java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_palindrome_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:05:09,882 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:05:09,884 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:05:09,897 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:05:09,897 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:05:09,899 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:05:09,900 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:05:09,902 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:05:09,905 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:05:09,905 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:05:09,906 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:05:09,907 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:05:09,908 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:05:09,909 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:05:09,910 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:05:09,911 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:05:09,912 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:05:09,914 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:05:09,917 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:05:09,919 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:05:09,920 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:05:09,921 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:05:09,924 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:05:09,925 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:05:09,925 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:05:09,926 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:05:09,927 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:05:09,928 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:05:09,929 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:05:09,930 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:05:09,931 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:05:09,931 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:05:09,932 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:05:09,932 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:05:09,933 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:05:09,934 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:05:09,934 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:05:09,951 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:05:09,952 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:05:09,953 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:05:09,953 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:05:09,954 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:05:09,954 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:05:09,954 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:05:09,954 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:05:09,954 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:05:09,955 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:05:09,955 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:05:09,955 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:05:09,955 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:05:09,956 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:05:09,956 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:05:09,956 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:05:09,956 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:05:09,956 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:05:09,956 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:05:09,957 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:05:09,957 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:05:09,957 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:05:09,957 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:05:09,957 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:05:09,958 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:05:09,958 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:05:09,958 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:05:09,958 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:05:09,958 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:05:09,959 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:05:09,959 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:05:10,015 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:05:10,030 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:05:10,034 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:05:10,036 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:05:10,036 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:05:10,037 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_palindrome_true-unreach-call_ground.i [2018-11-23 12:05:10,101 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d36939cc9/77b1a17c67ff496285f443a00a2a32df/FLAGc50ab3f80 [2018-11-23 12:05:10,605 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:05:10,606 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_palindrome_true-unreach-call_ground.i [2018-11-23 12:05:10,612 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d36939cc9/77b1a17c67ff496285f443a00a2a32df/FLAGc50ab3f80 [2018-11-23 12:05:10,945 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d36939cc9/77b1a17c67ff496285f443a00a2a32df [2018-11-23 12:05:10,955 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:05:10,957 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:05:10,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:05:10,958 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:05:10,963 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:05:10,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:05:10" (1/1) ... [2018-11-23 12:05:10,968 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7115c4f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:10, skipping insertion in model container [2018-11-23 12:05:10,968 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:05:10" (1/1) ... [2018-11-23 12:05:10,980 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:05:11,005 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:05:11,243 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:05:11,250 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:05:11,286 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:05:11,315 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:05:11,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:11 WrapperNode [2018-11-23 12:05:11,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:05:11,317 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:05:11,317 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:05:11,317 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:05:11,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:11" (1/1) ... [2018-11-23 12:05:11,335 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:11" (1/1) ... [2018-11-23 12:05:11,342 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:05:11,342 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:05:11,342 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:05:11,343 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:05:11,351 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:11" (1/1) ... [2018-11-23 12:05:11,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:11" (1/1) ... [2018-11-23 12:05:11,353 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:11" (1/1) ... [2018-11-23 12:05:11,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:11" (1/1) ... [2018-11-23 12:05:11,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:11" (1/1) ... [2018-11-23 12:05:11,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:11" (1/1) ... [2018-11-23 12:05:11,371 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:11" (1/1) ... [2018-11-23 12:05:11,373 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:05:11,374 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:05:11,374 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:05:11,374 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:05:11,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:05:11,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:05:11,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:05:11,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:05:11,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:05:11,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:05:11,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:05:11,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:05:11,512 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:05:11,512 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:05:11,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:05:11,512 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:05:11,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:05:11,992 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:05:11,992 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:05:11,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:05:11 BoogieIcfgContainer [2018-11-23 12:05:11,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:05:11,994 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:05:11,995 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:05:11,998 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:05:11,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:05:10" (1/3) ... [2018-11-23 12:05:11,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a411774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:05:11, skipping insertion in model container [2018-11-23 12:05:11,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:11" (2/3) ... [2018-11-23 12:05:12,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a411774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:05:11, skipping insertion in model container [2018-11-23 12:05:12,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:05:11" (3/3) ... [2018-11-23 12:05:12,002 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_palindrome_true-unreach-call_ground.i [2018-11-23 12:05:12,013 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:05:12,023 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:05:12,043 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:05:12,080 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:05:12,081 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:05:12,081 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:05:12,081 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:05:12,082 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:05:12,082 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:05:12,082 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:05:12,082 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:05:12,083 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:05:12,103 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-23 12:05:12,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:05:12,110 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:12,112 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:12,114 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:12,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:12,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1821336840, now seen corresponding path program 1 times [2018-11-23 12:05:12,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:12,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:12,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:12,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:12,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:12,299 INFO L256 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2018-11-23 12:05:12,303 INFO L273 TraceCheckUtils]: 1: Hoare triple {27#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27#true} is VALID [2018-11-23 12:05:12,303 INFO L273 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2018-11-23 12:05:12,304 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #49#return; {27#true} is VALID [2018-11-23 12:05:12,304 INFO L256 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret5 := main(); {27#true} is VALID [2018-11-23 12:05:12,305 INFO L273 TraceCheckUtils]: 5: Hoare triple {27#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {27#true} is VALID [2018-11-23 12:05:12,306 INFO L273 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2018-11-23 12:05:12,306 INFO L273 TraceCheckUtils]: 7: Hoare triple {28#false} havoc ~x~0;~x~0 := 0; {28#false} is VALID [2018-11-23 12:05:12,306 INFO L273 TraceCheckUtils]: 8: Hoare triple {28#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {28#false} is VALID [2018-11-23 12:05:12,307 INFO L256 TraceCheckUtils]: 9: Hoare triple {28#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {28#false} is VALID [2018-11-23 12:05:12,307 INFO L273 TraceCheckUtils]: 10: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2018-11-23 12:05:12,308 INFO L273 TraceCheckUtils]: 11: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2018-11-23 12:05:12,308 INFO L273 TraceCheckUtils]: 12: Hoare triple {28#false} assume !false; {28#false} is VALID [2018-11-23 12:05:12,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:12,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:05:12,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:05:12,320 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 12:05:12,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:12,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:05:12,407 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-23 12:05:12,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:05:12,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:05:12,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:05:12,420 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2018-11-23 12:05:12,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:12,573 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2018-11-23 12:05:12,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:05:12,573 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 12:05:12,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:12,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:05:12,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 47 transitions. [2018-11-23 12:05:12,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:05:12,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 47 transitions. [2018-11-23 12:05:12,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 47 transitions. [2018-11-23 12:05:12,966 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-23 12:05:12,978 INFO L225 Difference]: With dead ends: 40 [2018-11-23 12:05:12,978 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 12:05:12,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:05:13,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 12:05:13,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 12:05:13,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:13,029 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 12:05:13,029 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 12:05:13,029 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 12:05:13,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:13,033 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 12:05:13,034 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 12:05:13,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:13,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:13,035 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 12:05:13,035 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 12:05:13,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:13,040 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 12:05:13,040 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 12:05:13,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:13,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:13,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:13,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:13,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:05:13,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-23 12:05:13,044 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 13 [2018-11-23 12:05:13,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:13,045 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-23 12:05:13,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:05:13,045 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 12:05:13,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:05:13,046 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:13,046 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:13,047 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:13,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:13,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1443575666, now seen corresponding path program 1 times [2018-11-23 12:05:13,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:13,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:13,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:13,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:13,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:13,133 INFO L256 TraceCheckUtils]: 0: Hoare triple {147#true} call ULTIMATE.init(); {147#true} is VALID [2018-11-23 12:05:13,134 INFO L273 TraceCheckUtils]: 1: Hoare triple {147#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {147#true} is VALID [2018-11-23 12:05:13,134 INFO L273 TraceCheckUtils]: 2: Hoare triple {147#true} assume true; {147#true} is VALID [2018-11-23 12:05:13,134 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {147#true} {147#true} #49#return; {147#true} is VALID [2018-11-23 12:05:13,134 INFO L256 TraceCheckUtils]: 4: Hoare triple {147#true} call #t~ret5 := main(); {147#true} is VALID [2018-11-23 12:05:13,136 INFO L273 TraceCheckUtils]: 5: Hoare triple {147#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {149#(= main_~i~0 0)} is VALID [2018-11-23 12:05:13,137 INFO L273 TraceCheckUtils]: 6: Hoare triple {149#(= main_~i~0 0)} assume !(~i~0 < 50000); {148#false} is VALID [2018-11-23 12:05:13,137 INFO L273 TraceCheckUtils]: 7: Hoare triple {148#false} havoc ~x~0;~x~0 := 0; {148#false} is VALID [2018-11-23 12:05:13,138 INFO L273 TraceCheckUtils]: 8: Hoare triple {148#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {148#false} is VALID [2018-11-23 12:05:13,138 INFO L256 TraceCheckUtils]: 9: Hoare triple {148#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {148#false} is VALID [2018-11-23 12:05:13,138 INFO L273 TraceCheckUtils]: 10: Hoare triple {148#false} ~cond := #in~cond; {148#false} is VALID [2018-11-23 12:05:13,140 INFO L273 TraceCheckUtils]: 11: Hoare triple {148#false} assume 0 == ~cond; {148#false} is VALID [2018-11-23 12:05:13,140 INFO L273 TraceCheckUtils]: 12: Hoare triple {148#false} assume !false; {148#false} is VALID [2018-11-23 12:05:13,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:13,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:05:13,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:05:13,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 12:05:13,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:13,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:05:13,190 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-23 12:05:13,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:05:13,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:05:13,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:05:13,192 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 3 states. [2018-11-23 12:05:13,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:13,402 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-23 12:05:13,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:05:13,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 12:05:13,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:13,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:05:13,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-23 12:05:13,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:05:13,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-23 12:05:13,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2018-11-23 12:05:13,550 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:13,552 INFO L225 Difference]: With dead ends: 32 [2018-11-23 12:05:13,552 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 12:05:13,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:05:13,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 12:05:13,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-11-23 12:05:13,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:13,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 20 states. [2018-11-23 12:05:13,579 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 20 states. [2018-11-23 12:05:13,579 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 20 states. [2018-11-23 12:05:13,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:13,583 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-23 12:05:13,583 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 12:05:13,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:13,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:13,584 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 21 states. [2018-11-23 12:05:13,584 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 21 states. [2018-11-23 12:05:13,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:13,587 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-23 12:05:13,587 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 12:05:13,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:13,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:13,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:13,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:13,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:05:13,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 12:05:13,590 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 13 [2018-11-23 12:05:13,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:13,591 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 12:05:13,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:05:13,591 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 12:05:13,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:05:13,592 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:13,592 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:13,592 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:13,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:13,593 INFO L82 PathProgramCache]: Analyzing trace with hash 31729808, now seen corresponding path program 1 times [2018-11-23 12:05:13,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:13,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:13,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:13,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:13,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:13,688 INFO L256 TraceCheckUtils]: 0: Hoare triple {267#true} call ULTIMATE.init(); {267#true} is VALID [2018-11-23 12:05:13,689 INFO L273 TraceCheckUtils]: 1: Hoare triple {267#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {267#true} is VALID [2018-11-23 12:05:13,689 INFO L273 TraceCheckUtils]: 2: Hoare triple {267#true} assume true; {267#true} is VALID [2018-11-23 12:05:13,689 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {267#true} {267#true} #49#return; {267#true} is VALID [2018-11-23 12:05:13,690 INFO L256 TraceCheckUtils]: 4: Hoare triple {267#true} call #t~ret5 := main(); {267#true} is VALID [2018-11-23 12:05:13,691 INFO L273 TraceCheckUtils]: 5: Hoare triple {267#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {269#(= main_~i~0 0)} is VALID [2018-11-23 12:05:13,696 INFO L273 TraceCheckUtils]: 6: Hoare triple {269#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {269#(= main_~i~0 0)} is VALID [2018-11-23 12:05:13,698 INFO L273 TraceCheckUtils]: 7: Hoare triple {269#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {270#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:13,699 INFO L273 TraceCheckUtils]: 8: Hoare triple {270#(<= main_~i~0 1)} assume !(~i~0 < 50000); {268#false} is VALID [2018-11-23 12:05:13,699 INFO L273 TraceCheckUtils]: 9: Hoare triple {268#false} havoc ~x~0;~x~0 := 0; {268#false} is VALID [2018-11-23 12:05:13,700 INFO L273 TraceCheckUtils]: 10: Hoare triple {268#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {268#false} is VALID [2018-11-23 12:05:13,700 INFO L256 TraceCheckUtils]: 11: Hoare triple {268#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {268#false} is VALID [2018-11-23 12:05:13,700 INFO L273 TraceCheckUtils]: 12: Hoare triple {268#false} ~cond := #in~cond; {268#false} is VALID [2018-11-23 12:05:13,700 INFO L273 TraceCheckUtils]: 13: Hoare triple {268#false} assume 0 == ~cond; {268#false} is VALID [2018-11-23 12:05:13,701 INFO L273 TraceCheckUtils]: 14: Hoare triple {268#false} assume !false; {268#false} is VALID [2018-11-23 12:05:13,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:13,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:13,703 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:13,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:13,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:13,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:14,185 INFO L256 TraceCheckUtils]: 0: Hoare triple {267#true} call ULTIMATE.init(); {267#true} is VALID [2018-11-23 12:05:14,186 INFO L273 TraceCheckUtils]: 1: Hoare triple {267#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {267#true} is VALID [2018-11-23 12:05:14,186 INFO L273 TraceCheckUtils]: 2: Hoare triple {267#true} assume true; {267#true} is VALID [2018-11-23 12:05:14,186 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {267#true} {267#true} #49#return; {267#true} is VALID [2018-11-23 12:05:14,186 INFO L256 TraceCheckUtils]: 4: Hoare triple {267#true} call #t~ret5 := main(); {267#true} is VALID [2018-11-23 12:05:14,189 INFO L273 TraceCheckUtils]: 5: Hoare triple {267#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {289#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:14,190 INFO L273 TraceCheckUtils]: 6: Hoare triple {289#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {289#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:14,191 INFO L273 TraceCheckUtils]: 7: Hoare triple {289#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {270#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:14,192 INFO L273 TraceCheckUtils]: 8: Hoare triple {270#(<= main_~i~0 1)} assume !(~i~0 < 50000); {268#false} is VALID [2018-11-23 12:05:14,192 INFO L273 TraceCheckUtils]: 9: Hoare triple {268#false} havoc ~x~0;~x~0 := 0; {268#false} is VALID [2018-11-23 12:05:14,192 INFO L273 TraceCheckUtils]: 10: Hoare triple {268#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {268#false} is VALID [2018-11-23 12:05:14,193 INFO L256 TraceCheckUtils]: 11: Hoare triple {268#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {268#false} is VALID [2018-11-23 12:05:14,193 INFO L273 TraceCheckUtils]: 12: Hoare triple {268#false} ~cond := #in~cond; {268#false} is VALID [2018-11-23 12:05:14,193 INFO L273 TraceCheckUtils]: 13: Hoare triple {268#false} assume 0 == ~cond; {268#false} is VALID [2018-11-23 12:05:14,194 INFO L273 TraceCheckUtils]: 14: Hoare triple {268#false} assume !false; {268#false} is VALID [2018-11-23 12:05:14,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:14,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:14,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:05:14,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-23 12:05:14,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:14,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:05:14,251 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:14,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:05:14,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:05:14,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:05:14,253 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2018-11-23 12:05:14,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:14,585 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-23 12:05:14,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:05:14,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-23 12:05:14,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:14,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:05:14,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2018-11-23 12:05:14,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:05:14,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2018-11-23 12:05:14,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 36 transitions. [2018-11-23 12:05:14,670 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-23 12:05:14,673 INFO L225 Difference]: With dead ends: 34 [2018-11-23 12:05:14,673 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 12:05:14,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:05:14,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 12:05:14,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-11-23 12:05:14,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:14,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 22 states. [2018-11-23 12:05:14,691 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 22 states. [2018-11-23 12:05:14,691 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 22 states. [2018-11-23 12:05:14,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:14,694 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-11-23 12:05:14,694 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 12:05:14,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:14,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:14,695 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 23 states. [2018-11-23 12:05:14,695 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 23 states. [2018-11-23 12:05:14,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:14,697 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-11-23 12:05:14,698 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 12:05:14,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:14,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:14,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:14,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:14,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:05:14,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-11-23 12:05:14,701 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 15 [2018-11-23 12:05:14,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:14,701 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-23 12:05:14,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:05:14,702 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 12:05:14,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:05:14,702 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:14,703 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:14,703 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:14,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:14,703 INFO L82 PathProgramCache]: Analyzing trace with hash 457525806, now seen corresponding path program 2 times [2018-11-23 12:05:14,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:14,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:14,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:14,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:14,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:14,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:14,866 INFO L256 TraceCheckUtils]: 0: Hoare triple {441#true} call ULTIMATE.init(); {441#true} is VALID [2018-11-23 12:05:14,867 INFO L273 TraceCheckUtils]: 1: Hoare triple {441#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {441#true} is VALID [2018-11-23 12:05:14,867 INFO L273 TraceCheckUtils]: 2: Hoare triple {441#true} assume true; {441#true} is VALID [2018-11-23 12:05:14,867 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {441#true} {441#true} #49#return; {441#true} is VALID [2018-11-23 12:05:14,868 INFO L256 TraceCheckUtils]: 4: Hoare triple {441#true} call #t~ret5 := main(); {441#true} is VALID [2018-11-23 12:05:14,869 INFO L273 TraceCheckUtils]: 5: Hoare triple {441#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {443#(= main_~i~0 0)} is VALID [2018-11-23 12:05:14,871 INFO L273 TraceCheckUtils]: 6: Hoare triple {443#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {443#(= main_~i~0 0)} is VALID [2018-11-23 12:05:14,873 INFO L273 TraceCheckUtils]: 7: Hoare triple {443#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {444#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:14,873 INFO L273 TraceCheckUtils]: 8: Hoare triple {444#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {444#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:14,876 INFO L273 TraceCheckUtils]: 9: Hoare triple {444#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {445#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:14,878 INFO L273 TraceCheckUtils]: 10: Hoare triple {445#(<= main_~i~0 2)} assume !(~i~0 < 50000); {442#false} is VALID [2018-11-23 12:05:14,878 INFO L273 TraceCheckUtils]: 11: Hoare triple {442#false} havoc ~x~0;~x~0 := 0; {442#false} is VALID [2018-11-23 12:05:14,878 INFO L273 TraceCheckUtils]: 12: Hoare triple {442#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {442#false} is VALID [2018-11-23 12:05:14,879 INFO L256 TraceCheckUtils]: 13: Hoare triple {442#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {442#false} is VALID [2018-11-23 12:05:14,879 INFO L273 TraceCheckUtils]: 14: Hoare triple {442#false} ~cond := #in~cond; {442#false} is VALID [2018-11-23 12:05:14,880 INFO L273 TraceCheckUtils]: 15: Hoare triple {442#false} assume 0 == ~cond; {442#false} is VALID [2018-11-23 12:05:14,880 INFO L273 TraceCheckUtils]: 16: Hoare triple {442#false} assume !false; {442#false} is VALID [2018-11-23 12:05:14,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:14,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:14,881 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:14,892 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:05:14,912 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:05:14,913 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:14,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:15,023 INFO L256 TraceCheckUtils]: 0: Hoare triple {441#true} call ULTIMATE.init(); {441#true} is VALID [2018-11-23 12:05:15,024 INFO L273 TraceCheckUtils]: 1: Hoare triple {441#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {441#true} is VALID [2018-11-23 12:05:15,024 INFO L273 TraceCheckUtils]: 2: Hoare triple {441#true} assume true; {441#true} is VALID [2018-11-23 12:05:15,024 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {441#true} {441#true} #49#return; {441#true} is VALID [2018-11-23 12:05:15,025 INFO L256 TraceCheckUtils]: 4: Hoare triple {441#true} call #t~ret5 := main(); {441#true} is VALID [2018-11-23 12:05:15,025 INFO L273 TraceCheckUtils]: 5: Hoare triple {441#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {464#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:15,026 INFO L273 TraceCheckUtils]: 6: Hoare triple {464#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {464#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:15,027 INFO L273 TraceCheckUtils]: 7: Hoare triple {464#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {444#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:15,027 INFO L273 TraceCheckUtils]: 8: Hoare triple {444#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {444#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:15,028 INFO L273 TraceCheckUtils]: 9: Hoare triple {444#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {445#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:15,029 INFO L273 TraceCheckUtils]: 10: Hoare triple {445#(<= main_~i~0 2)} assume !(~i~0 < 50000); {442#false} is VALID [2018-11-23 12:05:15,029 INFO L273 TraceCheckUtils]: 11: Hoare triple {442#false} havoc ~x~0;~x~0 := 0; {442#false} is VALID [2018-11-23 12:05:15,030 INFO L273 TraceCheckUtils]: 12: Hoare triple {442#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {442#false} is VALID [2018-11-23 12:05:15,030 INFO L256 TraceCheckUtils]: 13: Hoare triple {442#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {442#false} is VALID [2018-11-23 12:05:15,031 INFO L273 TraceCheckUtils]: 14: Hoare triple {442#false} ~cond := #in~cond; {442#false} is VALID [2018-11-23 12:05:15,031 INFO L273 TraceCheckUtils]: 15: Hoare triple {442#false} assume 0 == ~cond; {442#false} is VALID [2018-11-23 12:05:15,032 INFO L273 TraceCheckUtils]: 16: Hoare triple {442#false} assume !false; {442#false} is VALID [2018-11-23 12:05:15,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:15,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:15,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:05:15,055 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 12:05:15,056 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:15,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:05:15,105 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-23 12:05:15,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:05:15,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:05:15,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:05:15,106 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 6 states. [2018-11-23 12:05:15,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:15,387 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-23 12:05:15,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:05:15,387 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 12:05:15,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:15,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:05:15,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2018-11-23 12:05:15,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:05:15,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2018-11-23 12:05:15,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2018-11-23 12:05:15,473 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:15,474 INFO L225 Difference]: With dead ends: 36 [2018-11-23 12:05:15,474 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 12:05:15,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:05:15,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 12:05:15,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-23 12:05:15,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:15,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 24 states. [2018-11-23 12:05:15,495 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 24 states. [2018-11-23 12:05:15,495 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 24 states. [2018-11-23 12:05:15,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:15,497 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 12:05:15,497 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 12:05:15,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:15,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:15,498 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 25 states. [2018-11-23 12:05:15,499 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 25 states. [2018-11-23 12:05:15,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:15,501 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 12:05:15,501 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 12:05:15,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:15,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:15,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:15,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:15,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:05:15,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-23 12:05:15,504 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 17 [2018-11-23 12:05:15,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:15,505 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-23 12:05:15,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:05:15,505 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 12:05:15,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:05:15,506 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:15,506 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:15,507 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:15,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:15,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1625586764, now seen corresponding path program 3 times [2018-11-23 12:05:15,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:15,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:15,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:15,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:15,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:15,676 INFO L256 TraceCheckUtils]: 0: Hoare triple {632#true} call ULTIMATE.init(); {632#true} is VALID [2018-11-23 12:05:15,677 INFO L273 TraceCheckUtils]: 1: Hoare triple {632#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {632#true} is VALID [2018-11-23 12:05:15,677 INFO L273 TraceCheckUtils]: 2: Hoare triple {632#true} assume true; {632#true} is VALID [2018-11-23 12:05:15,678 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {632#true} {632#true} #49#return; {632#true} is VALID [2018-11-23 12:05:15,678 INFO L256 TraceCheckUtils]: 4: Hoare triple {632#true} call #t~ret5 := main(); {632#true} is VALID [2018-11-23 12:05:15,679 INFO L273 TraceCheckUtils]: 5: Hoare triple {632#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {634#(= main_~i~0 0)} is VALID [2018-11-23 12:05:15,680 INFO L273 TraceCheckUtils]: 6: Hoare triple {634#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {634#(= main_~i~0 0)} is VALID [2018-11-23 12:05:15,681 INFO L273 TraceCheckUtils]: 7: Hoare triple {634#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {635#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:15,682 INFO L273 TraceCheckUtils]: 8: Hoare triple {635#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {635#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:15,683 INFO L273 TraceCheckUtils]: 9: Hoare triple {635#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {636#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:15,684 INFO L273 TraceCheckUtils]: 10: Hoare triple {636#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {636#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:15,684 INFO L273 TraceCheckUtils]: 11: Hoare triple {636#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {637#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:15,685 INFO L273 TraceCheckUtils]: 12: Hoare triple {637#(<= main_~i~0 3)} assume !(~i~0 < 50000); {633#false} is VALID [2018-11-23 12:05:15,685 INFO L273 TraceCheckUtils]: 13: Hoare triple {633#false} havoc ~x~0;~x~0 := 0; {633#false} is VALID [2018-11-23 12:05:15,686 INFO L273 TraceCheckUtils]: 14: Hoare triple {633#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {633#false} is VALID [2018-11-23 12:05:15,686 INFO L256 TraceCheckUtils]: 15: Hoare triple {633#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {633#false} is VALID [2018-11-23 12:05:15,686 INFO L273 TraceCheckUtils]: 16: Hoare triple {633#false} ~cond := #in~cond; {633#false} is VALID [2018-11-23 12:05:15,686 INFO L273 TraceCheckUtils]: 17: Hoare triple {633#false} assume 0 == ~cond; {633#false} is VALID [2018-11-23 12:05:15,687 INFO L273 TraceCheckUtils]: 18: Hoare triple {633#false} assume !false; {633#false} is VALID [2018-11-23 12:05:15,688 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:15,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:15,688 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:15,699 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:05:15,724 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:05:15,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:15,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:15,860 INFO L256 TraceCheckUtils]: 0: Hoare triple {632#true} call ULTIMATE.init(); {632#true} is VALID [2018-11-23 12:05:15,860 INFO L273 TraceCheckUtils]: 1: Hoare triple {632#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {632#true} is VALID [2018-11-23 12:05:15,861 INFO L273 TraceCheckUtils]: 2: Hoare triple {632#true} assume true; {632#true} is VALID [2018-11-23 12:05:15,861 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {632#true} {632#true} #49#return; {632#true} is VALID [2018-11-23 12:05:15,861 INFO L256 TraceCheckUtils]: 4: Hoare triple {632#true} call #t~ret5 := main(); {632#true} is VALID [2018-11-23 12:05:15,862 INFO L273 TraceCheckUtils]: 5: Hoare triple {632#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {656#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:15,864 INFO L273 TraceCheckUtils]: 6: Hoare triple {656#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {656#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:15,865 INFO L273 TraceCheckUtils]: 7: Hoare triple {656#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {635#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:15,866 INFO L273 TraceCheckUtils]: 8: Hoare triple {635#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {635#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:15,866 INFO L273 TraceCheckUtils]: 9: Hoare triple {635#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {636#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:15,867 INFO L273 TraceCheckUtils]: 10: Hoare triple {636#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {636#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:15,868 INFO L273 TraceCheckUtils]: 11: Hoare triple {636#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {637#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:15,885 INFO L273 TraceCheckUtils]: 12: Hoare triple {637#(<= main_~i~0 3)} assume !(~i~0 < 50000); {633#false} is VALID [2018-11-23 12:05:15,886 INFO L273 TraceCheckUtils]: 13: Hoare triple {633#false} havoc ~x~0;~x~0 := 0; {633#false} is VALID [2018-11-23 12:05:15,886 INFO L273 TraceCheckUtils]: 14: Hoare triple {633#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {633#false} is VALID [2018-11-23 12:05:15,887 INFO L256 TraceCheckUtils]: 15: Hoare triple {633#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {633#false} is VALID [2018-11-23 12:05:15,887 INFO L273 TraceCheckUtils]: 16: Hoare triple {633#false} ~cond := #in~cond; {633#false} is VALID [2018-11-23 12:05:15,887 INFO L273 TraceCheckUtils]: 17: Hoare triple {633#false} assume 0 == ~cond; {633#false} is VALID [2018-11-23 12:05:15,888 INFO L273 TraceCheckUtils]: 18: Hoare triple {633#false} assume !false; {633#false} is VALID [2018-11-23 12:05:15,889 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:15,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:15,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 12:05:15,909 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-23 12:05:15,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:15,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:05:15,948 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:15,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:05:15,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:05:15,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:05:15,949 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 7 states. [2018-11-23 12:05:16,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:16,093 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-11-23 12:05:16,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:05:16,093 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-23 12:05:16,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:16,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:05:16,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2018-11-23 12:05:16,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:05:16,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2018-11-23 12:05:16,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2018-11-23 12:05:16,169 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:16,171 INFO L225 Difference]: With dead ends: 38 [2018-11-23 12:05:16,171 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 12:05:16,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:05:16,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 12:05:16,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-23 12:05:16,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:16,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 26 states. [2018-11-23 12:05:16,189 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 26 states. [2018-11-23 12:05:16,189 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 26 states. [2018-11-23 12:05:16,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:16,191 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-23 12:05:16,192 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 12:05:16,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:16,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:16,192 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 27 states. [2018-11-23 12:05:16,193 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 27 states. [2018-11-23 12:05:16,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:16,195 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-23 12:05:16,195 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 12:05:16,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:16,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:16,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:16,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:16,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:05:16,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-11-23 12:05:16,198 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 19 [2018-11-23 12:05:16,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:16,199 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-23 12:05:16,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:05:16,199 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 12:05:16,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:05:16,200 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:16,200 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:16,201 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:16,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:16,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1149264150, now seen corresponding path program 4 times [2018-11-23 12:05:16,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:16,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:16,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:16,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:16,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:16,344 INFO L256 TraceCheckUtils]: 0: Hoare triple {840#true} call ULTIMATE.init(); {840#true} is VALID [2018-11-23 12:05:16,345 INFO L273 TraceCheckUtils]: 1: Hoare triple {840#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {840#true} is VALID [2018-11-23 12:05:16,345 INFO L273 TraceCheckUtils]: 2: Hoare triple {840#true} assume true; {840#true} is VALID [2018-11-23 12:05:16,345 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {840#true} {840#true} #49#return; {840#true} is VALID [2018-11-23 12:05:16,346 INFO L256 TraceCheckUtils]: 4: Hoare triple {840#true} call #t~ret5 := main(); {840#true} is VALID [2018-11-23 12:05:16,349 INFO L273 TraceCheckUtils]: 5: Hoare triple {840#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {842#(= main_~i~0 0)} is VALID [2018-11-23 12:05:16,351 INFO L273 TraceCheckUtils]: 6: Hoare triple {842#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {842#(= main_~i~0 0)} is VALID [2018-11-23 12:05:16,351 INFO L273 TraceCheckUtils]: 7: Hoare triple {842#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {843#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:16,352 INFO L273 TraceCheckUtils]: 8: Hoare triple {843#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {843#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:16,353 INFO L273 TraceCheckUtils]: 9: Hoare triple {843#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {844#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:16,353 INFO L273 TraceCheckUtils]: 10: Hoare triple {844#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {844#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:16,354 INFO L273 TraceCheckUtils]: 11: Hoare triple {844#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {845#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:16,355 INFO L273 TraceCheckUtils]: 12: Hoare triple {845#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {845#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:16,356 INFO L273 TraceCheckUtils]: 13: Hoare triple {845#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {846#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:16,357 INFO L273 TraceCheckUtils]: 14: Hoare triple {846#(<= main_~i~0 4)} assume !(~i~0 < 50000); {841#false} is VALID [2018-11-23 12:05:16,358 INFO L273 TraceCheckUtils]: 15: Hoare triple {841#false} havoc ~x~0;~x~0 := 0; {841#false} is VALID [2018-11-23 12:05:16,358 INFO L273 TraceCheckUtils]: 16: Hoare triple {841#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {841#false} is VALID [2018-11-23 12:05:16,358 INFO L256 TraceCheckUtils]: 17: Hoare triple {841#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {841#false} is VALID [2018-11-23 12:05:16,359 INFO L273 TraceCheckUtils]: 18: Hoare triple {841#false} ~cond := #in~cond; {841#false} is VALID [2018-11-23 12:05:16,359 INFO L273 TraceCheckUtils]: 19: Hoare triple {841#false} assume 0 == ~cond; {841#false} is VALID [2018-11-23 12:05:16,360 INFO L273 TraceCheckUtils]: 20: Hoare triple {841#false} assume !false; {841#false} is VALID [2018-11-23 12:05:16,361 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:16,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:16,362 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:16,371 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:05:16,388 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:05:16,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:16,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:16,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:16,598 INFO L256 TraceCheckUtils]: 0: Hoare triple {840#true} call ULTIMATE.init(); {840#true} is VALID [2018-11-23 12:05:16,598 INFO L273 TraceCheckUtils]: 1: Hoare triple {840#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {840#true} is VALID [2018-11-23 12:05:16,599 INFO L273 TraceCheckUtils]: 2: Hoare triple {840#true} assume true; {840#true} is VALID [2018-11-23 12:05:16,599 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {840#true} {840#true} #49#return; {840#true} is VALID [2018-11-23 12:05:16,599 INFO L256 TraceCheckUtils]: 4: Hoare triple {840#true} call #t~ret5 := main(); {840#true} is VALID [2018-11-23 12:05:16,601 INFO L273 TraceCheckUtils]: 5: Hoare triple {840#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {865#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:16,601 INFO L273 TraceCheckUtils]: 6: Hoare triple {865#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {865#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:16,603 INFO L273 TraceCheckUtils]: 7: Hoare triple {865#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {843#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:16,609 INFO L273 TraceCheckUtils]: 8: Hoare triple {843#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {843#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:16,610 INFO L273 TraceCheckUtils]: 9: Hoare triple {843#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {844#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:16,610 INFO L273 TraceCheckUtils]: 10: Hoare triple {844#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {844#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:16,611 INFO L273 TraceCheckUtils]: 11: Hoare triple {844#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {845#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:16,611 INFO L273 TraceCheckUtils]: 12: Hoare triple {845#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {845#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:16,612 INFO L273 TraceCheckUtils]: 13: Hoare triple {845#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {846#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:16,613 INFO L273 TraceCheckUtils]: 14: Hoare triple {846#(<= main_~i~0 4)} assume !(~i~0 < 50000); {841#false} is VALID [2018-11-23 12:05:16,613 INFO L273 TraceCheckUtils]: 15: Hoare triple {841#false} havoc ~x~0;~x~0 := 0; {841#false} is VALID [2018-11-23 12:05:16,613 INFO L273 TraceCheckUtils]: 16: Hoare triple {841#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {841#false} is VALID [2018-11-23 12:05:16,613 INFO L256 TraceCheckUtils]: 17: Hoare triple {841#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {841#false} is VALID [2018-11-23 12:05:16,614 INFO L273 TraceCheckUtils]: 18: Hoare triple {841#false} ~cond := #in~cond; {841#false} is VALID [2018-11-23 12:05:16,614 INFO L273 TraceCheckUtils]: 19: Hoare triple {841#false} assume 0 == ~cond; {841#false} is VALID [2018-11-23 12:05:16,614 INFO L273 TraceCheckUtils]: 20: Hoare triple {841#false} assume !false; {841#false} is VALID [2018-11-23 12:05:16,616 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:16,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:16,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:05:16,637 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-11-23 12:05:16,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:16,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:05:16,680 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:16,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:05:16,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:05:16,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:05:16,681 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 8 states. [2018-11-23 12:05:16,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:16,929 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-23 12:05:16,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:05:16,929 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-11-23 12:05:16,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:16,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:05:16,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2018-11-23 12:05:16,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:05:16,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2018-11-23 12:05:16,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2018-11-23 12:05:17,096 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:17,097 INFO L225 Difference]: With dead ends: 40 [2018-11-23 12:05:17,097 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:05:17,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:05:17,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:05:17,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-23 12:05:17,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:17,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2018-11-23 12:05:17,113 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2018-11-23 12:05:17,113 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2018-11-23 12:05:17,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:17,115 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-23 12:05:17,116 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 12:05:17,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:17,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:17,117 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2018-11-23 12:05:17,117 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2018-11-23 12:05:17,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:17,119 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-23 12:05:17,119 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 12:05:17,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:17,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:17,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:17,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:17,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:05:17,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-11-23 12:05:17,122 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 21 [2018-11-23 12:05:17,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:17,122 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-23 12:05:17,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:05:17,123 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 12:05:17,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:05:17,124 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:17,124 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:17,124 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:17,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:17,125 INFO L82 PathProgramCache]: Analyzing trace with hash -606301688, now seen corresponding path program 5 times [2018-11-23 12:05:17,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:17,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:17,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:17,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:17,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:17,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:17,322 INFO L256 TraceCheckUtils]: 0: Hoare triple {1065#true} call ULTIMATE.init(); {1065#true} is VALID [2018-11-23 12:05:17,322 INFO L273 TraceCheckUtils]: 1: Hoare triple {1065#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1065#true} is VALID [2018-11-23 12:05:17,322 INFO L273 TraceCheckUtils]: 2: Hoare triple {1065#true} assume true; {1065#true} is VALID [2018-11-23 12:05:17,323 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1065#true} {1065#true} #49#return; {1065#true} is VALID [2018-11-23 12:05:17,323 INFO L256 TraceCheckUtils]: 4: Hoare triple {1065#true} call #t~ret5 := main(); {1065#true} is VALID [2018-11-23 12:05:17,323 INFO L273 TraceCheckUtils]: 5: Hoare triple {1065#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {1067#(= main_~i~0 0)} is VALID [2018-11-23 12:05:17,324 INFO L273 TraceCheckUtils]: 6: Hoare triple {1067#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1067#(= main_~i~0 0)} is VALID [2018-11-23 12:05:17,325 INFO L273 TraceCheckUtils]: 7: Hoare triple {1067#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1068#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:17,326 INFO L273 TraceCheckUtils]: 8: Hoare triple {1068#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1068#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:17,327 INFO L273 TraceCheckUtils]: 9: Hoare triple {1068#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1069#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:17,328 INFO L273 TraceCheckUtils]: 10: Hoare triple {1069#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1069#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:17,329 INFO L273 TraceCheckUtils]: 11: Hoare triple {1069#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1070#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:17,329 INFO L273 TraceCheckUtils]: 12: Hoare triple {1070#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1070#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:17,330 INFO L273 TraceCheckUtils]: 13: Hoare triple {1070#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1071#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:17,331 INFO L273 TraceCheckUtils]: 14: Hoare triple {1071#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1071#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:17,332 INFO L273 TraceCheckUtils]: 15: Hoare triple {1071#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1072#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:17,333 INFO L273 TraceCheckUtils]: 16: Hoare triple {1072#(<= main_~i~0 5)} assume !(~i~0 < 50000); {1066#false} is VALID [2018-11-23 12:05:17,334 INFO L273 TraceCheckUtils]: 17: Hoare triple {1066#false} havoc ~x~0;~x~0 := 0; {1066#false} is VALID [2018-11-23 12:05:17,334 INFO L273 TraceCheckUtils]: 18: Hoare triple {1066#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {1066#false} is VALID [2018-11-23 12:05:17,334 INFO L256 TraceCheckUtils]: 19: Hoare triple {1066#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1066#false} is VALID [2018-11-23 12:05:17,335 INFO L273 TraceCheckUtils]: 20: Hoare triple {1066#false} ~cond := #in~cond; {1066#false} is VALID [2018-11-23 12:05:17,335 INFO L273 TraceCheckUtils]: 21: Hoare triple {1066#false} assume 0 == ~cond; {1066#false} is VALID [2018-11-23 12:05:17,336 INFO L273 TraceCheckUtils]: 22: Hoare triple {1066#false} assume !false; {1066#false} is VALID [2018-11-23 12:05:17,337 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:17,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:17,338 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-23 12:05:17,347 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:05:17,374 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 12:05:17,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:17,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:17,526 INFO L256 TraceCheckUtils]: 0: Hoare triple {1065#true} call ULTIMATE.init(); {1065#true} is VALID [2018-11-23 12:05:17,526 INFO L273 TraceCheckUtils]: 1: Hoare triple {1065#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1065#true} is VALID [2018-11-23 12:05:17,527 INFO L273 TraceCheckUtils]: 2: Hoare triple {1065#true} assume true; {1065#true} is VALID [2018-11-23 12:05:17,527 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1065#true} {1065#true} #49#return; {1065#true} is VALID [2018-11-23 12:05:17,527 INFO L256 TraceCheckUtils]: 4: Hoare triple {1065#true} call #t~ret5 := main(); {1065#true} is VALID [2018-11-23 12:05:17,528 INFO L273 TraceCheckUtils]: 5: Hoare triple {1065#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {1091#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:17,528 INFO L273 TraceCheckUtils]: 6: Hoare triple {1091#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1091#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:17,529 INFO L273 TraceCheckUtils]: 7: Hoare triple {1091#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1068#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:17,530 INFO L273 TraceCheckUtils]: 8: Hoare triple {1068#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1068#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:17,530 INFO L273 TraceCheckUtils]: 9: Hoare triple {1068#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1069#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:17,537 INFO L273 TraceCheckUtils]: 10: Hoare triple {1069#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1069#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:17,538 INFO L273 TraceCheckUtils]: 11: Hoare triple {1069#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1070#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:17,538 INFO L273 TraceCheckUtils]: 12: Hoare triple {1070#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1070#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:17,548 INFO L273 TraceCheckUtils]: 13: Hoare triple {1070#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1071#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:17,549 INFO L273 TraceCheckUtils]: 14: Hoare triple {1071#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1071#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:17,550 INFO L273 TraceCheckUtils]: 15: Hoare triple {1071#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1072#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:17,550 INFO L273 TraceCheckUtils]: 16: Hoare triple {1072#(<= main_~i~0 5)} assume !(~i~0 < 50000); {1066#false} is VALID [2018-11-23 12:05:17,550 INFO L273 TraceCheckUtils]: 17: Hoare triple {1066#false} havoc ~x~0;~x~0 := 0; {1066#false} is VALID [2018-11-23 12:05:17,551 INFO L273 TraceCheckUtils]: 18: Hoare triple {1066#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {1066#false} is VALID [2018-11-23 12:05:17,551 INFO L256 TraceCheckUtils]: 19: Hoare triple {1066#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1066#false} is VALID [2018-11-23 12:05:17,551 INFO L273 TraceCheckUtils]: 20: Hoare triple {1066#false} ~cond := #in~cond; {1066#false} is VALID [2018-11-23 12:05:17,552 INFO L273 TraceCheckUtils]: 21: Hoare triple {1066#false} assume 0 == ~cond; {1066#false} is VALID [2018-11-23 12:05:17,552 INFO L273 TraceCheckUtils]: 22: Hoare triple {1066#false} assume !false; {1066#false} is VALID [2018-11-23 12:05:17,555 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:17,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:17,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 12:05:17,578 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-23 12:05:17,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:17,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:05:17,616 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-23 12:05:17,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:05:17,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:05:17,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:05:17,618 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 9 states. [2018-11-23 12:05:17,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:17,722 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-23 12:05:17,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:05:17,722 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-23 12:05:17,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:17,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:05:17,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2018-11-23 12:05:17,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:05:17,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2018-11-23 12:05:17,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2018-11-23 12:05:17,798 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-23 12:05:17,800 INFO L225 Difference]: With dead ends: 42 [2018-11-23 12:05:17,800 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 12:05:17,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:05:17,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 12:05:17,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-23 12:05:17,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:17,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 30 states. [2018-11-23 12:05:17,820 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 30 states. [2018-11-23 12:05:17,821 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 30 states. [2018-11-23 12:05:17,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:17,822 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-23 12:05:17,822 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-23 12:05:17,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:17,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:17,823 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 31 states. [2018-11-23 12:05:17,823 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 31 states. [2018-11-23 12:05:17,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:17,825 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-23 12:05:17,825 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-23 12:05:17,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:17,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:17,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:17,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:17,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:05:17,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-23 12:05:17,828 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 23 [2018-11-23 12:05:17,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:17,828 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-23 12:05:17,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:05:17,829 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-23 12:05:17,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:05:17,829 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:17,829 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:17,830 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:17,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:17,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1489581478, now seen corresponding path program 6 times [2018-11-23 12:05:17,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:17,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:17,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:17,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:17,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:18,075 INFO L256 TraceCheckUtils]: 0: Hoare triple {1307#true} call ULTIMATE.init(); {1307#true} is VALID [2018-11-23 12:05:18,075 INFO L273 TraceCheckUtils]: 1: Hoare triple {1307#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1307#true} is VALID [2018-11-23 12:05:18,075 INFO L273 TraceCheckUtils]: 2: Hoare triple {1307#true} assume true; {1307#true} is VALID [2018-11-23 12:05:18,076 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1307#true} {1307#true} #49#return; {1307#true} is VALID [2018-11-23 12:05:18,076 INFO L256 TraceCheckUtils]: 4: Hoare triple {1307#true} call #t~ret5 := main(); {1307#true} is VALID [2018-11-23 12:05:18,076 INFO L273 TraceCheckUtils]: 5: Hoare triple {1307#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {1309#(= main_~i~0 0)} is VALID [2018-11-23 12:05:18,077 INFO L273 TraceCheckUtils]: 6: Hoare triple {1309#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1309#(= main_~i~0 0)} is VALID [2018-11-23 12:05:18,079 INFO L273 TraceCheckUtils]: 7: Hoare triple {1309#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1310#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:18,080 INFO L273 TraceCheckUtils]: 8: Hoare triple {1310#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1310#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:18,081 INFO L273 TraceCheckUtils]: 9: Hoare triple {1310#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1311#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:18,082 INFO L273 TraceCheckUtils]: 10: Hoare triple {1311#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1311#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:18,083 INFO L273 TraceCheckUtils]: 11: Hoare triple {1311#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1312#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:18,084 INFO L273 TraceCheckUtils]: 12: Hoare triple {1312#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1312#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:18,085 INFO L273 TraceCheckUtils]: 13: Hoare triple {1312#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1313#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:18,086 INFO L273 TraceCheckUtils]: 14: Hoare triple {1313#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1313#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:18,087 INFO L273 TraceCheckUtils]: 15: Hoare triple {1313#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1314#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:18,088 INFO L273 TraceCheckUtils]: 16: Hoare triple {1314#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1314#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:18,089 INFO L273 TraceCheckUtils]: 17: Hoare triple {1314#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1315#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:18,090 INFO L273 TraceCheckUtils]: 18: Hoare triple {1315#(<= main_~i~0 6)} assume !(~i~0 < 50000); {1308#false} is VALID [2018-11-23 12:05:18,090 INFO L273 TraceCheckUtils]: 19: Hoare triple {1308#false} havoc ~x~0;~x~0 := 0; {1308#false} is VALID [2018-11-23 12:05:18,091 INFO L273 TraceCheckUtils]: 20: Hoare triple {1308#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {1308#false} is VALID [2018-11-23 12:05:18,091 INFO L256 TraceCheckUtils]: 21: Hoare triple {1308#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1308#false} is VALID [2018-11-23 12:05:18,091 INFO L273 TraceCheckUtils]: 22: Hoare triple {1308#false} ~cond := #in~cond; {1308#false} is VALID [2018-11-23 12:05:18,092 INFO L273 TraceCheckUtils]: 23: Hoare triple {1308#false} assume 0 == ~cond; {1308#false} is VALID [2018-11-23 12:05:18,092 INFO L273 TraceCheckUtils]: 24: Hoare triple {1308#false} assume !false; {1308#false} is VALID [2018-11-23 12:05:18,095 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:18,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:18,096 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-23 12:05:18,110 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:05:18,186 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 12:05:18,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:18,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:18,307 INFO L256 TraceCheckUtils]: 0: Hoare triple {1307#true} call ULTIMATE.init(); {1307#true} is VALID [2018-11-23 12:05:18,307 INFO L273 TraceCheckUtils]: 1: Hoare triple {1307#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1307#true} is VALID [2018-11-23 12:05:18,307 INFO L273 TraceCheckUtils]: 2: Hoare triple {1307#true} assume true; {1307#true} is VALID [2018-11-23 12:05:18,308 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1307#true} {1307#true} #49#return; {1307#true} is VALID [2018-11-23 12:05:18,308 INFO L256 TraceCheckUtils]: 4: Hoare triple {1307#true} call #t~ret5 := main(); {1307#true} is VALID [2018-11-23 12:05:18,308 INFO L273 TraceCheckUtils]: 5: Hoare triple {1307#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {1334#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:18,309 INFO L273 TraceCheckUtils]: 6: Hoare triple {1334#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1334#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:18,309 INFO L273 TraceCheckUtils]: 7: Hoare triple {1334#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1310#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:18,311 INFO L273 TraceCheckUtils]: 8: Hoare triple {1310#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1310#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:18,311 INFO L273 TraceCheckUtils]: 9: Hoare triple {1310#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1311#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:18,312 INFO L273 TraceCheckUtils]: 10: Hoare triple {1311#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1311#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:18,313 INFO L273 TraceCheckUtils]: 11: Hoare triple {1311#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1312#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:18,316 INFO L273 TraceCheckUtils]: 12: Hoare triple {1312#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1312#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:18,319 INFO L273 TraceCheckUtils]: 13: Hoare triple {1312#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1313#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:18,323 INFO L273 TraceCheckUtils]: 14: Hoare triple {1313#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1313#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:18,325 INFO L273 TraceCheckUtils]: 15: Hoare triple {1313#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1314#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:18,326 INFO L273 TraceCheckUtils]: 16: Hoare triple {1314#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1314#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:18,327 INFO L273 TraceCheckUtils]: 17: Hoare triple {1314#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1315#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:18,328 INFO L273 TraceCheckUtils]: 18: Hoare triple {1315#(<= main_~i~0 6)} assume !(~i~0 < 50000); {1308#false} is VALID [2018-11-23 12:05:18,328 INFO L273 TraceCheckUtils]: 19: Hoare triple {1308#false} havoc ~x~0;~x~0 := 0; {1308#false} is VALID [2018-11-23 12:05:18,328 INFO L273 TraceCheckUtils]: 20: Hoare triple {1308#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {1308#false} is VALID [2018-11-23 12:05:18,329 INFO L256 TraceCheckUtils]: 21: Hoare triple {1308#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1308#false} is VALID [2018-11-23 12:05:18,329 INFO L273 TraceCheckUtils]: 22: Hoare triple {1308#false} ~cond := #in~cond; {1308#false} is VALID [2018-11-23 12:05:18,329 INFO L273 TraceCheckUtils]: 23: Hoare triple {1308#false} assume 0 == ~cond; {1308#false} is VALID [2018-11-23 12:05:18,329 INFO L273 TraceCheckUtils]: 24: Hoare triple {1308#false} assume !false; {1308#false} is VALID [2018-11-23 12:05:18,331 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:18,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:18,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 12:05:18,351 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-11-23 12:05:18,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:18,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:05:18,384 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:18,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:05:18,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:05:18,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:05:18,385 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2018-11-23 12:05:18,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:18,514 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-23 12:05:18,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:05:18,514 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-11-23 12:05:18,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:18,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:05:18,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2018-11-23 12:05:18,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:05:18,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2018-11-23 12:05:18,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 46 transitions. [2018-11-23 12:05:18,584 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:18,585 INFO L225 Difference]: With dead ends: 44 [2018-11-23 12:05:18,585 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 12:05:18,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:05:18,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 12:05:18,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-23 12:05:18,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:18,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 32 states. [2018-11-23 12:05:18,603 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 32 states. [2018-11-23 12:05:18,603 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 32 states. [2018-11-23 12:05:18,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:18,605 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-11-23 12:05:18,605 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-23 12:05:18,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:18,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:18,606 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states. [2018-11-23 12:05:18,606 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states. [2018-11-23 12:05:18,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:18,608 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-11-23 12:05:18,608 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-23 12:05:18,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:18,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:18,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:18,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:18,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:05:18,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-11-23 12:05:18,611 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 25 [2018-11-23 12:05:18,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:18,611 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-11-23 12:05:18,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:05:18,611 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-23 12:05:18,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:05:18,612 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:18,612 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:18,612 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:18,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:18,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1293642180, now seen corresponding path program 7 times [2018-11-23 12:05:18,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:18,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:18,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:18,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:18,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:18,805 INFO L256 TraceCheckUtils]: 0: Hoare triple {1566#true} call ULTIMATE.init(); {1566#true} is VALID [2018-11-23 12:05:18,805 INFO L273 TraceCheckUtils]: 1: Hoare triple {1566#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1566#true} is VALID [2018-11-23 12:05:18,806 INFO L273 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2018-11-23 12:05:18,806 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #49#return; {1566#true} is VALID [2018-11-23 12:05:18,806 INFO L256 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret5 := main(); {1566#true} is VALID [2018-11-23 12:05:18,807 INFO L273 TraceCheckUtils]: 5: Hoare triple {1566#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {1568#(= main_~i~0 0)} is VALID [2018-11-23 12:05:18,808 INFO L273 TraceCheckUtils]: 6: Hoare triple {1568#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1568#(= main_~i~0 0)} is VALID [2018-11-23 12:05:18,809 INFO L273 TraceCheckUtils]: 7: Hoare triple {1568#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1569#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:18,809 INFO L273 TraceCheckUtils]: 8: Hoare triple {1569#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1569#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:18,810 INFO L273 TraceCheckUtils]: 9: Hoare triple {1569#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1570#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:18,811 INFO L273 TraceCheckUtils]: 10: Hoare triple {1570#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1570#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:18,812 INFO L273 TraceCheckUtils]: 11: Hoare triple {1570#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1571#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:18,812 INFO L273 TraceCheckUtils]: 12: Hoare triple {1571#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1571#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:18,813 INFO L273 TraceCheckUtils]: 13: Hoare triple {1571#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1572#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:18,814 INFO L273 TraceCheckUtils]: 14: Hoare triple {1572#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1572#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:18,815 INFO L273 TraceCheckUtils]: 15: Hoare triple {1572#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1573#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:18,815 INFO L273 TraceCheckUtils]: 16: Hoare triple {1573#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1573#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:18,816 INFO L273 TraceCheckUtils]: 17: Hoare triple {1573#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1574#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:18,817 INFO L273 TraceCheckUtils]: 18: Hoare triple {1574#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1574#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:18,818 INFO L273 TraceCheckUtils]: 19: Hoare triple {1574#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1575#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:18,819 INFO L273 TraceCheckUtils]: 20: Hoare triple {1575#(<= main_~i~0 7)} assume !(~i~0 < 50000); {1567#false} is VALID [2018-11-23 12:05:18,819 INFO L273 TraceCheckUtils]: 21: Hoare triple {1567#false} havoc ~x~0;~x~0 := 0; {1567#false} is VALID [2018-11-23 12:05:18,819 INFO L273 TraceCheckUtils]: 22: Hoare triple {1567#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {1567#false} is VALID [2018-11-23 12:05:18,820 INFO L256 TraceCheckUtils]: 23: Hoare triple {1567#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1567#false} is VALID [2018-11-23 12:05:18,820 INFO L273 TraceCheckUtils]: 24: Hoare triple {1567#false} ~cond := #in~cond; {1567#false} is VALID [2018-11-23 12:05:18,820 INFO L273 TraceCheckUtils]: 25: Hoare triple {1567#false} assume 0 == ~cond; {1567#false} is VALID [2018-11-23 12:05:18,821 INFO L273 TraceCheckUtils]: 26: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2018-11-23 12:05:18,822 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:18,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:18,823 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-23 12:05:18,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:18,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:19,072 INFO L256 TraceCheckUtils]: 0: Hoare triple {1566#true} call ULTIMATE.init(); {1566#true} is VALID [2018-11-23 12:05:19,072 INFO L273 TraceCheckUtils]: 1: Hoare triple {1566#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1566#true} is VALID [2018-11-23 12:05:19,073 INFO L273 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2018-11-23 12:05:19,073 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #49#return; {1566#true} is VALID [2018-11-23 12:05:19,073 INFO L256 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret5 := main(); {1566#true} is VALID [2018-11-23 12:05:19,076 INFO L273 TraceCheckUtils]: 5: Hoare triple {1566#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {1594#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:19,076 INFO L273 TraceCheckUtils]: 6: Hoare triple {1594#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1594#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:19,077 INFO L273 TraceCheckUtils]: 7: Hoare triple {1594#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1569#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:19,078 INFO L273 TraceCheckUtils]: 8: Hoare triple {1569#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1569#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:19,078 INFO L273 TraceCheckUtils]: 9: Hoare triple {1569#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1570#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:19,079 INFO L273 TraceCheckUtils]: 10: Hoare triple {1570#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1570#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:19,080 INFO L273 TraceCheckUtils]: 11: Hoare triple {1570#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1571#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:19,081 INFO L273 TraceCheckUtils]: 12: Hoare triple {1571#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1571#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:19,082 INFO L273 TraceCheckUtils]: 13: Hoare triple {1571#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1572#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:19,083 INFO L273 TraceCheckUtils]: 14: Hoare triple {1572#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1572#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:19,083 INFO L273 TraceCheckUtils]: 15: Hoare triple {1572#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1573#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:19,086 INFO L273 TraceCheckUtils]: 16: Hoare triple {1573#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1573#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:19,087 INFO L273 TraceCheckUtils]: 17: Hoare triple {1573#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1574#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:19,087 INFO L273 TraceCheckUtils]: 18: Hoare triple {1574#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1574#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:19,088 INFO L273 TraceCheckUtils]: 19: Hoare triple {1574#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1575#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:19,088 INFO L273 TraceCheckUtils]: 20: Hoare triple {1575#(<= main_~i~0 7)} assume !(~i~0 < 50000); {1567#false} is VALID [2018-11-23 12:05:19,088 INFO L273 TraceCheckUtils]: 21: Hoare triple {1567#false} havoc ~x~0;~x~0 := 0; {1567#false} is VALID [2018-11-23 12:05:19,089 INFO L273 TraceCheckUtils]: 22: Hoare triple {1567#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {1567#false} is VALID [2018-11-23 12:05:19,089 INFO L256 TraceCheckUtils]: 23: Hoare triple {1567#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1567#false} is VALID [2018-11-23 12:05:19,089 INFO L273 TraceCheckUtils]: 24: Hoare triple {1567#false} ~cond := #in~cond; {1567#false} is VALID [2018-11-23 12:05:19,089 INFO L273 TraceCheckUtils]: 25: Hoare triple {1567#false} assume 0 == ~cond; {1567#false} is VALID [2018-11-23 12:05:19,089 INFO L273 TraceCheckUtils]: 26: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2018-11-23 12:05:19,092 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:19,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:19,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:05:19,120 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-11-23 12:05:19,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:19,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:05:19,187 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-23 12:05:19,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:05:19,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:05:19,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:05:19,189 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 11 states. [2018-11-23 12:05:19,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:19,430 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-11-23 12:05:19,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:05:19,431 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-11-23 12:05:19,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:19,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:05:19,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2018-11-23 12:05:19,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:05:19,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2018-11-23 12:05:19,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 48 transitions. [2018-11-23 12:05:19,496 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:19,498 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:05:19,498 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 12:05:19,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:05:19,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 12:05:19,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-11-23 12:05:19,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:19,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 34 states. [2018-11-23 12:05:19,609 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 34 states. [2018-11-23 12:05:19,609 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 34 states. [2018-11-23 12:05:19,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:19,611 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-11-23 12:05:19,611 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-11-23 12:05:19,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:19,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:19,612 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 35 states. [2018-11-23 12:05:19,613 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 35 states. [2018-11-23 12:05:19,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:19,614 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-11-23 12:05:19,615 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-11-23 12:05:19,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:19,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:19,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:19,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:19,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:05:19,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-11-23 12:05:19,617 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 27 [2018-11-23 12:05:19,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:19,617 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-11-23 12:05:19,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:05:19,618 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-11-23 12:05:19,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:05:19,619 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:19,619 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:19,619 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:19,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:19,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1974537826, now seen corresponding path program 8 times [2018-11-23 12:05:19,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:19,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:19,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:19,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:19,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:19,967 INFO L256 TraceCheckUtils]: 0: Hoare triple {1842#true} call ULTIMATE.init(); {1842#true} is VALID [2018-11-23 12:05:19,968 INFO L273 TraceCheckUtils]: 1: Hoare triple {1842#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1842#true} is VALID [2018-11-23 12:05:19,968 INFO L273 TraceCheckUtils]: 2: Hoare triple {1842#true} assume true; {1842#true} is VALID [2018-11-23 12:05:19,968 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1842#true} {1842#true} #49#return; {1842#true} is VALID [2018-11-23 12:05:19,968 INFO L256 TraceCheckUtils]: 4: Hoare triple {1842#true} call #t~ret5 := main(); {1842#true} is VALID [2018-11-23 12:05:19,969 INFO L273 TraceCheckUtils]: 5: Hoare triple {1842#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {1844#(= main_~i~0 0)} is VALID [2018-11-23 12:05:19,969 INFO L273 TraceCheckUtils]: 6: Hoare triple {1844#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1844#(= main_~i~0 0)} is VALID [2018-11-23 12:05:19,969 INFO L273 TraceCheckUtils]: 7: Hoare triple {1844#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1845#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:19,970 INFO L273 TraceCheckUtils]: 8: Hoare triple {1845#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1845#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:19,970 INFO L273 TraceCheckUtils]: 9: Hoare triple {1845#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1846#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:19,971 INFO L273 TraceCheckUtils]: 10: Hoare triple {1846#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1846#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:19,971 INFO L273 TraceCheckUtils]: 11: Hoare triple {1846#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1847#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:19,971 INFO L273 TraceCheckUtils]: 12: Hoare triple {1847#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1847#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:19,972 INFO L273 TraceCheckUtils]: 13: Hoare triple {1847#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1848#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:19,973 INFO L273 TraceCheckUtils]: 14: Hoare triple {1848#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1848#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:19,974 INFO L273 TraceCheckUtils]: 15: Hoare triple {1848#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1849#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:19,974 INFO L273 TraceCheckUtils]: 16: Hoare triple {1849#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1849#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:19,975 INFO L273 TraceCheckUtils]: 17: Hoare triple {1849#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1850#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:19,976 INFO L273 TraceCheckUtils]: 18: Hoare triple {1850#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1850#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:19,976 INFO L273 TraceCheckUtils]: 19: Hoare triple {1850#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1851#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:19,977 INFO L273 TraceCheckUtils]: 20: Hoare triple {1851#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1851#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:19,988 INFO L273 TraceCheckUtils]: 21: Hoare triple {1851#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1852#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:19,988 INFO L273 TraceCheckUtils]: 22: Hoare triple {1852#(<= main_~i~0 8)} assume !(~i~0 < 50000); {1843#false} is VALID [2018-11-23 12:05:19,989 INFO L273 TraceCheckUtils]: 23: Hoare triple {1843#false} havoc ~x~0;~x~0 := 0; {1843#false} is VALID [2018-11-23 12:05:19,989 INFO L273 TraceCheckUtils]: 24: Hoare triple {1843#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {1843#false} is VALID [2018-11-23 12:05:19,989 INFO L256 TraceCheckUtils]: 25: Hoare triple {1843#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1843#false} is VALID [2018-11-23 12:05:19,989 INFO L273 TraceCheckUtils]: 26: Hoare triple {1843#false} ~cond := #in~cond; {1843#false} is VALID [2018-11-23 12:05:19,989 INFO L273 TraceCheckUtils]: 27: Hoare triple {1843#false} assume 0 == ~cond; {1843#false} is VALID [2018-11-23 12:05:19,990 INFO L273 TraceCheckUtils]: 28: Hoare triple {1843#false} assume !false; {1843#false} is VALID [2018-11-23 12:05:19,991 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:19,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:19,991 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-23 12:05:20,008 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:05:20,053 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:05:20,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:20,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:20,197 INFO L256 TraceCheckUtils]: 0: Hoare triple {1842#true} call ULTIMATE.init(); {1842#true} is VALID [2018-11-23 12:05:20,197 INFO L273 TraceCheckUtils]: 1: Hoare triple {1842#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1842#true} is VALID [2018-11-23 12:05:20,198 INFO L273 TraceCheckUtils]: 2: Hoare triple {1842#true} assume true; {1842#true} is VALID [2018-11-23 12:05:20,198 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1842#true} {1842#true} #49#return; {1842#true} is VALID [2018-11-23 12:05:20,198 INFO L256 TraceCheckUtils]: 4: Hoare triple {1842#true} call #t~ret5 := main(); {1842#true} is VALID [2018-11-23 12:05:20,199 INFO L273 TraceCheckUtils]: 5: Hoare triple {1842#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {1871#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:20,199 INFO L273 TraceCheckUtils]: 6: Hoare triple {1871#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1871#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:20,200 INFO L273 TraceCheckUtils]: 7: Hoare triple {1871#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1845#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:20,200 INFO L273 TraceCheckUtils]: 8: Hoare triple {1845#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1845#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:20,201 INFO L273 TraceCheckUtils]: 9: Hoare triple {1845#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1846#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:20,201 INFO L273 TraceCheckUtils]: 10: Hoare triple {1846#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1846#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:20,202 INFO L273 TraceCheckUtils]: 11: Hoare triple {1846#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1847#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:20,203 INFO L273 TraceCheckUtils]: 12: Hoare triple {1847#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1847#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:20,203 INFO L273 TraceCheckUtils]: 13: Hoare triple {1847#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1848#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:20,204 INFO L273 TraceCheckUtils]: 14: Hoare triple {1848#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1848#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:20,205 INFO L273 TraceCheckUtils]: 15: Hoare triple {1848#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1849#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:20,205 INFO L273 TraceCheckUtils]: 16: Hoare triple {1849#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1849#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:20,206 INFO L273 TraceCheckUtils]: 17: Hoare triple {1849#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1850#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:20,207 INFO L273 TraceCheckUtils]: 18: Hoare triple {1850#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1850#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:20,207 INFO L273 TraceCheckUtils]: 19: Hoare triple {1850#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1851#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:20,208 INFO L273 TraceCheckUtils]: 20: Hoare triple {1851#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1851#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:20,209 INFO L273 TraceCheckUtils]: 21: Hoare triple {1851#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1852#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:20,209 INFO L273 TraceCheckUtils]: 22: Hoare triple {1852#(<= main_~i~0 8)} assume !(~i~0 < 50000); {1843#false} is VALID [2018-11-23 12:05:20,210 INFO L273 TraceCheckUtils]: 23: Hoare triple {1843#false} havoc ~x~0;~x~0 := 0; {1843#false} is VALID [2018-11-23 12:05:20,210 INFO L273 TraceCheckUtils]: 24: Hoare triple {1843#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {1843#false} is VALID [2018-11-23 12:05:20,210 INFO L256 TraceCheckUtils]: 25: Hoare triple {1843#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1843#false} is VALID [2018-11-23 12:05:20,210 INFO L273 TraceCheckUtils]: 26: Hoare triple {1843#false} ~cond := #in~cond; {1843#false} is VALID [2018-11-23 12:05:20,211 INFO L273 TraceCheckUtils]: 27: Hoare triple {1843#false} assume 0 == ~cond; {1843#false} is VALID [2018-11-23 12:05:20,211 INFO L273 TraceCheckUtils]: 28: Hoare triple {1843#false} assume !false; {1843#false} is VALID [2018-11-23 12:05:20,212 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:20,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:20,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:05:20,233 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-11-23 12:05:20,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:20,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:05:20,423 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:20,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:05:20,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:05:20,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:05:20,424 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 12 states. [2018-11-23 12:05:21,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:21,216 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-23 12:05:21,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:05:21,216 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-11-23 12:05:21,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:21,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:05:21,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2018-11-23 12:05:21,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:05:21,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2018-11-23 12:05:21,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 50 transitions. [2018-11-23 12:05:21,292 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:21,293 INFO L225 Difference]: With dead ends: 48 [2018-11-23 12:05:21,293 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 12:05:21,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 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-23 12:05:21,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 12:05:21,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-23 12:05:21,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:21,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 36 states. [2018-11-23 12:05:21,317 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 36 states. [2018-11-23 12:05:21,317 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 36 states. [2018-11-23 12:05:21,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:21,319 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-11-23 12:05:21,319 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-23 12:05:21,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:21,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:21,320 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 37 states. [2018-11-23 12:05:21,320 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 37 states. [2018-11-23 12:05:21,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:21,321 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-11-23 12:05:21,321 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-23 12:05:21,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:21,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:21,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:21,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:21,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:05:21,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-23 12:05:21,323 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 29 [2018-11-23 12:05:21,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:21,323 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-23 12:05:21,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:05:21,323 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 12:05:21,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:05:21,324 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:21,324 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:21,324 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:21,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:21,325 INFO L82 PathProgramCache]: Analyzing trace with hash -814742656, now seen corresponding path program 9 times [2018-11-23 12:05:21,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:21,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:21,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:21,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:21,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:22,197 INFO L256 TraceCheckUtils]: 0: Hoare triple {2135#true} call ULTIMATE.init(); {2135#true} is VALID [2018-11-23 12:05:22,198 INFO L273 TraceCheckUtils]: 1: Hoare triple {2135#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2135#true} is VALID [2018-11-23 12:05:22,198 INFO L273 TraceCheckUtils]: 2: Hoare triple {2135#true} assume true; {2135#true} is VALID [2018-11-23 12:05:22,199 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2135#true} {2135#true} #49#return; {2135#true} is VALID [2018-11-23 12:05:22,199 INFO L256 TraceCheckUtils]: 4: Hoare triple {2135#true} call #t~ret5 := main(); {2135#true} is VALID [2018-11-23 12:05:22,200 INFO L273 TraceCheckUtils]: 5: Hoare triple {2135#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {2137#(= main_~i~0 0)} is VALID [2018-11-23 12:05:22,203 INFO L273 TraceCheckUtils]: 6: Hoare triple {2137#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2137#(= main_~i~0 0)} is VALID [2018-11-23 12:05:22,203 INFO L273 TraceCheckUtils]: 7: Hoare triple {2137#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2138#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:22,204 INFO L273 TraceCheckUtils]: 8: Hoare triple {2138#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2138#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:22,204 INFO L273 TraceCheckUtils]: 9: Hoare triple {2138#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2139#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:22,205 INFO L273 TraceCheckUtils]: 10: Hoare triple {2139#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2139#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:22,205 INFO L273 TraceCheckUtils]: 11: Hoare triple {2139#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2140#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:22,206 INFO L273 TraceCheckUtils]: 12: Hoare triple {2140#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2140#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:22,206 INFO L273 TraceCheckUtils]: 13: Hoare triple {2140#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2141#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:22,207 INFO L273 TraceCheckUtils]: 14: Hoare triple {2141#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2141#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:22,208 INFO L273 TraceCheckUtils]: 15: Hoare triple {2141#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2142#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:22,209 INFO L273 TraceCheckUtils]: 16: Hoare triple {2142#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2142#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:22,210 INFO L273 TraceCheckUtils]: 17: Hoare triple {2142#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2143#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:22,210 INFO L273 TraceCheckUtils]: 18: Hoare triple {2143#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2143#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:22,211 INFO L273 TraceCheckUtils]: 19: Hoare triple {2143#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2144#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:22,212 INFO L273 TraceCheckUtils]: 20: Hoare triple {2144#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2144#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:22,213 INFO L273 TraceCheckUtils]: 21: Hoare triple {2144#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2145#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:22,214 INFO L273 TraceCheckUtils]: 22: Hoare triple {2145#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2145#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:22,214 INFO L273 TraceCheckUtils]: 23: Hoare triple {2145#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2146#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:22,215 INFO L273 TraceCheckUtils]: 24: Hoare triple {2146#(<= main_~i~0 9)} assume !(~i~0 < 50000); {2136#false} is VALID [2018-11-23 12:05:22,216 INFO L273 TraceCheckUtils]: 25: Hoare triple {2136#false} havoc ~x~0;~x~0 := 0; {2136#false} is VALID [2018-11-23 12:05:22,216 INFO L273 TraceCheckUtils]: 26: Hoare triple {2136#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {2136#false} is VALID [2018-11-23 12:05:22,216 INFO L256 TraceCheckUtils]: 27: Hoare triple {2136#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {2136#false} is VALID [2018-11-23 12:05:22,216 INFO L273 TraceCheckUtils]: 28: Hoare triple {2136#false} ~cond := #in~cond; {2136#false} is VALID [2018-11-23 12:05:22,217 INFO L273 TraceCheckUtils]: 29: Hoare triple {2136#false} assume 0 == ~cond; {2136#false} is VALID [2018-11-23 12:05:22,217 INFO L273 TraceCheckUtils]: 30: Hoare triple {2136#false} assume !false; {2136#false} is VALID [2018-11-23 12:05:22,219 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:22,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:22,220 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-23 12:05:22,231 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:05:22,326 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 12:05:22,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:22,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:22,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:22,464 INFO L256 TraceCheckUtils]: 0: Hoare triple {2135#true} call ULTIMATE.init(); {2135#true} is VALID [2018-11-23 12:05:22,464 INFO L273 TraceCheckUtils]: 1: Hoare triple {2135#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2135#true} is VALID [2018-11-23 12:05:22,464 INFO L273 TraceCheckUtils]: 2: Hoare triple {2135#true} assume true; {2135#true} is VALID [2018-11-23 12:05:22,465 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2135#true} {2135#true} #49#return; {2135#true} is VALID [2018-11-23 12:05:22,465 INFO L256 TraceCheckUtils]: 4: Hoare triple {2135#true} call #t~ret5 := main(); {2135#true} is VALID [2018-11-23 12:05:22,465 INFO L273 TraceCheckUtils]: 5: Hoare triple {2135#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {2165#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:22,465 INFO L273 TraceCheckUtils]: 6: Hoare triple {2165#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2165#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:22,466 INFO L273 TraceCheckUtils]: 7: Hoare triple {2165#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2138#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:22,466 INFO L273 TraceCheckUtils]: 8: Hoare triple {2138#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2138#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:22,467 INFO L273 TraceCheckUtils]: 9: Hoare triple {2138#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2139#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:22,467 INFO L273 TraceCheckUtils]: 10: Hoare triple {2139#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2139#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:22,468 INFO L273 TraceCheckUtils]: 11: Hoare triple {2139#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2140#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:22,468 INFO L273 TraceCheckUtils]: 12: Hoare triple {2140#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2140#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:22,475 INFO L273 TraceCheckUtils]: 13: Hoare triple {2140#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2141#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:22,475 INFO L273 TraceCheckUtils]: 14: Hoare triple {2141#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2141#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:22,476 INFO L273 TraceCheckUtils]: 15: Hoare triple {2141#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2142#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:22,476 INFO L273 TraceCheckUtils]: 16: Hoare triple {2142#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2142#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:22,480 INFO L273 TraceCheckUtils]: 17: Hoare triple {2142#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2143#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:22,481 INFO L273 TraceCheckUtils]: 18: Hoare triple {2143#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2143#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:22,481 INFO L273 TraceCheckUtils]: 19: Hoare triple {2143#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2144#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:22,482 INFO L273 TraceCheckUtils]: 20: Hoare triple {2144#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2144#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:22,482 INFO L273 TraceCheckUtils]: 21: Hoare triple {2144#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2145#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:22,482 INFO L273 TraceCheckUtils]: 22: Hoare triple {2145#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2145#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:22,483 INFO L273 TraceCheckUtils]: 23: Hoare triple {2145#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2146#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:22,483 INFO L273 TraceCheckUtils]: 24: Hoare triple {2146#(<= main_~i~0 9)} assume !(~i~0 < 50000); {2136#false} is VALID [2018-11-23 12:05:22,483 INFO L273 TraceCheckUtils]: 25: Hoare triple {2136#false} havoc ~x~0;~x~0 := 0; {2136#false} is VALID [2018-11-23 12:05:22,484 INFO L273 TraceCheckUtils]: 26: Hoare triple {2136#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {2136#false} is VALID [2018-11-23 12:05:22,484 INFO L256 TraceCheckUtils]: 27: Hoare triple {2136#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {2136#false} is VALID [2018-11-23 12:05:22,484 INFO L273 TraceCheckUtils]: 28: Hoare triple {2136#false} ~cond := #in~cond; {2136#false} is VALID [2018-11-23 12:05:22,484 INFO L273 TraceCheckUtils]: 29: Hoare triple {2136#false} assume 0 == ~cond; {2136#false} is VALID [2018-11-23 12:05:22,484 INFO L273 TraceCheckUtils]: 30: Hoare triple {2136#false} assume !false; {2136#false} is VALID [2018-11-23 12:05:22,485 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:22,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:22,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 12:05:22,506 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-11-23 12:05:22,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:22,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:05:22,539 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:22,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:05:22,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:05:22,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:05:22,540 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 13 states. [2018-11-23 12:05:22,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:22,692 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-11-23 12:05:22,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:05:22,693 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-11-23 12:05:22,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:22,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:05:22,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2018-11-23 12:05:22,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:05:22,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2018-11-23 12:05:22,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 52 transitions. [2018-11-23 12:05:22,781 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:22,782 INFO L225 Difference]: With dead ends: 50 [2018-11-23 12:05:22,782 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:05:22,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:05:22,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:05:22,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-23 12:05:22,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:22,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 38 states. [2018-11-23 12:05:22,798 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 38 states. [2018-11-23 12:05:22,798 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 38 states. [2018-11-23 12:05:22,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:22,800 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-11-23 12:05:22,800 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 12:05:22,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:22,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:22,800 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 39 states. [2018-11-23 12:05:22,801 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 39 states. [2018-11-23 12:05:22,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:22,802 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-11-23 12:05:22,802 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 12:05:22,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:22,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:22,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:22,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:22,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:05:22,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-11-23 12:05:22,803 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 31 [2018-11-23 12:05:22,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:22,803 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-11-23 12:05:22,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:05:22,803 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-23 12:05:22,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:05:22,804 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:22,804 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:22,804 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:22,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:22,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1253693154, now seen corresponding path program 10 times [2018-11-23 12:05:22,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:22,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:22,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:22,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:22,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:22,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:23,158 INFO L256 TraceCheckUtils]: 0: Hoare triple {2445#true} call ULTIMATE.init(); {2445#true} is VALID [2018-11-23 12:05:23,159 INFO L273 TraceCheckUtils]: 1: Hoare triple {2445#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2445#true} is VALID [2018-11-23 12:05:23,159 INFO L273 TraceCheckUtils]: 2: Hoare triple {2445#true} assume true; {2445#true} is VALID [2018-11-23 12:05:23,159 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2445#true} {2445#true} #49#return; {2445#true} is VALID [2018-11-23 12:05:23,160 INFO L256 TraceCheckUtils]: 4: Hoare triple {2445#true} call #t~ret5 := main(); {2445#true} is VALID [2018-11-23 12:05:23,160 INFO L273 TraceCheckUtils]: 5: Hoare triple {2445#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {2447#(= main_~i~0 0)} is VALID [2018-11-23 12:05:23,161 INFO L273 TraceCheckUtils]: 6: Hoare triple {2447#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2447#(= main_~i~0 0)} is VALID [2018-11-23 12:05:23,161 INFO L273 TraceCheckUtils]: 7: Hoare triple {2447#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2448#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:23,179 INFO L273 TraceCheckUtils]: 8: Hoare triple {2448#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2448#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:23,188 INFO L273 TraceCheckUtils]: 9: Hoare triple {2448#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2449#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:23,204 INFO L273 TraceCheckUtils]: 10: Hoare triple {2449#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2449#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:23,213 INFO L273 TraceCheckUtils]: 11: Hoare triple {2449#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2450#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:23,227 INFO L273 TraceCheckUtils]: 12: Hoare triple {2450#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2450#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:23,236 INFO L273 TraceCheckUtils]: 13: Hoare triple {2450#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2451#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:23,250 INFO L273 TraceCheckUtils]: 14: Hoare triple {2451#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2451#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:23,259 INFO L273 TraceCheckUtils]: 15: Hoare triple {2451#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2452#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:23,271 INFO L273 TraceCheckUtils]: 16: Hoare triple {2452#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2452#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:23,284 INFO L273 TraceCheckUtils]: 17: Hoare triple {2452#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2453#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:23,293 INFO L273 TraceCheckUtils]: 18: Hoare triple {2453#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2453#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:23,306 INFO L273 TraceCheckUtils]: 19: Hoare triple {2453#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2454#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:23,322 INFO L273 TraceCheckUtils]: 20: Hoare triple {2454#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2454#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:23,331 INFO L273 TraceCheckUtils]: 21: Hoare triple {2454#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2455#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:23,346 INFO L273 TraceCheckUtils]: 22: Hoare triple {2455#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2455#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:23,350 INFO L273 TraceCheckUtils]: 23: Hoare triple {2455#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2456#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:23,350 INFO L273 TraceCheckUtils]: 24: Hoare triple {2456#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2456#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:23,352 INFO L273 TraceCheckUtils]: 25: Hoare triple {2456#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2457#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:23,352 INFO L273 TraceCheckUtils]: 26: Hoare triple {2457#(<= main_~i~0 10)} assume !(~i~0 < 50000); {2446#false} is VALID [2018-11-23 12:05:23,352 INFO L273 TraceCheckUtils]: 27: Hoare triple {2446#false} havoc ~x~0;~x~0 := 0; {2446#false} is VALID [2018-11-23 12:05:23,353 INFO L273 TraceCheckUtils]: 28: Hoare triple {2446#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {2446#false} is VALID [2018-11-23 12:05:23,353 INFO L256 TraceCheckUtils]: 29: Hoare triple {2446#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {2446#false} is VALID [2018-11-23 12:05:23,353 INFO L273 TraceCheckUtils]: 30: Hoare triple {2446#false} ~cond := #in~cond; {2446#false} is VALID [2018-11-23 12:05:23,353 INFO L273 TraceCheckUtils]: 31: Hoare triple {2446#false} assume 0 == ~cond; {2446#false} is VALID [2018-11-23 12:05:23,353 INFO L273 TraceCheckUtils]: 32: Hoare triple {2446#false} assume !false; {2446#false} is VALID [2018-11-23 12:05:23,355 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-23 12:05:23,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:23,355 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-23 12:05:23,370 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:05:23,389 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:05:23,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:23,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:23,508 INFO L256 TraceCheckUtils]: 0: Hoare triple {2445#true} call ULTIMATE.init(); {2445#true} is VALID [2018-11-23 12:05:23,509 INFO L273 TraceCheckUtils]: 1: Hoare triple {2445#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2445#true} is VALID [2018-11-23 12:05:23,509 INFO L273 TraceCheckUtils]: 2: Hoare triple {2445#true} assume true; {2445#true} is VALID [2018-11-23 12:05:23,509 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2445#true} {2445#true} #49#return; {2445#true} is VALID [2018-11-23 12:05:23,509 INFO L256 TraceCheckUtils]: 4: Hoare triple {2445#true} call #t~ret5 := main(); {2445#true} is VALID [2018-11-23 12:05:23,510 INFO L273 TraceCheckUtils]: 5: Hoare triple {2445#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {2476#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:23,510 INFO L273 TraceCheckUtils]: 6: Hoare triple {2476#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2476#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:23,511 INFO L273 TraceCheckUtils]: 7: Hoare triple {2476#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2448#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:23,511 INFO L273 TraceCheckUtils]: 8: Hoare triple {2448#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2448#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:23,512 INFO L273 TraceCheckUtils]: 9: Hoare triple {2448#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2449#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:23,512 INFO L273 TraceCheckUtils]: 10: Hoare triple {2449#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2449#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:23,521 INFO L273 TraceCheckUtils]: 11: Hoare triple {2449#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2450#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:23,535 INFO L273 TraceCheckUtils]: 12: Hoare triple {2450#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2450#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:23,544 INFO L273 TraceCheckUtils]: 13: Hoare triple {2450#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2451#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:23,551 INFO L273 TraceCheckUtils]: 14: Hoare triple {2451#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2451#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:23,552 INFO L273 TraceCheckUtils]: 15: Hoare triple {2451#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2452#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:23,553 INFO L273 TraceCheckUtils]: 16: Hoare triple {2452#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2452#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:23,553 INFO L273 TraceCheckUtils]: 17: Hoare triple {2452#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2453#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:23,556 INFO L273 TraceCheckUtils]: 18: Hoare triple {2453#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2453#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:23,556 INFO L273 TraceCheckUtils]: 19: Hoare triple {2453#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2454#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:23,557 INFO L273 TraceCheckUtils]: 20: Hoare triple {2454#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2454#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:23,557 INFO L273 TraceCheckUtils]: 21: Hoare triple {2454#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2455#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:23,557 INFO L273 TraceCheckUtils]: 22: Hoare triple {2455#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2455#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:23,558 INFO L273 TraceCheckUtils]: 23: Hoare triple {2455#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2456#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:23,558 INFO L273 TraceCheckUtils]: 24: Hoare triple {2456#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2456#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:23,559 INFO L273 TraceCheckUtils]: 25: Hoare triple {2456#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2457#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:23,559 INFO L273 TraceCheckUtils]: 26: Hoare triple {2457#(<= main_~i~0 10)} assume !(~i~0 < 50000); {2446#false} is VALID [2018-11-23 12:05:23,559 INFO L273 TraceCheckUtils]: 27: Hoare triple {2446#false} havoc ~x~0;~x~0 := 0; {2446#false} is VALID [2018-11-23 12:05:23,559 INFO L273 TraceCheckUtils]: 28: Hoare triple {2446#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {2446#false} is VALID [2018-11-23 12:05:23,560 INFO L256 TraceCheckUtils]: 29: Hoare triple {2446#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {2446#false} is VALID [2018-11-23 12:05:23,560 INFO L273 TraceCheckUtils]: 30: Hoare triple {2446#false} ~cond := #in~cond; {2446#false} is VALID [2018-11-23 12:05:23,560 INFO L273 TraceCheckUtils]: 31: Hoare triple {2446#false} assume 0 == ~cond; {2446#false} is VALID [2018-11-23 12:05:23,560 INFO L273 TraceCheckUtils]: 32: Hoare triple {2446#false} assume !false; {2446#false} is VALID [2018-11-23 12:05:23,562 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-23 12:05:23,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:23,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 12:05:23,583 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-23 12:05:23,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:23,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:05:23,640 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-23 12:05:23,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:05:23,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:05:23,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:05:23,642 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 14 states. [2018-11-23 12:05:23,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:23,873 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-11-23 12:05:23,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:05:23,874 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-23 12:05:23,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:23,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:05:23,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 54 transitions. [2018-11-23 12:05:23,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:05:23,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 54 transitions. [2018-11-23 12:05:23,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 54 transitions. [2018-11-23 12:05:23,929 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-23 12:05:23,931 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:05:23,931 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 12:05:23,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:05:23,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 12:05:23,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-11-23 12:05:23,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:23,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 40 states. [2018-11-23 12:05:23,949 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 40 states. [2018-11-23 12:05:23,950 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 40 states. [2018-11-23 12:05:23,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:23,951 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-11-23 12:05:23,951 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-11-23 12:05:23,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:23,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:23,952 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 41 states. [2018-11-23 12:05:23,952 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 41 states. [2018-11-23 12:05:23,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:23,953 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-11-23 12:05:23,953 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-11-23 12:05:23,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:23,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:23,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:23,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:23,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:05:23,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-11-23 12:05:23,954 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 33 [2018-11-23 12:05:23,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:23,955 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-11-23 12:05:23,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:05:23,955 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 12:05:23,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 12:05:23,955 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:23,956 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:23,956 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:23,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:23,956 INFO L82 PathProgramCache]: Analyzing trace with hash 2116640572, now seen corresponding path program 11 times [2018-11-23 12:05:23,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:23,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:23,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:23,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:23,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:24,793 INFO L256 TraceCheckUtils]: 0: Hoare triple {2772#true} call ULTIMATE.init(); {2772#true} is VALID [2018-11-23 12:05:24,794 INFO L273 TraceCheckUtils]: 1: Hoare triple {2772#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2772#true} is VALID [2018-11-23 12:05:24,794 INFO L273 TraceCheckUtils]: 2: Hoare triple {2772#true} assume true; {2772#true} is VALID [2018-11-23 12:05:24,794 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2772#true} {2772#true} #49#return; {2772#true} is VALID [2018-11-23 12:05:24,794 INFO L256 TraceCheckUtils]: 4: Hoare triple {2772#true} call #t~ret5 := main(); {2772#true} is VALID [2018-11-23 12:05:24,797 INFO L273 TraceCheckUtils]: 5: Hoare triple {2772#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {2774#(= main_~i~0 0)} is VALID [2018-11-23 12:05:24,812 INFO L273 TraceCheckUtils]: 6: Hoare triple {2774#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2774#(= main_~i~0 0)} is VALID [2018-11-23 12:05:24,813 INFO L273 TraceCheckUtils]: 7: Hoare triple {2774#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2775#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:24,814 INFO L273 TraceCheckUtils]: 8: Hoare triple {2775#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2775#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:24,814 INFO L273 TraceCheckUtils]: 9: Hoare triple {2775#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2776#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:24,814 INFO L273 TraceCheckUtils]: 10: Hoare triple {2776#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2776#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:24,815 INFO L273 TraceCheckUtils]: 11: Hoare triple {2776#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2777#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:24,815 INFO L273 TraceCheckUtils]: 12: Hoare triple {2777#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2777#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:24,816 INFO L273 TraceCheckUtils]: 13: Hoare triple {2777#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2778#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:24,816 INFO L273 TraceCheckUtils]: 14: Hoare triple {2778#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2778#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:24,816 INFO L273 TraceCheckUtils]: 15: Hoare triple {2778#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2779#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:24,817 INFO L273 TraceCheckUtils]: 16: Hoare triple {2779#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2779#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:24,817 INFO L273 TraceCheckUtils]: 17: Hoare triple {2779#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2780#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:24,818 INFO L273 TraceCheckUtils]: 18: Hoare triple {2780#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2780#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:24,819 INFO L273 TraceCheckUtils]: 19: Hoare triple {2780#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2781#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:24,819 INFO L273 TraceCheckUtils]: 20: Hoare triple {2781#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2781#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:24,820 INFO L273 TraceCheckUtils]: 21: Hoare triple {2781#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2782#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:24,821 INFO L273 TraceCheckUtils]: 22: Hoare triple {2782#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2782#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:24,822 INFO L273 TraceCheckUtils]: 23: Hoare triple {2782#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2783#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:24,822 INFO L273 TraceCheckUtils]: 24: Hoare triple {2783#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2783#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:24,823 INFO L273 TraceCheckUtils]: 25: Hoare triple {2783#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2784#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:24,823 INFO L273 TraceCheckUtils]: 26: Hoare triple {2784#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2784#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:24,824 INFO L273 TraceCheckUtils]: 27: Hoare triple {2784#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2785#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:24,825 INFO L273 TraceCheckUtils]: 28: Hoare triple {2785#(<= main_~i~0 11)} assume !(~i~0 < 50000); {2773#false} is VALID [2018-11-23 12:05:24,825 INFO L273 TraceCheckUtils]: 29: Hoare triple {2773#false} havoc ~x~0;~x~0 := 0; {2773#false} is VALID [2018-11-23 12:05:24,825 INFO L273 TraceCheckUtils]: 30: Hoare triple {2773#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {2773#false} is VALID [2018-11-23 12:05:24,826 INFO L256 TraceCheckUtils]: 31: Hoare triple {2773#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {2773#false} is VALID [2018-11-23 12:05:24,826 INFO L273 TraceCheckUtils]: 32: Hoare triple {2773#false} ~cond := #in~cond; {2773#false} is VALID [2018-11-23 12:05:24,826 INFO L273 TraceCheckUtils]: 33: Hoare triple {2773#false} assume 0 == ~cond; {2773#false} is VALID [2018-11-23 12:05:24,826 INFO L273 TraceCheckUtils]: 34: Hoare triple {2773#false} assume !false; {2773#false} is VALID [2018-11-23 12:05:24,828 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:24,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:24,828 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-23 12:05:24,838 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:05:24,942 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 12:05:24,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:24,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:25,107 INFO L256 TraceCheckUtils]: 0: Hoare triple {2772#true} call ULTIMATE.init(); {2772#true} is VALID [2018-11-23 12:05:25,107 INFO L273 TraceCheckUtils]: 1: Hoare triple {2772#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2772#true} is VALID [2018-11-23 12:05:25,108 INFO L273 TraceCheckUtils]: 2: Hoare triple {2772#true} assume true; {2772#true} is VALID [2018-11-23 12:05:25,108 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2772#true} {2772#true} #49#return; {2772#true} is VALID [2018-11-23 12:05:25,108 INFO L256 TraceCheckUtils]: 4: Hoare triple {2772#true} call #t~ret5 := main(); {2772#true} is VALID [2018-11-23 12:05:25,126 INFO L273 TraceCheckUtils]: 5: Hoare triple {2772#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {2804#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:25,135 INFO L273 TraceCheckUtils]: 6: Hoare triple {2804#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2804#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:25,144 INFO L273 TraceCheckUtils]: 7: Hoare triple {2804#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2775#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:25,157 INFO L273 TraceCheckUtils]: 8: Hoare triple {2775#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2775#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:25,170 INFO L273 TraceCheckUtils]: 9: Hoare triple {2775#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2776#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:25,185 INFO L273 TraceCheckUtils]: 10: Hoare triple {2776#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2776#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:25,194 INFO L273 TraceCheckUtils]: 11: Hoare triple {2776#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2777#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:25,208 INFO L273 TraceCheckUtils]: 12: Hoare triple {2777#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2777#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:25,217 INFO L273 TraceCheckUtils]: 13: Hoare triple {2777#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2778#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:25,230 INFO L273 TraceCheckUtils]: 14: Hoare triple {2778#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2778#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:25,243 INFO L273 TraceCheckUtils]: 15: Hoare triple {2778#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2779#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:25,243 INFO L273 TraceCheckUtils]: 16: Hoare triple {2779#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2779#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:25,248 INFO L273 TraceCheckUtils]: 17: Hoare triple {2779#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2780#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:25,248 INFO L273 TraceCheckUtils]: 18: Hoare triple {2780#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2780#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:25,250 INFO L273 TraceCheckUtils]: 19: Hoare triple {2780#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2781#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:25,250 INFO L273 TraceCheckUtils]: 20: Hoare triple {2781#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2781#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:25,252 INFO L273 TraceCheckUtils]: 21: Hoare triple {2781#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2782#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:25,252 INFO L273 TraceCheckUtils]: 22: Hoare triple {2782#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2782#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:25,254 INFO L273 TraceCheckUtils]: 23: Hoare triple {2782#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2783#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:25,254 INFO L273 TraceCheckUtils]: 24: Hoare triple {2783#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2783#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:25,256 INFO L273 TraceCheckUtils]: 25: Hoare triple {2783#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2784#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:25,256 INFO L273 TraceCheckUtils]: 26: Hoare triple {2784#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2784#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:25,258 INFO L273 TraceCheckUtils]: 27: Hoare triple {2784#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2785#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:25,258 INFO L273 TraceCheckUtils]: 28: Hoare triple {2785#(<= main_~i~0 11)} assume !(~i~0 < 50000); {2773#false} is VALID [2018-11-23 12:05:25,258 INFO L273 TraceCheckUtils]: 29: Hoare triple {2773#false} havoc ~x~0;~x~0 := 0; {2773#false} is VALID [2018-11-23 12:05:25,259 INFO L273 TraceCheckUtils]: 30: Hoare triple {2773#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {2773#false} is VALID [2018-11-23 12:05:25,259 INFO L256 TraceCheckUtils]: 31: Hoare triple {2773#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {2773#false} is VALID [2018-11-23 12:05:25,259 INFO L273 TraceCheckUtils]: 32: Hoare triple {2773#false} ~cond := #in~cond; {2773#false} is VALID [2018-11-23 12:05:25,259 INFO L273 TraceCheckUtils]: 33: Hoare triple {2773#false} assume 0 == ~cond; {2773#false} is VALID [2018-11-23 12:05:25,259 INFO L273 TraceCheckUtils]: 34: Hoare triple {2773#false} assume !false; {2773#false} is VALID [2018-11-23 12:05:25,261 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:25,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:25,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 12:05:25,281 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-11-23 12:05:25,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:25,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:05:25,322 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:25,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:05:25,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:05:25,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:05:25,323 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 15 states. [2018-11-23 12:05:25,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:25,468 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-11-23 12:05:25,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:05:25,468 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-11-23 12:05:25,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:25,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:05:25,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2018-11-23 12:05:25,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:05:25,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2018-11-23 12:05:25,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 56 transitions. [2018-11-23 12:05:25,524 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-23 12:05:25,525 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:05:25,526 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 12:05:25,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:05:25,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 12:05:25,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-11-23 12:05:25,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:25,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 42 states. [2018-11-23 12:05:25,562 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 42 states. [2018-11-23 12:05:25,562 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 42 states. [2018-11-23 12:05:25,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:25,563 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-11-23 12:05:25,563 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-11-23 12:05:25,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:25,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:25,563 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 43 states. [2018-11-23 12:05:25,564 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 43 states. [2018-11-23 12:05:25,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:25,564 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-11-23 12:05:25,565 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-11-23 12:05:25,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:25,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:25,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:25,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:25,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:05:25,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-11-23 12:05:25,566 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 35 [2018-11-23 12:05:25,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:25,566 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-23 12:05:25,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:05:25,566 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-23 12:05:25,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 12:05:25,567 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:25,567 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:25,567 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:25,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:25,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1692957222, now seen corresponding path program 12 times [2018-11-23 12:05:25,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:25,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:25,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:25,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:25,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:25,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:25,850 INFO L256 TraceCheckUtils]: 0: Hoare triple {3116#true} call ULTIMATE.init(); {3116#true} is VALID [2018-11-23 12:05:25,851 INFO L273 TraceCheckUtils]: 1: Hoare triple {3116#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3116#true} is VALID [2018-11-23 12:05:25,851 INFO L273 TraceCheckUtils]: 2: Hoare triple {3116#true} assume true; {3116#true} is VALID [2018-11-23 12:05:25,851 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3116#true} {3116#true} #49#return; {3116#true} is VALID [2018-11-23 12:05:25,852 INFO L256 TraceCheckUtils]: 4: Hoare triple {3116#true} call #t~ret5 := main(); {3116#true} is VALID [2018-11-23 12:05:25,852 INFO L273 TraceCheckUtils]: 5: Hoare triple {3116#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {3118#(= main_~i~0 0)} is VALID [2018-11-23 12:05:25,853 INFO L273 TraceCheckUtils]: 6: Hoare triple {3118#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3118#(= main_~i~0 0)} is VALID [2018-11-23 12:05:25,854 INFO L273 TraceCheckUtils]: 7: Hoare triple {3118#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3119#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:25,855 INFO L273 TraceCheckUtils]: 8: Hoare triple {3119#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3119#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:25,855 INFO L273 TraceCheckUtils]: 9: Hoare triple {3119#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3120#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:25,868 INFO L273 TraceCheckUtils]: 10: Hoare triple {3120#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3120#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:25,869 INFO L273 TraceCheckUtils]: 11: Hoare triple {3120#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3121#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:25,869 INFO L273 TraceCheckUtils]: 12: Hoare triple {3121#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3121#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:25,870 INFO L273 TraceCheckUtils]: 13: Hoare triple {3121#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3122#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:25,870 INFO L273 TraceCheckUtils]: 14: Hoare triple {3122#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3122#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:25,871 INFO L273 TraceCheckUtils]: 15: Hoare triple {3122#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3123#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:25,871 INFO L273 TraceCheckUtils]: 16: Hoare triple {3123#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3123#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:25,872 INFO L273 TraceCheckUtils]: 17: Hoare triple {3123#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3124#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:25,873 INFO L273 TraceCheckUtils]: 18: Hoare triple {3124#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3124#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:25,874 INFO L273 TraceCheckUtils]: 19: Hoare triple {3124#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3125#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:25,874 INFO L273 TraceCheckUtils]: 20: Hoare triple {3125#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3125#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:25,875 INFO L273 TraceCheckUtils]: 21: Hoare triple {3125#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3126#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:25,876 INFO L273 TraceCheckUtils]: 22: Hoare triple {3126#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3126#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:25,877 INFO L273 TraceCheckUtils]: 23: Hoare triple {3126#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3127#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:25,877 INFO L273 TraceCheckUtils]: 24: Hoare triple {3127#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3127#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:25,878 INFO L273 TraceCheckUtils]: 25: Hoare triple {3127#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3128#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:25,879 INFO L273 TraceCheckUtils]: 26: Hoare triple {3128#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3128#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:25,880 INFO L273 TraceCheckUtils]: 27: Hoare triple {3128#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3129#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:25,880 INFO L273 TraceCheckUtils]: 28: Hoare triple {3129#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3129#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:25,881 INFO L273 TraceCheckUtils]: 29: Hoare triple {3129#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3130#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:25,882 INFO L273 TraceCheckUtils]: 30: Hoare triple {3130#(<= main_~i~0 12)} assume !(~i~0 < 50000); {3117#false} is VALID [2018-11-23 12:05:25,882 INFO L273 TraceCheckUtils]: 31: Hoare triple {3117#false} havoc ~x~0;~x~0 := 0; {3117#false} is VALID [2018-11-23 12:05:25,883 INFO L273 TraceCheckUtils]: 32: Hoare triple {3117#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {3117#false} is VALID [2018-11-23 12:05:25,883 INFO L256 TraceCheckUtils]: 33: Hoare triple {3117#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {3117#false} is VALID [2018-11-23 12:05:25,883 INFO L273 TraceCheckUtils]: 34: Hoare triple {3117#false} ~cond := #in~cond; {3117#false} is VALID [2018-11-23 12:05:25,884 INFO L273 TraceCheckUtils]: 35: Hoare triple {3117#false} assume 0 == ~cond; {3117#false} is VALID [2018-11-23 12:05:25,884 INFO L273 TraceCheckUtils]: 36: Hoare triple {3117#false} assume !false; {3117#false} is VALID [2018-11-23 12:05:25,886 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:25,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:25,886 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-23 12:05:25,900 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:05:26,112 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 12:05:26,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:26,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:26,259 INFO L256 TraceCheckUtils]: 0: Hoare triple {3116#true} call ULTIMATE.init(); {3116#true} is VALID [2018-11-23 12:05:26,259 INFO L273 TraceCheckUtils]: 1: Hoare triple {3116#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3116#true} is VALID [2018-11-23 12:05:26,259 INFO L273 TraceCheckUtils]: 2: Hoare triple {3116#true} assume true; {3116#true} is VALID [2018-11-23 12:05:26,259 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3116#true} {3116#true} #49#return; {3116#true} is VALID [2018-11-23 12:05:26,259 INFO L256 TraceCheckUtils]: 4: Hoare triple {3116#true} call #t~ret5 := main(); {3116#true} is VALID [2018-11-23 12:05:26,260 INFO L273 TraceCheckUtils]: 5: Hoare triple {3116#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {3149#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:26,260 INFO L273 TraceCheckUtils]: 6: Hoare triple {3149#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3149#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:26,261 INFO L273 TraceCheckUtils]: 7: Hoare triple {3149#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3119#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:26,261 INFO L273 TraceCheckUtils]: 8: Hoare triple {3119#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3119#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:26,262 INFO L273 TraceCheckUtils]: 9: Hoare triple {3119#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3120#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:26,262 INFO L273 TraceCheckUtils]: 10: Hoare triple {3120#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3120#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:26,262 INFO L273 TraceCheckUtils]: 11: Hoare triple {3120#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3121#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:26,263 INFO L273 TraceCheckUtils]: 12: Hoare triple {3121#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3121#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:26,263 INFO L273 TraceCheckUtils]: 13: Hoare triple {3121#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3122#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:26,263 INFO L273 TraceCheckUtils]: 14: Hoare triple {3122#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3122#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:26,264 INFO L273 TraceCheckUtils]: 15: Hoare triple {3122#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3123#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:26,265 INFO L273 TraceCheckUtils]: 16: Hoare triple {3123#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3123#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:26,265 INFO L273 TraceCheckUtils]: 17: Hoare triple {3123#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3124#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:26,266 INFO L273 TraceCheckUtils]: 18: Hoare triple {3124#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3124#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:26,267 INFO L273 TraceCheckUtils]: 19: Hoare triple {3124#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3125#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:26,267 INFO L273 TraceCheckUtils]: 20: Hoare triple {3125#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3125#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:26,268 INFO L273 TraceCheckUtils]: 21: Hoare triple {3125#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3126#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:26,269 INFO L273 TraceCheckUtils]: 22: Hoare triple {3126#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3126#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:26,269 INFO L273 TraceCheckUtils]: 23: Hoare triple {3126#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3127#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:26,270 INFO L273 TraceCheckUtils]: 24: Hoare triple {3127#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3127#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:26,271 INFO L273 TraceCheckUtils]: 25: Hoare triple {3127#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3128#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:26,271 INFO L273 TraceCheckUtils]: 26: Hoare triple {3128#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3128#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:26,276 INFO L273 TraceCheckUtils]: 27: Hoare triple {3128#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3129#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:26,276 INFO L273 TraceCheckUtils]: 28: Hoare triple {3129#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3129#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:26,277 INFO L273 TraceCheckUtils]: 29: Hoare triple {3129#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3130#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:26,277 INFO L273 TraceCheckUtils]: 30: Hoare triple {3130#(<= main_~i~0 12)} assume !(~i~0 < 50000); {3117#false} is VALID [2018-11-23 12:05:26,277 INFO L273 TraceCheckUtils]: 31: Hoare triple {3117#false} havoc ~x~0;~x~0 := 0; {3117#false} is VALID [2018-11-23 12:05:26,277 INFO L273 TraceCheckUtils]: 32: Hoare triple {3117#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {3117#false} is VALID [2018-11-23 12:05:26,277 INFO L256 TraceCheckUtils]: 33: Hoare triple {3117#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {3117#false} is VALID [2018-11-23 12:05:26,278 INFO L273 TraceCheckUtils]: 34: Hoare triple {3117#false} ~cond := #in~cond; {3117#false} is VALID [2018-11-23 12:05:26,278 INFO L273 TraceCheckUtils]: 35: Hoare triple {3117#false} assume 0 == ~cond; {3117#false} is VALID [2018-11-23 12:05:26,278 INFO L273 TraceCheckUtils]: 36: Hoare triple {3117#false} assume !false; {3117#false} is VALID [2018-11-23 12:05:26,279 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:26,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:26,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 12:05:26,300 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2018-11-23 12:05:26,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:26,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 12:05:26,386 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:26,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 12:05:26,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 12:05:26,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:05:26,387 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 16 states. [2018-11-23 12:05:26,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:26,680 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-11-23 12:05:26,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:05:26,681 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2018-11-23 12:05:26,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:26,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:05:26,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 58 transitions. [2018-11-23 12:05:26,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:05:26,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 58 transitions. [2018-11-23 12:05:26,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 58 transitions. [2018-11-23 12:05:26,769 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:26,769 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:05:26,770 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 12:05:26,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 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-23 12:05:26,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 12:05:26,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-23 12:05:26,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:26,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 44 states. [2018-11-23 12:05:26,822 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 44 states. [2018-11-23 12:05:26,822 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 44 states. [2018-11-23 12:05:26,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:26,823 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-11-23 12:05:26,823 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-23 12:05:26,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:26,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:26,824 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 45 states. [2018-11-23 12:05:26,824 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 45 states. [2018-11-23 12:05:26,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:26,825 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-11-23 12:05:26,825 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-23 12:05:26,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:26,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:26,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:26,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:26,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:05:26,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-11-23 12:05:26,827 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 37 [2018-11-23 12:05:26,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:26,827 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-11-23 12:05:26,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 12:05:26,827 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-11-23 12:05:26,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 12:05:26,828 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:26,828 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:26,828 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:26,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:26,829 INFO L82 PathProgramCache]: Analyzing trace with hash 890666232, now seen corresponding path program 13 times [2018-11-23 12:05:26,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:26,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:26,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:26,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:26,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:27,282 INFO L256 TraceCheckUtils]: 0: Hoare triple {3477#true} call ULTIMATE.init(); {3477#true} is VALID [2018-11-23 12:05:27,282 INFO L273 TraceCheckUtils]: 1: Hoare triple {3477#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3477#true} is VALID [2018-11-23 12:05:27,282 INFO L273 TraceCheckUtils]: 2: Hoare triple {3477#true} assume true; {3477#true} is VALID [2018-11-23 12:05:27,283 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3477#true} {3477#true} #49#return; {3477#true} is VALID [2018-11-23 12:05:27,283 INFO L256 TraceCheckUtils]: 4: Hoare triple {3477#true} call #t~ret5 := main(); {3477#true} is VALID [2018-11-23 12:05:27,284 INFO L273 TraceCheckUtils]: 5: Hoare triple {3477#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {3479#(= main_~i~0 0)} is VALID [2018-11-23 12:05:27,284 INFO L273 TraceCheckUtils]: 6: Hoare triple {3479#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3479#(= main_~i~0 0)} is VALID [2018-11-23 12:05:27,285 INFO L273 TraceCheckUtils]: 7: Hoare triple {3479#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3480#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:27,285 INFO L273 TraceCheckUtils]: 8: Hoare triple {3480#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3480#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:27,286 INFO L273 TraceCheckUtils]: 9: Hoare triple {3480#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3481#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:27,286 INFO L273 TraceCheckUtils]: 10: Hoare triple {3481#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3481#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:27,306 INFO L273 TraceCheckUtils]: 11: Hoare triple {3481#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3482#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:27,311 INFO L273 TraceCheckUtils]: 12: Hoare triple {3482#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3482#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:27,312 INFO L273 TraceCheckUtils]: 13: Hoare triple {3482#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3483#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:27,312 INFO L273 TraceCheckUtils]: 14: Hoare triple {3483#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3483#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:27,313 INFO L273 TraceCheckUtils]: 15: Hoare triple {3483#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3484#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:27,313 INFO L273 TraceCheckUtils]: 16: Hoare triple {3484#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3484#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:27,313 INFO L273 TraceCheckUtils]: 17: Hoare triple {3484#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3485#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:27,314 INFO L273 TraceCheckUtils]: 18: Hoare triple {3485#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3485#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:27,315 INFO L273 TraceCheckUtils]: 19: Hoare triple {3485#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3486#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:27,315 INFO L273 TraceCheckUtils]: 20: Hoare triple {3486#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3486#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:27,316 INFO L273 TraceCheckUtils]: 21: Hoare triple {3486#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3487#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:27,317 INFO L273 TraceCheckUtils]: 22: Hoare triple {3487#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3487#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:27,317 INFO L273 TraceCheckUtils]: 23: Hoare triple {3487#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3488#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:27,318 INFO L273 TraceCheckUtils]: 24: Hoare triple {3488#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3488#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:27,319 INFO L273 TraceCheckUtils]: 25: Hoare triple {3488#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3489#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:27,319 INFO L273 TraceCheckUtils]: 26: Hoare triple {3489#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3489#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:27,320 INFO L273 TraceCheckUtils]: 27: Hoare triple {3489#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3490#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:27,321 INFO L273 TraceCheckUtils]: 28: Hoare triple {3490#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3490#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:27,321 INFO L273 TraceCheckUtils]: 29: Hoare triple {3490#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3491#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:27,322 INFO L273 TraceCheckUtils]: 30: Hoare triple {3491#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3491#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:27,323 INFO L273 TraceCheckUtils]: 31: Hoare triple {3491#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3492#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:27,323 INFO L273 TraceCheckUtils]: 32: Hoare triple {3492#(<= main_~i~0 13)} assume !(~i~0 < 50000); {3478#false} is VALID [2018-11-23 12:05:27,324 INFO L273 TraceCheckUtils]: 33: Hoare triple {3478#false} havoc ~x~0;~x~0 := 0; {3478#false} is VALID [2018-11-23 12:05:27,324 INFO L273 TraceCheckUtils]: 34: Hoare triple {3478#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {3478#false} is VALID [2018-11-23 12:05:27,324 INFO L256 TraceCheckUtils]: 35: Hoare triple {3478#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {3478#false} is VALID [2018-11-23 12:05:27,324 INFO L273 TraceCheckUtils]: 36: Hoare triple {3478#false} ~cond := #in~cond; {3478#false} is VALID [2018-11-23 12:05:27,325 INFO L273 TraceCheckUtils]: 37: Hoare triple {3478#false} assume 0 == ~cond; {3478#false} is VALID [2018-11-23 12:05:27,325 INFO L273 TraceCheckUtils]: 38: Hoare triple {3478#false} assume !false; {3478#false} is VALID [2018-11-23 12:05:27,327 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:27,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:27,327 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-23 12:05:27,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:27,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:27,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:27,574 INFO L256 TraceCheckUtils]: 0: Hoare triple {3477#true} call ULTIMATE.init(); {3477#true} is VALID [2018-11-23 12:05:27,575 INFO L273 TraceCheckUtils]: 1: Hoare triple {3477#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3477#true} is VALID [2018-11-23 12:05:27,575 INFO L273 TraceCheckUtils]: 2: Hoare triple {3477#true} assume true; {3477#true} is VALID [2018-11-23 12:05:27,576 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3477#true} {3477#true} #49#return; {3477#true} is VALID [2018-11-23 12:05:27,576 INFO L256 TraceCheckUtils]: 4: Hoare triple {3477#true} call #t~ret5 := main(); {3477#true} is VALID [2018-11-23 12:05:27,577 INFO L273 TraceCheckUtils]: 5: Hoare triple {3477#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {3511#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:27,577 INFO L273 TraceCheckUtils]: 6: Hoare triple {3511#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3511#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:27,578 INFO L273 TraceCheckUtils]: 7: Hoare triple {3511#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3480#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:27,578 INFO L273 TraceCheckUtils]: 8: Hoare triple {3480#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3480#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:27,578 INFO L273 TraceCheckUtils]: 9: Hoare triple {3480#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3481#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:27,579 INFO L273 TraceCheckUtils]: 10: Hoare triple {3481#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3481#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:27,580 INFO L273 TraceCheckUtils]: 11: Hoare triple {3481#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3482#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:27,580 INFO L273 TraceCheckUtils]: 12: Hoare triple {3482#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3482#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:27,581 INFO L273 TraceCheckUtils]: 13: Hoare triple {3482#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3483#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:27,582 INFO L273 TraceCheckUtils]: 14: Hoare triple {3483#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3483#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:27,583 INFO L273 TraceCheckUtils]: 15: Hoare triple {3483#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3484#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:27,583 INFO L273 TraceCheckUtils]: 16: Hoare triple {3484#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3484#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:27,584 INFO L273 TraceCheckUtils]: 17: Hoare triple {3484#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3485#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:27,585 INFO L273 TraceCheckUtils]: 18: Hoare triple {3485#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3485#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:27,588 INFO L273 TraceCheckUtils]: 19: Hoare triple {3485#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3486#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:27,588 INFO L273 TraceCheckUtils]: 20: Hoare triple {3486#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3486#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:27,589 INFO L273 TraceCheckUtils]: 21: Hoare triple {3486#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3487#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:27,589 INFO L273 TraceCheckUtils]: 22: Hoare triple {3487#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3487#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:27,590 INFO L273 TraceCheckUtils]: 23: Hoare triple {3487#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3488#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:27,590 INFO L273 TraceCheckUtils]: 24: Hoare triple {3488#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3488#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:27,591 INFO L273 TraceCheckUtils]: 25: Hoare triple {3488#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3489#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:27,591 INFO L273 TraceCheckUtils]: 26: Hoare triple {3489#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3489#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:27,592 INFO L273 TraceCheckUtils]: 27: Hoare triple {3489#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3490#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:27,593 INFO L273 TraceCheckUtils]: 28: Hoare triple {3490#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3490#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:27,594 INFO L273 TraceCheckUtils]: 29: Hoare triple {3490#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3491#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:27,594 INFO L273 TraceCheckUtils]: 30: Hoare triple {3491#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3491#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:27,595 INFO L273 TraceCheckUtils]: 31: Hoare triple {3491#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3492#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:27,596 INFO L273 TraceCheckUtils]: 32: Hoare triple {3492#(<= main_~i~0 13)} assume !(~i~0 < 50000); {3478#false} is VALID [2018-11-23 12:05:27,596 INFO L273 TraceCheckUtils]: 33: Hoare triple {3478#false} havoc ~x~0;~x~0 := 0; {3478#false} is VALID [2018-11-23 12:05:27,597 INFO L273 TraceCheckUtils]: 34: Hoare triple {3478#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {3478#false} is VALID [2018-11-23 12:05:27,597 INFO L256 TraceCheckUtils]: 35: Hoare triple {3478#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {3478#false} is VALID [2018-11-23 12:05:27,597 INFO L273 TraceCheckUtils]: 36: Hoare triple {3478#false} ~cond := #in~cond; {3478#false} is VALID [2018-11-23 12:05:27,597 INFO L273 TraceCheckUtils]: 37: Hoare triple {3478#false} assume 0 == ~cond; {3478#false} is VALID [2018-11-23 12:05:27,598 INFO L273 TraceCheckUtils]: 38: Hoare triple {3478#false} assume !false; {3478#false} is VALID [2018-11-23 12:05:27,600 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:27,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:27,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:05:27,621 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2018-11-23 12:05:27,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:27,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:05:27,668 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:27,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:05:27,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:05:27,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:05:27,670 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 17 states. [2018-11-23 12:05:27,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:27,898 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-11-23 12:05:27,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:05:27,898 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2018-11-23 12:05:27,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:27,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:05:27,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 60 transitions. [2018-11-23 12:05:27,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:05:27,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 60 transitions. [2018-11-23 12:05:27,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 60 transitions. [2018-11-23 12:05:28,030 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-23 12:05:28,032 INFO L225 Difference]: With dead ends: 58 [2018-11-23 12:05:28,032 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 12:05:28,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:05:28,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 12:05:28,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-11-23 12:05:28,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:28,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 46 states. [2018-11-23 12:05:28,055 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 46 states. [2018-11-23 12:05:28,055 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 46 states. [2018-11-23 12:05:28,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:28,056 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-11-23 12:05:28,057 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-11-23 12:05:28,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:28,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:28,057 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 47 states. [2018-11-23 12:05:28,057 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 47 states. [2018-11-23 12:05:28,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:28,059 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-11-23 12:05:28,059 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-11-23 12:05:28,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:28,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:28,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:28,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:28,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:05:28,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-11-23 12:05:28,061 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 39 [2018-11-23 12:05:28,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:28,062 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-11-23 12:05:28,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:05:28,062 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-11-23 12:05:28,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 12:05:28,062 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:28,063 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:28,063 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:28,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:28,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1261708438, now seen corresponding path program 14 times [2018-11-23 12:05:28,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:28,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:28,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:28,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:28,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:29,136 INFO L256 TraceCheckUtils]: 0: Hoare triple {3855#true} call ULTIMATE.init(); {3855#true} is VALID [2018-11-23 12:05:29,137 INFO L273 TraceCheckUtils]: 1: Hoare triple {3855#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3855#true} is VALID [2018-11-23 12:05:29,137 INFO L273 TraceCheckUtils]: 2: Hoare triple {3855#true} assume true; {3855#true} is VALID [2018-11-23 12:05:29,137 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3855#true} {3855#true} #49#return; {3855#true} is VALID [2018-11-23 12:05:29,138 INFO L256 TraceCheckUtils]: 4: Hoare triple {3855#true} call #t~ret5 := main(); {3855#true} is VALID [2018-11-23 12:05:29,138 INFO L273 TraceCheckUtils]: 5: Hoare triple {3855#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {3857#(= main_~i~0 0)} is VALID [2018-11-23 12:05:29,139 INFO L273 TraceCheckUtils]: 6: Hoare triple {3857#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3857#(= main_~i~0 0)} is VALID [2018-11-23 12:05:29,140 INFO L273 TraceCheckUtils]: 7: Hoare triple {3857#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3858#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:29,140 INFO L273 TraceCheckUtils]: 8: Hoare triple {3858#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3858#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:29,140 INFO L273 TraceCheckUtils]: 9: Hoare triple {3858#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3859#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:29,141 INFO L273 TraceCheckUtils]: 10: Hoare triple {3859#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3859#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:29,142 INFO L273 TraceCheckUtils]: 11: Hoare triple {3859#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3860#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:29,142 INFO L273 TraceCheckUtils]: 12: Hoare triple {3860#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3860#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:29,143 INFO L273 TraceCheckUtils]: 13: Hoare triple {3860#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3861#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:29,144 INFO L273 TraceCheckUtils]: 14: Hoare triple {3861#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3861#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:29,145 INFO L273 TraceCheckUtils]: 15: Hoare triple {3861#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3862#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:29,145 INFO L273 TraceCheckUtils]: 16: Hoare triple {3862#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3862#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:29,146 INFO L273 TraceCheckUtils]: 17: Hoare triple {3862#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3863#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:29,147 INFO L273 TraceCheckUtils]: 18: Hoare triple {3863#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3863#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:29,148 INFO L273 TraceCheckUtils]: 19: Hoare triple {3863#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3864#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:29,149 INFO L273 TraceCheckUtils]: 20: Hoare triple {3864#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3864#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:29,149 INFO L273 TraceCheckUtils]: 21: Hoare triple {3864#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3865#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:29,150 INFO L273 TraceCheckUtils]: 22: Hoare triple {3865#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3865#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:29,151 INFO L273 TraceCheckUtils]: 23: Hoare triple {3865#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3866#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:29,152 INFO L273 TraceCheckUtils]: 24: Hoare triple {3866#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3866#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:29,170 INFO L273 TraceCheckUtils]: 25: Hoare triple {3866#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3867#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:29,171 INFO L273 TraceCheckUtils]: 26: Hoare triple {3867#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3867#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:29,171 INFO L273 TraceCheckUtils]: 27: Hoare triple {3867#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3868#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:29,172 INFO L273 TraceCheckUtils]: 28: Hoare triple {3868#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3868#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:29,172 INFO L273 TraceCheckUtils]: 29: Hoare triple {3868#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3869#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:29,172 INFO L273 TraceCheckUtils]: 30: Hoare triple {3869#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3869#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:29,173 INFO L273 TraceCheckUtils]: 31: Hoare triple {3869#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3870#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:29,173 INFO L273 TraceCheckUtils]: 32: Hoare triple {3870#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3870#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:29,174 INFO L273 TraceCheckUtils]: 33: Hoare triple {3870#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3871#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:29,174 INFO L273 TraceCheckUtils]: 34: Hoare triple {3871#(<= main_~i~0 14)} assume !(~i~0 < 50000); {3856#false} is VALID [2018-11-23 12:05:29,174 INFO L273 TraceCheckUtils]: 35: Hoare triple {3856#false} havoc ~x~0;~x~0 := 0; {3856#false} is VALID [2018-11-23 12:05:29,174 INFO L273 TraceCheckUtils]: 36: Hoare triple {3856#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {3856#false} is VALID [2018-11-23 12:05:29,175 INFO L256 TraceCheckUtils]: 37: Hoare triple {3856#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {3856#false} is VALID [2018-11-23 12:05:29,175 INFO L273 TraceCheckUtils]: 38: Hoare triple {3856#false} ~cond := #in~cond; {3856#false} is VALID [2018-11-23 12:05:29,175 INFO L273 TraceCheckUtils]: 39: Hoare triple {3856#false} assume 0 == ~cond; {3856#false} is VALID [2018-11-23 12:05:29,175 INFO L273 TraceCheckUtils]: 40: Hoare triple {3856#false} assume !false; {3856#false} is VALID [2018-11-23 12:05:29,177 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:29,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:29,178 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-23 12:05:29,188 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:05:29,214 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:05:29,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:29,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:29,347 INFO L256 TraceCheckUtils]: 0: Hoare triple {3855#true} call ULTIMATE.init(); {3855#true} is VALID [2018-11-23 12:05:29,347 INFO L273 TraceCheckUtils]: 1: Hoare triple {3855#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3855#true} is VALID [2018-11-23 12:05:29,348 INFO L273 TraceCheckUtils]: 2: Hoare triple {3855#true} assume true; {3855#true} is VALID [2018-11-23 12:05:29,348 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3855#true} {3855#true} #49#return; {3855#true} is VALID [2018-11-23 12:05:29,348 INFO L256 TraceCheckUtils]: 4: Hoare triple {3855#true} call #t~ret5 := main(); {3855#true} is VALID [2018-11-23 12:05:29,349 INFO L273 TraceCheckUtils]: 5: Hoare triple {3855#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {3890#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:29,349 INFO L273 TraceCheckUtils]: 6: Hoare triple {3890#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3890#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:29,350 INFO L273 TraceCheckUtils]: 7: Hoare triple {3890#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3858#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:29,369 INFO L273 TraceCheckUtils]: 8: Hoare triple {3858#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3858#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:29,384 INFO L273 TraceCheckUtils]: 9: Hoare triple {3858#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3859#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:29,400 INFO L273 TraceCheckUtils]: 10: Hoare triple {3859#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3859#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:29,409 INFO L273 TraceCheckUtils]: 11: Hoare triple {3859#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3860#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:29,423 INFO L273 TraceCheckUtils]: 12: Hoare triple {3860#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3860#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:29,432 INFO L273 TraceCheckUtils]: 13: Hoare triple {3860#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3861#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:29,448 INFO L273 TraceCheckUtils]: 14: Hoare triple {3861#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3861#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:29,457 INFO L273 TraceCheckUtils]: 15: Hoare triple {3861#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3862#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:29,461 INFO L273 TraceCheckUtils]: 16: Hoare triple {3862#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3862#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:29,463 INFO L273 TraceCheckUtils]: 17: Hoare triple {3862#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3863#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:29,463 INFO L273 TraceCheckUtils]: 18: Hoare triple {3863#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3863#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:29,465 INFO L273 TraceCheckUtils]: 19: Hoare triple {3863#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3864#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:29,465 INFO L273 TraceCheckUtils]: 20: Hoare triple {3864#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3864#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:29,467 INFO L273 TraceCheckUtils]: 21: Hoare triple {3864#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3865#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:29,467 INFO L273 TraceCheckUtils]: 22: Hoare triple {3865#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3865#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:29,469 INFO L273 TraceCheckUtils]: 23: Hoare triple {3865#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3866#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:29,469 INFO L273 TraceCheckUtils]: 24: Hoare triple {3866#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3866#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:29,469 INFO L273 TraceCheckUtils]: 25: Hoare triple {3866#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3867#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:29,470 INFO L273 TraceCheckUtils]: 26: Hoare triple {3867#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3867#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:29,470 INFO L273 TraceCheckUtils]: 27: Hoare triple {3867#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3868#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:29,471 INFO L273 TraceCheckUtils]: 28: Hoare triple {3868#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3868#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:29,471 INFO L273 TraceCheckUtils]: 29: Hoare triple {3868#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3869#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:29,471 INFO L273 TraceCheckUtils]: 30: Hoare triple {3869#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3869#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:29,472 INFO L273 TraceCheckUtils]: 31: Hoare triple {3869#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3870#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:29,472 INFO L273 TraceCheckUtils]: 32: Hoare triple {3870#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3870#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:29,473 INFO L273 TraceCheckUtils]: 33: Hoare triple {3870#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3871#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:29,473 INFO L273 TraceCheckUtils]: 34: Hoare triple {3871#(<= main_~i~0 14)} assume !(~i~0 < 50000); {3856#false} is VALID [2018-11-23 12:05:29,473 INFO L273 TraceCheckUtils]: 35: Hoare triple {3856#false} havoc ~x~0;~x~0 := 0; {3856#false} is VALID [2018-11-23 12:05:29,474 INFO L273 TraceCheckUtils]: 36: Hoare triple {3856#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {3856#false} is VALID [2018-11-23 12:05:29,474 INFO L256 TraceCheckUtils]: 37: Hoare triple {3856#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {3856#false} is VALID [2018-11-23 12:05:29,474 INFO L273 TraceCheckUtils]: 38: Hoare triple {3856#false} ~cond := #in~cond; {3856#false} is VALID [2018-11-23 12:05:29,474 INFO L273 TraceCheckUtils]: 39: Hoare triple {3856#false} assume 0 == ~cond; {3856#false} is VALID [2018-11-23 12:05:29,474 INFO L273 TraceCheckUtils]: 40: Hoare triple {3856#false} assume !false; {3856#false} is VALID [2018-11-23 12:05:29,476 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:29,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:29,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:05:29,497 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2018-11-23 12:05:29,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:29,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:05:29,539 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-23 12:05:29,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:05:29,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:05:29,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:05:29,540 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 18 states. [2018-11-23 12:05:29,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:29,832 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-11-23 12:05:29,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:05:29,832 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2018-11-23 12:05:29,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:29,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:05:29,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 62 transitions. [2018-11-23 12:05:29,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:05:29,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 62 transitions. [2018-11-23 12:05:29,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 62 transitions. [2018-11-23 12:05:29,893 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:29,895 INFO L225 Difference]: With dead ends: 60 [2018-11-23 12:05:29,895 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 12:05:29,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:05:29,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 12:05:29,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-11-23 12:05:29,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:29,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 48 states. [2018-11-23 12:05:29,920 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 48 states. [2018-11-23 12:05:29,920 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 48 states. [2018-11-23 12:05:29,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:29,922 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-11-23 12:05:29,922 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-11-23 12:05:29,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:29,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:29,923 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 49 states. [2018-11-23 12:05:29,923 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 49 states. [2018-11-23 12:05:29,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:29,924 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-11-23 12:05:29,925 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-11-23 12:05:29,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:29,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:29,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:29,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:29,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:05:29,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-11-23 12:05:29,927 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 41 [2018-11-23 12:05:29,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:29,927 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-11-23 12:05:29,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:05:29,927 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-23 12:05:29,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 12:05:29,928 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:29,928 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:29,928 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:29,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:29,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1350982836, now seen corresponding path program 15 times [2018-11-23 12:05:29,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:29,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:29,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:29,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:29,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:29,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:30,593 INFO L256 TraceCheckUtils]: 0: Hoare triple {4250#true} call ULTIMATE.init(); {4250#true} is VALID [2018-11-23 12:05:30,594 INFO L273 TraceCheckUtils]: 1: Hoare triple {4250#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4250#true} is VALID [2018-11-23 12:05:30,594 INFO L273 TraceCheckUtils]: 2: Hoare triple {4250#true} assume true; {4250#true} is VALID [2018-11-23 12:05:30,594 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4250#true} {4250#true} #49#return; {4250#true} is VALID [2018-11-23 12:05:30,594 INFO L256 TraceCheckUtils]: 4: Hoare triple {4250#true} call #t~ret5 := main(); {4250#true} is VALID [2018-11-23 12:05:30,595 INFO L273 TraceCheckUtils]: 5: Hoare triple {4250#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {4252#(= main_~i~0 0)} is VALID [2018-11-23 12:05:30,595 INFO L273 TraceCheckUtils]: 6: Hoare triple {4252#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4252#(= main_~i~0 0)} is VALID [2018-11-23 12:05:30,595 INFO L273 TraceCheckUtils]: 7: Hoare triple {4252#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4253#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:30,596 INFO L273 TraceCheckUtils]: 8: Hoare triple {4253#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4253#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:30,596 INFO L273 TraceCheckUtils]: 9: Hoare triple {4253#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4254#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:30,597 INFO L273 TraceCheckUtils]: 10: Hoare triple {4254#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4254#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:30,597 INFO L273 TraceCheckUtils]: 11: Hoare triple {4254#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4255#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:30,597 INFO L273 TraceCheckUtils]: 12: Hoare triple {4255#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4255#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:30,598 INFO L273 TraceCheckUtils]: 13: Hoare triple {4255#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4256#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:30,598 INFO L273 TraceCheckUtils]: 14: Hoare triple {4256#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4256#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:30,599 INFO L273 TraceCheckUtils]: 15: Hoare triple {4256#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4257#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:30,600 INFO L273 TraceCheckUtils]: 16: Hoare triple {4257#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4257#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:30,600 INFO L273 TraceCheckUtils]: 17: Hoare triple {4257#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4258#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:30,601 INFO L273 TraceCheckUtils]: 18: Hoare triple {4258#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4258#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:30,602 INFO L273 TraceCheckUtils]: 19: Hoare triple {4258#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4259#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:30,602 INFO L273 TraceCheckUtils]: 20: Hoare triple {4259#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4259#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:30,603 INFO L273 TraceCheckUtils]: 21: Hoare triple {4259#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4260#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:30,604 INFO L273 TraceCheckUtils]: 22: Hoare triple {4260#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4260#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:30,604 INFO L273 TraceCheckUtils]: 23: Hoare triple {4260#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4261#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:30,605 INFO L273 TraceCheckUtils]: 24: Hoare triple {4261#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4261#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:30,606 INFO L273 TraceCheckUtils]: 25: Hoare triple {4261#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4262#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:30,606 INFO L273 TraceCheckUtils]: 26: Hoare triple {4262#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4262#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:30,607 INFO L273 TraceCheckUtils]: 27: Hoare triple {4262#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4263#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:30,607 INFO L273 TraceCheckUtils]: 28: Hoare triple {4263#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4263#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:30,608 INFO L273 TraceCheckUtils]: 29: Hoare triple {4263#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4264#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:30,609 INFO L273 TraceCheckUtils]: 30: Hoare triple {4264#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4264#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:30,610 INFO L273 TraceCheckUtils]: 31: Hoare triple {4264#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4265#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:30,610 INFO L273 TraceCheckUtils]: 32: Hoare triple {4265#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4265#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:30,611 INFO L273 TraceCheckUtils]: 33: Hoare triple {4265#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4266#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:30,611 INFO L273 TraceCheckUtils]: 34: Hoare triple {4266#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4266#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:30,612 INFO L273 TraceCheckUtils]: 35: Hoare triple {4266#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4267#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:30,613 INFO L273 TraceCheckUtils]: 36: Hoare triple {4267#(<= main_~i~0 15)} assume !(~i~0 < 50000); {4251#false} is VALID [2018-11-23 12:05:30,613 INFO L273 TraceCheckUtils]: 37: Hoare triple {4251#false} havoc ~x~0;~x~0 := 0; {4251#false} is VALID [2018-11-23 12:05:30,613 INFO L273 TraceCheckUtils]: 38: Hoare triple {4251#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {4251#false} is VALID [2018-11-23 12:05:30,614 INFO L256 TraceCheckUtils]: 39: Hoare triple {4251#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {4251#false} is VALID [2018-11-23 12:05:30,614 INFO L273 TraceCheckUtils]: 40: Hoare triple {4251#false} ~cond := #in~cond; {4251#false} is VALID [2018-11-23 12:05:30,614 INFO L273 TraceCheckUtils]: 41: Hoare triple {4251#false} assume 0 == ~cond; {4251#false} is VALID [2018-11-23 12:05:30,614 INFO L273 TraceCheckUtils]: 42: Hoare triple {4251#false} assume !false; {4251#false} is VALID [2018-11-23 12:05:30,617 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:30,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:30,617 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-23 12:05:30,625 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:05:31,161 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-23 12:05:31,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:31,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:31,346 INFO L256 TraceCheckUtils]: 0: Hoare triple {4250#true} call ULTIMATE.init(); {4250#true} is VALID [2018-11-23 12:05:31,346 INFO L273 TraceCheckUtils]: 1: Hoare triple {4250#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4250#true} is VALID [2018-11-23 12:05:31,346 INFO L273 TraceCheckUtils]: 2: Hoare triple {4250#true} assume true; {4250#true} is VALID [2018-11-23 12:05:31,347 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4250#true} {4250#true} #49#return; {4250#true} is VALID [2018-11-23 12:05:31,347 INFO L256 TraceCheckUtils]: 4: Hoare triple {4250#true} call #t~ret5 := main(); {4250#true} is VALID [2018-11-23 12:05:31,348 INFO L273 TraceCheckUtils]: 5: Hoare triple {4250#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {4286#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:31,348 INFO L273 TraceCheckUtils]: 6: Hoare triple {4286#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4286#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:31,348 INFO L273 TraceCheckUtils]: 7: Hoare triple {4286#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4253#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:31,349 INFO L273 TraceCheckUtils]: 8: Hoare triple {4253#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4253#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:31,349 INFO L273 TraceCheckUtils]: 9: Hoare triple {4253#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4254#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:31,350 INFO L273 TraceCheckUtils]: 10: Hoare triple {4254#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4254#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:31,350 INFO L273 TraceCheckUtils]: 11: Hoare triple {4254#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4255#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:31,350 INFO L273 TraceCheckUtils]: 12: Hoare triple {4255#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4255#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:31,351 INFO L273 TraceCheckUtils]: 13: Hoare triple {4255#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4256#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:31,352 INFO L273 TraceCheckUtils]: 14: Hoare triple {4256#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4256#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:31,352 INFO L273 TraceCheckUtils]: 15: Hoare triple {4256#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4257#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:31,353 INFO L273 TraceCheckUtils]: 16: Hoare triple {4257#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4257#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:31,354 INFO L273 TraceCheckUtils]: 17: Hoare triple {4257#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4258#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:31,354 INFO L273 TraceCheckUtils]: 18: Hoare triple {4258#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4258#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:31,355 INFO L273 TraceCheckUtils]: 19: Hoare triple {4258#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4259#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:31,356 INFO L273 TraceCheckUtils]: 20: Hoare triple {4259#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4259#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:31,356 INFO L273 TraceCheckUtils]: 21: Hoare triple {4259#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4260#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:31,357 INFO L273 TraceCheckUtils]: 22: Hoare triple {4260#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4260#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:31,358 INFO L273 TraceCheckUtils]: 23: Hoare triple {4260#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4261#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:31,358 INFO L273 TraceCheckUtils]: 24: Hoare triple {4261#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4261#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:31,359 INFO L273 TraceCheckUtils]: 25: Hoare triple {4261#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4262#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:31,360 INFO L273 TraceCheckUtils]: 26: Hoare triple {4262#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4262#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:31,360 INFO L273 TraceCheckUtils]: 27: Hoare triple {4262#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4263#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:31,361 INFO L273 TraceCheckUtils]: 28: Hoare triple {4263#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4263#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:31,362 INFO L273 TraceCheckUtils]: 29: Hoare triple {4263#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4264#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:31,362 INFO L273 TraceCheckUtils]: 30: Hoare triple {4264#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4264#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:31,363 INFO L273 TraceCheckUtils]: 31: Hoare triple {4264#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4265#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:31,364 INFO L273 TraceCheckUtils]: 32: Hoare triple {4265#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4265#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:31,364 INFO L273 TraceCheckUtils]: 33: Hoare triple {4265#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4266#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:31,365 INFO L273 TraceCheckUtils]: 34: Hoare triple {4266#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4266#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:31,366 INFO L273 TraceCheckUtils]: 35: Hoare triple {4266#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4267#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:31,366 INFO L273 TraceCheckUtils]: 36: Hoare triple {4267#(<= main_~i~0 15)} assume !(~i~0 < 50000); {4251#false} is VALID [2018-11-23 12:05:31,367 INFO L273 TraceCheckUtils]: 37: Hoare triple {4251#false} havoc ~x~0;~x~0 := 0; {4251#false} is VALID [2018-11-23 12:05:31,367 INFO L273 TraceCheckUtils]: 38: Hoare triple {4251#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {4251#false} is VALID [2018-11-23 12:05:31,367 INFO L256 TraceCheckUtils]: 39: Hoare triple {4251#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {4251#false} is VALID [2018-11-23 12:05:31,367 INFO L273 TraceCheckUtils]: 40: Hoare triple {4251#false} ~cond := #in~cond; {4251#false} is VALID [2018-11-23 12:05:31,368 INFO L273 TraceCheckUtils]: 41: Hoare triple {4251#false} assume 0 == ~cond; {4251#false} is VALID [2018-11-23 12:05:31,368 INFO L273 TraceCheckUtils]: 42: Hoare triple {4251#false} assume !false; {4251#false} is VALID [2018-11-23 12:05:31,370 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:31,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:31,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 12:05:31,390 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 43 [2018-11-23 12:05:31,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:31,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:05:31,436 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:31,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:05:31,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:05:31,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:05:31,437 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 19 states. [2018-11-23 12:05:31,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:31,774 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-11-23 12:05:31,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 12:05:31,775 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 43 [2018-11-23 12:05:31,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:31,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:05:31,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 64 transitions. [2018-11-23 12:05:31,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:05:31,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 64 transitions. [2018-11-23 12:05:31,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 64 transitions. [2018-11-23 12:05:31,846 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:31,848 INFO L225 Difference]: With dead ends: 62 [2018-11-23 12:05:31,848 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 12:05:31,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:05:31,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 12:05:31,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-11-23 12:05:31,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:31,867 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 50 states. [2018-11-23 12:05:31,867 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 50 states. [2018-11-23 12:05:31,867 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 50 states. [2018-11-23 12:05:31,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:31,869 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-11-23 12:05:31,869 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-11-23 12:05:31,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:31,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:31,870 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 51 states. [2018-11-23 12:05:31,870 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 51 states. [2018-11-23 12:05:31,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:31,871 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-11-23 12:05:31,871 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-11-23 12:05:31,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:31,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:31,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:31,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:31,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 12:05:31,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-11-23 12:05:31,874 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 43 [2018-11-23 12:05:31,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:31,874 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-11-23 12:05:31,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:05:31,874 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-11-23 12:05:31,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 12:05:31,875 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:31,876 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:31,876 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:31,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:31,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1244333394, now seen corresponding path program 16 times [2018-11-23 12:05:31,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:31,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:31,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:31,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:31,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:33,091 INFO L256 TraceCheckUtils]: 0: Hoare triple {4662#true} call ULTIMATE.init(); {4662#true} is VALID [2018-11-23 12:05:33,092 INFO L273 TraceCheckUtils]: 1: Hoare triple {4662#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4662#true} is VALID [2018-11-23 12:05:33,092 INFO L273 TraceCheckUtils]: 2: Hoare triple {4662#true} assume true; {4662#true} is VALID [2018-11-23 12:05:33,092 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4662#true} {4662#true} #49#return; {4662#true} is VALID [2018-11-23 12:05:33,092 INFO L256 TraceCheckUtils]: 4: Hoare triple {4662#true} call #t~ret5 := main(); {4662#true} is VALID [2018-11-23 12:05:33,093 INFO L273 TraceCheckUtils]: 5: Hoare triple {4662#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {4664#(= main_~i~0 0)} is VALID [2018-11-23 12:05:33,093 INFO L273 TraceCheckUtils]: 6: Hoare triple {4664#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4664#(= main_~i~0 0)} is VALID [2018-11-23 12:05:33,094 INFO L273 TraceCheckUtils]: 7: Hoare triple {4664#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4665#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:33,094 INFO L273 TraceCheckUtils]: 8: Hoare triple {4665#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4665#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:33,094 INFO L273 TraceCheckUtils]: 9: Hoare triple {4665#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4666#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:33,113 INFO L273 TraceCheckUtils]: 10: Hoare triple {4666#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4666#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:33,117 INFO L273 TraceCheckUtils]: 11: Hoare triple {4666#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4667#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:33,117 INFO L273 TraceCheckUtils]: 12: Hoare triple {4667#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4667#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:33,118 INFO L273 TraceCheckUtils]: 13: Hoare triple {4667#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4668#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:33,118 INFO L273 TraceCheckUtils]: 14: Hoare triple {4668#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4668#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:33,119 INFO L273 TraceCheckUtils]: 15: Hoare triple {4668#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4669#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:33,119 INFO L273 TraceCheckUtils]: 16: Hoare triple {4669#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4669#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:33,119 INFO L273 TraceCheckUtils]: 17: Hoare triple {4669#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4670#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:33,120 INFO L273 TraceCheckUtils]: 18: Hoare triple {4670#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4670#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:33,120 INFO L273 TraceCheckUtils]: 19: Hoare triple {4670#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4671#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:33,121 INFO L273 TraceCheckUtils]: 20: Hoare triple {4671#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4671#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:33,121 INFO L273 TraceCheckUtils]: 21: Hoare triple {4671#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4672#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:33,122 INFO L273 TraceCheckUtils]: 22: Hoare triple {4672#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4672#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:33,123 INFO L273 TraceCheckUtils]: 23: Hoare triple {4672#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4673#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:33,123 INFO L273 TraceCheckUtils]: 24: Hoare triple {4673#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4673#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:33,124 INFO L273 TraceCheckUtils]: 25: Hoare triple {4673#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4674#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:33,124 INFO L273 TraceCheckUtils]: 26: Hoare triple {4674#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4674#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:33,125 INFO L273 TraceCheckUtils]: 27: Hoare triple {4674#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4675#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:33,126 INFO L273 TraceCheckUtils]: 28: Hoare triple {4675#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4675#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:33,127 INFO L273 TraceCheckUtils]: 29: Hoare triple {4675#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4676#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:33,127 INFO L273 TraceCheckUtils]: 30: Hoare triple {4676#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4676#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:33,128 INFO L273 TraceCheckUtils]: 31: Hoare triple {4676#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4677#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:33,128 INFO L273 TraceCheckUtils]: 32: Hoare triple {4677#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4677#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:33,129 INFO L273 TraceCheckUtils]: 33: Hoare triple {4677#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4678#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:33,130 INFO L273 TraceCheckUtils]: 34: Hoare triple {4678#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4678#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:33,130 INFO L273 TraceCheckUtils]: 35: Hoare triple {4678#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4679#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:33,132 INFO L273 TraceCheckUtils]: 36: Hoare triple {4679#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4679#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:33,133 INFO L273 TraceCheckUtils]: 37: Hoare triple {4679#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4680#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:33,133 INFO L273 TraceCheckUtils]: 38: Hoare triple {4680#(<= main_~i~0 16)} assume !(~i~0 < 50000); {4663#false} is VALID [2018-11-23 12:05:33,133 INFO L273 TraceCheckUtils]: 39: Hoare triple {4663#false} havoc ~x~0;~x~0 := 0; {4663#false} is VALID [2018-11-23 12:05:33,133 INFO L273 TraceCheckUtils]: 40: Hoare triple {4663#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {4663#false} is VALID [2018-11-23 12:05:33,134 INFO L256 TraceCheckUtils]: 41: Hoare triple {4663#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {4663#false} is VALID [2018-11-23 12:05:33,134 INFO L273 TraceCheckUtils]: 42: Hoare triple {4663#false} ~cond := #in~cond; {4663#false} is VALID [2018-11-23 12:05:33,134 INFO L273 TraceCheckUtils]: 43: Hoare triple {4663#false} assume 0 == ~cond; {4663#false} is VALID [2018-11-23 12:05:33,134 INFO L273 TraceCheckUtils]: 44: Hoare triple {4663#false} assume !false; {4663#false} is VALID [2018-11-23 12:05:33,136 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:33,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:33,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 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-23 12:05:33,151 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:05:33,190 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:05:33,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:33,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:33,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:33,492 INFO L256 TraceCheckUtils]: 0: Hoare triple {4662#true} call ULTIMATE.init(); {4662#true} is VALID [2018-11-23 12:05:33,493 INFO L273 TraceCheckUtils]: 1: Hoare triple {4662#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4662#true} is VALID [2018-11-23 12:05:33,493 INFO L273 TraceCheckUtils]: 2: Hoare triple {4662#true} assume true; {4662#true} is VALID [2018-11-23 12:05:33,493 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4662#true} {4662#true} #49#return; {4662#true} is VALID [2018-11-23 12:05:33,493 INFO L256 TraceCheckUtils]: 4: Hoare triple {4662#true} call #t~ret5 := main(); {4662#true} is VALID [2018-11-23 12:05:33,493 INFO L273 TraceCheckUtils]: 5: Hoare triple {4662#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {4699#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:33,494 INFO L273 TraceCheckUtils]: 6: Hoare triple {4699#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4699#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:33,494 INFO L273 TraceCheckUtils]: 7: Hoare triple {4699#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4665#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:33,495 INFO L273 TraceCheckUtils]: 8: Hoare triple {4665#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4665#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:33,495 INFO L273 TraceCheckUtils]: 9: Hoare triple {4665#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4666#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:33,495 INFO L273 TraceCheckUtils]: 10: Hoare triple {4666#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4666#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:33,496 INFO L273 TraceCheckUtils]: 11: Hoare triple {4666#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4667#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:33,496 INFO L273 TraceCheckUtils]: 12: Hoare triple {4667#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4667#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:33,497 INFO L273 TraceCheckUtils]: 13: Hoare triple {4667#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4668#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:33,498 INFO L273 TraceCheckUtils]: 14: Hoare triple {4668#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4668#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:33,498 INFO L273 TraceCheckUtils]: 15: Hoare triple {4668#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4669#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:33,499 INFO L273 TraceCheckUtils]: 16: Hoare triple {4669#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4669#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:33,500 INFO L273 TraceCheckUtils]: 17: Hoare triple {4669#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4670#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:33,500 INFO L273 TraceCheckUtils]: 18: Hoare triple {4670#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4670#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:33,501 INFO L273 TraceCheckUtils]: 19: Hoare triple {4670#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4671#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:33,502 INFO L273 TraceCheckUtils]: 20: Hoare triple {4671#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4671#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:33,502 INFO L273 TraceCheckUtils]: 21: Hoare triple {4671#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4672#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:33,503 INFO L273 TraceCheckUtils]: 22: Hoare triple {4672#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4672#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:33,504 INFO L273 TraceCheckUtils]: 23: Hoare triple {4672#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4673#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:33,504 INFO L273 TraceCheckUtils]: 24: Hoare triple {4673#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4673#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:33,505 INFO L273 TraceCheckUtils]: 25: Hoare triple {4673#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4674#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:33,505 INFO L273 TraceCheckUtils]: 26: Hoare triple {4674#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4674#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:33,506 INFO L273 TraceCheckUtils]: 27: Hoare triple {4674#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4675#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:33,507 INFO L273 TraceCheckUtils]: 28: Hoare triple {4675#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4675#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:33,508 INFO L273 TraceCheckUtils]: 29: Hoare triple {4675#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4676#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:33,508 INFO L273 TraceCheckUtils]: 30: Hoare triple {4676#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4676#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:33,509 INFO L273 TraceCheckUtils]: 31: Hoare triple {4676#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4677#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:33,509 INFO L273 TraceCheckUtils]: 32: Hoare triple {4677#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4677#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:33,510 INFO L273 TraceCheckUtils]: 33: Hoare triple {4677#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4678#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:33,511 INFO L273 TraceCheckUtils]: 34: Hoare triple {4678#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4678#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:33,511 INFO L273 TraceCheckUtils]: 35: Hoare triple {4678#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4679#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:33,512 INFO L273 TraceCheckUtils]: 36: Hoare triple {4679#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4679#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:33,513 INFO L273 TraceCheckUtils]: 37: Hoare triple {4679#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4680#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:33,513 INFO L273 TraceCheckUtils]: 38: Hoare triple {4680#(<= main_~i~0 16)} assume !(~i~0 < 50000); {4663#false} is VALID [2018-11-23 12:05:33,514 INFO L273 TraceCheckUtils]: 39: Hoare triple {4663#false} havoc ~x~0;~x~0 := 0; {4663#false} is VALID [2018-11-23 12:05:33,514 INFO L273 TraceCheckUtils]: 40: Hoare triple {4663#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {4663#false} is VALID [2018-11-23 12:05:33,514 INFO L256 TraceCheckUtils]: 41: Hoare triple {4663#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {4663#false} is VALID [2018-11-23 12:05:33,514 INFO L273 TraceCheckUtils]: 42: Hoare triple {4663#false} ~cond := #in~cond; {4663#false} is VALID [2018-11-23 12:05:33,515 INFO L273 TraceCheckUtils]: 43: Hoare triple {4663#false} assume 0 == ~cond; {4663#false} is VALID [2018-11-23 12:05:33,515 INFO L273 TraceCheckUtils]: 44: Hoare triple {4663#false} assume !false; {4663#false} is VALID [2018-11-23 12:05:33,517 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:33,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:33,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 12:05:33,536 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 45 [2018-11-23 12:05:33,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:33,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:05:33,594 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:33,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:05:33,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:05:33,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:05:33,595 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 20 states. [2018-11-23 12:05:33,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:33,834 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-11-23 12:05:33,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:05:33,834 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 45 [2018-11-23 12:05:33,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:33,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:05:33,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 66 transitions. [2018-11-23 12:05:33,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:05:33,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 66 transitions. [2018-11-23 12:05:33,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 66 transitions. [2018-11-23 12:05:34,324 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-23 12:05:34,325 INFO L225 Difference]: With dead ends: 64 [2018-11-23 12:05:34,326 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 12:05:34,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 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-23 12:05:34,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 12:05:34,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-11-23 12:05:34,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:34,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 52 states. [2018-11-23 12:05:34,345 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 52 states. [2018-11-23 12:05:34,345 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 52 states. [2018-11-23 12:05:34,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:34,346 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-11-23 12:05:34,346 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-11-23 12:05:34,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:34,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:34,347 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 53 states. [2018-11-23 12:05:34,347 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 53 states. [2018-11-23 12:05:34,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:34,348 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-11-23 12:05:34,348 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-11-23 12:05:34,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:34,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:34,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:34,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:34,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:05:34,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2018-11-23 12:05:34,350 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 45 [2018-11-23 12:05:34,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:34,350 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2018-11-23 12:05:34,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:05:34,351 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-11-23 12:05:34,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 12:05:34,351 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:34,351 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:34,352 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:34,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:34,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1833434736, now seen corresponding path program 17 times [2018-11-23 12:05:34,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:34,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:34,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:34,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:34,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:34,781 INFO L256 TraceCheckUtils]: 0: Hoare triple {5091#true} call ULTIMATE.init(); {5091#true} is VALID [2018-11-23 12:05:34,781 INFO L273 TraceCheckUtils]: 1: Hoare triple {5091#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5091#true} is VALID [2018-11-23 12:05:34,782 INFO L273 TraceCheckUtils]: 2: Hoare triple {5091#true} assume true; {5091#true} is VALID [2018-11-23 12:05:34,782 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5091#true} {5091#true} #49#return; {5091#true} is VALID [2018-11-23 12:05:34,782 INFO L256 TraceCheckUtils]: 4: Hoare triple {5091#true} call #t~ret5 := main(); {5091#true} is VALID [2018-11-23 12:05:34,783 INFO L273 TraceCheckUtils]: 5: Hoare triple {5091#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {5093#(= main_~i~0 0)} is VALID [2018-11-23 12:05:34,783 INFO L273 TraceCheckUtils]: 6: Hoare triple {5093#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5093#(= main_~i~0 0)} is VALID [2018-11-23 12:05:34,784 INFO L273 TraceCheckUtils]: 7: Hoare triple {5093#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5094#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:34,785 INFO L273 TraceCheckUtils]: 8: Hoare triple {5094#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5094#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:34,785 INFO L273 TraceCheckUtils]: 9: Hoare triple {5094#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5095#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:34,786 INFO L273 TraceCheckUtils]: 10: Hoare triple {5095#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5095#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:34,787 INFO L273 TraceCheckUtils]: 11: Hoare triple {5095#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5096#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:34,787 INFO L273 TraceCheckUtils]: 12: Hoare triple {5096#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5096#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:34,788 INFO L273 TraceCheckUtils]: 13: Hoare triple {5096#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5097#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:34,789 INFO L273 TraceCheckUtils]: 14: Hoare triple {5097#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5097#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:34,790 INFO L273 TraceCheckUtils]: 15: Hoare triple {5097#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5098#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:34,790 INFO L273 TraceCheckUtils]: 16: Hoare triple {5098#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5098#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:34,791 INFO L273 TraceCheckUtils]: 17: Hoare triple {5098#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5099#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:34,791 INFO L273 TraceCheckUtils]: 18: Hoare triple {5099#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5099#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:34,792 INFO L273 TraceCheckUtils]: 19: Hoare triple {5099#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5100#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:34,793 INFO L273 TraceCheckUtils]: 20: Hoare triple {5100#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5100#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:34,794 INFO L273 TraceCheckUtils]: 21: Hoare triple {5100#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5101#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:34,794 INFO L273 TraceCheckUtils]: 22: Hoare triple {5101#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5101#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:34,795 INFO L273 TraceCheckUtils]: 23: Hoare triple {5101#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5102#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:34,795 INFO L273 TraceCheckUtils]: 24: Hoare triple {5102#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5102#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:34,796 INFO L273 TraceCheckUtils]: 25: Hoare triple {5102#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5103#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:34,797 INFO L273 TraceCheckUtils]: 26: Hoare triple {5103#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5103#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:34,798 INFO L273 TraceCheckUtils]: 27: Hoare triple {5103#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5104#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:34,798 INFO L273 TraceCheckUtils]: 28: Hoare triple {5104#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5104#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:34,799 INFO L273 TraceCheckUtils]: 29: Hoare triple {5104#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5105#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:34,799 INFO L273 TraceCheckUtils]: 30: Hoare triple {5105#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5105#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:34,800 INFO L273 TraceCheckUtils]: 31: Hoare triple {5105#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5106#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:34,801 INFO L273 TraceCheckUtils]: 32: Hoare triple {5106#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5106#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:34,801 INFO L273 TraceCheckUtils]: 33: Hoare triple {5106#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5107#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:34,802 INFO L273 TraceCheckUtils]: 34: Hoare triple {5107#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5107#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:34,803 INFO L273 TraceCheckUtils]: 35: Hoare triple {5107#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5108#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:34,803 INFO L273 TraceCheckUtils]: 36: Hoare triple {5108#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5108#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:34,804 INFO L273 TraceCheckUtils]: 37: Hoare triple {5108#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5109#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:34,805 INFO L273 TraceCheckUtils]: 38: Hoare triple {5109#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5109#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:34,805 INFO L273 TraceCheckUtils]: 39: Hoare triple {5109#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5110#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:34,806 INFO L273 TraceCheckUtils]: 40: Hoare triple {5110#(<= main_~i~0 17)} assume !(~i~0 < 50000); {5092#false} is VALID [2018-11-23 12:05:34,806 INFO L273 TraceCheckUtils]: 41: Hoare triple {5092#false} havoc ~x~0;~x~0 := 0; {5092#false} is VALID [2018-11-23 12:05:34,807 INFO L273 TraceCheckUtils]: 42: Hoare triple {5092#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {5092#false} is VALID [2018-11-23 12:05:34,807 INFO L256 TraceCheckUtils]: 43: Hoare triple {5092#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {5092#false} is VALID [2018-11-23 12:05:34,807 INFO L273 TraceCheckUtils]: 44: Hoare triple {5092#false} ~cond := #in~cond; {5092#false} is VALID [2018-11-23 12:05:34,807 INFO L273 TraceCheckUtils]: 45: Hoare triple {5092#false} assume 0 == ~cond; {5092#false} is VALID [2018-11-23 12:05:34,807 INFO L273 TraceCheckUtils]: 46: Hoare triple {5092#false} assume !false; {5092#false} is VALID [2018-11-23 12:05:34,810 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:34,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:34,810 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-23 12:05:34,820 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:05:35,104 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-23 12:05:35,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:35,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:35,380 INFO L256 TraceCheckUtils]: 0: Hoare triple {5091#true} call ULTIMATE.init(); {5091#true} is VALID [2018-11-23 12:05:35,381 INFO L273 TraceCheckUtils]: 1: Hoare triple {5091#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5091#true} is VALID [2018-11-23 12:05:35,381 INFO L273 TraceCheckUtils]: 2: Hoare triple {5091#true} assume true; {5091#true} is VALID [2018-11-23 12:05:35,381 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5091#true} {5091#true} #49#return; {5091#true} is VALID [2018-11-23 12:05:35,382 INFO L256 TraceCheckUtils]: 4: Hoare triple {5091#true} call #t~ret5 := main(); {5091#true} is VALID [2018-11-23 12:05:35,382 INFO L273 TraceCheckUtils]: 5: Hoare triple {5091#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {5129#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:35,383 INFO L273 TraceCheckUtils]: 6: Hoare triple {5129#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5129#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:35,383 INFO L273 TraceCheckUtils]: 7: Hoare triple {5129#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5094#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:35,384 INFO L273 TraceCheckUtils]: 8: Hoare triple {5094#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5094#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:35,384 INFO L273 TraceCheckUtils]: 9: Hoare triple {5094#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5095#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:35,385 INFO L273 TraceCheckUtils]: 10: Hoare triple {5095#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5095#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:35,385 INFO L273 TraceCheckUtils]: 11: Hoare triple {5095#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5096#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:35,386 INFO L273 TraceCheckUtils]: 12: Hoare triple {5096#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5096#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:35,386 INFO L273 TraceCheckUtils]: 13: Hoare triple {5096#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5097#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:35,387 INFO L273 TraceCheckUtils]: 14: Hoare triple {5097#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5097#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:35,388 INFO L273 TraceCheckUtils]: 15: Hoare triple {5097#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5098#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:35,388 INFO L273 TraceCheckUtils]: 16: Hoare triple {5098#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5098#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:35,389 INFO L273 TraceCheckUtils]: 17: Hoare triple {5098#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5099#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:35,390 INFO L273 TraceCheckUtils]: 18: Hoare triple {5099#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5099#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:35,390 INFO L273 TraceCheckUtils]: 19: Hoare triple {5099#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5100#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:35,391 INFO L273 TraceCheckUtils]: 20: Hoare triple {5100#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5100#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:35,392 INFO L273 TraceCheckUtils]: 21: Hoare triple {5100#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5101#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:35,392 INFO L273 TraceCheckUtils]: 22: Hoare triple {5101#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5101#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:35,393 INFO L273 TraceCheckUtils]: 23: Hoare triple {5101#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5102#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:35,394 INFO L273 TraceCheckUtils]: 24: Hoare triple {5102#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5102#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:35,394 INFO L273 TraceCheckUtils]: 25: Hoare triple {5102#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5103#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:35,395 INFO L273 TraceCheckUtils]: 26: Hoare triple {5103#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5103#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:35,396 INFO L273 TraceCheckUtils]: 27: Hoare triple {5103#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5104#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:35,396 INFO L273 TraceCheckUtils]: 28: Hoare triple {5104#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5104#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:35,397 INFO L273 TraceCheckUtils]: 29: Hoare triple {5104#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5105#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:35,398 INFO L273 TraceCheckUtils]: 30: Hoare triple {5105#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5105#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:35,398 INFO L273 TraceCheckUtils]: 31: Hoare triple {5105#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5106#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:35,399 INFO L273 TraceCheckUtils]: 32: Hoare triple {5106#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5106#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:35,400 INFO L273 TraceCheckUtils]: 33: Hoare triple {5106#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5107#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:35,400 INFO L273 TraceCheckUtils]: 34: Hoare triple {5107#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5107#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:35,401 INFO L273 TraceCheckUtils]: 35: Hoare triple {5107#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5108#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:35,402 INFO L273 TraceCheckUtils]: 36: Hoare triple {5108#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5108#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:35,402 INFO L273 TraceCheckUtils]: 37: Hoare triple {5108#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5109#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:35,403 INFO L273 TraceCheckUtils]: 38: Hoare triple {5109#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5109#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:35,404 INFO L273 TraceCheckUtils]: 39: Hoare triple {5109#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5110#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:35,404 INFO L273 TraceCheckUtils]: 40: Hoare triple {5110#(<= main_~i~0 17)} assume !(~i~0 < 50000); {5092#false} is VALID [2018-11-23 12:05:35,405 INFO L273 TraceCheckUtils]: 41: Hoare triple {5092#false} havoc ~x~0;~x~0 := 0; {5092#false} is VALID [2018-11-23 12:05:35,405 INFO L273 TraceCheckUtils]: 42: Hoare triple {5092#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {5092#false} is VALID [2018-11-23 12:05:35,405 INFO L256 TraceCheckUtils]: 43: Hoare triple {5092#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {5092#false} is VALID [2018-11-23 12:05:35,405 INFO L273 TraceCheckUtils]: 44: Hoare triple {5092#false} ~cond := #in~cond; {5092#false} is VALID [2018-11-23 12:05:35,405 INFO L273 TraceCheckUtils]: 45: Hoare triple {5092#false} assume 0 == ~cond; {5092#false} is VALID [2018-11-23 12:05:35,406 INFO L273 TraceCheckUtils]: 46: Hoare triple {5092#false} assume !false; {5092#false} is VALID [2018-11-23 12:05:35,408 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:35,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:35,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 12:05:35,430 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2018-11-23 12:05:35,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:35,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 12:05:35,480 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:35,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 12:05:35,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 12:05:35,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:05:35,481 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 21 states. [2018-11-23 12:05:35,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:35,983 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-11-23 12:05:35,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 12:05:35,984 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2018-11-23 12:05:35,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:35,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:05:35,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 68 transitions. [2018-11-23 12:05:35,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:05:35,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 68 transitions. [2018-11-23 12:05:35,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 68 transitions. [2018-11-23 12:05:36,448 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-23 12:05:36,449 INFO L225 Difference]: With dead ends: 66 [2018-11-23 12:05:36,450 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 12:05:36,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:05:36,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 12:05:36,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-11-23 12:05:36,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:36,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 54 states. [2018-11-23 12:05:36,544 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 54 states. [2018-11-23 12:05:36,544 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 54 states. [2018-11-23 12:05:36,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:36,546 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-11-23 12:05:36,546 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-11-23 12:05:36,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:36,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:36,547 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 55 states. [2018-11-23 12:05:36,547 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 55 states. [2018-11-23 12:05:36,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:36,548 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-11-23 12:05:36,548 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-11-23 12:05:36,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:36,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:36,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:36,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:36,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:05:36,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-11-23 12:05:36,551 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 47 [2018-11-23 12:05:36,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:36,551 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-11-23 12:05:36,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 12:05:36,551 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-11-23 12:05:36,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 12:05:36,552 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:36,552 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:36,552 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:36,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:36,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1024141326, now seen corresponding path program 18 times [2018-11-23 12:05:36,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:36,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:36,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:36,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:36,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:37,572 INFO L256 TraceCheckUtils]: 0: Hoare triple {5537#true} call ULTIMATE.init(); {5537#true} is VALID [2018-11-23 12:05:37,573 INFO L273 TraceCheckUtils]: 1: Hoare triple {5537#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5537#true} is VALID [2018-11-23 12:05:37,573 INFO L273 TraceCheckUtils]: 2: Hoare triple {5537#true} assume true; {5537#true} is VALID [2018-11-23 12:05:37,573 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5537#true} {5537#true} #49#return; {5537#true} is VALID [2018-11-23 12:05:37,573 INFO L256 TraceCheckUtils]: 4: Hoare triple {5537#true} call #t~ret5 := main(); {5537#true} is VALID [2018-11-23 12:05:37,574 INFO L273 TraceCheckUtils]: 5: Hoare triple {5537#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {5539#(= main_~i~0 0)} is VALID [2018-11-23 12:05:37,574 INFO L273 TraceCheckUtils]: 6: Hoare triple {5539#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5539#(= main_~i~0 0)} is VALID [2018-11-23 12:05:37,575 INFO L273 TraceCheckUtils]: 7: Hoare triple {5539#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5540#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:37,575 INFO L273 TraceCheckUtils]: 8: Hoare triple {5540#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5540#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:37,576 INFO L273 TraceCheckUtils]: 9: Hoare triple {5540#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5541#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:37,576 INFO L273 TraceCheckUtils]: 10: Hoare triple {5541#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5541#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:37,576 INFO L273 TraceCheckUtils]: 11: Hoare triple {5541#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5542#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:37,577 INFO L273 TraceCheckUtils]: 12: Hoare triple {5542#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5542#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:37,577 INFO L273 TraceCheckUtils]: 13: Hoare triple {5542#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5543#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:37,578 INFO L273 TraceCheckUtils]: 14: Hoare triple {5543#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5543#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:37,578 INFO L273 TraceCheckUtils]: 15: Hoare triple {5543#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5544#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:37,579 INFO L273 TraceCheckUtils]: 16: Hoare triple {5544#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5544#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:37,580 INFO L273 TraceCheckUtils]: 17: Hoare triple {5544#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5545#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:37,580 INFO L273 TraceCheckUtils]: 18: Hoare triple {5545#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5545#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:37,581 INFO L273 TraceCheckUtils]: 19: Hoare triple {5545#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5546#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:37,582 INFO L273 TraceCheckUtils]: 20: Hoare triple {5546#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5546#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:37,582 INFO L273 TraceCheckUtils]: 21: Hoare triple {5546#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5547#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:37,583 INFO L273 TraceCheckUtils]: 22: Hoare triple {5547#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5547#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:37,584 INFO L273 TraceCheckUtils]: 23: Hoare triple {5547#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5548#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:37,584 INFO L273 TraceCheckUtils]: 24: Hoare triple {5548#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5548#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:37,585 INFO L273 TraceCheckUtils]: 25: Hoare triple {5548#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5549#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:37,586 INFO L273 TraceCheckUtils]: 26: Hoare triple {5549#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5549#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:37,586 INFO L273 TraceCheckUtils]: 27: Hoare triple {5549#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5550#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:37,587 INFO L273 TraceCheckUtils]: 28: Hoare triple {5550#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5550#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:37,588 INFO L273 TraceCheckUtils]: 29: Hoare triple {5550#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5551#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:37,588 INFO L273 TraceCheckUtils]: 30: Hoare triple {5551#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5551#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:37,589 INFO L273 TraceCheckUtils]: 31: Hoare triple {5551#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5552#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:37,590 INFO L273 TraceCheckUtils]: 32: Hoare triple {5552#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5552#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:37,590 INFO L273 TraceCheckUtils]: 33: Hoare triple {5552#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5553#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:37,591 INFO L273 TraceCheckUtils]: 34: Hoare triple {5553#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5553#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:37,592 INFO L273 TraceCheckUtils]: 35: Hoare triple {5553#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5554#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:37,592 INFO L273 TraceCheckUtils]: 36: Hoare triple {5554#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5554#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:37,593 INFO L273 TraceCheckUtils]: 37: Hoare triple {5554#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5555#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:37,593 INFO L273 TraceCheckUtils]: 38: Hoare triple {5555#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5555#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:37,594 INFO L273 TraceCheckUtils]: 39: Hoare triple {5555#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5556#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:37,595 INFO L273 TraceCheckUtils]: 40: Hoare triple {5556#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5556#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:37,596 INFO L273 TraceCheckUtils]: 41: Hoare triple {5556#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5557#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:37,596 INFO L273 TraceCheckUtils]: 42: Hoare triple {5557#(<= main_~i~0 18)} assume !(~i~0 < 50000); {5538#false} is VALID [2018-11-23 12:05:37,596 INFO L273 TraceCheckUtils]: 43: Hoare triple {5538#false} havoc ~x~0;~x~0 := 0; {5538#false} is VALID [2018-11-23 12:05:37,597 INFO L273 TraceCheckUtils]: 44: Hoare triple {5538#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {5538#false} is VALID [2018-11-23 12:05:37,597 INFO L256 TraceCheckUtils]: 45: Hoare triple {5538#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {5538#false} is VALID [2018-11-23 12:05:37,597 INFO L273 TraceCheckUtils]: 46: Hoare triple {5538#false} ~cond := #in~cond; {5538#false} is VALID [2018-11-23 12:05:37,597 INFO L273 TraceCheckUtils]: 47: Hoare triple {5538#false} assume 0 == ~cond; {5538#false} is VALID [2018-11-23 12:05:37,598 INFO L273 TraceCheckUtils]: 48: Hoare triple {5538#false} assume !false; {5538#false} is VALID [2018-11-23 12:05:37,599 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:37,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:37,600 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-23 12:05:37,608 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:05:38,451 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 12:05:38,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:38,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:38,759 INFO L256 TraceCheckUtils]: 0: Hoare triple {5537#true} call ULTIMATE.init(); {5537#true} is VALID [2018-11-23 12:05:38,759 INFO L273 TraceCheckUtils]: 1: Hoare triple {5537#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5537#true} is VALID [2018-11-23 12:05:38,760 INFO L273 TraceCheckUtils]: 2: Hoare triple {5537#true} assume true; {5537#true} is VALID [2018-11-23 12:05:38,760 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5537#true} {5537#true} #49#return; {5537#true} is VALID [2018-11-23 12:05:38,760 INFO L256 TraceCheckUtils]: 4: Hoare triple {5537#true} call #t~ret5 := main(); {5537#true} is VALID [2018-11-23 12:05:38,761 INFO L273 TraceCheckUtils]: 5: Hoare triple {5537#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {5576#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:38,762 INFO L273 TraceCheckUtils]: 6: Hoare triple {5576#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5576#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:38,762 INFO L273 TraceCheckUtils]: 7: Hoare triple {5576#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5540#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:38,762 INFO L273 TraceCheckUtils]: 8: Hoare triple {5540#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5540#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:38,779 INFO L273 TraceCheckUtils]: 9: Hoare triple {5540#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5541#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:38,795 INFO L273 TraceCheckUtils]: 10: Hoare triple {5541#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5541#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:38,803 INFO L273 TraceCheckUtils]: 11: Hoare triple {5541#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5542#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:38,803 INFO L273 TraceCheckUtils]: 12: Hoare triple {5542#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5542#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:38,804 INFO L273 TraceCheckUtils]: 13: Hoare triple {5542#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5543#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:38,804 INFO L273 TraceCheckUtils]: 14: Hoare triple {5543#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5543#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:38,805 INFO L273 TraceCheckUtils]: 15: Hoare triple {5543#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5544#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:38,805 INFO L273 TraceCheckUtils]: 16: Hoare triple {5544#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5544#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:38,806 INFO L273 TraceCheckUtils]: 17: Hoare triple {5544#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5545#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:38,806 INFO L273 TraceCheckUtils]: 18: Hoare triple {5545#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5545#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:38,807 INFO L273 TraceCheckUtils]: 19: Hoare triple {5545#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5546#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:38,807 INFO L273 TraceCheckUtils]: 20: Hoare triple {5546#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5546#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:38,808 INFO L273 TraceCheckUtils]: 21: Hoare triple {5546#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5547#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:38,808 INFO L273 TraceCheckUtils]: 22: Hoare triple {5547#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5547#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:38,809 INFO L273 TraceCheckUtils]: 23: Hoare triple {5547#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5548#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:38,810 INFO L273 TraceCheckUtils]: 24: Hoare triple {5548#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5548#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:38,811 INFO L273 TraceCheckUtils]: 25: Hoare triple {5548#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5549#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:38,811 INFO L273 TraceCheckUtils]: 26: Hoare triple {5549#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5549#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:38,812 INFO L273 TraceCheckUtils]: 27: Hoare triple {5549#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5550#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:38,813 INFO L273 TraceCheckUtils]: 28: Hoare triple {5550#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5550#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:38,814 INFO L273 TraceCheckUtils]: 29: Hoare triple {5550#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5551#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:38,814 INFO L273 TraceCheckUtils]: 30: Hoare triple {5551#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5551#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:38,815 INFO L273 TraceCheckUtils]: 31: Hoare triple {5551#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5552#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:38,816 INFO L273 TraceCheckUtils]: 32: Hoare triple {5552#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5552#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:38,817 INFO L273 TraceCheckUtils]: 33: Hoare triple {5552#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5553#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:38,817 INFO L273 TraceCheckUtils]: 34: Hoare triple {5553#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5553#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:38,818 INFO L273 TraceCheckUtils]: 35: Hoare triple {5553#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5554#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:38,819 INFO L273 TraceCheckUtils]: 36: Hoare triple {5554#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5554#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:38,820 INFO L273 TraceCheckUtils]: 37: Hoare triple {5554#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5555#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:38,820 INFO L273 TraceCheckUtils]: 38: Hoare triple {5555#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5555#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:38,821 INFO L273 TraceCheckUtils]: 39: Hoare triple {5555#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5556#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:38,822 INFO L273 TraceCheckUtils]: 40: Hoare triple {5556#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5556#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:38,823 INFO L273 TraceCheckUtils]: 41: Hoare triple {5556#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5557#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:38,824 INFO L273 TraceCheckUtils]: 42: Hoare triple {5557#(<= main_~i~0 18)} assume !(~i~0 < 50000); {5538#false} is VALID [2018-11-23 12:05:38,824 INFO L273 TraceCheckUtils]: 43: Hoare triple {5538#false} havoc ~x~0;~x~0 := 0; {5538#false} is VALID [2018-11-23 12:05:38,824 INFO L273 TraceCheckUtils]: 44: Hoare triple {5538#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {5538#false} is VALID [2018-11-23 12:05:38,825 INFO L256 TraceCheckUtils]: 45: Hoare triple {5538#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {5538#false} is VALID [2018-11-23 12:05:38,825 INFO L273 TraceCheckUtils]: 46: Hoare triple {5538#false} ~cond := #in~cond; {5538#false} is VALID [2018-11-23 12:05:38,825 INFO L273 TraceCheckUtils]: 47: Hoare triple {5538#false} assume 0 == ~cond; {5538#false} is VALID [2018-11-23 12:05:38,825 INFO L273 TraceCheckUtils]: 48: Hoare triple {5538#false} assume !false; {5538#false} is VALID [2018-11-23 12:05:38,830 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:38,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:38,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 12:05:38,850 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2018-11-23 12:05:38,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:38,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 12:05:38,909 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:38,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 12:05:38,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 12:05:38,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:05:38,911 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 22 states. [2018-11-23 12:05:39,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:39,383 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-11-23 12:05:39,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 12:05:39,383 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2018-11-23 12:05:39,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:39,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:05:39,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 70 transitions. [2018-11-23 12:05:39,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:05:39,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 70 transitions. [2018-11-23 12:05:39,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 70 transitions. [2018-11-23 12:05:39,464 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:39,466 INFO L225 Difference]: With dead ends: 68 [2018-11-23 12:05:39,466 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:05:39,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:05:39,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:05:39,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-23 12:05:39,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:39,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 56 states. [2018-11-23 12:05:39,489 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 56 states. [2018-11-23 12:05:39,489 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 56 states. [2018-11-23 12:05:39,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:39,490 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-11-23 12:05:39,491 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-23 12:05:39,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:39,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:39,491 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 57 states. [2018-11-23 12:05:39,491 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 57 states. [2018-11-23 12:05:39,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:39,492 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-11-23 12:05:39,492 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-23 12:05:39,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:39,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:39,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:39,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:39,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 12:05:39,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-11-23 12:05:39,494 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 49 [2018-11-23 12:05:39,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:39,494 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-11-23 12:05:39,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 12:05:39,495 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-11-23 12:05:39,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 12:05:39,495 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:39,495 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:39,496 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:39,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:39,496 INFO L82 PathProgramCache]: Analyzing trace with hash 682254892, now seen corresponding path program 19 times [2018-11-23 12:05:39,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:39,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:39,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:39,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:39,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:40,176 INFO L256 TraceCheckUtils]: 0: Hoare triple {6000#true} call ULTIMATE.init(); {6000#true} is VALID [2018-11-23 12:05:40,177 INFO L273 TraceCheckUtils]: 1: Hoare triple {6000#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6000#true} is VALID [2018-11-23 12:05:40,177 INFO L273 TraceCheckUtils]: 2: Hoare triple {6000#true} assume true; {6000#true} is VALID [2018-11-23 12:05:40,177 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6000#true} {6000#true} #49#return; {6000#true} is VALID [2018-11-23 12:05:40,177 INFO L256 TraceCheckUtils]: 4: Hoare triple {6000#true} call #t~ret5 := main(); {6000#true} is VALID [2018-11-23 12:05:40,178 INFO L273 TraceCheckUtils]: 5: Hoare triple {6000#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {6002#(= main_~i~0 0)} is VALID [2018-11-23 12:05:40,179 INFO L273 TraceCheckUtils]: 6: Hoare triple {6002#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6002#(= main_~i~0 0)} is VALID [2018-11-23 12:05:40,179 INFO L273 TraceCheckUtils]: 7: Hoare triple {6002#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6003#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:40,180 INFO L273 TraceCheckUtils]: 8: Hoare triple {6003#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6003#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:40,180 INFO L273 TraceCheckUtils]: 9: Hoare triple {6003#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6004#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:40,180 INFO L273 TraceCheckUtils]: 10: Hoare triple {6004#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6004#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:40,181 INFO L273 TraceCheckUtils]: 11: Hoare triple {6004#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6005#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:40,181 INFO L273 TraceCheckUtils]: 12: Hoare triple {6005#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6005#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:40,182 INFO L273 TraceCheckUtils]: 13: Hoare triple {6005#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6006#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:40,183 INFO L273 TraceCheckUtils]: 14: Hoare triple {6006#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6006#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:40,183 INFO L273 TraceCheckUtils]: 15: Hoare triple {6006#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6007#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:40,184 INFO L273 TraceCheckUtils]: 16: Hoare triple {6007#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6007#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:40,185 INFO L273 TraceCheckUtils]: 17: Hoare triple {6007#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6008#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:40,185 INFO L273 TraceCheckUtils]: 18: Hoare triple {6008#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6008#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:40,186 INFO L273 TraceCheckUtils]: 19: Hoare triple {6008#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6009#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:40,187 INFO L273 TraceCheckUtils]: 20: Hoare triple {6009#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6009#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:40,187 INFO L273 TraceCheckUtils]: 21: Hoare triple {6009#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6010#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:40,188 INFO L273 TraceCheckUtils]: 22: Hoare triple {6010#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6010#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:40,189 INFO L273 TraceCheckUtils]: 23: Hoare triple {6010#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6011#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:40,189 INFO L273 TraceCheckUtils]: 24: Hoare triple {6011#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6011#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:40,190 INFO L273 TraceCheckUtils]: 25: Hoare triple {6011#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6012#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:40,190 INFO L273 TraceCheckUtils]: 26: Hoare triple {6012#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6012#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:40,191 INFO L273 TraceCheckUtils]: 27: Hoare triple {6012#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6013#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:40,192 INFO L273 TraceCheckUtils]: 28: Hoare triple {6013#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6013#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:40,193 INFO L273 TraceCheckUtils]: 29: Hoare triple {6013#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6014#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:40,193 INFO L273 TraceCheckUtils]: 30: Hoare triple {6014#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6014#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:40,194 INFO L273 TraceCheckUtils]: 31: Hoare triple {6014#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6015#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:40,194 INFO L273 TraceCheckUtils]: 32: Hoare triple {6015#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6015#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:40,195 INFO L273 TraceCheckUtils]: 33: Hoare triple {6015#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6016#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:40,196 INFO L273 TraceCheckUtils]: 34: Hoare triple {6016#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6016#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:40,196 INFO L273 TraceCheckUtils]: 35: Hoare triple {6016#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6017#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:40,197 INFO L273 TraceCheckUtils]: 36: Hoare triple {6017#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6017#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:40,198 INFO L273 TraceCheckUtils]: 37: Hoare triple {6017#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6018#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:40,198 INFO L273 TraceCheckUtils]: 38: Hoare triple {6018#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6018#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:40,199 INFO L273 TraceCheckUtils]: 39: Hoare triple {6018#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6019#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:40,200 INFO L273 TraceCheckUtils]: 40: Hoare triple {6019#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6019#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:40,200 INFO L273 TraceCheckUtils]: 41: Hoare triple {6019#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6020#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:40,201 INFO L273 TraceCheckUtils]: 42: Hoare triple {6020#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6020#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:40,202 INFO L273 TraceCheckUtils]: 43: Hoare triple {6020#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6021#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:40,202 INFO L273 TraceCheckUtils]: 44: Hoare triple {6021#(<= main_~i~0 19)} assume !(~i~0 < 50000); {6001#false} is VALID [2018-11-23 12:05:40,203 INFO L273 TraceCheckUtils]: 45: Hoare triple {6001#false} havoc ~x~0;~x~0 := 0; {6001#false} is VALID [2018-11-23 12:05:40,203 INFO L273 TraceCheckUtils]: 46: Hoare triple {6001#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {6001#false} is VALID [2018-11-23 12:05:40,203 INFO L256 TraceCheckUtils]: 47: Hoare triple {6001#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {6001#false} is VALID [2018-11-23 12:05:40,203 INFO L273 TraceCheckUtils]: 48: Hoare triple {6001#false} ~cond := #in~cond; {6001#false} is VALID [2018-11-23 12:05:40,203 INFO L273 TraceCheckUtils]: 49: Hoare triple {6001#false} assume 0 == ~cond; {6001#false} is VALID [2018-11-23 12:05:40,204 INFO L273 TraceCheckUtils]: 50: Hoare triple {6001#false} assume !false; {6001#false} is VALID [2018-11-23 12:05:40,207 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:40,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:40,207 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-23 12:05:40,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:40,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:40,443 INFO L256 TraceCheckUtils]: 0: Hoare triple {6000#true} call ULTIMATE.init(); {6000#true} is VALID [2018-11-23 12:05:40,443 INFO L273 TraceCheckUtils]: 1: Hoare triple {6000#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6000#true} is VALID [2018-11-23 12:05:40,443 INFO L273 TraceCheckUtils]: 2: Hoare triple {6000#true} assume true; {6000#true} is VALID [2018-11-23 12:05:40,444 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6000#true} {6000#true} #49#return; {6000#true} is VALID [2018-11-23 12:05:40,444 INFO L256 TraceCheckUtils]: 4: Hoare triple {6000#true} call #t~ret5 := main(); {6000#true} is VALID [2018-11-23 12:05:40,445 INFO L273 TraceCheckUtils]: 5: Hoare triple {6000#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {6040#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:40,445 INFO L273 TraceCheckUtils]: 6: Hoare triple {6040#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6040#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:40,446 INFO L273 TraceCheckUtils]: 7: Hoare triple {6040#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6003#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:40,446 INFO L273 TraceCheckUtils]: 8: Hoare triple {6003#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6003#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:40,447 INFO L273 TraceCheckUtils]: 9: Hoare triple {6003#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6004#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:40,447 INFO L273 TraceCheckUtils]: 10: Hoare triple {6004#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6004#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:40,447 INFO L273 TraceCheckUtils]: 11: Hoare triple {6004#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6005#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:40,448 INFO L273 TraceCheckUtils]: 12: Hoare triple {6005#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6005#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:40,448 INFO L273 TraceCheckUtils]: 13: Hoare triple {6005#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6006#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:40,449 INFO L273 TraceCheckUtils]: 14: Hoare triple {6006#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6006#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:40,450 INFO L273 TraceCheckUtils]: 15: Hoare triple {6006#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6007#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:40,450 INFO L273 TraceCheckUtils]: 16: Hoare triple {6007#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6007#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:40,451 INFO L273 TraceCheckUtils]: 17: Hoare triple {6007#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6008#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:40,452 INFO L273 TraceCheckUtils]: 18: Hoare triple {6008#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6008#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:40,452 INFO L273 TraceCheckUtils]: 19: Hoare triple {6008#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6009#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:40,453 INFO L273 TraceCheckUtils]: 20: Hoare triple {6009#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6009#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:40,454 INFO L273 TraceCheckUtils]: 21: Hoare triple {6009#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6010#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:40,454 INFO L273 TraceCheckUtils]: 22: Hoare triple {6010#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6010#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:40,455 INFO L273 TraceCheckUtils]: 23: Hoare triple {6010#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6011#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:40,456 INFO L273 TraceCheckUtils]: 24: Hoare triple {6011#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6011#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:40,456 INFO L273 TraceCheckUtils]: 25: Hoare triple {6011#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6012#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:40,457 INFO L273 TraceCheckUtils]: 26: Hoare triple {6012#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6012#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:40,458 INFO L273 TraceCheckUtils]: 27: Hoare triple {6012#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6013#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:40,458 INFO L273 TraceCheckUtils]: 28: Hoare triple {6013#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6013#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:40,459 INFO L273 TraceCheckUtils]: 29: Hoare triple {6013#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6014#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:40,460 INFO L273 TraceCheckUtils]: 30: Hoare triple {6014#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6014#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:40,460 INFO L273 TraceCheckUtils]: 31: Hoare triple {6014#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6015#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:40,461 INFO L273 TraceCheckUtils]: 32: Hoare triple {6015#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6015#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:40,462 INFO L273 TraceCheckUtils]: 33: Hoare triple {6015#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6016#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:40,462 INFO L273 TraceCheckUtils]: 34: Hoare triple {6016#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6016#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:40,463 INFO L273 TraceCheckUtils]: 35: Hoare triple {6016#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6017#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:40,463 INFO L273 TraceCheckUtils]: 36: Hoare triple {6017#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6017#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:40,464 INFO L273 TraceCheckUtils]: 37: Hoare triple {6017#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6018#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:40,465 INFO L273 TraceCheckUtils]: 38: Hoare triple {6018#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6018#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:40,466 INFO L273 TraceCheckUtils]: 39: Hoare triple {6018#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6019#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:40,466 INFO L273 TraceCheckUtils]: 40: Hoare triple {6019#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6019#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:40,467 INFO L273 TraceCheckUtils]: 41: Hoare triple {6019#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6020#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:40,467 INFO L273 TraceCheckUtils]: 42: Hoare triple {6020#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6020#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:40,468 INFO L273 TraceCheckUtils]: 43: Hoare triple {6020#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6021#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:40,469 INFO L273 TraceCheckUtils]: 44: Hoare triple {6021#(<= main_~i~0 19)} assume !(~i~0 < 50000); {6001#false} is VALID [2018-11-23 12:05:40,469 INFO L273 TraceCheckUtils]: 45: Hoare triple {6001#false} havoc ~x~0;~x~0 := 0; {6001#false} is VALID [2018-11-23 12:05:40,469 INFO L273 TraceCheckUtils]: 46: Hoare triple {6001#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {6001#false} is VALID [2018-11-23 12:05:40,470 INFO L256 TraceCheckUtils]: 47: Hoare triple {6001#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {6001#false} is VALID [2018-11-23 12:05:40,470 INFO L273 TraceCheckUtils]: 48: Hoare triple {6001#false} ~cond := #in~cond; {6001#false} is VALID [2018-11-23 12:05:40,470 INFO L273 TraceCheckUtils]: 49: Hoare triple {6001#false} assume 0 == ~cond; {6001#false} is VALID [2018-11-23 12:05:40,470 INFO L273 TraceCheckUtils]: 50: Hoare triple {6001#false} assume !false; {6001#false} is VALID [2018-11-23 12:05:40,473 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:40,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:40,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 12:05:40,494 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 51 [2018-11-23 12:05:40,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:40,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:05:40,551 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-23 12:05:40,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:05:40,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:05:40,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:05:40,553 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 23 states. [2018-11-23 12:05:40,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:40,772 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-11-23 12:05:40,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 12:05:40,772 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 51 [2018-11-23 12:05:40,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:40,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:05:40,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 72 transitions. [2018-11-23 12:05:40,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:05:40,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 72 transitions. [2018-11-23 12:05:40,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 72 transitions. [2018-11-23 12:05:40,845 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:40,846 INFO L225 Difference]: With dead ends: 70 [2018-11-23 12:05:40,846 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 12:05:40,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 51 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-23 12:05:40,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 12:05:40,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-11-23 12:05:40,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:40,867 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 58 states. [2018-11-23 12:05:40,867 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 58 states. [2018-11-23 12:05:40,867 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 58 states. [2018-11-23 12:05:40,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:40,869 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-11-23 12:05:40,869 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-11-23 12:05:40,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:40,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:40,869 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 59 states. [2018-11-23 12:05:40,869 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 59 states. [2018-11-23 12:05:40,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:40,871 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-11-23 12:05:40,871 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-11-23 12:05:40,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:40,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:40,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:40,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:40,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 12:05:40,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-11-23 12:05:40,872 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 51 [2018-11-23 12:05:40,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:40,873 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-11-23 12:05:40,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:05:40,873 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-11-23 12:05:40,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 12:05:40,873 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:40,873 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:40,874 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:40,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:40,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1453093686, now seen corresponding path program 20 times [2018-11-23 12:05:40,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:40,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:40,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:40,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:40,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:41,256 INFO L256 TraceCheckUtils]: 0: Hoare triple {6480#true} call ULTIMATE.init(); {6480#true} is VALID [2018-11-23 12:05:41,257 INFO L273 TraceCheckUtils]: 1: Hoare triple {6480#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6480#true} is VALID [2018-11-23 12:05:41,257 INFO L273 TraceCheckUtils]: 2: Hoare triple {6480#true} assume true; {6480#true} is VALID [2018-11-23 12:05:41,257 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6480#true} {6480#true} #49#return; {6480#true} is VALID [2018-11-23 12:05:41,257 INFO L256 TraceCheckUtils]: 4: Hoare triple {6480#true} call #t~ret5 := main(); {6480#true} is VALID [2018-11-23 12:05:41,258 INFO L273 TraceCheckUtils]: 5: Hoare triple {6480#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {6482#(= main_~i~0 0)} is VALID [2018-11-23 12:05:41,258 INFO L273 TraceCheckUtils]: 6: Hoare triple {6482#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6482#(= main_~i~0 0)} is VALID [2018-11-23 12:05:41,259 INFO L273 TraceCheckUtils]: 7: Hoare triple {6482#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6483#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:41,259 INFO L273 TraceCheckUtils]: 8: Hoare triple {6483#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6483#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:41,260 INFO L273 TraceCheckUtils]: 9: Hoare triple {6483#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6484#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:41,260 INFO L273 TraceCheckUtils]: 10: Hoare triple {6484#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6484#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:41,260 INFO L273 TraceCheckUtils]: 11: Hoare triple {6484#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6485#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:41,261 INFO L273 TraceCheckUtils]: 12: Hoare triple {6485#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6485#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:41,261 INFO L273 TraceCheckUtils]: 13: Hoare triple {6485#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6486#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:41,262 INFO L273 TraceCheckUtils]: 14: Hoare triple {6486#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6486#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:41,262 INFO L273 TraceCheckUtils]: 15: Hoare triple {6486#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6487#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:41,263 INFO L273 TraceCheckUtils]: 16: Hoare triple {6487#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6487#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:41,264 INFO L273 TraceCheckUtils]: 17: Hoare triple {6487#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6488#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:41,264 INFO L273 TraceCheckUtils]: 18: Hoare triple {6488#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6488#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:41,265 INFO L273 TraceCheckUtils]: 19: Hoare triple {6488#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6489#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:41,266 INFO L273 TraceCheckUtils]: 20: Hoare triple {6489#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6489#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:41,266 INFO L273 TraceCheckUtils]: 21: Hoare triple {6489#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6490#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:41,267 INFO L273 TraceCheckUtils]: 22: Hoare triple {6490#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6490#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:41,268 INFO L273 TraceCheckUtils]: 23: Hoare triple {6490#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6491#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:41,268 INFO L273 TraceCheckUtils]: 24: Hoare triple {6491#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6491#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:41,269 INFO L273 TraceCheckUtils]: 25: Hoare triple {6491#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6492#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:41,270 INFO L273 TraceCheckUtils]: 26: Hoare triple {6492#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6492#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:41,270 INFO L273 TraceCheckUtils]: 27: Hoare triple {6492#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6493#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:41,271 INFO L273 TraceCheckUtils]: 28: Hoare triple {6493#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6493#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:41,272 INFO L273 TraceCheckUtils]: 29: Hoare triple {6493#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6494#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:41,272 INFO L273 TraceCheckUtils]: 30: Hoare triple {6494#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6494#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:41,273 INFO L273 TraceCheckUtils]: 31: Hoare triple {6494#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6495#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:41,274 INFO L273 TraceCheckUtils]: 32: Hoare triple {6495#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6495#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:41,274 INFO L273 TraceCheckUtils]: 33: Hoare triple {6495#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6496#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:41,275 INFO L273 TraceCheckUtils]: 34: Hoare triple {6496#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6496#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:41,276 INFO L273 TraceCheckUtils]: 35: Hoare triple {6496#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6497#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:41,276 INFO L273 TraceCheckUtils]: 36: Hoare triple {6497#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6497#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:41,277 INFO L273 TraceCheckUtils]: 37: Hoare triple {6497#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6498#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:41,277 INFO L273 TraceCheckUtils]: 38: Hoare triple {6498#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6498#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:41,278 INFO L273 TraceCheckUtils]: 39: Hoare triple {6498#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6499#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:41,279 INFO L273 TraceCheckUtils]: 40: Hoare triple {6499#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6499#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:41,279 INFO L273 TraceCheckUtils]: 41: Hoare triple {6499#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6500#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:41,280 INFO L273 TraceCheckUtils]: 42: Hoare triple {6500#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6500#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:41,281 INFO L273 TraceCheckUtils]: 43: Hoare triple {6500#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6501#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:41,281 INFO L273 TraceCheckUtils]: 44: Hoare triple {6501#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6501#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:41,282 INFO L273 TraceCheckUtils]: 45: Hoare triple {6501#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6502#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:41,283 INFO L273 TraceCheckUtils]: 46: Hoare triple {6502#(<= main_~i~0 20)} assume !(~i~0 < 50000); {6481#false} is VALID [2018-11-23 12:05:41,283 INFO L273 TraceCheckUtils]: 47: Hoare triple {6481#false} havoc ~x~0;~x~0 := 0; {6481#false} is VALID [2018-11-23 12:05:41,283 INFO L273 TraceCheckUtils]: 48: Hoare triple {6481#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {6481#false} is VALID [2018-11-23 12:05:41,284 INFO L256 TraceCheckUtils]: 49: Hoare triple {6481#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {6481#false} is VALID [2018-11-23 12:05:41,284 INFO L273 TraceCheckUtils]: 50: Hoare triple {6481#false} ~cond := #in~cond; {6481#false} is VALID [2018-11-23 12:05:41,284 INFO L273 TraceCheckUtils]: 51: Hoare triple {6481#false} assume 0 == ~cond; {6481#false} is VALID [2018-11-23 12:05:41,284 INFO L273 TraceCheckUtils]: 52: Hoare triple {6481#false} assume !false; {6481#false} is VALID [2018-11-23 12:05:41,287 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:41,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:41,287 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-23 12:05:41,297 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:05:41,323 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:05:41,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:41,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:41,510 INFO L256 TraceCheckUtils]: 0: Hoare triple {6480#true} call ULTIMATE.init(); {6480#true} is VALID [2018-11-23 12:05:41,510 INFO L273 TraceCheckUtils]: 1: Hoare triple {6480#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6480#true} is VALID [2018-11-23 12:05:41,511 INFO L273 TraceCheckUtils]: 2: Hoare triple {6480#true} assume true; {6480#true} is VALID [2018-11-23 12:05:41,511 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6480#true} {6480#true} #49#return; {6480#true} is VALID [2018-11-23 12:05:41,511 INFO L256 TraceCheckUtils]: 4: Hoare triple {6480#true} call #t~ret5 := main(); {6480#true} is VALID [2018-11-23 12:05:41,512 INFO L273 TraceCheckUtils]: 5: Hoare triple {6480#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {6521#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:41,512 INFO L273 TraceCheckUtils]: 6: Hoare triple {6521#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6521#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:41,513 INFO L273 TraceCheckUtils]: 7: Hoare triple {6521#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6483#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:41,513 INFO L273 TraceCheckUtils]: 8: Hoare triple {6483#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6483#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:41,532 INFO L273 TraceCheckUtils]: 9: Hoare triple {6483#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6484#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:41,532 INFO L273 TraceCheckUtils]: 10: Hoare triple {6484#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6484#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:41,533 INFO L273 TraceCheckUtils]: 11: Hoare triple {6484#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6485#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:41,533 INFO L273 TraceCheckUtils]: 12: Hoare triple {6485#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6485#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:41,534 INFO L273 TraceCheckUtils]: 13: Hoare triple {6485#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6486#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:41,534 INFO L273 TraceCheckUtils]: 14: Hoare triple {6486#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6486#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:41,535 INFO L273 TraceCheckUtils]: 15: Hoare triple {6486#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6487#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:41,536 INFO L273 TraceCheckUtils]: 16: Hoare triple {6487#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6487#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:41,536 INFO L273 TraceCheckUtils]: 17: Hoare triple {6487#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6488#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:41,537 INFO L273 TraceCheckUtils]: 18: Hoare triple {6488#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6488#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:41,538 INFO L273 TraceCheckUtils]: 19: Hoare triple {6488#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6489#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:41,538 INFO L273 TraceCheckUtils]: 20: Hoare triple {6489#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6489#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:41,539 INFO L273 TraceCheckUtils]: 21: Hoare triple {6489#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6490#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:41,540 INFO L273 TraceCheckUtils]: 22: Hoare triple {6490#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6490#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:41,540 INFO L273 TraceCheckUtils]: 23: Hoare triple {6490#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6491#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:41,541 INFO L273 TraceCheckUtils]: 24: Hoare triple {6491#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6491#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:41,542 INFO L273 TraceCheckUtils]: 25: Hoare triple {6491#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6492#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:41,542 INFO L273 TraceCheckUtils]: 26: Hoare triple {6492#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6492#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:41,543 INFO L273 TraceCheckUtils]: 27: Hoare triple {6492#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6493#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:41,544 INFO L273 TraceCheckUtils]: 28: Hoare triple {6493#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6493#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:41,544 INFO L273 TraceCheckUtils]: 29: Hoare triple {6493#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6494#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:41,545 INFO L273 TraceCheckUtils]: 30: Hoare triple {6494#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6494#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:41,546 INFO L273 TraceCheckUtils]: 31: Hoare triple {6494#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6495#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:41,546 INFO L273 TraceCheckUtils]: 32: Hoare triple {6495#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6495#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:41,547 INFO L273 TraceCheckUtils]: 33: Hoare triple {6495#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6496#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:41,547 INFO L273 TraceCheckUtils]: 34: Hoare triple {6496#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6496#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:41,548 INFO L273 TraceCheckUtils]: 35: Hoare triple {6496#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6497#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:41,549 INFO L273 TraceCheckUtils]: 36: Hoare triple {6497#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6497#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:41,550 INFO L273 TraceCheckUtils]: 37: Hoare triple {6497#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6498#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:41,550 INFO L273 TraceCheckUtils]: 38: Hoare triple {6498#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6498#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:41,551 INFO L273 TraceCheckUtils]: 39: Hoare triple {6498#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6499#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:41,551 INFO L273 TraceCheckUtils]: 40: Hoare triple {6499#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6499#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:41,552 INFO L273 TraceCheckUtils]: 41: Hoare triple {6499#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6500#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:41,553 INFO L273 TraceCheckUtils]: 42: Hoare triple {6500#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6500#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:41,553 INFO L273 TraceCheckUtils]: 43: Hoare triple {6500#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6501#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:41,554 INFO L273 TraceCheckUtils]: 44: Hoare triple {6501#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6501#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:41,555 INFO L273 TraceCheckUtils]: 45: Hoare triple {6501#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6502#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:41,555 INFO L273 TraceCheckUtils]: 46: Hoare triple {6502#(<= main_~i~0 20)} assume !(~i~0 < 50000); {6481#false} is VALID [2018-11-23 12:05:41,556 INFO L273 TraceCheckUtils]: 47: Hoare triple {6481#false} havoc ~x~0;~x~0 := 0; {6481#false} is VALID [2018-11-23 12:05:41,556 INFO L273 TraceCheckUtils]: 48: Hoare triple {6481#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {6481#false} is VALID [2018-11-23 12:05:41,556 INFO L256 TraceCheckUtils]: 49: Hoare triple {6481#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {6481#false} is VALID [2018-11-23 12:05:41,556 INFO L273 TraceCheckUtils]: 50: Hoare triple {6481#false} ~cond := #in~cond; {6481#false} is VALID [2018-11-23 12:05:41,557 INFO L273 TraceCheckUtils]: 51: Hoare triple {6481#false} assume 0 == ~cond; {6481#false} is VALID [2018-11-23 12:05:41,557 INFO L273 TraceCheckUtils]: 52: Hoare triple {6481#false} assume !false; {6481#false} is VALID [2018-11-23 12:05:41,560 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:41,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:41,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 12:05:41,580 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 53 [2018-11-23 12:05:41,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:41,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:05:41,638 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-23 12:05:41,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:05:41,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:05:41,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:05:41,640 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 24 states. [2018-11-23 12:05:41,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:41,934 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-11-23 12:05:41,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 12:05:41,935 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 53 [2018-11-23 12:05:41,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:41,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:05:41,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 74 transitions. [2018-11-23 12:05:41,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:05:41,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 74 transitions. [2018-11-23 12:05:41,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 74 transitions. [2018-11-23 12:05:42,019 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-23 12:05:42,020 INFO L225 Difference]: With dead ends: 72 [2018-11-23 12:05:42,020 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 12:05:42,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:05:42,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 12:05:42,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-11-23 12:05:42,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:42,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 60 states. [2018-11-23 12:05:42,049 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 60 states. [2018-11-23 12:05:42,050 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 60 states. [2018-11-23 12:05:42,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:42,051 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-11-23 12:05:42,051 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-11-23 12:05:42,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:42,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:42,052 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 61 states. [2018-11-23 12:05:42,052 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 61 states. [2018-11-23 12:05:42,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:42,053 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-11-23 12:05:42,053 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-11-23 12:05:42,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:42,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:42,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:42,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:42,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 12:05:42,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-11-23 12:05:42,055 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 53 [2018-11-23 12:05:42,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:42,055 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-11-23 12:05:42,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:05:42,055 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-23 12:05:42,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 12:05:42,056 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:42,056 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:42,056 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:42,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:42,057 INFO L82 PathProgramCache]: Analyzing trace with hash -528709656, now seen corresponding path program 21 times [2018-11-23 12:05:42,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:42,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:42,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:42,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:42,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:43,014 INFO L256 TraceCheckUtils]: 0: Hoare triple {6977#true} call ULTIMATE.init(); {6977#true} is VALID [2018-11-23 12:05:43,014 INFO L273 TraceCheckUtils]: 1: Hoare triple {6977#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6977#true} is VALID [2018-11-23 12:05:43,014 INFO L273 TraceCheckUtils]: 2: Hoare triple {6977#true} assume true; {6977#true} is VALID [2018-11-23 12:05:43,014 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6977#true} {6977#true} #49#return; {6977#true} is VALID [2018-11-23 12:05:43,015 INFO L256 TraceCheckUtils]: 4: Hoare triple {6977#true} call #t~ret5 := main(); {6977#true} is VALID [2018-11-23 12:05:43,015 INFO L273 TraceCheckUtils]: 5: Hoare triple {6977#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {6979#(= main_~i~0 0)} is VALID [2018-11-23 12:05:43,016 INFO L273 TraceCheckUtils]: 6: Hoare triple {6979#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6979#(= main_~i~0 0)} is VALID [2018-11-23 12:05:43,016 INFO L273 TraceCheckUtils]: 7: Hoare triple {6979#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6980#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:43,017 INFO L273 TraceCheckUtils]: 8: Hoare triple {6980#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6980#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:43,017 INFO L273 TraceCheckUtils]: 9: Hoare triple {6980#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6981#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:43,018 INFO L273 TraceCheckUtils]: 10: Hoare triple {6981#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6981#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:43,018 INFO L273 TraceCheckUtils]: 11: Hoare triple {6981#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6982#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:43,018 INFO L273 TraceCheckUtils]: 12: Hoare triple {6982#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6982#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:43,019 INFO L273 TraceCheckUtils]: 13: Hoare triple {6982#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6983#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:43,020 INFO L273 TraceCheckUtils]: 14: Hoare triple {6983#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6983#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:43,021 INFO L273 TraceCheckUtils]: 15: Hoare triple {6983#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6984#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:43,021 INFO L273 TraceCheckUtils]: 16: Hoare triple {6984#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6984#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:43,022 INFO L273 TraceCheckUtils]: 17: Hoare triple {6984#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6985#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:43,022 INFO L273 TraceCheckUtils]: 18: Hoare triple {6985#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6985#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:43,023 INFO L273 TraceCheckUtils]: 19: Hoare triple {6985#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6986#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:43,024 INFO L273 TraceCheckUtils]: 20: Hoare triple {6986#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6986#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:43,024 INFO L273 TraceCheckUtils]: 21: Hoare triple {6986#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6987#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:43,025 INFO L273 TraceCheckUtils]: 22: Hoare triple {6987#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6987#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:43,026 INFO L273 TraceCheckUtils]: 23: Hoare triple {6987#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6988#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:43,027 INFO L273 TraceCheckUtils]: 24: Hoare triple {6988#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6988#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:43,028 INFO L273 TraceCheckUtils]: 25: Hoare triple {6988#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6989#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:43,028 INFO L273 TraceCheckUtils]: 26: Hoare triple {6989#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6989#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:43,029 INFO L273 TraceCheckUtils]: 27: Hoare triple {6989#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6990#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:43,029 INFO L273 TraceCheckUtils]: 28: Hoare triple {6990#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6990#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:43,030 INFO L273 TraceCheckUtils]: 29: Hoare triple {6990#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6991#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:43,031 INFO L273 TraceCheckUtils]: 30: Hoare triple {6991#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6991#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:43,031 INFO L273 TraceCheckUtils]: 31: Hoare triple {6991#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6992#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:43,032 INFO L273 TraceCheckUtils]: 32: Hoare triple {6992#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6992#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:43,033 INFO L273 TraceCheckUtils]: 33: Hoare triple {6992#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6993#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:43,033 INFO L273 TraceCheckUtils]: 34: Hoare triple {6993#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6993#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:43,034 INFO L273 TraceCheckUtils]: 35: Hoare triple {6993#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6994#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:43,035 INFO L273 TraceCheckUtils]: 36: Hoare triple {6994#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6994#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:43,035 INFO L273 TraceCheckUtils]: 37: Hoare triple {6994#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6995#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:43,036 INFO L273 TraceCheckUtils]: 38: Hoare triple {6995#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6995#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:43,037 INFO L273 TraceCheckUtils]: 39: Hoare triple {6995#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6996#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:43,037 INFO L273 TraceCheckUtils]: 40: Hoare triple {6996#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6996#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:43,038 INFO L273 TraceCheckUtils]: 41: Hoare triple {6996#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6997#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:43,039 INFO L273 TraceCheckUtils]: 42: Hoare triple {6997#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6997#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:43,039 INFO L273 TraceCheckUtils]: 43: Hoare triple {6997#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6998#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:43,040 INFO L273 TraceCheckUtils]: 44: Hoare triple {6998#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6998#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:43,041 INFO L273 TraceCheckUtils]: 45: Hoare triple {6998#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6999#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:43,041 INFO L273 TraceCheckUtils]: 46: Hoare triple {6999#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6999#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:43,042 INFO L273 TraceCheckUtils]: 47: Hoare triple {6999#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7000#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:43,043 INFO L273 TraceCheckUtils]: 48: Hoare triple {7000#(<= main_~i~0 21)} assume !(~i~0 < 50000); {6978#false} is VALID [2018-11-23 12:05:43,043 INFO L273 TraceCheckUtils]: 49: Hoare triple {6978#false} havoc ~x~0;~x~0 := 0; {6978#false} is VALID [2018-11-23 12:05:43,043 INFO L273 TraceCheckUtils]: 50: Hoare triple {6978#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {6978#false} is VALID [2018-11-23 12:05:43,043 INFO L256 TraceCheckUtils]: 51: Hoare triple {6978#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {6978#false} is VALID [2018-11-23 12:05:43,044 INFO L273 TraceCheckUtils]: 52: Hoare triple {6978#false} ~cond := #in~cond; {6978#false} is VALID [2018-11-23 12:05:43,044 INFO L273 TraceCheckUtils]: 53: Hoare triple {6978#false} assume 0 == ~cond; {6978#false} is VALID [2018-11-23 12:05:43,044 INFO L273 TraceCheckUtils]: 54: Hoare triple {6978#false} assume !false; {6978#false} is VALID [2018-11-23 12:05:43,047 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:43,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:43,047 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-23 12:05:43,056 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:05:46,218 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-23 12:05:46,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:46,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:46,541 INFO L256 TraceCheckUtils]: 0: Hoare triple {6977#true} call ULTIMATE.init(); {6977#true} is VALID [2018-11-23 12:05:46,541 INFO L273 TraceCheckUtils]: 1: Hoare triple {6977#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6977#true} is VALID [2018-11-23 12:05:46,541 INFO L273 TraceCheckUtils]: 2: Hoare triple {6977#true} assume true; {6977#true} is VALID [2018-11-23 12:05:46,542 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6977#true} {6977#true} #49#return; {6977#true} is VALID [2018-11-23 12:05:46,542 INFO L256 TraceCheckUtils]: 4: Hoare triple {6977#true} call #t~ret5 := main(); {6977#true} is VALID [2018-11-23 12:05:46,543 INFO L273 TraceCheckUtils]: 5: Hoare triple {6977#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {7019#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:46,543 INFO L273 TraceCheckUtils]: 6: Hoare triple {7019#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7019#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:46,544 INFO L273 TraceCheckUtils]: 7: Hoare triple {7019#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6980#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:46,544 INFO L273 TraceCheckUtils]: 8: Hoare triple {6980#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6980#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:46,544 INFO L273 TraceCheckUtils]: 9: Hoare triple {6980#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6981#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:46,545 INFO L273 TraceCheckUtils]: 10: Hoare triple {6981#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6981#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:46,545 INFO L273 TraceCheckUtils]: 11: Hoare triple {6981#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6982#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:46,546 INFO L273 TraceCheckUtils]: 12: Hoare triple {6982#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6982#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:46,547 INFO L273 TraceCheckUtils]: 13: Hoare triple {6982#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6983#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:46,547 INFO L273 TraceCheckUtils]: 14: Hoare triple {6983#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6983#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:46,548 INFO L273 TraceCheckUtils]: 15: Hoare triple {6983#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6984#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:46,549 INFO L273 TraceCheckUtils]: 16: Hoare triple {6984#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6984#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:46,549 INFO L273 TraceCheckUtils]: 17: Hoare triple {6984#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6985#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:46,550 INFO L273 TraceCheckUtils]: 18: Hoare triple {6985#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6985#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:46,551 INFO L273 TraceCheckUtils]: 19: Hoare triple {6985#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6986#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:46,551 INFO L273 TraceCheckUtils]: 20: Hoare triple {6986#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6986#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:46,552 INFO L273 TraceCheckUtils]: 21: Hoare triple {6986#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6987#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:46,553 INFO L273 TraceCheckUtils]: 22: Hoare triple {6987#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6987#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:46,553 INFO L273 TraceCheckUtils]: 23: Hoare triple {6987#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6988#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:46,554 INFO L273 TraceCheckUtils]: 24: Hoare triple {6988#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6988#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:46,555 INFO L273 TraceCheckUtils]: 25: Hoare triple {6988#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6989#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:46,555 INFO L273 TraceCheckUtils]: 26: Hoare triple {6989#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6989#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:46,556 INFO L273 TraceCheckUtils]: 27: Hoare triple {6989#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6990#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:46,557 INFO L273 TraceCheckUtils]: 28: Hoare triple {6990#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6990#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:46,557 INFO L273 TraceCheckUtils]: 29: Hoare triple {6990#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6991#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:46,558 INFO L273 TraceCheckUtils]: 30: Hoare triple {6991#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6991#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:46,559 INFO L273 TraceCheckUtils]: 31: Hoare triple {6991#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6992#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:46,559 INFO L273 TraceCheckUtils]: 32: Hoare triple {6992#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6992#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:46,560 INFO L273 TraceCheckUtils]: 33: Hoare triple {6992#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6993#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:46,561 INFO L273 TraceCheckUtils]: 34: Hoare triple {6993#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6993#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:46,561 INFO L273 TraceCheckUtils]: 35: Hoare triple {6993#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6994#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:46,562 INFO L273 TraceCheckUtils]: 36: Hoare triple {6994#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6994#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:46,563 INFO L273 TraceCheckUtils]: 37: Hoare triple {6994#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6995#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:46,563 INFO L273 TraceCheckUtils]: 38: Hoare triple {6995#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6995#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:46,564 INFO L273 TraceCheckUtils]: 39: Hoare triple {6995#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6996#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:46,565 INFO L273 TraceCheckUtils]: 40: Hoare triple {6996#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6996#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:46,565 INFO L273 TraceCheckUtils]: 41: Hoare triple {6996#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6997#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:46,566 INFO L273 TraceCheckUtils]: 42: Hoare triple {6997#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6997#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:46,567 INFO L273 TraceCheckUtils]: 43: Hoare triple {6997#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6998#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:46,567 INFO L273 TraceCheckUtils]: 44: Hoare triple {6998#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6998#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:46,568 INFO L273 TraceCheckUtils]: 45: Hoare triple {6998#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6999#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:46,569 INFO L273 TraceCheckUtils]: 46: Hoare triple {6999#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6999#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:46,569 INFO L273 TraceCheckUtils]: 47: Hoare triple {6999#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7000#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:46,570 INFO L273 TraceCheckUtils]: 48: Hoare triple {7000#(<= main_~i~0 21)} assume !(~i~0 < 50000); {6978#false} is VALID [2018-11-23 12:05:46,570 INFO L273 TraceCheckUtils]: 49: Hoare triple {6978#false} havoc ~x~0;~x~0 := 0; {6978#false} is VALID [2018-11-23 12:05:46,571 INFO L273 TraceCheckUtils]: 50: Hoare triple {6978#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {6978#false} is VALID [2018-11-23 12:05:46,571 INFO L256 TraceCheckUtils]: 51: Hoare triple {6978#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {6978#false} is VALID [2018-11-23 12:05:46,571 INFO L273 TraceCheckUtils]: 52: Hoare triple {6978#false} ~cond := #in~cond; {6978#false} is VALID [2018-11-23 12:05:46,571 INFO L273 TraceCheckUtils]: 53: Hoare triple {6978#false} assume 0 == ~cond; {6978#false} is VALID [2018-11-23 12:05:46,571 INFO L273 TraceCheckUtils]: 54: Hoare triple {6978#false} assume !false; {6978#false} is VALID [2018-11-23 12:05:46,575 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:46,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:46,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-23 12:05:46,597 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 55 [2018-11-23 12:05:46,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:46,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 12:05:46,656 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:46,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 12:05:46,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 12:05:46,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:05:46,658 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 25 states. [2018-11-23 12:05:47,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:47,214 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2018-11-23 12:05:47,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 12:05:47,214 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 55 [2018-11-23 12:05:47,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:47,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:05:47,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 76 transitions. [2018-11-23 12:05:47,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:05:47,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 76 transitions. [2018-11-23 12:05:47,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 76 transitions. [2018-11-23 12:05:47,931 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:47,933 INFO L225 Difference]: With dead ends: 74 [2018-11-23 12:05:47,933 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 12:05:47,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:05:47,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 12:05:48,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-11-23 12:05:48,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:48,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 62 states. [2018-11-23 12:05:48,033 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 62 states. [2018-11-23 12:05:48,033 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 62 states. [2018-11-23 12:05:48,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:48,034 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-11-23 12:05:48,034 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-11-23 12:05:48,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:48,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:48,035 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 63 states. [2018-11-23 12:05:48,035 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 63 states. [2018-11-23 12:05:48,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:48,036 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-11-23 12:05:48,036 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-11-23 12:05:48,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:48,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:48,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:48,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:48,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 12:05:48,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2018-11-23 12:05:48,038 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 55 [2018-11-23 12:05:48,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:48,039 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2018-11-23 12:05:48,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 12:05:48,039 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2018-11-23 12:05:48,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 12:05:48,040 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:48,040 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:48,040 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:48,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:48,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1253887098, now seen corresponding path program 22 times [2018-11-23 12:05:48,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:48,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:48,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:48,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:48,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:48,608 INFO L256 TraceCheckUtils]: 0: Hoare triple {7491#true} call ULTIMATE.init(); {7491#true} is VALID [2018-11-23 12:05:48,609 INFO L273 TraceCheckUtils]: 1: Hoare triple {7491#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7491#true} is VALID [2018-11-23 12:05:48,609 INFO L273 TraceCheckUtils]: 2: Hoare triple {7491#true} assume true; {7491#true} is VALID [2018-11-23 12:05:48,609 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7491#true} {7491#true} #49#return; {7491#true} is VALID [2018-11-23 12:05:48,610 INFO L256 TraceCheckUtils]: 4: Hoare triple {7491#true} call #t~ret5 := main(); {7491#true} is VALID [2018-11-23 12:05:48,610 INFO L273 TraceCheckUtils]: 5: Hoare triple {7491#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {7493#(= main_~i~0 0)} is VALID [2018-11-23 12:05:48,610 INFO L273 TraceCheckUtils]: 6: Hoare triple {7493#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7493#(= main_~i~0 0)} is VALID [2018-11-23 12:05:48,611 INFO L273 TraceCheckUtils]: 7: Hoare triple {7493#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7494#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:48,611 INFO L273 TraceCheckUtils]: 8: Hoare triple {7494#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7494#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:48,612 INFO L273 TraceCheckUtils]: 9: Hoare triple {7494#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7495#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:48,612 INFO L273 TraceCheckUtils]: 10: Hoare triple {7495#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7495#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:48,613 INFO L273 TraceCheckUtils]: 11: Hoare triple {7495#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7496#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:48,613 INFO L273 TraceCheckUtils]: 12: Hoare triple {7496#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7496#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:48,613 INFO L273 TraceCheckUtils]: 13: Hoare triple {7496#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7497#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:48,614 INFO L273 TraceCheckUtils]: 14: Hoare triple {7497#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7497#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:48,614 INFO L273 TraceCheckUtils]: 15: Hoare triple {7497#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7498#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:48,615 INFO L273 TraceCheckUtils]: 16: Hoare triple {7498#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7498#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:48,616 INFO L273 TraceCheckUtils]: 17: Hoare triple {7498#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7499#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:48,616 INFO L273 TraceCheckUtils]: 18: Hoare triple {7499#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7499#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:48,617 INFO L273 TraceCheckUtils]: 19: Hoare triple {7499#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7500#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:48,617 INFO L273 TraceCheckUtils]: 20: Hoare triple {7500#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7500#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:48,618 INFO L273 TraceCheckUtils]: 21: Hoare triple {7500#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7501#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:48,619 INFO L273 TraceCheckUtils]: 22: Hoare triple {7501#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7501#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:48,619 INFO L273 TraceCheckUtils]: 23: Hoare triple {7501#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7502#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:48,620 INFO L273 TraceCheckUtils]: 24: Hoare triple {7502#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7502#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:48,621 INFO L273 TraceCheckUtils]: 25: Hoare triple {7502#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7503#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:48,621 INFO L273 TraceCheckUtils]: 26: Hoare triple {7503#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7503#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:48,622 INFO L273 TraceCheckUtils]: 27: Hoare triple {7503#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7504#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:48,623 INFO L273 TraceCheckUtils]: 28: Hoare triple {7504#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7504#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:48,623 INFO L273 TraceCheckUtils]: 29: Hoare triple {7504#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7505#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:48,624 INFO L273 TraceCheckUtils]: 30: Hoare triple {7505#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7505#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:48,625 INFO L273 TraceCheckUtils]: 31: Hoare triple {7505#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7506#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:48,625 INFO L273 TraceCheckUtils]: 32: Hoare triple {7506#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7506#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:48,626 INFO L273 TraceCheckUtils]: 33: Hoare triple {7506#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7507#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:48,627 INFO L273 TraceCheckUtils]: 34: Hoare triple {7507#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7507#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:48,627 INFO L273 TraceCheckUtils]: 35: Hoare triple {7507#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7508#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:48,628 INFO L273 TraceCheckUtils]: 36: Hoare triple {7508#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7508#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:48,629 INFO L273 TraceCheckUtils]: 37: Hoare triple {7508#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7509#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:48,629 INFO L273 TraceCheckUtils]: 38: Hoare triple {7509#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7509#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:48,630 INFO L273 TraceCheckUtils]: 39: Hoare triple {7509#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7510#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:48,630 INFO L273 TraceCheckUtils]: 40: Hoare triple {7510#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7510#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:48,631 INFO L273 TraceCheckUtils]: 41: Hoare triple {7510#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7511#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:48,632 INFO L273 TraceCheckUtils]: 42: Hoare triple {7511#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7511#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:48,633 INFO L273 TraceCheckUtils]: 43: Hoare triple {7511#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7512#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:48,633 INFO L273 TraceCheckUtils]: 44: Hoare triple {7512#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7512#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:48,634 INFO L273 TraceCheckUtils]: 45: Hoare triple {7512#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7513#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:48,634 INFO L273 TraceCheckUtils]: 46: Hoare triple {7513#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7513#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:48,635 INFO L273 TraceCheckUtils]: 47: Hoare triple {7513#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7514#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:48,636 INFO L273 TraceCheckUtils]: 48: Hoare triple {7514#(<= main_~i~0 21)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7514#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:48,636 INFO L273 TraceCheckUtils]: 49: Hoare triple {7514#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7515#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:48,637 INFO L273 TraceCheckUtils]: 50: Hoare triple {7515#(<= main_~i~0 22)} assume !(~i~0 < 50000); {7492#false} is VALID [2018-11-23 12:05:48,637 INFO L273 TraceCheckUtils]: 51: Hoare triple {7492#false} havoc ~x~0;~x~0 := 0; {7492#false} is VALID [2018-11-23 12:05:48,638 INFO L273 TraceCheckUtils]: 52: Hoare triple {7492#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {7492#false} is VALID [2018-11-23 12:05:48,638 INFO L256 TraceCheckUtils]: 53: Hoare triple {7492#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {7492#false} is VALID [2018-11-23 12:05:48,638 INFO L273 TraceCheckUtils]: 54: Hoare triple {7492#false} ~cond := #in~cond; {7492#false} is VALID [2018-11-23 12:05:48,638 INFO L273 TraceCheckUtils]: 55: Hoare triple {7492#false} assume 0 == ~cond; {7492#false} is VALID [2018-11-23 12:05:48,638 INFO L273 TraceCheckUtils]: 56: Hoare triple {7492#false} assume !false; {7492#false} is VALID [2018-11-23 12:05:48,642 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:48,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:48,643 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-23 12:05:48,651 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:05:48,676 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:05:48,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:48,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:49,017 INFO L256 TraceCheckUtils]: 0: Hoare triple {7491#true} call ULTIMATE.init(); {7491#true} is VALID [2018-11-23 12:05:49,018 INFO L273 TraceCheckUtils]: 1: Hoare triple {7491#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7491#true} is VALID [2018-11-23 12:05:49,018 INFO L273 TraceCheckUtils]: 2: Hoare triple {7491#true} assume true; {7491#true} is VALID [2018-11-23 12:05:49,018 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7491#true} {7491#true} #49#return; {7491#true} is VALID [2018-11-23 12:05:49,018 INFO L256 TraceCheckUtils]: 4: Hoare triple {7491#true} call #t~ret5 := main(); {7491#true} is VALID [2018-11-23 12:05:49,019 INFO L273 TraceCheckUtils]: 5: Hoare triple {7491#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {7534#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:49,019 INFO L273 TraceCheckUtils]: 6: Hoare triple {7534#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7534#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:49,020 INFO L273 TraceCheckUtils]: 7: Hoare triple {7534#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7494#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:49,020 INFO L273 TraceCheckUtils]: 8: Hoare triple {7494#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7494#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:49,021 INFO L273 TraceCheckUtils]: 9: Hoare triple {7494#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7495#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:49,021 INFO L273 TraceCheckUtils]: 10: Hoare triple {7495#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7495#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:49,022 INFO L273 TraceCheckUtils]: 11: Hoare triple {7495#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7496#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:49,022 INFO L273 TraceCheckUtils]: 12: Hoare triple {7496#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7496#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:49,023 INFO L273 TraceCheckUtils]: 13: Hoare triple {7496#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7497#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:49,024 INFO L273 TraceCheckUtils]: 14: Hoare triple {7497#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7497#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:49,024 INFO L273 TraceCheckUtils]: 15: Hoare triple {7497#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7498#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:49,025 INFO L273 TraceCheckUtils]: 16: Hoare triple {7498#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7498#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:49,026 INFO L273 TraceCheckUtils]: 17: Hoare triple {7498#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7499#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:49,026 INFO L273 TraceCheckUtils]: 18: Hoare triple {7499#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7499#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:49,027 INFO L273 TraceCheckUtils]: 19: Hoare triple {7499#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7500#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:49,027 INFO L273 TraceCheckUtils]: 20: Hoare triple {7500#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7500#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:49,028 INFO L273 TraceCheckUtils]: 21: Hoare triple {7500#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7501#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:49,029 INFO L273 TraceCheckUtils]: 22: Hoare triple {7501#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7501#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:49,030 INFO L273 TraceCheckUtils]: 23: Hoare triple {7501#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7502#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:49,030 INFO L273 TraceCheckUtils]: 24: Hoare triple {7502#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7502#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:49,031 INFO L273 TraceCheckUtils]: 25: Hoare triple {7502#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7503#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:49,031 INFO L273 TraceCheckUtils]: 26: Hoare triple {7503#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7503#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:49,032 INFO L273 TraceCheckUtils]: 27: Hoare triple {7503#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7504#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:49,033 INFO L273 TraceCheckUtils]: 28: Hoare triple {7504#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7504#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:49,033 INFO L273 TraceCheckUtils]: 29: Hoare triple {7504#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7505#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:49,034 INFO L273 TraceCheckUtils]: 30: Hoare triple {7505#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7505#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:49,035 INFO L273 TraceCheckUtils]: 31: Hoare triple {7505#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7506#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:49,035 INFO L273 TraceCheckUtils]: 32: Hoare triple {7506#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7506#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:49,036 INFO L273 TraceCheckUtils]: 33: Hoare triple {7506#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7507#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:49,036 INFO L273 TraceCheckUtils]: 34: Hoare triple {7507#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7507#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:49,037 INFO L273 TraceCheckUtils]: 35: Hoare triple {7507#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7508#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:49,038 INFO L273 TraceCheckUtils]: 36: Hoare triple {7508#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7508#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:49,039 INFO L273 TraceCheckUtils]: 37: Hoare triple {7508#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7509#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:49,039 INFO L273 TraceCheckUtils]: 38: Hoare triple {7509#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7509#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:49,040 INFO L273 TraceCheckUtils]: 39: Hoare triple {7509#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7510#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:49,040 INFO L273 TraceCheckUtils]: 40: Hoare triple {7510#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7510#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:49,041 INFO L273 TraceCheckUtils]: 41: Hoare triple {7510#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7511#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:49,042 INFO L273 TraceCheckUtils]: 42: Hoare triple {7511#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7511#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:49,042 INFO L273 TraceCheckUtils]: 43: Hoare triple {7511#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7512#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:49,043 INFO L273 TraceCheckUtils]: 44: Hoare triple {7512#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7512#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:49,044 INFO L273 TraceCheckUtils]: 45: Hoare triple {7512#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7513#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:49,044 INFO L273 TraceCheckUtils]: 46: Hoare triple {7513#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7513#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:49,045 INFO L273 TraceCheckUtils]: 47: Hoare triple {7513#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7514#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:49,045 INFO L273 TraceCheckUtils]: 48: Hoare triple {7514#(<= main_~i~0 21)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7514#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:49,046 INFO L273 TraceCheckUtils]: 49: Hoare triple {7514#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7515#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:49,047 INFO L273 TraceCheckUtils]: 50: Hoare triple {7515#(<= main_~i~0 22)} assume !(~i~0 < 50000); {7492#false} is VALID [2018-11-23 12:05:49,047 INFO L273 TraceCheckUtils]: 51: Hoare triple {7492#false} havoc ~x~0;~x~0 := 0; {7492#false} is VALID [2018-11-23 12:05:49,047 INFO L273 TraceCheckUtils]: 52: Hoare triple {7492#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {7492#false} is VALID [2018-11-23 12:05:49,048 INFO L256 TraceCheckUtils]: 53: Hoare triple {7492#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {7492#false} is VALID [2018-11-23 12:05:49,048 INFO L273 TraceCheckUtils]: 54: Hoare triple {7492#false} ~cond := #in~cond; {7492#false} is VALID [2018-11-23 12:05:49,048 INFO L273 TraceCheckUtils]: 55: Hoare triple {7492#false} assume 0 == ~cond; {7492#false} is VALID [2018-11-23 12:05:49,048 INFO L273 TraceCheckUtils]: 56: Hoare triple {7492#false} assume !false; {7492#false} is VALID [2018-11-23 12:05:49,051 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:49,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:49,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 12:05:49,071 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 57 [2018-11-23 12:05:49,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:49,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:05:49,130 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-23 12:05:49,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:05:49,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:05:49,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:05:49,132 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 26 states. [2018-11-23 12:05:49,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:49,559 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2018-11-23 12:05:49,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 12:05:49,560 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 57 [2018-11-23 12:05:49,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:49,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:05:49,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 78 transitions. [2018-11-23 12:05:49,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:05:49,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 78 transitions. [2018-11-23 12:05:49,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 78 transitions. [2018-11-23 12:05:49,644 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-23 12:05:49,645 INFO L225 Difference]: With dead ends: 76 [2018-11-23 12:05:49,646 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 12:05:49,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 57 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-23 12:05:49,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 12:05:49,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-11-23 12:05:49,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:49,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 64 states. [2018-11-23 12:05:49,670 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 64 states. [2018-11-23 12:05:49,670 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 64 states. [2018-11-23 12:05:49,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:49,671 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-11-23 12:05:49,671 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-11-23 12:05:49,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:49,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:49,672 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 65 states. [2018-11-23 12:05:49,672 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 65 states. [2018-11-23 12:05:49,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:49,673 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-11-23 12:05:49,673 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-11-23 12:05:49,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:49,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:49,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:49,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:49,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 12:05:49,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-11-23 12:05:49,674 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 57 [2018-11-23 12:05:49,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:49,675 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-11-23 12:05:49,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:05:49,675 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-11-23 12:05:49,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 12:05:49,675 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:49,675 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:49,676 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:49,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:49,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1930260388, now seen corresponding path program 23 times [2018-11-23 12:05:49,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:49,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:49,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:49,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:49,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:50,149 INFO L256 TraceCheckUtils]: 0: Hoare triple {8022#true} call ULTIMATE.init(); {8022#true} is VALID [2018-11-23 12:05:50,149 INFO L273 TraceCheckUtils]: 1: Hoare triple {8022#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8022#true} is VALID [2018-11-23 12:05:50,150 INFO L273 TraceCheckUtils]: 2: Hoare triple {8022#true} assume true; {8022#true} is VALID [2018-11-23 12:05:50,150 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8022#true} {8022#true} #49#return; {8022#true} is VALID [2018-11-23 12:05:50,150 INFO L256 TraceCheckUtils]: 4: Hoare triple {8022#true} call #t~ret5 := main(); {8022#true} is VALID [2018-11-23 12:05:50,151 INFO L273 TraceCheckUtils]: 5: Hoare triple {8022#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {8024#(= main_~i~0 0)} is VALID [2018-11-23 12:05:50,151 INFO L273 TraceCheckUtils]: 6: Hoare triple {8024#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8024#(= main_~i~0 0)} is VALID [2018-11-23 12:05:50,151 INFO L273 TraceCheckUtils]: 7: Hoare triple {8024#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8025#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:50,152 INFO L273 TraceCheckUtils]: 8: Hoare triple {8025#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8025#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:50,152 INFO L273 TraceCheckUtils]: 9: Hoare triple {8025#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8026#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:50,153 INFO L273 TraceCheckUtils]: 10: Hoare triple {8026#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8026#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:50,153 INFO L273 TraceCheckUtils]: 11: Hoare triple {8026#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8027#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:50,153 INFO L273 TraceCheckUtils]: 12: Hoare triple {8027#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8027#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:50,154 INFO L273 TraceCheckUtils]: 13: Hoare triple {8027#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8028#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:50,154 INFO L273 TraceCheckUtils]: 14: Hoare triple {8028#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8028#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:50,155 INFO L273 TraceCheckUtils]: 15: Hoare triple {8028#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8029#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:50,156 INFO L273 TraceCheckUtils]: 16: Hoare triple {8029#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8029#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:50,156 INFO L273 TraceCheckUtils]: 17: Hoare triple {8029#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8030#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:50,157 INFO L273 TraceCheckUtils]: 18: Hoare triple {8030#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8030#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:50,158 INFO L273 TraceCheckUtils]: 19: Hoare triple {8030#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8031#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:50,158 INFO L273 TraceCheckUtils]: 20: Hoare triple {8031#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8031#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:50,159 INFO L273 TraceCheckUtils]: 21: Hoare triple {8031#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8032#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:50,159 INFO L273 TraceCheckUtils]: 22: Hoare triple {8032#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8032#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:50,160 INFO L273 TraceCheckUtils]: 23: Hoare triple {8032#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8033#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:50,161 INFO L273 TraceCheckUtils]: 24: Hoare triple {8033#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8033#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:50,161 INFO L273 TraceCheckUtils]: 25: Hoare triple {8033#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8034#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:50,162 INFO L273 TraceCheckUtils]: 26: Hoare triple {8034#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8034#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:50,163 INFO L273 TraceCheckUtils]: 27: Hoare triple {8034#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8035#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:50,163 INFO L273 TraceCheckUtils]: 28: Hoare triple {8035#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8035#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:50,164 INFO L273 TraceCheckUtils]: 29: Hoare triple {8035#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8036#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:50,165 INFO L273 TraceCheckUtils]: 30: Hoare triple {8036#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8036#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:50,165 INFO L273 TraceCheckUtils]: 31: Hoare triple {8036#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8037#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:50,166 INFO L273 TraceCheckUtils]: 32: Hoare triple {8037#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8037#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:50,167 INFO L273 TraceCheckUtils]: 33: Hoare triple {8037#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8038#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:50,167 INFO L273 TraceCheckUtils]: 34: Hoare triple {8038#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8038#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:50,168 INFO L273 TraceCheckUtils]: 35: Hoare triple {8038#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8039#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:50,168 INFO L273 TraceCheckUtils]: 36: Hoare triple {8039#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8039#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:50,169 INFO L273 TraceCheckUtils]: 37: Hoare triple {8039#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8040#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:50,170 INFO L273 TraceCheckUtils]: 38: Hoare triple {8040#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8040#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:50,170 INFO L273 TraceCheckUtils]: 39: Hoare triple {8040#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8041#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:50,171 INFO L273 TraceCheckUtils]: 40: Hoare triple {8041#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8041#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:50,172 INFO L273 TraceCheckUtils]: 41: Hoare triple {8041#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8042#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:50,172 INFO L273 TraceCheckUtils]: 42: Hoare triple {8042#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8042#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:50,173 INFO L273 TraceCheckUtils]: 43: Hoare triple {8042#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8043#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:50,186 INFO L273 TraceCheckUtils]: 44: Hoare triple {8043#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8043#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:50,186 INFO L273 TraceCheckUtils]: 45: Hoare triple {8043#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8044#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:50,187 INFO L273 TraceCheckUtils]: 46: Hoare triple {8044#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8044#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:50,187 INFO L273 TraceCheckUtils]: 47: Hoare triple {8044#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8045#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:50,187 INFO L273 TraceCheckUtils]: 48: Hoare triple {8045#(<= main_~i~0 21)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8045#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:50,188 INFO L273 TraceCheckUtils]: 49: Hoare triple {8045#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8046#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:50,188 INFO L273 TraceCheckUtils]: 50: Hoare triple {8046#(<= main_~i~0 22)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8046#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:50,189 INFO L273 TraceCheckUtils]: 51: Hoare triple {8046#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8047#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:50,189 INFO L273 TraceCheckUtils]: 52: Hoare triple {8047#(<= main_~i~0 23)} assume !(~i~0 < 50000); {8023#false} is VALID [2018-11-23 12:05:50,189 INFO L273 TraceCheckUtils]: 53: Hoare triple {8023#false} havoc ~x~0;~x~0 := 0; {8023#false} is VALID [2018-11-23 12:05:50,189 INFO L273 TraceCheckUtils]: 54: Hoare triple {8023#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {8023#false} is VALID [2018-11-23 12:05:50,189 INFO L256 TraceCheckUtils]: 55: Hoare triple {8023#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {8023#false} is VALID [2018-11-23 12:05:50,190 INFO L273 TraceCheckUtils]: 56: Hoare triple {8023#false} ~cond := #in~cond; {8023#false} is VALID [2018-11-23 12:05:50,190 INFO L273 TraceCheckUtils]: 57: Hoare triple {8023#false} assume 0 == ~cond; {8023#false} is VALID [2018-11-23 12:05:50,190 INFO L273 TraceCheckUtils]: 58: Hoare triple {8023#false} assume !false; {8023#false} is VALID [2018-11-23 12:05:50,193 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:50,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:50,194 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-23 12:05:50,202 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:05:51,978 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-23 12:05:51,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:51,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:52,172 INFO L256 TraceCheckUtils]: 0: Hoare triple {8022#true} call ULTIMATE.init(); {8022#true} is VALID [2018-11-23 12:05:52,173 INFO L273 TraceCheckUtils]: 1: Hoare triple {8022#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8022#true} is VALID [2018-11-23 12:05:52,173 INFO L273 TraceCheckUtils]: 2: Hoare triple {8022#true} assume true; {8022#true} is VALID [2018-11-23 12:05:52,173 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8022#true} {8022#true} #49#return; {8022#true} is VALID [2018-11-23 12:05:52,173 INFO L256 TraceCheckUtils]: 4: Hoare triple {8022#true} call #t~ret5 := main(); {8022#true} is VALID [2018-11-23 12:05:52,174 INFO L273 TraceCheckUtils]: 5: Hoare triple {8022#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {8066#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:52,175 INFO L273 TraceCheckUtils]: 6: Hoare triple {8066#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8066#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:52,175 INFO L273 TraceCheckUtils]: 7: Hoare triple {8066#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8025#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:52,176 INFO L273 TraceCheckUtils]: 8: Hoare triple {8025#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8025#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:52,176 INFO L273 TraceCheckUtils]: 9: Hoare triple {8025#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8026#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:52,176 INFO L273 TraceCheckUtils]: 10: Hoare triple {8026#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8026#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:52,177 INFO L273 TraceCheckUtils]: 11: Hoare triple {8026#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8027#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:52,177 INFO L273 TraceCheckUtils]: 12: Hoare triple {8027#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8027#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:52,178 INFO L273 TraceCheckUtils]: 13: Hoare triple {8027#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8028#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:52,179 INFO L273 TraceCheckUtils]: 14: Hoare triple {8028#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8028#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:52,179 INFO L273 TraceCheckUtils]: 15: Hoare triple {8028#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8029#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:52,180 INFO L273 TraceCheckUtils]: 16: Hoare triple {8029#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8029#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:52,181 INFO L273 TraceCheckUtils]: 17: Hoare triple {8029#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8030#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:52,181 INFO L273 TraceCheckUtils]: 18: Hoare triple {8030#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8030#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:52,182 INFO L273 TraceCheckUtils]: 19: Hoare triple {8030#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8031#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:52,183 INFO L273 TraceCheckUtils]: 20: Hoare triple {8031#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8031#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:52,183 INFO L273 TraceCheckUtils]: 21: Hoare triple {8031#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8032#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:52,184 INFO L273 TraceCheckUtils]: 22: Hoare triple {8032#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8032#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:52,185 INFO L273 TraceCheckUtils]: 23: Hoare triple {8032#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8033#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:52,185 INFO L273 TraceCheckUtils]: 24: Hoare triple {8033#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8033#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:52,186 INFO L273 TraceCheckUtils]: 25: Hoare triple {8033#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8034#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:52,186 INFO L273 TraceCheckUtils]: 26: Hoare triple {8034#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8034#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:52,187 INFO L273 TraceCheckUtils]: 27: Hoare triple {8034#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8035#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:52,188 INFO L273 TraceCheckUtils]: 28: Hoare triple {8035#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8035#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:52,188 INFO L273 TraceCheckUtils]: 29: Hoare triple {8035#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8036#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:52,189 INFO L273 TraceCheckUtils]: 30: Hoare triple {8036#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8036#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:52,190 INFO L273 TraceCheckUtils]: 31: Hoare triple {8036#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8037#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:52,190 INFO L273 TraceCheckUtils]: 32: Hoare triple {8037#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8037#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:52,191 INFO L273 TraceCheckUtils]: 33: Hoare triple {8037#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8038#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:52,192 INFO L273 TraceCheckUtils]: 34: Hoare triple {8038#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8038#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:52,192 INFO L273 TraceCheckUtils]: 35: Hoare triple {8038#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8039#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:52,193 INFO L273 TraceCheckUtils]: 36: Hoare triple {8039#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8039#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:52,194 INFO L273 TraceCheckUtils]: 37: Hoare triple {8039#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8040#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:52,194 INFO L273 TraceCheckUtils]: 38: Hoare triple {8040#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8040#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:52,195 INFO L273 TraceCheckUtils]: 39: Hoare triple {8040#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8041#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:52,196 INFO L273 TraceCheckUtils]: 40: Hoare triple {8041#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8041#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:52,196 INFO L273 TraceCheckUtils]: 41: Hoare triple {8041#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8042#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:52,197 INFO L273 TraceCheckUtils]: 42: Hoare triple {8042#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8042#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:52,198 INFO L273 TraceCheckUtils]: 43: Hoare triple {8042#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8043#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:52,198 INFO L273 TraceCheckUtils]: 44: Hoare triple {8043#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8043#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:52,199 INFO L273 TraceCheckUtils]: 45: Hoare triple {8043#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8044#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:52,199 INFO L273 TraceCheckUtils]: 46: Hoare triple {8044#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8044#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:52,200 INFO L273 TraceCheckUtils]: 47: Hoare triple {8044#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8045#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:52,201 INFO L273 TraceCheckUtils]: 48: Hoare triple {8045#(<= main_~i~0 21)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8045#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:52,201 INFO L273 TraceCheckUtils]: 49: Hoare triple {8045#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8046#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:52,202 INFO L273 TraceCheckUtils]: 50: Hoare triple {8046#(<= main_~i~0 22)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8046#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:52,203 INFO L273 TraceCheckUtils]: 51: Hoare triple {8046#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8047#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:52,203 INFO L273 TraceCheckUtils]: 52: Hoare triple {8047#(<= main_~i~0 23)} assume !(~i~0 < 50000); {8023#false} is VALID [2018-11-23 12:05:52,204 INFO L273 TraceCheckUtils]: 53: Hoare triple {8023#false} havoc ~x~0;~x~0 := 0; {8023#false} is VALID [2018-11-23 12:05:52,204 INFO L273 TraceCheckUtils]: 54: Hoare triple {8023#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {8023#false} is VALID [2018-11-23 12:05:52,204 INFO L256 TraceCheckUtils]: 55: Hoare triple {8023#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {8023#false} is VALID [2018-11-23 12:05:52,204 INFO L273 TraceCheckUtils]: 56: Hoare triple {8023#false} ~cond := #in~cond; {8023#false} is VALID [2018-11-23 12:05:52,204 INFO L273 TraceCheckUtils]: 57: Hoare triple {8023#false} assume 0 == ~cond; {8023#false} is VALID [2018-11-23 12:05:52,205 INFO L273 TraceCheckUtils]: 58: Hoare triple {8023#false} assume !false; {8023#false} is VALID [2018-11-23 12:05:52,209 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:52,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:52,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-23 12:05:52,232 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 59 [2018-11-23 12:05:52,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:52,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 12:05:52,294 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:52,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 12:05:52,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 12:05:52,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:05:52,296 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 27 states. [2018-11-23 12:05:52,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:52,876 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2018-11-23 12:05:52,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 12:05:52,876 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 59 [2018-11-23 12:05:52,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:52,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:05:52,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 80 transitions. [2018-11-23 12:05:52,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:05:52,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 80 transitions. [2018-11-23 12:05:52,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 80 transitions. [2018-11-23 12:05:52,956 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-23 12:05:52,957 INFO L225 Difference]: With dead ends: 78 [2018-11-23 12:05:52,957 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 12:05:52,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 59 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-23 12:05:52,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 12:05:52,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-11-23 12:05:52,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:52,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 66 states. [2018-11-23 12:05:52,982 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 66 states. [2018-11-23 12:05:52,982 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 66 states. [2018-11-23 12:05:52,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:52,983 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-11-23 12:05:52,984 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-11-23 12:05:52,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:52,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:52,984 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 67 states. [2018-11-23 12:05:52,984 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 67 states. [2018-11-23 12:05:52,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:52,986 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-11-23 12:05:52,986 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-11-23 12:05:52,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:52,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:52,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:52,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:52,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 12:05:52,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2018-11-23 12:05:52,988 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 59 [2018-11-23 12:05:52,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:52,988 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2018-11-23 12:05:52,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 12:05:52,988 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-11-23 12:05:52,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 12:05:52,989 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:52,989 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:52,989 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:52,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:52,990 INFO L82 PathProgramCache]: Analyzing trace with hash -415687614, now seen corresponding path program 24 times [2018-11-23 12:05:52,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:52,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:52,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:52,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:52,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:54,022 INFO L256 TraceCheckUtils]: 0: Hoare triple {8570#true} call ULTIMATE.init(); {8570#true} is VALID [2018-11-23 12:05:54,022 INFO L273 TraceCheckUtils]: 1: Hoare triple {8570#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8570#true} is VALID [2018-11-23 12:05:54,022 INFO L273 TraceCheckUtils]: 2: Hoare triple {8570#true} assume true; {8570#true} is VALID [2018-11-23 12:05:54,023 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8570#true} {8570#true} #49#return; {8570#true} is VALID [2018-11-23 12:05:54,023 INFO L256 TraceCheckUtils]: 4: Hoare triple {8570#true} call #t~ret5 := main(); {8570#true} is VALID [2018-11-23 12:05:54,023 INFO L273 TraceCheckUtils]: 5: Hoare triple {8570#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {8572#(= main_~i~0 0)} is VALID [2018-11-23 12:05:54,024 INFO L273 TraceCheckUtils]: 6: Hoare triple {8572#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8572#(= main_~i~0 0)} is VALID [2018-11-23 12:05:54,024 INFO L273 TraceCheckUtils]: 7: Hoare triple {8572#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8573#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:54,025 INFO L273 TraceCheckUtils]: 8: Hoare triple {8573#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8573#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:54,025 INFO L273 TraceCheckUtils]: 9: Hoare triple {8573#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8574#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:54,026 INFO L273 TraceCheckUtils]: 10: Hoare triple {8574#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8574#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:54,026 INFO L273 TraceCheckUtils]: 11: Hoare triple {8574#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8575#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:54,026 INFO L273 TraceCheckUtils]: 12: Hoare triple {8575#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8575#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:54,027 INFO L273 TraceCheckUtils]: 13: Hoare triple {8575#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8576#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:54,027 INFO L273 TraceCheckUtils]: 14: Hoare triple {8576#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8576#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:54,028 INFO L273 TraceCheckUtils]: 15: Hoare triple {8576#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8577#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:54,028 INFO L273 TraceCheckUtils]: 16: Hoare triple {8577#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8577#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:54,029 INFO L273 TraceCheckUtils]: 17: Hoare triple {8577#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8578#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:54,030 INFO L273 TraceCheckUtils]: 18: Hoare triple {8578#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8578#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:54,031 INFO L273 TraceCheckUtils]: 19: Hoare triple {8578#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8579#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:54,031 INFO L273 TraceCheckUtils]: 20: Hoare triple {8579#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8579#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:54,032 INFO L273 TraceCheckUtils]: 21: Hoare triple {8579#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8580#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:54,032 INFO L273 TraceCheckUtils]: 22: Hoare triple {8580#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8580#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:54,033 INFO L273 TraceCheckUtils]: 23: Hoare triple {8580#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8581#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:54,034 INFO L273 TraceCheckUtils]: 24: Hoare triple {8581#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8581#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:54,034 INFO L273 TraceCheckUtils]: 25: Hoare triple {8581#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8582#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:54,035 INFO L273 TraceCheckUtils]: 26: Hoare triple {8582#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8582#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:54,036 INFO L273 TraceCheckUtils]: 27: Hoare triple {8582#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:54,036 INFO L273 TraceCheckUtils]: 28: Hoare triple {8583#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:54,037 INFO L273 TraceCheckUtils]: 29: Hoare triple {8583#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8584#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:54,038 INFO L273 TraceCheckUtils]: 30: Hoare triple {8584#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8584#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:54,038 INFO L273 TraceCheckUtils]: 31: Hoare triple {8584#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8585#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:54,039 INFO L273 TraceCheckUtils]: 32: Hoare triple {8585#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8585#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:54,040 INFO L273 TraceCheckUtils]: 33: Hoare triple {8585#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8586#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:54,040 INFO L273 TraceCheckUtils]: 34: Hoare triple {8586#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8586#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:54,041 INFO L273 TraceCheckUtils]: 35: Hoare triple {8586#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8587#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:54,041 INFO L273 TraceCheckUtils]: 36: Hoare triple {8587#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8587#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:54,042 INFO L273 TraceCheckUtils]: 37: Hoare triple {8587#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8588#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:54,043 INFO L273 TraceCheckUtils]: 38: Hoare triple {8588#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8588#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:54,043 INFO L273 TraceCheckUtils]: 39: Hoare triple {8588#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8589#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:54,044 INFO L273 TraceCheckUtils]: 40: Hoare triple {8589#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8589#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:54,045 INFO L273 TraceCheckUtils]: 41: Hoare triple {8589#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8590#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:54,045 INFO L273 TraceCheckUtils]: 42: Hoare triple {8590#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8590#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:54,046 INFO L273 TraceCheckUtils]: 43: Hoare triple {8590#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8591#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:54,047 INFO L273 TraceCheckUtils]: 44: Hoare triple {8591#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8591#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:54,047 INFO L273 TraceCheckUtils]: 45: Hoare triple {8591#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8592#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:54,048 INFO L273 TraceCheckUtils]: 46: Hoare triple {8592#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8592#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:54,049 INFO L273 TraceCheckUtils]: 47: Hoare triple {8592#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8593#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:54,049 INFO L273 TraceCheckUtils]: 48: Hoare triple {8593#(<= main_~i~0 21)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8593#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:54,050 INFO L273 TraceCheckUtils]: 49: Hoare triple {8593#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8594#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:54,050 INFO L273 TraceCheckUtils]: 50: Hoare triple {8594#(<= main_~i~0 22)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8594#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:54,051 INFO L273 TraceCheckUtils]: 51: Hoare triple {8594#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8595#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:54,052 INFO L273 TraceCheckUtils]: 52: Hoare triple {8595#(<= main_~i~0 23)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8595#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:54,053 INFO L273 TraceCheckUtils]: 53: Hoare triple {8595#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8596#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:54,053 INFO L273 TraceCheckUtils]: 54: Hoare triple {8596#(<= main_~i~0 24)} assume !(~i~0 < 50000); {8571#false} is VALID [2018-11-23 12:05:54,053 INFO L273 TraceCheckUtils]: 55: Hoare triple {8571#false} havoc ~x~0;~x~0 := 0; {8571#false} is VALID [2018-11-23 12:05:54,054 INFO L273 TraceCheckUtils]: 56: Hoare triple {8571#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {8571#false} is VALID [2018-11-23 12:05:54,054 INFO L256 TraceCheckUtils]: 57: Hoare triple {8571#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {8571#false} is VALID [2018-11-23 12:05:54,054 INFO L273 TraceCheckUtils]: 58: Hoare triple {8571#false} ~cond := #in~cond; {8571#false} is VALID [2018-11-23 12:05:54,054 INFO L273 TraceCheckUtils]: 59: Hoare triple {8571#false} assume 0 == ~cond; {8571#false} is VALID [2018-11-23 12:05:54,054 INFO L273 TraceCheckUtils]: 60: Hoare triple {8571#false} assume !false; {8571#false} is VALID [2018-11-23 12:05:54,057 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:54,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:54,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 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-23 12:05:54,067 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:06:01,660 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-11-23 12:06:01,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:01,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:01,862 INFO L256 TraceCheckUtils]: 0: Hoare triple {8570#true} call ULTIMATE.init(); {8570#true} is VALID [2018-11-23 12:06:01,863 INFO L273 TraceCheckUtils]: 1: Hoare triple {8570#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8570#true} is VALID [2018-11-23 12:06:01,863 INFO L273 TraceCheckUtils]: 2: Hoare triple {8570#true} assume true; {8570#true} is VALID [2018-11-23 12:06:01,863 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8570#true} {8570#true} #49#return; {8570#true} is VALID [2018-11-23 12:06:01,863 INFO L256 TraceCheckUtils]: 4: Hoare triple {8570#true} call #t~ret5 := main(); {8570#true} is VALID [2018-11-23 12:06:01,864 INFO L273 TraceCheckUtils]: 5: Hoare triple {8570#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {8615#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:01,865 INFO L273 TraceCheckUtils]: 6: Hoare triple {8615#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8615#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:01,866 INFO L273 TraceCheckUtils]: 7: Hoare triple {8615#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8573#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:01,866 INFO L273 TraceCheckUtils]: 8: Hoare triple {8573#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8573#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:01,867 INFO L273 TraceCheckUtils]: 9: Hoare triple {8573#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8574#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:01,867 INFO L273 TraceCheckUtils]: 10: Hoare triple {8574#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8574#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:01,868 INFO L273 TraceCheckUtils]: 11: Hoare triple {8574#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8575#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:01,869 INFO L273 TraceCheckUtils]: 12: Hoare triple {8575#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8575#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:01,870 INFO L273 TraceCheckUtils]: 13: Hoare triple {8575#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8576#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:01,870 INFO L273 TraceCheckUtils]: 14: Hoare triple {8576#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8576#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:01,871 INFO L273 TraceCheckUtils]: 15: Hoare triple {8576#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8577#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:01,871 INFO L273 TraceCheckUtils]: 16: Hoare triple {8577#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8577#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:01,872 INFO L273 TraceCheckUtils]: 17: Hoare triple {8577#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8578#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:01,873 INFO L273 TraceCheckUtils]: 18: Hoare triple {8578#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8578#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:01,873 INFO L273 TraceCheckUtils]: 19: Hoare triple {8578#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8579#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:01,874 INFO L273 TraceCheckUtils]: 20: Hoare triple {8579#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8579#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:01,875 INFO L273 TraceCheckUtils]: 21: Hoare triple {8579#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8580#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:01,875 INFO L273 TraceCheckUtils]: 22: Hoare triple {8580#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8580#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:01,876 INFO L273 TraceCheckUtils]: 23: Hoare triple {8580#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8581#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:01,877 INFO L273 TraceCheckUtils]: 24: Hoare triple {8581#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8581#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:01,877 INFO L273 TraceCheckUtils]: 25: Hoare triple {8581#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8582#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:01,878 INFO L273 TraceCheckUtils]: 26: Hoare triple {8582#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8582#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:01,879 INFO L273 TraceCheckUtils]: 27: Hoare triple {8582#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:01,879 INFO L273 TraceCheckUtils]: 28: Hoare triple {8583#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:01,880 INFO L273 TraceCheckUtils]: 29: Hoare triple {8583#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8584#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:01,880 INFO L273 TraceCheckUtils]: 30: Hoare triple {8584#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8584#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:01,881 INFO L273 TraceCheckUtils]: 31: Hoare triple {8584#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8585#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:01,882 INFO L273 TraceCheckUtils]: 32: Hoare triple {8585#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8585#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:01,883 INFO L273 TraceCheckUtils]: 33: Hoare triple {8585#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8586#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:01,883 INFO L273 TraceCheckUtils]: 34: Hoare triple {8586#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8586#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:01,884 INFO L273 TraceCheckUtils]: 35: Hoare triple {8586#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8587#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:01,884 INFO L273 TraceCheckUtils]: 36: Hoare triple {8587#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8587#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:01,885 INFO L273 TraceCheckUtils]: 37: Hoare triple {8587#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8588#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:01,886 INFO L273 TraceCheckUtils]: 38: Hoare triple {8588#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8588#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:01,886 INFO L273 TraceCheckUtils]: 39: Hoare triple {8588#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8589#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:01,887 INFO L273 TraceCheckUtils]: 40: Hoare triple {8589#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8589#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:01,888 INFO L273 TraceCheckUtils]: 41: Hoare triple {8589#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8590#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:01,888 INFO L273 TraceCheckUtils]: 42: Hoare triple {8590#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8590#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:01,889 INFO L273 TraceCheckUtils]: 43: Hoare triple {8590#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8591#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:01,890 INFO L273 TraceCheckUtils]: 44: Hoare triple {8591#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8591#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:01,890 INFO L273 TraceCheckUtils]: 45: Hoare triple {8591#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8592#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:01,891 INFO L273 TraceCheckUtils]: 46: Hoare triple {8592#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8592#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:01,892 INFO L273 TraceCheckUtils]: 47: Hoare triple {8592#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8593#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:01,892 INFO L273 TraceCheckUtils]: 48: Hoare triple {8593#(<= main_~i~0 21)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8593#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:01,893 INFO L273 TraceCheckUtils]: 49: Hoare triple {8593#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8594#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:01,894 INFO L273 TraceCheckUtils]: 50: Hoare triple {8594#(<= main_~i~0 22)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8594#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:01,894 INFO L273 TraceCheckUtils]: 51: Hoare triple {8594#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8595#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:01,895 INFO L273 TraceCheckUtils]: 52: Hoare triple {8595#(<= main_~i~0 23)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8595#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:01,896 INFO L273 TraceCheckUtils]: 53: Hoare triple {8595#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8596#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:01,896 INFO L273 TraceCheckUtils]: 54: Hoare triple {8596#(<= main_~i~0 24)} assume !(~i~0 < 50000); {8571#false} is VALID [2018-11-23 12:06:01,897 INFO L273 TraceCheckUtils]: 55: Hoare triple {8571#false} havoc ~x~0;~x~0 := 0; {8571#false} is VALID [2018-11-23 12:06:01,897 INFO L273 TraceCheckUtils]: 56: Hoare triple {8571#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {8571#false} is VALID [2018-11-23 12:06:01,897 INFO L256 TraceCheckUtils]: 57: Hoare triple {8571#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {8571#false} is VALID [2018-11-23 12:06:01,897 INFO L273 TraceCheckUtils]: 58: Hoare triple {8571#false} ~cond := #in~cond; {8571#false} is VALID [2018-11-23 12:06:01,897 INFO L273 TraceCheckUtils]: 59: Hoare triple {8571#false} assume 0 == ~cond; {8571#false} is VALID [2018-11-23 12:06:01,898 INFO L273 TraceCheckUtils]: 60: Hoare triple {8571#false} assume !false; {8571#false} is VALID [2018-11-23 12:06:01,902 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:01,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:01,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-11-23 12:06:01,926 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 61 [2018-11-23 12:06:01,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:01,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 12:06:01,998 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:01,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 12:06:01,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 12:06:01,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 12:06:02,000 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 28 states. [2018-11-23 12:06:02,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:02,494 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2018-11-23 12:06:02,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 12:06:02,494 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 61 [2018-11-23 12:06:02,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:02,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:06:02,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 82 transitions. [2018-11-23 12:06:02,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:06:02,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 82 transitions. [2018-11-23 12:06:02,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 82 transitions. [2018-11-23 12:06:02,676 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:02,677 INFO L225 Difference]: With dead ends: 80 [2018-11-23 12:06:02,677 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 12:06:02,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 12:06:02,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 12:06:02,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-11-23 12:06:02,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:02,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 68 states. [2018-11-23 12:06:02,798 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 68 states. [2018-11-23 12:06:02,798 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 68 states. [2018-11-23 12:06:02,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:02,800 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2018-11-23 12:06:02,800 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-11-23 12:06:02,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:02,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:02,801 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 69 states. [2018-11-23 12:06:02,801 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 69 states. [2018-11-23 12:06:02,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:02,802 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2018-11-23 12:06:02,802 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-11-23 12:06:02,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:02,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:02,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:02,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:02,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 12:06:02,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2018-11-23 12:06:02,804 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 61 [2018-11-23 12:06:02,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:02,804 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2018-11-23 12:06:02,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 12:06:02,804 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2018-11-23 12:06:02,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 12:06:02,805 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:02,805 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:02,805 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:02,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:02,806 INFO L82 PathProgramCache]: Analyzing trace with hash -13887136, now seen corresponding path program 25 times [2018-11-23 12:06:02,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:02,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:02,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:02,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:02,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:03,911 INFO L256 TraceCheckUtils]: 0: Hoare triple {9135#true} call ULTIMATE.init(); {9135#true} is VALID [2018-11-23 12:06:03,911 INFO L273 TraceCheckUtils]: 1: Hoare triple {9135#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9135#true} is VALID [2018-11-23 12:06:03,911 INFO L273 TraceCheckUtils]: 2: Hoare triple {9135#true} assume true; {9135#true} is VALID [2018-11-23 12:06:03,912 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9135#true} {9135#true} #49#return; {9135#true} is VALID [2018-11-23 12:06:03,912 INFO L256 TraceCheckUtils]: 4: Hoare triple {9135#true} call #t~ret5 := main(); {9135#true} is VALID [2018-11-23 12:06:03,912 INFO L273 TraceCheckUtils]: 5: Hoare triple {9135#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {9137#(= main_~i~0 0)} is VALID [2018-11-23 12:06:03,912 INFO L273 TraceCheckUtils]: 6: Hoare triple {9137#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9137#(= main_~i~0 0)} is VALID [2018-11-23 12:06:03,913 INFO L273 TraceCheckUtils]: 7: Hoare triple {9137#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9138#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:03,913 INFO L273 TraceCheckUtils]: 8: Hoare triple {9138#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9138#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:03,914 INFO L273 TraceCheckUtils]: 9: Hoare triple {9138#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9139#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:03,914 INFO L273 TraceCheckUtils]: 10: Hoare triple {9139#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9139#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:03,915 INFO L273 TraceCheckUtils]: 11: Hoare triple {9139#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9140#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:03,916 INFO L273 TraceCheckUtils]: 12: Hoare triple {9140#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9140#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:03,916 INFO L273 TraceCheckUtils]: 13: Hoare triple {9140#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9141#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:03,917 INFO L273 TraceCheckUtils]: 14: Hoare triple {9141#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9141#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:03,918 INFO L273 TraceCheckUtils]: 15: Hoare triple {9141#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9142#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:03,918 INFO L273 TraceCheckUtils]: 16: Hoare triple {9142#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9142#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:03,919 INFO L273 TraceCheckUtils]: 17: Hoare triple {9142#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9143#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:03,920 INFO L273 TraceCheckUtils]: 18: Hoare triple {9143#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9143#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:03,920 INFO L273 TraceCheckUtils]: 19: Hoare triple {9143#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9144#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:03,921 INFO L273 TraceCheckUtils]: 20: Hoare triple {9144#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9144#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:03,922 INFO L273 TraceCheckUtils]: 21: Hoare triple {9144#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9145#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:03,922 INFO L273 TraceCheckUtils]: 22: Hoare triple {9145#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9145#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:03,923 INFO L273 TraceCheckUtils]: 23: Hoare triple {9145#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9146#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:03,923 INFO L273 TraceCheckUtils]: 24: Hoare triple {9146#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9146#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:03,924 INFO L273 TraceCheckUtils]: 25: Hoare triple {9146#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9147#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:03,925 INFO L273 TraceCheckUtils]: 26: Hoare triple {9147#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9147#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:03,926 INFO L273 TraceCheckUtils]: 27: Hoare triple {9147#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9148#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:03,926 INFO L273 TraceCheckUtils]: 28: Hoare triple {9148#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9148#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:03,927 INFO L273 TraceCheckUtils]: 29: Hoare triple {9148#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9149#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:03,928 INFO L273 TraceCheckUtils]: 30: Hoare triple {9149#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9149#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:03,928 INFO L273 TraceCheckUtils]: 31: Hoare triple {9149#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9150#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:03,929 INFO L273 TraceCheckUtils]: 32: Hoare triple {9150#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9150#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:03,930 INFO L273 TraceCheckUtils]: 33: Hoare triple {9150#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9151#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:03,930 INFO L273 TraceCheckUtils]: 34: Hoare triple {9151#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9151#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:03,931 INFO L273 TraceCheckUtils]: 35: Hoare triple {9151#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9152#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:03,931 INFO L273 TraceCheckUtils]: 36: Hoare triple {9152#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9152#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:03,932 INFO L273 TraceCheckUtils]: 37: Hoare triple {9152#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9153#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:03,933 INFO L273 TraceCheckUtils]: 38: Hoare triple {9153#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9153#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:03,933 INFO L273 TraceCheckUtils]: 39: Hoare triple {9153#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9154#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:03,934 INFO L273 TraceCheckUtils]: 40: Hoare triple {9154#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9154#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:03,935 INFO L273 TraceCheckUtils]: 41: Hoare triple {9154#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9155#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:03,935 INFO L273 TraceCheckUtils]: 42: Hoare triple {9155#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9155#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:03,936 INFO L273 TraceCheckUtils]: 43: Hoare triple {9155#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9156#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:03,937 INFO L273 TraceCheckUtils]: 44: Hoare triple {9156#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9156#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:03,937 INFO L273 TraceCheckUtils]: 45: Hoare triple {9156#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9157#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:03,938 INFO L273 TraceCheckUtils]: 46: Hoare triple {9157#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9157#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:03,939 INFO L273 TraceCheckUtils]: 47: Hoare triple {9157#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9158#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:03,939 INFO L273 TraceCheckUtils]: 48: Hoare triple {9158#(<= main_~i~0 21)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9158#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:03,940 INFO L273 TraceCheckUtils]: 49: Hoare triple {9158#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9159#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:03,940 INFO L273 TraceCheckUtils]: 50: Hoare triple {9159#(<= main_~i~0 22)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9159#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:03,941 INFO L273 TraceCheckUtils]: 51: Hoare triple {9159#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9160#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:03,942 INFO L273 TraceCheckUtils]: 52: Hoare triple {9160#(<= main_~i~0 23)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9160#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:03,943 INFO L273 TraceCheckUtils]: 53: Hoare triple {9160#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9161#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:03,943 INFO L273 TraceCheckUtils]: 54: Hoare triple {9161#(<= main_~i~0 24)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9161#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:03,944 INFO L273 TraceCheckUtils]: 55: Hoare triple {9161#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9162#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:03,945 INFO L273 TraceCheckUtils]: 56: Hoare triple {9162#(<= main_~i~0 25)} assume !(~i~0 < 50000); {9136#false} is VALID [2018-11-23 12:06:03,945 INFO L273 TraceCheckUtils]: 57: Hoare triple {9136#false} havoc ~x~0;~x~0 := 0; {9136#false} is VALID [2018-11-23 12:06:03,945 INFO L273 TraceCheckUtils]: 58: Hoare triple {9136#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {9136#false} is VALID [2018-11-23 12:06:03,945 INFO L256 TraceCheckUtils]: 59: Hoare triple {9136#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {9136#false} is VALID [2018-11-23 12:06:03,945 INFO L273 TraceCheckUtils]: 60: Hoare triple {9136#false} ~cond := #in~cond; {9136#false} is VALID [2018-11-23 12:06:03,946 INFO L273 TraceCheckUtils]: 61: Hoare triple {9136#false} assume 0 == ~cond; {9136#false} is VALID [2018-11-23 12:06:03,946 INFO L273 TraceCheckUtils]: 62: Hoare triple {9136#false} assume !false; {9136#false} is VALID [2018-11-23 12:06:03,950 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:03,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:03,951 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-23 12:06:03,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:04,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:04,231 INFO L256 TraceCheckUtils]: 0: Hoare triple {9135#true} call ULTIMATE.init(); {9135#true} is VALID [2018-11-23 12:06:04,231 INFO L273 TraceCheckUtils]: 1: Hoare triple {9135#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9135#true} is VALID [2018-11-23 12:06:04,231 INFO L273 TraceCheckUtils]: 2: Hoare triple {9135#true} assume true; {9135#true} is VALID [2018-11-23 12:06:04,231 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9135#true} {9135#true} #49#return; {9135#true} is VALID [2018-11-23 12:06:04,232 INFO L256 TraceCheckUtils]: 4: Hoare triple {9135#true} call #t~ret5 := main(); {9135#true} is VALID [2018-11-23 12:06:04,232 INFO L273 TraceCheckUtils]: 5: Hoare triple {9135#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {9181#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:04,233 INFO L273 TraceCheckUtils]: 6: Hoare triple {9181#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9181#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:04,233 INFO L273 TraceCheckUtils]: 7: Hoare triple {9181#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9138#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:04,234 INFO L273 TraceCheckUtils]: 8: Hoare triple {9138#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9138#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:04,235 INFO L273 TraceCheckUtils]: 9: Hoare triple {9138#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9139#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:04,235 INFO L273 TraceCheckUtils]: 10: Hoare triple {9139#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9139#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:04,236 INFO L273 TraceCheckUtils]: 11: Hoare triple {9139#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9140#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:04,236 INFO L273 TraceCheckUtils]: 12: Hoare triple {9140#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9140#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:04,237 INFO L273 TraceCheckUtils]: 13: Hoare triple {9140#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9141#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:04,237 INFO L273 TraceCheckUtils]: 14: Hoare triple {9141#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9141#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:04,238 INFO L273 TraceCheckUtils]: 15: Hoare triple {9141#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9142#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:04,239 INFO L273 TraceCheckUtils]: 16: Hoare triple {9142#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9142#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:04,239 INFO L273 TraceCheckUtils]: 17: Hoare triple {9142#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9143#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:04,240 INFO L273 TraceCheckUtils]: 18: Hoare triple {9143#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9143#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:04,241 INFO L273 TraceCheckUtils]: 19: Hoare triple {9143#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9144#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:04,241 INFO L273 TraceCheckUtils]: 20: Hoare triple {9144#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9144#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:04,242 INFO L273 TraceCheckUtils]: 21: Hoare triple {9144#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9145#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:04,243 INFO L273 TraceCheckUtils]: 22: Hoare triple {9145#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9145#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:04,243 INFO L273 TraceCheckUtils]: 23: Hoare triple {9145#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9146#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:04,244 INFO L273 TraceCheckUtils]: 24: Hoare triple {9146#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9146#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:04,245 INFO L273 TraceCheckUtils]: 25: Hoare triple {9146#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9147#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:04,245 INFO L273 TraceCheckUtils]: 26: Hoare triple {9147#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9147#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:04,246 INFO L273 TraceCheckUtils]: 27: Hoare triple {9147#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9148#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:04,247 INFO L273 TraceCheckUtils]: 28: Hoare triple {9148#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9148#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:04,247 INFO L273 TraceCheckUtils]: 29: Hoare triple {9148#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9149#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:04,248 INFO L273 TraceCheckUtils]: 30: Hoare triple {9149#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9149#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:04,249 INFO L273 TraceCheckUtils]: 31: Hoare triple {9149#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9150#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:04,249 INFO L273 TraceCheckUtils]: 32: Hoare triple {9150#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9150#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:04,250 INFO L273 TraceCheckUtils]: 33: Hoare triple {9150#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9151#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:04,250 INFO L273 TraceCheckUtils]: 34: Hoare triple {9151#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9151#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:04,251 INFO L273 TraceCheckUtils]: 35: Hoare triple {9151#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9152#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:04,252 INFO L273 TraceCheckUtils]: 36: Hoare triple {9152#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9152#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:04,252 INFO L273 TraceCheckUtils]: 37: Hoare triple {9152#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9153#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:04,253 INFO L273 TraceCheckUtils]: 38: Hoare triple {9153#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9153#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:04,254 INFO L273 TraceCheckUtils]: 39: Hoare triple {9153#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9154#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:04,254 INFO L273 TraceCheckUtils]: 40: Hoare triple {9154#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9154#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:04,255 INFO L273 TraceCheckUtils]: 41: Hoare triple {9154#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9155#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:04,256 INFO L273 TraceCheckUtils]: 42: Hoare triple {9155#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9155#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:04,256 INFO L273 TraceCheckUtils]: 43: Hoare triple {9155#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9156#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:04,257 INFO L273 TraceCheckUtils]: 44: Hoare triple {9156#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9156#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:04,258 INFO L273 TraceCheckUtils]: 45: Hoare triple {9156#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9157#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:04,258 INFO L273 TraceCheckUtils]: 46: Hoare triple {9157#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9157#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:04,259 INFO L273 TraceCheckUtils]: 47: Hoare triple {9157#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9158#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:04,260 INFO L273 TraceCheckUtils]: 48: Hoare triple {9158#(<= main_~i~0 21)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9158#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:04,260 INFO L273 TraceCheckUtils]: 49: Hoare triple {9158#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9159#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:04,261 INFO L273 TraceCheckUtils]: 50: Hoare triple {9159#(<= main_~i~0 22)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9159#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:04,262 INFO L273 TraceCheckUtils]: 51: Hoare triple {9159#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9160#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:04,262 INFO L273 TraceCheckUtils]: 52: Hoare triple {9160#(<= main_~i~0 23)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9160#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:04,263 INFO L273 TraceCheckUtils]: 53: Hoare triple {9160#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9161#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:04,263 INFO L273 TraceCheckUtils]: 54: Hoare triple {9161#(<= main_~i~0 24)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9161#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:04,264 INFO L273 TraceCheckUtils]: 55: Hoare triple {9161#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9162#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:04,265 INFO L273 TraceCheckUtils]: 56: Hoare triple {9162#(<= main_~i~0 25)} assume !(~i~0 < 50000); {9136#false} is VALID [2018-11-23 12:06:04,265 INFO L273 TraceCheckUtils]: 57: Hoare triple {9136#false} havoc ~x~0;~x~0 := 0; {9136#false} is VALID [2018-11-23 12:06:04,265 INFO L273 TraceCheckUtils]: 58: Hoare triple {9136#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {9136#false} is VALID [2018-11-23 12:06:04,266 INFO L256 TraceCheckUtils]: 59: Hoare triple {9136#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {9136#false} is VALID [2018-11-23 12:06:04,266 INFO L273 TraceCheckUtils]: 60: Hoare triple {9136#false} ~cond := #in~cond; {9136#false} is VALID [2018-11-23 12:06:04,266 INFO L273 TraceCheckUtils]: 61: Hoare triple {9136#false} assume 0 == ~cond; {9136#false} is VALID [2018-11-23 12:06:04,266 INFO L273 TraceCheckUtils]: 62: Hoare triple {9136#false} assume !false; {9136#false} is VALID [2018-11-23 12:06:04,269 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:04,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:04,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-23 12:06:04,289 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 63 [2018-11-23 12:06:04,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:04,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 12:06:04,357 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-23 12:06:04,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 12:06:04,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 12:06:04,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:06:04,359 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 29 states. [2018-11-23 12:06:04,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:04,867 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2018-11-23 12:06:04,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 12:06:04,868 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 63 [2018-11-23 12:06:04,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:04,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:06:04,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 84 transitions. [2018-11-23 12:06:04,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:06:04,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 84 transitions. [2018-11-23 12:06:04,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 84 transitions. [2018-11-23 12:06:05,064 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-23 12:06:05,066 INFO L225 Difference]: With dead ends: 82 [2018-11-23 12:06:05,067 INFO L226 Difference]: Without dead ends: 71 [2018-11-23 12:06:05,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:06:05,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-23 12:06:05,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-11-23 12:06:05,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:05,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 70 states. [2018-11-23 12:06:05,092 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 70 states. [2018-11-23 12:06:05,092 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 70 states. [2018-11-23 12:06:05,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:05,093 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2018-11-23 12:06:05,093 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-11-23 12:06:05,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:05,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:05,094 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 71 states. [2018-11-23 12:06:05,094 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 71 states. [2018-11-23 12:06:05,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:05,096 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2018-11-23 12:06:05,096 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-11-23 12:06:05,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:05,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:05,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:05,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:05,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 12:06:05,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-11-23 12:06:05,098 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 63 [2018-11-23 12:06:05,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:05,098 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-11-23 12:06:05,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 12:06:05,099 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-11-23 12:06:05,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 12:06:05,099 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:05,099 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:05,100 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:05,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:05,100 INFO L82 PathProgramCache]: Analyzing trace with hash -430684418, now seen corresponding path program 26 times [2018-11-23 12:06:05,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:05,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:05,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:05,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:05,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:06,382 INFO L256 TraceCheckUtils]: 0: Hoare triple {9717#true} call ULTIMATE.init(); {9717#true} is VALID [2018-11-23 12:06:06,382 INFO L273 TraceCheckUtils]: 1: Hoare triple {9717#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9717#true} is VALID [2018-11-23 12:06:06,382 INFO L273 TraceCheckUtils]: 2: Hoare triple {9717#true} assume true; {9717#true} is VALID [2018-11-23 12:06:06,382 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9717#true} {9717#true} #49#return; {9717#true} is VALID [2018-11-23 12:06:06,383 INFO L256 TraceCheckUtils]: 4: Hoare triple {9717#true} call #t~ret5 := main(); {9717#true} is VALID [2018-11-23 12:06:06,383 INFO L273 TraceCheckUtils]: 5: Hoare triple {9717#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {9719#(= main_~i~0 0)} is VALID [2018-11-23 12:06:06,383 INFO L273 TraceCheckUtils]: 6: Hoare triple {9719#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9719#(= main_~i~0 0)} is VALID [2018-11-23 12:06:06,384 INFO L273 TraceCheckUtils]: 7: Hoare triple {9719#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9720#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:06,384 INFO L273 TraceCheckUtils]: 8: Hoare triple {9720#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9720#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:06,385 INFO L273 TraceCheckUtils]: 9: Hoare triple {9720#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9721#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:06,385 INFO L273 TraceCheckUtils]: 10: Hoare triple {9721#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9721#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:06,386 INFO L273 TraceCheckUtils]: 11: Hoare triple {9721#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9722#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:06,386 INFO L273 TraceCheckUtils]: 12: Hoare triple {9722#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9722#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:06,387 INFO L273 TraceCheckUtils]: 13: Hoare triple {9722#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9723#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:06,388 INFO L273 TraceCheckUtils]: 14: Hoare triple {9723#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9723#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:06,389 INFO L273 TraceCheckUtils]: 15: Hoare triple {9723#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9724#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:06,389 INFO L273 TraceCheckUtils]: 16: Hoare triple {9724#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9724#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:06,390 INFO L273 TraceCheckUtils]: 17: Hoare triple {9724#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9725#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:06,390 INFO L273 TraceCheckUtils]: 18: Hoare triple {9725#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9725#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:06,391 INFO L273 TraceCheckUtils]: 19: Hoare triple {9725#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9726#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:06,392 INFO L273 TraceCheckUtils]: 20: Hoare triple {9726#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9726#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:06,392 INFO L273 TraceCheckUtils]: 21: Hoare triple {9726#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9727#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:06,393 INFO L273 TraceCheckUtils]: 22: Hoare triple {9727#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9727#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:06,394 INFO L273 TraceCheckUtils]: 23: Hoare triple {9727#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9728#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:06,394 INFO L273 TraceCheckUtils]: 24: Hoare triple {9728#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9728#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:06,395 INFO L273 TraceCheckUtils]: 25: Hoare triple {9728#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9729#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:06,396 INFO L273 TraceCheckUtils]: 26: Hoare triple {9729#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9729#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:06,396 INFO L273 TraceCheckUtils]: 27: Hoare triple {9729#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9730#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:06,397 INFO L273 TraceCheckUtils]: 28: Hoare triple {9730#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9730#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:06,398 INFO L273 TraceCheckUtils]: 29: Hoare triple {9730#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9731#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:06,398 INFO L273 TraceCheckUtils]: 30: Hoare triple {9731#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9731#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:06,399 INFO L273 TraceCheckUtils]: 31: Hoare triple {9731#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9732#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:06,399 INFO L273 TraceCheckUtils]: 32: Hoare triple {9732#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9732#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:06,400 INFO L273 TraceCheckUtils]: 33: Hoare triple {9732#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9733#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:06,401 INFO L273 TraceCheckUtils]: 34: Hoare triple {9733#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9733#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:06,402 INFO L273 TraceCheckUtils]: 35: Hoare triple {9733#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9734#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:06,402 INFO L273 TraceCheckUtils]: 36: Hoare triple {9734#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9734#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:06,403 INFO L273 TraceCheckUtils]: 37: Hoare triple {9734#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9735#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:06,403 INFO L273 TraceCheckUtils]: 38: Hoare triple {9735#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9735#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:06,404 INFO L273 TraceCheckUtils]: 39: Hoare triple {9735#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9736#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:06,405 INFO L273 TraceCheckUtils]: 40: Hoare triple {9736#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9736#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:06,405 INFO L273 TraceCheckUtils]: 41: Hoare triple {9736#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9737#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:06,406 INFO L273 TraceCheckUtils]: 42: Hoare triple {9737#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9737#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:06,407 INFO L273 TraceCheckUtils]: 43: Hoare triple {9737#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9738#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:06,407 INFO L273 TraceCheckUtils]: 44: Hoare triple {9738#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9738#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:06,408 INFO L273 TraceCheckUtils]: 45: Hoare triple {9738#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9739#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:06,409 INFO L273 TraceCheckUtils]: 46: Hoare triple {9739#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9739#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:06,409 INFO L273 TraceCheckUtils]: 47: Hoare triple {9739#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9740#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:06,410 INFO L273 TraceCheckUtils]: 48: Hoare triple {9740#(<= main_~i~0 21)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9740#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:06,411 INFO L273 TraceCheckUtils]: 49: Hoare triple {9740#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9741#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:06,411 INFO L273 TraceCheckUtils]: 50: Hoare triple {9741#(<= main_~i~0 22)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9741#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:06,412 INFO L273 TraceCheckUtils]: 51: Hoare triple {9741#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9742#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:06,413 INFO L273 TraceCheckUtils]: 52: Hoare triple {9742#(<= main_~i~0 23)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9742#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:06,413 INFO L273 TraceCheckUtils]: 53: Hoare triple {9742#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9743#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:06,414 INFO L273 TraceCheckUtils]: 54: Hoare triple {9743#(<= main_~i~0 24)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9743#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:06,415 INFO L273 TraceCheckUtils]: 55: Hoare triple {9743#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9744#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:06,415 INFO L273 TraceCheckUtils]: 56: Hoare triple {9744#(<= main_~i~0 25)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9744#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:06,416 INFO L273 TraceCheckUtils]: 57: Hoare triple {9744#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9745#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:06,417 INFO L273 TraceCheckUtils]: 58: Hoare triple {9745#(<= main_~i~0 26)} assume !(~i~0 < 50000); {9718#false} is VALID [2018-11-23 12:06:06,417 INFO L273 TraceCheckUtils]: 59: Hoare triple {9718#false} havoc ~x~0;~x~0 := 0; {9718#false} is VALID [2018-11-23 12:06:06,417 INFO L273 TraceCheckUtils]: 60: Hoare triple {9718#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {9718#false} is VALID [2018-11-23 12:06:06,417 INFO L256 TraceCheckUtils]: 61: Hoare triple {9718#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {9718#false} is VALID [2018-11-23 12:06:06,417 INFO L273 TraceCheckUtils]: 62: Hoare triple {9718#false} ~cond := #in~cond; {9718#false} is VALID [2018-11-23 12:06:06,418 INFO L273 TraceCheckUtils]: 63: Hoare triple {9718#false} assume 0 == ~cond; {9718#false} is VALID [2018-11-23 12:06:06,418 INFO L273 TraceCheckUtils]: 64: Hoare triple {9718#false} assume !false; {9718#false} is VALID [2018-11-23 12:06:06,422 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:06,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:06,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 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-23 12:06:06,431 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:06:06,464 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:06:06,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:06,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:06,715 INFO L256 TraceCheckUtils]: 0: Hoare triple {9717#true} call ULTIMATE.init(); {9717#true} is VALID [2018-11-23 12:06:06,715 INFO L273 TraceCheckUtils]: 1: Hoare triple {9717#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9717#true} is VALID [2018-11-23 12:06:06,716 INFO L273 TraceCheckUtils]: 2: Hoare triple {9717#true} assume true; {9717#true} is VALID [2018-11-23 12:06:06,716 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9717#true} {9717#true} #49#return; {9717#true} is VALID [2018-11-23 12:06:06,716 INFO L256 TraceCheckUtils]: 4: Hoare triple {9717#true} call #t~ret5 := main(); {9717#true} is VALID [2018-11-23 12:06:06,717 INFO L273 TraceCheckUtils]: 5: Hoare triple {9717#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {9764#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:06,717 INFO L273 TraceCheckUtils]: 6: Hoare triple {9764#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9764#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:06,718 INFO L273 TraceCheckUtils]: 7: Hoare triple {9764#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9720#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:06,718 INFO L273 TraceCheckUtils]: 8: Hoare triple {9720#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9720#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:06,719 INFO L273 TraceCheckUtils]: 9: Hoare triple {9720#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9721#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:06,719 INFO L273 TraceCheckUtils]: 10: Hoare triple {9721#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9721#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:06,720 INFO L273 TraceCheckUtils]: 11: Hoare triple {9721#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9722#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:06,720 INFO L273 TraceCheckUtils]: 12: Hoare triple {9722#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9722#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:06,721 INFO L273 TraceCheckUtils]: 13: Hoare triple {9722#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9723#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:06,722 INFO L273 TraceCheckUtils]: 14: Hoare triple {9723#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9723#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:06,723 INFO L273 TraceCheckUtils]: 15: Hoare triple {9723#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9724#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:06,723 INFO L273 TraceCheckUtils]: 16: Hoare triple {9724#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9724#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:06,724 INFO L273 TraceCheckUtils]: 17: Hoare triple {9724#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9725#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:06,725 INFO L273 TraceCheckUtils]: 18: Hoare triple {9725#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9725#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:06,726 INFO L273 TraceCheckUtils]: 19: Hoare triple {9725#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9726#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:06,726 INFO L273 TraceCheckUtils]: 20: Hoare triple {9726#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9726#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:06,727 INFO L273 TraceCheckUtils]: 21: Hoare triple {9726#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9727#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:06,728 INFO L273 TraceCheckUtils]: 22: Hoare triple {9727#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9727#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:06,729 INFO L273 TraceCheckUtils]: 23: Hoare triple {9727#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9728#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:06,729 INFO L273 TraceCheckUtils]: 24: Hoare triple {9728#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9728#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:06,730 INFO L273 TraceCheckUtils]: 25: Hoare triple {9728#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9729#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:06,731 INFO L273 TraceCheckUtils]: 26: Hoare triple {9729#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9729#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:06,732 INFO L273 TraceCheckUtils]: 27: Hoare triple {9729#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9730#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:06,732 INFO L273 TraceCheckUtils]: 28: Hoare triple {9730#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9730#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:06,733 INFO L273 TraceCheckUtils]: 29: Hoare triple {9730#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9731#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:06,734 INFO L273 TraceCheckUtils]: 30: Hoare triple {9731#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9731#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:06,735 INFO L273 TraceCheckUtils]: 31: Hoare triple {9731#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9732#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:06,735 INFO L273 TraceCheckUtils]: 32: Hoare triple {9732#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9732#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:06,736 INFO L273 TraceCheckUtils]: 33: Hoare triple {9732#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9733#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:06,737 INFO L273 TraceCheckUtils]: 34: Hoare triple {9733#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9733#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:06,738 INFO L273 TraceCheckUtils]: 35: Hoare triple {9733#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9734#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:06,738 INFO L273 TraceCheckUtils]: 36: Hoare triple {9734#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9734#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:06,739 INFO L273 TraceCheckUtils]: 37: Hoare triple {9734#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9735#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:06,740 INFO L273 TraceCheckUtils]: 38: Hoare triple {9735#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9735#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:06,741 INFO L273 TraceCheckUtils]: 39: Hoare triple {9735#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9736#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:06,741 INFO L273 TraceCheckUtils]: 40: Hoare triple {9736#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9736#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:06,742 INFO L273 TraceCheckUtils]: 41: Hoare triple {9736#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9737#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:06,743 INFO L273 TraceCheckUtils]: 42: Hoare triple {9737#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9737#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:06,744 INFO L273 TraceCheckUtils]: 43: Hoare triple {9737#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9738#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:06,744 INFO L273 TraceCheckUtils]: 44: Hoare triple {9738#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9738#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:06,745 INFO L273 TraceCheckUtils]: 45: Hoare triple {9738#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9739#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:06,746 INFO L273 TraceCheckUtils]: 46: Hoare triple {9739#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9739#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:06,747 INFO L273 TraceCheckUtils]: 47: Hoare triple {9739#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9740#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:06,748 INFO L273 TraceCheckUtils]: 48: Hoare triple {9740#(<= main_~i~0 21)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9740#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:06,748 INFO L273 TraceCheckUtils]: 49: Hoare triple {9740#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9741#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:06,749 INFO L273 TraceCheckUtils]: 50: Hoare triple {9741#(<= main_~i~0 22)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9741#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:06,750 INFO L273 TraceCheckUtils]: 51: Hoare triple {9741#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9742#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:06,751 INFO L273 TraceCheckUtils]: 52: Hoare triple {9742#(<= main_~i~0 23)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9742#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:06,751 INFO L273 TraceCheckUtils]: 53: Hoare triple {9742#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9743#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:06,752 INFO L273 TraceCheckUtils]: 54: Hoare triple {9743#(<= main_~i~0 24)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9743#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:06,753 INFO L273 TraceCheckUtils]: 55: Hoare triple {9743#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9744#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:06,754 INFO L273 TraceCheckUtils]: 56: Hoare triple {9744#(<= main_~i~0 25)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9744#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:06,754 INFO L273 TraceCheckUtils]: 57: Hoare triple {9744#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9745#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:06,755 INFO L273 TraceCheckUtils]: 58: Hoare triple {9745#(<= main_~i~0 26)} assume !(~i~0 < 50000); {9718#false} is VALID [2018-11-23 12:06:06,756 INFO L273 TraceCheckUtils]: 59: Hoare triple {9718#false} havoc ~x~0;~x~0 := 0; {9718#false} is VALID [2018-11-23 12:06:06,756 INFO L273 TraceCheckUtils]: 60: Hoare triple {9718#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {9718#false} is VALID [2018-11-23 12:06:06,756 INFO L256 TraceCheckUtils]: 61: Hoare triple {9718#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {9718#false} is VALID [2018-11-23 12:06:06,756 INFO L273 TraceCheckUtils]: 62: Hoare triple {9718#false} ~cond := #in~cond; {9718#false} is VALID [2018-11-23 12:06:06,757 INFO L273 TraceCheckUtils]: 63: Hoare triple {9718#false} assume 0 == ~cond; {9718#false} is VALID [2018-11-23 12:06:06,757 INFO L273 TraceCheckUtils]: 64: Hoare triple {9718#false} assume !false; {9718#false} is VALID [2018-11-23 12:06:06,763 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:06,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:06,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-23 12:06:06,783 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 65 [2018-11-23 12:06:06,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:06,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:06:06,862 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-23 12:06:06,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:06:06,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:06:06,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:06:06,864 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 30 states. [2018-11-23 12:06:07,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:07,328 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2018-11-23 12:06:07,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 12:06:07,329 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 65 [2018-11-23 12:06:07,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:07,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:06:07,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 86 transitions. [2018-11-23 12:06:07,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:06:07,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 86 transitions. [2018-11-23 12:06:07,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 86 transitions. [2018-11-23 12:06:07,416 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-23 12:06:07,417 INFO L225 Difference]: With dead ends: 84 [2018-11-23 12:06:07,418 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 12:06:07,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:06:07,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 12:06:07,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-11-23 12:06:07,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:07,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 72 states. [2018-11-23 12:06:07,443 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 72 states. [2018-11-23 12:06:07,443 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 72 states. [2018-11-23 12:06:07,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:07,444 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2018-11-23 12:06:07,445 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-11-23 12:06:07,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:07,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:07,446 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 73 states. [2018-11-23 12:06:07,446 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 73 states. [2018-11-23 12:06:07,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:07,447 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2018-11-23 12:06:07,447 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-11-23 12:06:07,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:07,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:07,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:07,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:07,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 12:06:07,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-11-23 12:06:07,449 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 65 [2018-11-23 12:06:07,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:07,449 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-11-23 12:06:07,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:06:07,449 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-11-23 12:06:07,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 12:06:07,450 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:07,450 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:07,450 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:07,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:07,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1540913892, now seen corresponding path program 27 times [2018-11-23 12:06:07,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:07,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:07,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:07,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:07,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:08,209 INFO L256 TraceCheckUtils]: 0: Hoare triple {10316#true} call ULTIMATE.init(); {10316#true} is VALID [2018-11-23 12:06:08,209 INFO L273 TraceCheckUtils]: 1: Hoare triple {10316#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10316#true} is VALID [2018-11-23 12:06:08,209 INFO L273 TraceCheckUtils]: 2: Hoare triple {10316#true} assume true; {10316#true} is VALID [2018-11-23 12:06:08,210 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10316#true} {10316#true} #49#return; {10316#true} is VALID [2018-11-23 12:06:08,210 INFO L256 TraceCheckUtils]: 4: Hoare triple {10316#true} call #t~ret5 := main(); {10316#true} is VALID [2018-11-23 12:06:08,210 INFO L273 TraceCheckUtils]: 5: Hoare triple {10316#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {10318#(= main_~i~0 0)} is VALID [2018-11-23 12:06:08,211 INFO L273 TraceCheckUtils]: 6: Hoare triple {10318#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10318#(= main_~i~0 0)} is VALID [2018-11-23 12:06:08,212 INFO L273 TraceCheckUtils]: 7: Hoare triple {10318#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10319#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:08,212 INFO L273 TraceCheckUtils]: 8: Hoare triple {10319#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10319#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:08,213 INFO L273 TraceCheckUtils]: 9: Hoare triple {10319#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10320#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:08,213 INFO L273 TraceCheckUtils]: 10: Hoare triple {10320#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10320#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:08,214 INFO L273 TraceCheckUtils]: 11: Hoare triple {10320#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10321#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:08,215 INFO L273 TraceCheckUtils]: 12: Hoare triple {10321#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10321#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:08,215 INFO L273 TraceCheckUtils]: 13: Hoare triple {10321#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10322#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:08,216 INFO L273 TraceCheckUtils]: 14: Hoare triple {10322#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10322#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:08,217 INFO L273 TraceCheckUtils]: 15: Hoare triple {10322#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10323#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:08,217 INFO L273 TraceCheckUtils]: 16: Hoare triple {10323#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10323#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:08,218 INFO L273 TraceCheckUtils]: 17: Hoare triple {10323#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10324#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:08,219 INFO L273 TraceCheckUtils]: 18: Hoare triple {10324#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10324#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:08,219 INFO L273 TraceCheckUtils]: 19: Hoare triple {10324#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10325#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:08,220 INFO L273 TraceCheckUtils]: 20: Hoare triple {10325#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10325#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:08,221 INFO L273 TraceCheckUtils]: 21: Hoare triple {10325#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10326#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:08,221 INFO L273 TraceCheckUtils]: 22: Hoare triple {10326#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10326#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:08,222 INFO L273 TraceCheckUtils]: 23: Hoare triple {10326#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10327#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:08,223 INFO L273 TraceCheckUtils]: 24: Hoare triple {10327#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10327#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:08,223 INFO L273 TraceCheckUtils]: 25: Hoare triple {10327#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10328#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:08,224 INFO L273 TraceCheckUtils]: 26: Hoare triple {10328#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10328#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:08,225 INFO L273 TraceCheckUtils]: 27: Hoare triple {10328#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10329#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:08,225 INFO L273 TraceCheckUtils]: 28: Hoare triple {10329#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10329#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:08,226 INFO L273 TraceCheckUtils]: 29: Hoare triple {10329#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10330#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:08,226 INFO L273 TraceCheckUtils]: 30: Hoare triple {10330#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10330#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:08,227 INFO L273 TraceCheckUtils]: 31: Hoare triple {10330#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10331#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:08,228 INFO L273 TraceCheckUtils]: 32: Hoare triple {10331#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10331#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:08,229 INFO L273 TraceCheckUtils]: 33: Hoare triple {10331#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10332#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:08,229 INFO L273 TraceCheckUtils]: 34: Hoare triple {10332#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10332#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:08,230 INFO L273 TraceCheckUtils]: 35: Hoare triple {10332#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10333#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:08,230 INFO L273 TraceCheckUtils]: 36: Hoare triple {10333#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10333#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:08,231 INFO L273 TraceCheckUtils]: 37: Hoare triple {10333#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10334#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:08,232 INFO L273 TraceCheckUtils]: 38: Hoare triple {10334#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10334#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:08,233 INFO L273 TraceCheckUtils]: 39: Hoare triple {10334#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10335#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:08,233 INFO L273 TraceCheckUtils]: 40: Hoare triple {10335#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10335#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:08,234 INFO L273 TraceCheckUtils]: 41: Hoare triple {10335#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10336#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:08,234 INFO L273 TraceCheckUtils]: 42: Hoare triple {10336#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10336#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:08,235 INFO L273 TraceCheckUtils]: 43: Hoare triple {10336#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:08,236 INFO L273 TraceCheckUtils]: 44: Hoare triple {10337#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10337#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:08,236 INFO L273 TraceCheckUtils]: 45: Hoare triple {10337#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10338#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:08,237 INFO L273 TraceCheckUtils]: 46: Hoare triple {10338#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10338#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:08,238 INFO L273 TraceCheckUtils]: 47: Hoare triple {10338#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10339#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:08,238 INFO L273 TraceCheckUtils]: 48: Hoare triple {10339#(<= main_~i~0 21)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10339#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:08,239 INFO L273 TraceCheckUtils]: 49: Hoare triple {10339#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10340#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:08,240 INFO L273 TraceCheckUtils]: 50: Hoare triple {10340#(<= main_~i~0 22)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10340#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:08,240 INFO L273 TraceCheckUtils]: 51: Hoare triple {10340#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10341#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:08,241 INFO L273 TraceCheckUtils]: 52: Hoare triple {10341#(<= main_~i~0 23)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10341#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:08,242 INFO L273 TraceCheckUtils]: 53: Hoare triple {10341#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10342#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:08,242 INFO L273 TraceCheckUtils]: 54: Hoare triple {10342#(<= main_~i~0 24)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10342#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:08,243 INFO L273 TraceCheckUtils]: 55: Hoare triple {10342#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10343#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:08,244 INFO L273 TraceCheckUtils]: 56: Hoare triple {10343#(<= main_~i~0 25)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10343#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:08,244 INFO L273 TraceCheckUtils]: 57: Hoare triple {10343#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10344#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:08,245 INFO L273 TraceCheckUtils]: 58: Hoare triple {10344#(<= main_~i~0 26)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10344#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:08,246 INFO L273 TraceCheckUtils]: 59: Hoare triple {10344#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10345#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:08,246 INFO L273 TraceCheckUtils]: 60: Hoare triple {10345#(<= main_~i~0 27)} assume !(~i~0 < 50000); {10317#false} is VALID [2018-11-23 12:06:08,247 INFO L273 TraceCheckUtils]: 61: Hoare triple {10317#false} havoc ~x~0;~x~0 := 0; {10317#false} is VALID [2018-11-23 12:06:08,247 INFO L273 TraceCheckUtils]: 62: Hoare triple {10317#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {10317#false} is VALID [2018-11-23 12:06:08,247 INFO L256 TraceCheckUtils]: 63: Hoare triple {10317#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {10317#false} is VALID [2018-11-23 12:06:08,247 INFO L273 TraceCheckUtils]: 64: Hoare triple {10317#false} ~cond := #in~cond; {10317#false} is VALID [2018-11-23 12:06:08,247 INFO L273 TraceCheckUtils]: 65: Hoare triple {10317#false} assume 0 == ~cond; {10317#false} is VALID [2018-11-23 12:06:08,248 INFO L273 TraceCheckUtils]: 66: Hoare triple {10317#false} assume !false; {10317#false} is VALID [2018-11-23 12:06:08,251 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:08,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:08,252 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-23 12:06:08,261 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:06:11,329 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-11-23 12:06:11,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:11,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:11,542 INFO L256 TraceCheckUtils]: 0: Hoare triple {10316#true} call ULTIMATE.init(); {10316#true} is VALID [2018-11-23 12:06:11,542 INFO L273 TraceCheckUtils]: 1: Hoare triple {10316#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10316#true} is VALID [2018-11-23 12:06:11,543 INFO L273 TraceCheckUtils]: 2: Hoare triple {10316#true} assume true; {10316#true} is VALID [2018-11-23 12:06:11,543 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10316#true} {10316#true} #49#return; {10316#true} is VALID [2018-11-23 12:06:11,543 INFO L256 TraceCheckUtils]: 4: Hoare triple {10316#true} call #t~ret5 := main(); {10316#true} is VALID [2018-11-23 12:06:11,544 INFO L273 TraceCheckUtils]: 5: Hoare triple {10316#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {10364#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:11,544 INFO L273 TraceCheckUtils]: 6: Hoare triple {10364#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10364#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:11,544 INFO L273 TraceCheckUtils]: 7: Hoare triple {10364#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10319#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:11,545 INFO L273 TraceCheckUtils]: 8: Hoare triple {10319#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10319#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:11,545 INFO L273 TraceCheckUtils]: 9: Hoare triple {10319#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10320#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:11,546 INFO L273 TraceCheckUtils]: 10: Hoare triple {10320#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10320#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:11,546 INFO L273 TraceCheckUtils]: 11: Hoare triple {10320#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10321#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:11,546 INFO L273 TraceCheckUtils]: 12: Hoare triple {10321#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10321#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:11,547 INFO L273 TraceCheckUtils]: 13: Hoare triple {10321#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10322#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:11,548 INFO L273 TraceCheckUtils]: 14: Hoare triple {10322#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10322#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:11,548 INFO L273 TraceCheckUtils]: 15: Hoare triple {10322#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10323#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:11,549 INFO L273 TraceCheckUtils]: 16: Hoare triple {10323#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10323#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:11,550 INFO L273 TraceCheckUtils]: 17: Hoare triple {10323#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10324#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:11,550 INFO L273 TraceCheckUtils]: 18: Hoare triple {10324#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10324#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:11,551 INFO L273 TraceCheckUtils]: 19: Hoare triple {10324#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10325#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:11,552 INFO L273 TraceCheckUtils]: 20: Hoare triple {10325#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10325#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:11,552 INFO L273 TraceCheckUtils]: 21: Hoare triple {10325#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10326#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:11,553 INFO L273 TraceCheckUtils]: 22: Hoare triple {10326#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10326#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:11,554 INFO L273 TraceCheckUtils]: 23: Hoare triple {10326#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10327#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:11,554 INFO L273 TraceCheckUtils]: 24: Hoare triple {10327#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10327#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:11,555 INFO L273 TraceCheckUtils]: 25: Hoare triple {10327#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10328#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:11,556 INFO L273 TraceCheckUtils]: 26: Hoare triple {10328#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10328#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:11,557 INFO L273 TraceCheckUtils]: 27: Hoare triple {10328#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10329#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:11,557 INFO L273 TraceCheckUtils]: 28: Hoare triple {10329#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10329#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:11,558 INFO L273 TraceCheckUtils]: 29: Hoare triple {10329#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10330#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:11,559 INFO L273 TraceCheckUtils]: 30: Hoare triple {10330#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10330#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:11,560 INFO L273 TraceCheckUtils]: 31: Hoare triple {10330#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10331#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:11,560 INFO L273 TraceCheckUtils]: 32: Hoare triple {10331#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10331#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:11,561 INFO L273 TraceCheckUtils]: 33: Hoare triple {10331#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10332#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:11,561 INFO L273 TraceCheckUtils]: 34: Hoare triple {10332#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10332#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:11,562 INFO L273 TraceCheckUtils]: 35: Hoare triple {10332#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10333#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:11,563 INFO L273 TraceCheckUtils]: 36: Hoare triple {10333#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10333#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:11,563 INFO L273 TraceCheckUtils]: 37: Hoare triple {10333#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10334#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:11,564 INFO L273 TraceCheckUtils]: 38: Hoare triple {10334#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10334#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:11,565 INFO L273 TraceCheckUtils]: 39: Hoare triple {10334#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10335#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:11,565 INFO L273 TraceCheckUtils]: 40: Hoare triple {10335#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10335#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:11,566 INFO L273 TraceCheckUtils]: 41: Hoare triple {10335#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10336#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:11,566 INFO L273 TraceCheckUtils]: 42: Hoare triple {10336#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10336#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:11,567 INFO L273 TraceCheckUtils]: 43: Hoare triple {10336#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10337#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:11,568 INFO L273 TraceCheckUtils]: 44: Hoare triple {10337#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10337#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:11,568 INFO L273 TraceCheckUtils]: 45: Hoare triple {10337#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10338#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:11,569 INFO L273 TraceCheckUtils]: 46: Hoare triple {10338#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10338#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:11,570 INFO L273 TraceCheckUtils]: 47: Hoare triple {10338#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10339#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:11,570 INFO L273 TraceCheckUtils]: 48: Hoare triple {10339#(<= main_~i~0 21)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10339#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:11,571 INFO L273 TraceCheckUtils]: 49: Hoare triple {10339#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10340#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:11,571 INFO L273 TraceCheckUtils]: 50: Hoare triple {10340#(<= main_~i~0 22)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10340#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:11,572 INFO L273 TraceCheckUtils]: 51: Hoare triple {10340#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10341#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:11,573 INFO L273 TraceCheckUtils]: 52: Hoare triple {10341#(<= main_~i~0 23)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10341#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:11,573 INFO L273 TraceCheckUtils]: 53: Hoare triple {10341#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10342#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:11,574 INFO L273 TraceCheckUtils]: 54: Hoare triple {10342#(<= main_~i~0 24)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10342#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:11,575 INFO L273 TraceCheckUtils]: 55: Hoare triple {10342#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10343#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:11,575 INFO L273 TraceCheckUtils]: 56: Hoare triple {10343#(<= main_~i~0 25)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10343#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:11,576 INFO L273 TraceCheckUtils]: 57: Hoare triple {10343#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10344#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:11,576 INFO L273 TraceCheckUtils]: 58: Hoare triple {10344#(<= main_~i~0 26)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10344#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:11,577 INFO L273 TraceCheckUtils]: 59: Hoare triple {10344#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10345#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:11,578 INFO L273 TraceCheckUtils]: 60: Hoare triple {10345#(<= main_~i~0 27)} assume !(~i~0 < 50000); {10317#false} is VALID [2018-11-23 12:06:11,578 INFO L273 TraceCheckUtils]: 61: Hoare triple {10317#false} havoc ~x~0;~x~0 := 0; {10317#false} is VALID [2018-11-23 12:06:11,578 INFO L273 TraceCheckUtils]: 62: Hoare triple {10317#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {10317#false} is VALID [2018-11-23 12:06:11,578 INFO L256 TraceCheckUtils]: 63: Hoare triple {10317#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {10317#false} is VALID [2018-11-23 12:06:11,578 INFO L273 TraceCheckUtils]: 64: Hoare triple {10317#false} ~cond := #in~cond; {10317#false} is VALID [2018-11-23 12:06:11,579 INFO L273 TraceCheckUtils]: 65: Hoare triple {10317#false} assume 0 == ~cond; {10317#false} is VALID [2018-11-23 12:06:11,579 INFO L273 TraceCheckUtils]: 66: Hoare triple {10317#false} assume !false; {10317#false} is VALID [2018-11-23 12:06:11,582 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:11,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:11,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-11-23 12:06:11,603 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 67 [2018-11-23 12:06:11,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:11,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 12:06:11,670 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:11,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 12:06:11,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 12:06:11,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:06:11,671 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 31 states. [2018-11-23 12:06:12,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:12,133 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2018-11-23 12:06:12,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 12:06:12,133 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 67 [2018-11-23 12:06:12,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:12,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:06:12,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 88 transitions. [2018-11-23 12:06:12,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:06:12,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 88 transitions. [2018-11-23 12:06:12,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 88 transitions. [2018-11-23 12:06:12,225 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:12,227 INFO L225 Difference]: With dead ends: 86 [2018-11-23 12:06:12,227 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 12:06:12,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:06:12,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 12:06:12,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-11-23 12:06:12,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:12,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 74 states. [2018-11-23 12:06:12,271 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 74 states. [2018-11-23 12:06:12,271 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 74 states. [2018-11-23 12:06:12,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:12,272 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2018-11-23 12:06:12,272 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-11-23 12:06:12,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:12,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:12,273 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 75 states. [2018-11-23 12:06:12,273 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 75 states. [2018-11-23 12:06:12,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:12,274 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2018-11-23 12:06:12,274 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-11-23 12:06:12,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:12,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:12,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:12,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:12,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 12:06:12,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2018-11-23 12:06:12,276 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 67 [2018-11-23 12:06:12,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:12,277 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2018-11-23 12:06:12,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 12:06:12,277 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2018-11-23 12:06:12,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 12:06:12,277 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:12,278 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:12,278 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:12,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:12,278 INFO L82 PathProgramCache]: Analyzing trace with hash 975418298, now seen corresponding path program 28 times [2018-11-23 12:06:12,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:12,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:12,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:12,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:12,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:13,494 INFO L256 TraceCheckUtils]: 0: Hoare triple {10932#true} call ULTIMATE.init(); {10932#true} is VALID [2018-11-23 12:06:13,494 INFO L273 TraceCheckUtils]: 1: Hoare triple {10932#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10932#true} is VALID [2018-11-23 12:06:13,494 INFO L273 TraceCheckUtils]: 2: Hoare triple {10932#true} assume true; {10932#true} is VALID [2018-11-23 12:06:13,495 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10932#true} {10932#true} #49#return; {10932#true} is VALID [2018-11-23 12:06:13,495 INFO L256 TraceCheckUtils]: 4: Hoare triple {10932#true} call #t~ret5 := main(); {10932#true} is VALID [2018-11-23 12:06:13,495 INFO L273 TraceCheckUtils]: 5: Hoare triple {10932#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {10934#(= main_~i~0 0)} is VALID [2018-11-23 12:06:13,496 INFO L273 TraceCheckUtils]: 6: Hoare triple {10934#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10934#(= main_~i~0 0)} is VALID [2018-11-23 12:06:13,497 INFO L273 TraceCheckUtils]: 7: Hoare triple {10934#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10935#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:13,497 INFO L273 TraceCheckUtils]: 8: Hoare triple {10935#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10935#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:13,498 INFO L273 TraceCheckUtils]: 9: Hoare triple {10935#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10936#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:13,499 INFO L273 TraceCheckUtils]: 10: Hoare triple {10936#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10936#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:13,500 INFO L273 TraceCheckUtils]: 11: Hoare triple {10936#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10937#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:13,500 INFO L273 TraceCheckUtils]: 12: Hoare triple {10937#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10937#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:13,501 INFO L273 TraceCheckUtils]: 13: Hoare triple {10937#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10938#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:13,501 INFO L273 TraceCheckUtils]: 14: Hoare triple {10938#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10938#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:13,502 INFO L273 TraceCheckUtils]: 15: Hoare triple {10938#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10939#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:13,503 INFO L273 TraceCheckUtils]: 16: Hoare triple {10939#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10939#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:13,503 INFO L273 TraceCheckUtils]: 17: Hoare triple {10939#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10940#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:13,504 INFO L273 TraceCheckUtils]: 18: Hoare triple {10940#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10940#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:13,505 INFO L273 TraceCheckUtils]: 19: Hoare triple {10940#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10941#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:13,505 INFO L273 TraceCheckUtils]: 20: Hoare triple {10941#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10941#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:13,506 INFO L273 TraceCheckUtils]: 21: Hoare triple {10941#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10942#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:13,507 INFO L273 TraceCheckUtils]: 22: Hoare triple {10942#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10942#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:13,507 INFO L273 TraceCheckUtils]: 23: Hoare triple {10942#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10943#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:13,508 INFO L273 TraceCheckUtils]: 24: Hoare triple {10943#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10943#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:13,509 INFO L273 TraceCheckUtils]: 25: Hoare triple {10943#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10944#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:13,509 INFO L273 TraceCheckUtils]: 26: Hoare triple {10944#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10944#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:13,510 INFO L273 TraceCheckUtils]: 27: Hoare triple {10944#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10945#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:13,511 INFO L273 TraceCheckUtils]: 28: Hoare triple {10945#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10945#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:13,512 INFO L273 TraceCheckUtils]: 29: Hoare triple {10945#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10946#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:13,512 INFO L273 TraceCheckUtils]: 30: Hoare triple {10946#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10946#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:13,513 INFO L273 TraceCheckUtils]: 31: Hoare triple {10946#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10947#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:13,513 INFO L273 TraceCheckUtils]: 32: Hoare triple {10947#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10947#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:13,514 INFO L273 TraceCheckUtils]: 33: Hoare triple {10947#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10948#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:13,515 INFO L273 TraceCheckUtils]: 34: Hoare triple {10948#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10948#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:13,516 INFO L273 TraceCheckUtils]: 35: Hoare triple {10948#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10949#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:13,516 INFO L273 TraceCheckUtils]: 36: Hoare triple {10949#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10949#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:13,517 INFO L273 TraceCheckUtils]: 37: Hoare triple {10949#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10950#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:13,518 INFO L273 TraceCheckUtils]: 38: Hoare triple {10950#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10950#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:13,518 INFO L273 TraceCheckUtils]: 39: Hoare triple {10950#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10951#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:13,519 INFO L273 TraceCheckUtils]: 40: Hoare triple {10951#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10951#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:13,520 INFO L273 TraceCheckUtils]: 41: Hoare triple {10951#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10952#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:13,520 INFO L273 TraceCheckUtils]: 42: Hoare triple {10952#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10952#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:13,521 INFO L273 TraceCheckUtils]: 43: Hoare triple {10952#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10953#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:13,522 INFO L273 TraceCheckUtils]: 44: Hoare triple {10953#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10953#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:13,522 INFO L273 TraceCheckUtils]: 45: Hoare triple {10953#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10954#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:13,523 INFO L273 TraceCheckUtils]: 46: Hoare triple {10954#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10954#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:13,524 INFO L273 TraceCheckUtils]: 47: Hoare triple {10954#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10955#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:13,524 INFO L273 TraceCheckUtils]: 48: Hoare triple {10955#(<= main_~i~0 21)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10955#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:13,525 INFO L273 TraceCheckUtils]: 49: Hoare triple {10955#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10956#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:13,526 INFO L273 TraceCheckUtils]: 50: Hoare triple {10956#(<= main_~i~0 22)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10956#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:13,526 INFO L273 TraceCheckUtils]: 51: Hoare triple {10956#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10957#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:13,527 INFO L273 TraceCheckUtils]: 52: Hoare triple {10957#(<= main_~i~0 23)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10957#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:13,528 INFO L273 TraceCheckUtils]: 53: Hoare triple {10957#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10958#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:13,528 INFO L273 TraceCheckUtils]: 54: Hoare triple {10958#(<= main_~i~0 24)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10958#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:13,529 INFO L273 TraceCheckUtils]: 55: Hoare triple {10958#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10959#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:13,530 INFO L273 TraceCheckUtils]: 56: Hoare triple {10959#(<= main_~i~0 25)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10959#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:13,530 INFO L273 TraceCheckUtils]: 57: Hoare triple {10959#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10960#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:13,531 INFO L273 TraceCheckUtils]: 58: Hoare triple {10960#(<= main_~i~0 26)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10960#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:13,532 INFO L273 TraceCheckUtils]: 59: Hoare triple {10960#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10961#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:13,532 INFO L273 TraceCheckUtils]: 60: Hoare triple {10961#(<= main_~i~0 27)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10961#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:13,533 INFO L273 TraceCheckUtils]: 61: Hoare triple {10961#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10962#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:13,534 INFO L273 TraceCheckUtils]: 62: Hoare triple {10962#(<= main_~i~0 28)} assume !(~i~0 < 50000); {10933#false} is VALID [2018-11-23 12:06:13,534 INFO L273 TraceCheckUtils]: 63: Hoare triple {10933#false} havoc ~x~0;~x~0 := 0; {10933#false} is VALID [2018-11-23 12:06:13,534 INFO L273 TraceCheckUtils]: 64: Hoare triple {10933#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {10933#false} is VALID [2018-11-23 12:06:13,534 INFO L256 TraceCheckUtils]: 65: Hoare triple {10933#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {10933#false} is VALID [2018-11-23 12:06:13,534 INFO L273 TraceCheckUtils]: 66: Hoare triple {10933#false} ~cond := #in~cond; {10933#false} is VALID [2018-11-23 12:06:13,535 INFO L273 TraceCheckUtils]: 67: Hoare triple {10933#false} assume 0 == ~cond; {10933#false} is VALID [2018-11-23 12:06:13,535 INFO L273 TraceCheckUtils]: 68: Hoare triple {10933#false} assume !false; {10933#false} is VALID [2018-11-23 12:06:13,539 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:13,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:13,539 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-23 12:06:13,552 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:06:13,584 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:06:13,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:13,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:13,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:13,811 INFO L256 TraceCheckUtils]: 0: Hoare triple {10932#true} call ULTIMATE.init(); {10932#true} is VALID [2018-11-23 12:06:13,811 INFO L273 TraceCheckUtils]: 1: Hoare triple {10932#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10932#true} is VALID [2018-11-23 12:06:13,812 INFO L273 TraceCheckUtils]: 2: Hoare triple {10932#true} assume true; {10932#true} is VALID [2018-11-23 12:06:13,812 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10932#true} {10932#true} #49#return; {10932#true} is VALID [2018-11-23 12:06:13,812 INFO L256 TraceCheckUtils]: 4: Hoare triple {10932#true} call #t~ret5 := main(); {10932#true} is VALID [2018-11-23 12:06:13,813 INFO L273 TraceCheckUtils]: 5: Hoare triple {10932#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {10981#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:13,814 INFO L273 TraceCheckUtils]: 6: Hoare triple {10981#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10981#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:13,814 INFO L273 TraceCheckUtils]: 7: Hoare triple {10981#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10935#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:13,814 INFO L273 TraceCheckUtils]: 8: Hoare triple {10935#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10935#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:13,815 INFO L273 TraceCheckUtils]: 9: Hoare triple {10935#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10936#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:13,815 INFO L273 TraceCheckUtils]: 10: Hoare triple {10936#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10936#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:13,816 INFO L273 TraceCheckUtils]: 11: Hoare triple {10936#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10937#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:13,816 INFO L273 TraceCheckUtils]: 12: Hoare triple {10937#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10937#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:13,817 INFO L273 TraceCheckUtils]: 13: Hoare triple {10937#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10938#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:13,818 INFO L273 TraceCheckUtils]: 14: Hoare triple {10938#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10938#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:13,818 INFO L273 TraceCheckUtils]: 15: Hoare triple {10938#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10939#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:13,819 INFO L273 TraceCheckUtils]: 16: Hoare triple {10939#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10939#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:13,820 INFO L273 TraceCheckUtils]: 17: Hoare triple {10939#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10940#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:13,820 INFO L273 TraceCheckUtils]: 18: Hoare triple {10940#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10940#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:13,821 INFO L273 TraceCheckUtils]: 19: Hoare triple {10940#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10941#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:13,821 INFO L273 TraceCheckUtils]: 20: Hoare triple {10941#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10941#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:13,822 INFO L273 TraceCheckUtils]: 21: Hoare triple {10941#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10942#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:13,823 INFO L273 TraceCheckUtils]: 22: Hoare triple {10942#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10942#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:13,824 INFO L273 TraceCheckUtils]: 23: Hoare triple {10942#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10943#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:13,824 INFO L273 TraceCheckUtils]: 24: Hoare triple {10943#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10943#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:13,825 INFO L273 TraceCheckUtils]: 25: Hoare triple {10943#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10944#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:13,825 INFO L273 TraceCheckUtils]: 26: Hoare triple {10944#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10944#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:13,826 INFO L273 TraceCheckUtils]: 27: Hoare triple {10944#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10945#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:13,827 INFO L273 TraceCheckUtils]: 28: Hoare triple {10945#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10945#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:13,827 INFO L273 TraceCheckUtils]: 29: Hoare triple {10945#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10946#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:13,828 INFO L273 TraceCheckUtils]: 30: Hoare triple {10946#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10946#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:13,829 INFO L273 TraceCheckUtils]: 31: Hoare triple {10946#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10947#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:13,829 INFO L273 TraceCheckUtils]: 32: Hoare triple {10947#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10947#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:13,830 INFO L273 TraceCheckUtils]: 33: Hoare triple {10947#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10948#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:13,831 INFO L273 TraceCheckUtils]: 34: Hoare triple {10948#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10948#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:13,831 INFO L273 TraceCheckUtils]: 35: Hoare triple {10948#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10949#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:13,832 INFO L273 TraceCheckUtils]: 36: Hoare triple {10949#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10949#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:13,833 INFO L273 TraceCheckUtils]: 37: Hoare triple {10949#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10950#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:13,833 INFO L273 TraceCheckUtils]: 38: Hoare triple {10950#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10950#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:13,834 INFO L273 TraceCheckUtils]: 39: Hoare triple {10950#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10951#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:13,835 INFO L273 TraceCheckUtils]: 40: Hoare triple {10951#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10951#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:13,835 INFO L273 TraceCheckUtils]: 41: Hoare triple {10951#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10952#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:13,836 INFO L273 TraceCheckUtils]: 42: Hoare triple {10952#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10952#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:13,837 INFO L273 TraceCheckUtils]: 43: Hoare triple {10952#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10953#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:13,837 INFO L273 TraceCheckUtils]: 44: Hoare triple {10953#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10953#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:13,838 INFO L273 TraceCheckUtils]: 45: Hoare triple {10953#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10954#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:13,839 INFO L273 TraceCheckUtils]: 46: Hoare triple {10954#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10954#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:13,839 INFO L273 TraceCheckUtils]: 47: Hoare triple {10954#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10955#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:13,840 INFO L273 TraceCheckUtils]: 48: Hoare triple {10955#(<= main_~i~0 21)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10955#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:13,841 INFO L273 TraceCheckUtils]: 49: Hoare triple {10955#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10956#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:13,841 INFO L273 TraceCheckUtils]: 50: Hoare triple {10956#(<= main_~i~0 22)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10956#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:13,842 INFO L273 TraceCheckUtils]: 51: Hoare triple {10956#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10957#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:13,842 INFO L273 TraceCheckUtils]: 52: Hoare triple {10957#(<= main_~i~0 23)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10957#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:13,843 INFO L273 TraceCheckUtils]: 53: Hoare triple {10957#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10958#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:13,844 INFO L273 TraceCheckUtils]: 54: Hoare triple {10958#(<= main_~i~0 24)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10958#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:13,845 INFO L273 TraceCheckUtils]: 55: Hoare triple {10958#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10959#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:13,845 INFO L273 TraceCheckUtils]: 56: Hoare triple {10959#(<= main_~i~0 25)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10959#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:13,846 INFO L273 TraceCheckUtils]: 57: Hoare triple {10959#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10960#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:13,846 INFO L273 TraceCheckUtils]: 58: Hoare triple {10960#(<= main_~i~0 26)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10960#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:13,847 INFO L273 TraceCheckUtils]: 59: Hoare triple {10960#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10961#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:13,848 INFO L273 TraceCheckUtils]: 60: Hoare triple {10961#(<= main_~i~0 27)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10961#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:13,848 INFO L273 TraceCheckUtils]: 61: Hoare triple {10961#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10962#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:13,849 INFO L273 TraceCheckUtils]: 62: Hoare triple {10962#(<= main_~i~0 28)} assume !(~i~0 < 50000); {10933#false} is VALID [2018-11-23 12:06:13,849 INFO L273 TraceCheckUtils]: 63: Hoare triple {10933#false} havoc ~x~0;~x~0 := 0; {10933#false} is VALID [2018-11-23 12:06:13,850 INFO L273 TraceCheckUtils]: 64: Hoare triple {10933#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {10933#false} is VALID [2018-11-23 12:06:13,850 INFO L256 TraceCheckUtils]: 65: Hoare triple {10933#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {10933#false} is VALID [2018-11-23 12:06:13,850 INFO L273 TraceCheckUtils]: 66: Hoare triple {10933#false} ~cond := #in~cond; {10933#false} is VALID [2018-11-23 12:06:13,850 INFO L273 TraceCheckUtils]: 67: Hoare triple {10933#false} assume 0 == ~cond; {10933#false} is VALID [2018-11-23 12:06:13,850 INFO L273 TraceCheckUtils]: 68: Hoare triple {10933#false} assume !false; {10933#false} is VALID [2018-11-23 12:06:13,854 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:13,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:13,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-11-23 12:06:13,875 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2018-11-23 12:06:13,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:13,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 12:06:13,965 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:13,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 12:06:13,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 12:06:13,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 12:06:13,966 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 32 states. [2018-11-23 12:06:14,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:14,411 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2018-11-23 12:06:14,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 12:06:14,411 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2018-11-23 12:06:14,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:14,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:06:14,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 90 transitions. [2018-11-23 12:06:14,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:06:14,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 90 transitions. [2018-11-23 12:06:14,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 90 transitions. [2018-11-23 12:06:14,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:14,504 INFO L225 Difference]: With dead ends: 88 [2018-11-23 12:06:14,504 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 12:06:14,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 12:06:14,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 12:06:14,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-11-23 12:06:14,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:14,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 76 states. [2018-11-23 12:06:14,694 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 76 states. [2018-11-23 12:06:14,695 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 76 states. [2018-11-23 12:06:14,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:14,696 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2018-11-23 12:06:14,696 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-11-23 12:06:14,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:14,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:14,697 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 77 states. [2018-11-23 12:06:14,697 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 77 states. [2018-11-23 12:06:14,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:14,698 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2018-11-23 12:06:14,698 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-11-23 12:06:14,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:14,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:14,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:14,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:14,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 12:06:14,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-11-23 12:06:14,700 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 69 [2018-11-23 12:06:14,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:14,700 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-11-23 12:06:14,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 12:06:14,700 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-11-23 12:06:14,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 12:06:14,700 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:14,701 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:14,701 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:14,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:14,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1104065240, now seen corresponding path program 29 times [2018-11-23 12:06:14,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:14,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:14,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:14,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:14,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:15,286 INFO L256 TraceCheckUtils]: 0: Hoare triple {11565#true} call ULTIMATE.init(); {11565#true} is VALID [2018-11-23 12:06:15,286 INFO L273 TraceCheckUtils]: 1: Hoare triple {11565#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11565#true} is VALID [2018-11-23 12:06:15,287 INFO L273 TraceCheckUtils]: 2: Hoare triple {11565#true} assume true; {11565#true} is VALID [2018-11-23 12:06:15,287 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11565#true} {11565#true} #49#return; {11565#true} is VALID [2018-11-23 12:06:15,287 INFO L256 TraceCheckUtils]: 4: Hoare triple {11565#true} call #t~ret5 := main(); {11565#true} is VALID [2018-11-23 12:06:15,288 INFO L273 TraceCheckUtils]: 5: Hoare triple {11565#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {11567#(= main_~i~0 0)} is VALID [2018-11-23 12:06:15,288 INFO L273 TraceCheckUtils]: 6: Hoare triple {11567#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11567#(= main_~i~0 0)} is VALID [2018-11-23 12:06:15,289 INFO L273 TraceCheckUtils]: 7: Hoare triple {11567#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11568#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:15,289 INFO L273 TraceCheckUtils]: 8: Hoare triple {11568#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11568#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:15,289 INFO L273 TraceCheckUtils]: 9: Hoare triple {11568#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11569#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:15,290 INFO L273 TraceCheckUtils]: 10: Hoare triple {11569#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11569#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:15,290 INFO L273 TraceCheckUtils]: 11: Hoare triple {11569#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11570#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:15,291 INFO L273 TraceCheckUtils]: 12: Hoare triple {11570#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11570#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:15,291 INFO L273 TraceCheckUtils]: 13: Hoare triple {11570#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11571#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:15,292 INFO L273 TraceCheckUtils]: 14: Hoare triple {11571#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11571#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:15,293 INFO L273 TraceCheckUtils]: 15: Hoare triple {11571#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11572#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:15,293 INFO L273 TraceCheckUtils]: 16: Hoare triple {11572#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11572#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:15,294 INFO L273 TraceCheckUtils]: 17: Hoare triple {11572#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11573#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:15,294 INFO L273 TraceCheckUtils]: 18: Hoare triple {11573#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11573#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:15,295 INFO L273 TraceCheckUtils]: 19: Hoare triple {11573#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11574#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:15,296 INFO L273 TraceCheckUtils]: 20: Hoare triple {11574#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11574#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:15,296 INFO L273 TraceCheckUtils]: 21: Hoare triple {11574#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11575#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:15,297 INFO L273 TraceCheckUtils]: 22: Hoare triple {11575#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11575#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:15,298 INFO L273 TraceCheckUtils]: 23: Hoare triple {11575#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11576#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:15,298 INFO L273 TraceCheckUtils]: 24: Hoare triple {11576#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11576#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:15,299 INFO L273 TraceCheckUtils]: 25: Hoare triple {11576#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11577#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:15,299 INFO L273 TraceCheckUtils]: 26: Hoare triple {11577#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11577#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:15,300 INFO L273 TraceCheckUtils]: 27: Hoare triple {11577#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11578#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:15,301 INFO L273 TraceCheckUtils]: 28: Hoare triple {11578#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11578#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:15,301 INFO L273 TraceCheckUtils]: 29: Hoare triple {11578#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11579#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:15,302 INFO L273 TraceCheckUtils]: 30: Hoare triple {11579#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11579#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:15,303 INFO L273 TraceCheckUtils]: 31: Hoare triple {11579#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11580#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:15,303 INFO L273 TraceCheckUtils]: 32: Hoare triple {11580#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11580#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:15,304 INFO L273 TraceCheckUtils]: 33: Hoare triple {11580#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11581#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:15,305 INFO L273 TraceCheckUtils]: 34: Hoare triple {11581#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11581#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:15,305 INFO L273 TraceCheckUtils]: 35: Hoare triple {11581#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11582#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:15,306 INFO L273 TraceCheckUtils]: 36: Hoare triple {11582#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11582#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:15,307 INFO L273 TraceCheckUtils]: 37: Hoare triple {11582#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11583#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:15,307 INFO L273 TraceCheckUtils]: 38: Hoare triple {11583#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11583#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:15,308 INFO L273 TraceCheckUtils]: 39: Hoare triple {11583#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11584#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:15,308 INFO L273 TraceCheckUtils]: 40: Hoare triple {11584#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11584#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:15,309 INFO L273 TraceCheckUtils]: 41: Hoare triple {11584#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11585#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:15,310 INFO L273 TraceCheckUtils]: 42: Hoare triple {11585#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11585#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:15,310 INFO L273 TraceCheckUtils]: 43: Hoare triple {11585#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11586#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:15,311 INFO L273 TraceCheckUtils]: 44: Hoare triple {11586#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11586#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:15,312 INFO L273 TraceCheckUtils]: 45: Hoare triple {11586#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11587#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:15,312 INFO L273 TraceCheckUtils]: 46: Hoare triple {11587#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11587#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:15,313 INFO L273 TraceCheckUtils]: 47: Hoare triple {11587#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11588#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:15,313 INFO L273 TraceCheckUtils]: 48: Hoare triple {11588#(<= main_~i~0 21)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11588#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:15,314 INFO L273 TraceCheckUtils]: 49: Hoare triple {11588#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11589#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:15,315 INFO L273 TraceCheckUtils]: 50: Hoare triple {11589#(<= main_~i~0 22)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11589#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:15,315 INFO L273 TraceCheckUtils]: 51: Hoare triple {11589#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11590#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:15,316 INFO L273 TraceCheckUtils]: 52: Hoare triple {11590#(<= main_~i~0 23)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11590#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:15,317 INFO L273 TraceCheckUtils]: 53: Hoare triple {11590#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11591#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:15,317 INFO L273 TraceCheckUtils]: 54: Hoare triple {11591#(<= main_~i~0 24)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11591#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:15,318 INFO L273 TraceCheckUtils]: 55: Hoare triple {11591#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11592#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:15,319 INFO L273 TraceCheckUtils]: 56: Hoare triple {11592#(<= main_~i~0 25)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11592#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:15,319 INFO L273 TraceCheckUtils]: 57: Hoare triple {11592#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11593#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:15,320 INFO L273 TraceCheckUtils]: 58: Hoare triple {11593#(<= main_~i~0 26)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11593#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:15,321 INFO L273 TraceCheckUtils]: 59: Hoare triple {11593#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11594#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:15,321 INFO L273 TraceCheckUtils]: 60: Hoare triple {11594#(<= main_~i~0 27)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11594#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:15,322 INFO L273 TraceCheckUtils]: 61: Hoare triple {11594#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11595#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:15,322 INFO L273 TraceCheckUtils]: 62: Hoare triple {11595#(<= main_~i~0 28)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11595#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:15,323 INFO L273 TraceCheckUtils]: 63: Hoare triple {11595#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11596#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:15,324 INFO L273 TraceCheckUtils]: 64: Hoare triple {11596#(<= main_~i~0 29)} assume !(~i~0 < 50000); {11566#false} is VALID [2018-11-23 12:06:15,324 INFO L273 TraceCheckUtils]: 65: Hoare triple {11566#false} havoc ~x~0;~x~0 := 0; {11566#false} is VALID [2018-11-23 12:06:15,324 INFO L273 TraceCheckUtils]: 66: Hoare triple {11566#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {11566#false} is VALID [2018-11-23 12:06:15,324 INFO L256 TraceCheckUtils]: 67: Hoare triple {11566#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {11566#false} is VALID [2018-11-23 12:06:15,325 INFO L273 TraceCheckUtils]: 68: Hoare triple {11566#false} ~cond := #in~cond; {11566#false} is VALID [2018-11-23 12:06:15,325 INFO L273 TraceCheckUtils]: 69: Hoare triple {11566#false} assume 0 == ~cond; {11566#false} is VALID [2018-11-23 12:06:15,325 INFO L273 TraceCheckUtils]: 70: Hoare triple {11566#false} assume !false; {11566#false} is VALID [2018-11-23 12:06:15,329 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:15,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:15,329 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-23 12:06:15,339 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:06:18,627 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-11-23 12:06:18,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:18,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:18,870 INFO L256 TraceCheckUtils]: 0: Hoare triple {11565#true} call ULTIMATE.init(); {11565#true} is VALID [2018-11-23 12:06:18,870 INFO L273 TraceCheckUtils]: 1: Hoare triple {11565#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11565#true} is VALID [2018-11-23 12:06:18,871 INFO L273 TraceCheckUtils]: 2: Hoare triple {11565#true} assume true; {11565#true} is VALID [2018-11-23 12:06:18,871 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11565#true} {11565#true} #49#return; {11565#true} is VALID [2018-11-23 12:06:18,871 INFO L256 TraceCheckUtils]: 4: Hoare triple {11565#true} call #t~ret5 := main(); {11565#true} is VALID [2018-11-23 12:06:18,872 INFO L273 TraceCheckUtils]: 5: Hoare triple {11565#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {11615#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:18,872 INFO L273 TraceCheckUtils]: 6: Hoare triple {11615#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11615#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:18,873 INFO L273 TraceCheckUtils]: 7: Hoare triple {11615#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11568#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:18,874 INFO L273 TraceCheckUtils]: 8: Hoare triple {11568#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11568#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:18,874 INFO L273 TraceCheckUtils]: 9: Hoare triple {11568#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11569#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:18,875 INFO L273 TraceCheckUtils]: 10: Hoare triple {11569#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11569#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:18,875 INFO L273 TraceCheckUtils]: 11: Hoare triple {11569#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11570#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:18,876 INFO L273 TraceCheckUtils]: 12: Hoare triple {11570#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11570#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:18,876 INFO L273 TraceCheckUtils]: 13: Hoare triple {11570#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11571#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:18,879 INFO L273 TraceCheckUtils]: 14: Hoare triple {11571#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11571#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:18,880 INFO L273 TraceCheckUtils]: 15: Hoare triple {11571#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11572#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:18,880 INFO L273 TraceCheckUtils]: 16: Hoare triple {11572#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11572#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:18,881 INFO L273 TraceCheckUtils]: 17: Hoare triple {11572#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11573#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:18,882 INFO L273 TraceCheckUtils]: 18: Hoare triple {11573#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11573#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:18,883 INFO L273 TraceCheckUtils]: 19: Hoare triple {11573#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11574#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:18,883 INFO L273 TraceCheckUtils]: 20: Hoare triple {11574#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11574#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:18,884 INFO L273 TraceCheckUtils]: 21: Hoare triple {11574#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11575#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:18,885 INFO L273 TraceCheckUtils]: 22: Hoare triple {11575#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11575#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:18,885 INFO L273 TraceCheckUtils]: 23: Hoare triple {11575#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11576#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:18,886 INFO L273 TraceCheckUtils]: 24: Hoare triple {11576#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11576#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:18,887 INFO L273 TraceCheckUtils]: 25: Hoare triple {11576#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11577#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:18,888 INFO L273 TraceCheckUtils]: 26: Hoare triple {11577#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11577#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:18,888 INFO L273 TraceCheckUtils]: 27: Hoare triple {11577#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11578#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:18,889 INFO L273 TraceCheckUtils]: 28: Hoare triple {11578#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11578#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:18,890 INFO L273 TraceCheckUtils]: 29: Hoare triple {11578#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11579#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:18,890 INFO L273 TraceCheckUtils]: 30: Hoare triple {11579#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11579#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:18,891 INFO L273 TraceCheckUtils]: 31: Hoare triple {11579#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11580#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:18,892 INFO L273 TraceCheckUtils]: 32: Hoare triple {11580#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11580#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:18,892 INFO L273 TraceCheckUtils]: 33: Hoare triple {11580#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11581#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:18,893 INFO L273 TraceCheckUtils]: 34: Hoare triple {11581#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11581#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:18,894 INFO L273 TraceCheckUtils]: 35: Hoare triple {11581#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11582#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:18,894 INFO L273 TraceCheckUtils]: 36: Hoare triple {11582#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11582#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:18,895 INFO L273 TraceCheckUtils]: 37: Hoare triple {11582#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11583#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:18,895 INFO L273 TraceCheckUtils]: 38: Hoare triple {11583#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11583#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:18,896 INFO L273 TraceCheckUtils]: 39: Hoare triple {11583#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11584#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:18,897 INFO L273 TraceCheckUtils]: 40: Hoare triple {11584#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11584#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:18,897 INFO L273 TraceCheckUtils]: 41: Hoare triple {11584#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11585#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:18,898 INFO L273 TraceCheckUtils]: 42: Hoare triple {11585#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11585#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:18,899 INFO L273 TraceCheckUtils]: 43: Hoare triple {11585#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11586#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:18,899 INFO L273 TraceCheckUtils]: 44: Hoare triple {11586#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11586#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:18,900 INFO L273 TraceCheckUtils]: 45: Hoare triple {11586#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11587#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:18,900 INFO L273 TraceCheckUtils]: 46: Hoare triple {11587#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11587#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:18,901 INFO L273 TraceCheckUtils]: 47: Hoare triple {11587#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11588#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:18,902 INFO L273 TraceCheckUtils]: 48: Hoare triple {11588#(<= main_~i~0 21)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11588#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:18,902 INFO L273 TraceCheckUtils]: 49: Hoare triple {11588#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11589#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:18,903 INFO L273 TraceCheckUtils]: 50: Hoare triple {11589#(<= main_~i~0 22)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11589#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:18,904 INFO L273 TraceCheckUtils]: 51: Hoare triple {11589#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11590#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:18,904 INFO L273 TraceCheckUtils]: 52: Hoare triple {11590#(<= main_~i~0 23)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11590#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:18,905 INFO L273 TraceCheckUtils]: 53: Hoare triple {11590#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11591#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:18,906 INFO L273 TraceCheckUtils]: 54: Hoare triple {11591#(<= main_~i~0 24)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11591#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:18,906 INFO L273 TraceCheckUtils]: 55: Hoare triple {11591#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11592#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:18,907 INFO L273 TraceCheckUtils]: 56: Hoare triple {11592#(<= main_~i~0 25)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11592#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:18,908 INFO L273 TraceCheckUtils]: 57: Hoare triple {11592#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11593#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:18,908 INFO L273 TraceCheckUtils]: 58: Hoare triple {11593#(<= main_~i~0 26)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11593#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:18,909 INFO L273 TraceCheckUtils]: 59: Hoare triple {11593#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11594#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:18,909 INFO L273 TraceCheckUtils]: 60: Hoare triple {11594#(<= main_~i~0 27)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11594#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:18,910 INFO L273 TraceCheckUtils]: 61: Hoare triple {11594#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11595#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:18,911 INFO L273 TraceCheckUtils]: 62: Hoare triple {11595#(<= main_~i~0 28)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11595#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:18,911 INFO L273 TraceCheckUtils]: 63: Hoare triple {11595#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11596#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:18,912 INFO L273 TraceCheckUtils]: 64: Hoare triple {11596#(<= main_~i~0 29)} assume !(~i~0 < 50000); {11566#false} is VALID [2018-11-23 12:06:18,912 INFO L273 TraceCheckUtils]: 65: Hoare triple {11566#false} havoc ~x~0;~x~0 := 0; {11566#false} is VALID [2018-11-23 12:06:18,913 INFO L273 TraceCheckUtils]: 66: Hoare triple {11566#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {11566#false} is VALID [2018-11-23 12:06:18,913 INFO L256 TraceCheckUtils]: 67: Hoare triple {11566#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {11566#false} is VALID [2018-11-23 12:06:18,913 INFO L273 TraceCheckUtils]: 68: Hoare triple {11566#false} ~cond := #in~cond; {11566#false} is VALID [2018-11-23 12:06:18,913 INFO L273 TraceCheckUtils]: 69: Hoare triple {11566#false} assume 0 == ~cond; {11566#false} is VALID [2018-11-23 12:06:18,913 INFO L273 TraceCheckUtils]: 70: Hoare triple {11566#false} assume !false; {11566#false} is VALID [2018-11-23 12:06:18,917 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:18,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:18,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-11-23 12:06:18,939 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 71 [2018-11-23 12:06:18,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:18,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 12:06:19,013 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-23 12:06:19,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 12:06:19,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 12:06:19,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 12:06:19,015 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 33 states. [2018-11-23 12:06:19,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:19,458 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-11-23 12:06:19,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 12:06:19,458 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 71 [2018-11-23 12:06:19,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:19,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:06:19,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 92 transitions. [2018-11-23 12:06:19,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:06:19,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 92 transitions. [2018-11-23 12:06:19,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 92 transitions. [2018-11-23 12:06:19,569 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-23 12:06:19,571 INFO L225 Difference]: With dead ends: 90 [2018-11-23 12:06:19,571 INFO L226 Difference]: Without dead ends: 79 [2018-11-23 12:06:19,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 71 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-23 12:06:19,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-23 12:06:19,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-11-23 12:06:19,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:19,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 78 states. [2018-11-23 12:06:19,602 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 78 states. [2018-11-23 12:06:19,602 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 78 states. [2018-11-23 12:06:19,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:19,603 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2018-11-23 12:06:19,603 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-11-23 12:06:19,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:19,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:19,604 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 79 states. [2018-11-23 12:06:19,604 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 79 states. [2018-11-23 12:06:19,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:19,605 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2018-11-23 12:06:19,605 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-11-23 12:06:19,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:19,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:19,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:19,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:19,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 12:06:19,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-11-23 12:06:19,606 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 71 [2018-11-23 12:06:19,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:19,607 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-11-23 12:06:19,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 12:06:19,607 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-11-23 12:06:19,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 12:06:19,607 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:19,607 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:19,608 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:19,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:19,608 INFO L82 PathProgramCache]: Analyzing trace with hash 179724918, now seen corresponding path program 30 times [2018-11-23 12:06:19,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:19,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:19,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:19,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:19,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:20,160 INFO L256 TraceCheckUtils]: 0: Hoare triple {12215#true} call ULTIMATE.init(); {12215#true} is VALID [2018-11-23 12:06:20,161 INFO L273 TraceCheckUtils]: 1: Hoare triple {12215#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12215#true} is VALID [2018-11-23 12:06:20,161 INFO L273 TraceCheckUtils]: 2: Hoare triple {12215#true} assume true; {12215#true} is VALID [2018-11-23 12:06:20,161 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12215#true} {12215#true} #49#return; {12215#true} is VALID [2018-11-23 12:06:20,161 INFO L256 TraceCheckUtils]: 4: Hoare triple {12215#true} call #t~ret5 := main(); {12215#true} is VALID [2018-11-23 12:06:20,161 INFO L273 TraceCheckUtils]: 5: Hoare triple {12215#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {12217#(= main_~i~0 0)} is VALID [2018-11-23 12:06:20,162 INFO L273 TraceCheckUtils]: 6: Hoare triple {12217#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12217#(= main_~i~0 0)} is VALID [2018-11-23 12:06:20,163 INFO L273 TraceCheckUtils]: 7: Hoare triple {12217#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12218#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:20,163 INFO L273 TraceCheckUtils]: 8: Hoare triple {12218#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12218#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:20,164 INFO L273 TraceCheckUtils]: 9: Hoare triple {12218#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12219#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:20,164 INFO L273 TraceCheckUtils]: 10: Hoare triple {12219#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12219#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:20,164 INFO L273 TraceCheckUtils]: 11: Hoare triple {12219#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12220#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:20,165 INFO L273 TraceCheckUtils]: 12: Hoare triple {12220#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12220#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:20,165 INFO L273 TraceCheckUtils]: 13: Hoare triple {12220#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12221#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:20,165 INFO L273 TraceCheckUtils]: 14: Hoare triple {12221#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12221#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:20,166 INFO L273 TraceCheckUtils]: 15: Hoare triple {12221#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12222#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:20,167 INFO L273 TraceCheckUtils]: 16: Hoare triple {12222#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12222#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:20,168 INFO L273 TraceCheckUtils]: 17: Hoare triple {12222#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12223#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:20,168 INFO L273 TraceCheckUtils]: 18: Hoare triple {12223#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12223#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:20,169 INFO L273 TraceCheckUtils]: 19: Hoare triple {12223#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12224#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:20,169 INFO L273 TraceCheckUtils]: 20: Hoare triple {12224#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12224#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:20,170 INFO L273 TraceCheckUtils]: 21: Hoare triple {12224#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12225#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:20,171 INFO L273 TraceCheckUtils]: 22: Hoare triple {12225#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12225#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:20,171 INFO L273 TraceCheckUtils]: 23: Hoare triple {12225#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12226#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:20,172 INFO L273 TraceCheckUtils]: 24: Hoare triple {12226#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12226#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:20,173 INFO L273 TraceCheckUtils]: 25: Hoare triple {12226#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12227#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:20,173 INFO L273 TraceCheckUtils]: 26: Hoare triple {12227#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12227#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:20,174 INFO L273 TraceCheckUtils]: 27: Hoare triple {12227#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12228#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:20,174 INFO L273 TraceCheckUtils]: 28: Hoare triple {12228#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12228#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:20,175 INFO L273 TraceCheckUtils]: 29: Hoare triple {12228#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12229#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:20,175 INFO L273 TraceCheckUtils]: 30: Hoare triple {12229#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12229#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:20,176 INFO L273 TraceCheckUtils]: 31: Hoare triple {12229#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12230#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:20,177 INFO L273 TraceCheckUtils]: 32: Hoare triple {12230#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12230#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:20,177 INFO L273 TraceCheckUtils]: 33: Hoare triple {12230#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12231#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:20,178 INFO L273 TraceCheckUtils]: 34: Hoare triple {12231#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12231#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:20,179 INFO L273 TraceCheckUtils]: 35: Hoare triple {12231#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12232#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:20,179 INFO L273 TraceCheckUtils]: 36: Hoare triple {12232#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12232#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:20,180 INFO L273 TraceCheckUtils]: 37: Hoare triple {12232#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12233#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:20,180 INFO L273 TraceCheckUtils]: 38: Hoare triple {12233#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12233#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:20,181 INFO L273 TraceCheckUtils]: 39: Hoare triple {12233#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12234#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:20,181 INFO L273 TraceCheckUtils]: 40: Hoare triple {12234#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12234#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:20,182 INFO L273 TraceCheckUtils]: 41: Hoare triple {12234#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12235#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:20,183 INFO L273 TraceCheckUtils]: 42: Hoare triple {12235#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12235#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:20,183 INFO L273 TraceCheckUtils]: 43: Hoare triple {12235#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12236#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:20,184 INFO L273 TraceCheckUtils]: 44: Hoare triple {12236#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12236#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:20,185 INFO L273 TraceCheckUtils]: 45: Hoare triple {12236#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12237#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:20,185 INFO L273 TraceCheckUtils]: 46: Hoare triple {12237#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12237#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:20,186 INFO L273 TraceCheckUtils]: 47: Hoare triple {12237#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12238#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:20,186 INFO L273 TraceCheckUtils]: 48: Hoare triple {12238#(<= main_~i~0 21)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12238#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:20,187 INFO L273 TraceCheckUtils]: 49: Hoare triple {12238#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12239#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:20,188 INFO L273 TraceCheckUtils]: 50: Hoare triple {12239#(<= main_~i~0 22)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12239#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:20,188 INFO L273 TraceCheckUtils]: 51: Hoare triple {12239#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12240#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:20,189 INFO L273 TraceCheckUtils]: 52: Hoare triple {12240#(<= main_~i~0 23)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12240#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:20,189 INFO L273 TraceCheckUtils]: 53: Hoare triple {12240#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12241#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:20,190 INFO L273 TraceCheckUtils]: 54: Hoare triple {12241#(<= main_~i~0 24)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12241#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:20,191 INFO L273 TraceCheckUtils]: 55: Hoare triple {12241#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12242#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:20,191 INFO L273 TraceCheckUtils]: 56: Hoare triple {12242#(<= main_~i~0 25)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12242#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:20,192 INFO L273 TraceCheckUtils]: 57: Hoare triple {12242#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12243#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:20,192 INFO L273 TraceCheckUtils]: 58: Hoare triple {12243#(<= main_~i~0 26)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12243#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:20,193 INFO L273 TraceCheckUtils]: 59: Hoare triple {12243#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12244#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:20,194 INFO L273 TraceCheckUtils]: 60: Hoare triple {12244#(<= main_~i~0 27)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12244#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:20,194 INFO L273 TraceCheckUtils]: 61: Hoare triple {12244#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12245#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:20,195 INFO L273 TraceCheckUtils]: 62: Hoare triple {12245#(<= main_~i~0 28)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12245#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:20,196 INFO L273 TraceCheckUtils]: 63: Hoare triple {12245#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12246#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:20,196 INFO L273 TraceCheckUtils]: 64: Hoare triple {12246#(<= main_~i~0 29)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12246#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:20,197 INFO L273 TraceCheckUtils]: 65: Hoare triple {12246#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12247#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:20,197 INFO L273 TraceCheckUtils]: 66: Hoare triple {12247#(<= main_~i~0 30)} assume !(~i~0 < 50000); {12216#false} is VALID [2018-11-23 12:06:20,198 INFO L273 TraceCheckUtils]: 67: Hoare triple {12216#false} havoc ~x~0;~x~0 := 0; {12216#false} is VALID [2018-11-23 12:06:20,198 INFO L273 TraceCheckUtils]: 68: Hoare triple {12216#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {12216#false} is VALID [2018-11-23 12:06:20,198 INFO L256 TraceCheckUtils]: 69: Hoare triple {12216#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {12216#false} is VALID [2018-11-23 12:06:20,198 INFO L273 TraceCheckUtils]: 70: Hoare triple {12216#false} ~cond := #in~cond; {12216#false} is VALID [2018-11-23 12:06:20,199 INFO L273 TraceCheckUtils]: 71: Hoare triple {12216#false} assume 0 == ~cond; {12216#false} is VALID [2018-11-23 12:06:20,199 INFO L273 TraceCheckUtils]: 72: Hoare triple {12216#false} assume !false; {12216#false} is VALID [2018-11-23 12:06:20,204 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:20,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:20,204 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-23 12:06:20,213 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:06:45,887 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-11-23 12:06:45,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:45,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:46,224 INFO L256 TraceCheckUtils]: 0: Hoare triple {12215#true} call ULTIMATE.init(); {12215#true} is VALID [2018-11-23 12:06:46,224 INFO L273 TraceCheckUtils]: 1: Hoare triple {12215#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12215#true} is VALID [2018-11-23 12:06:46,224 INFO L273 TraceCheckUtils]: 2: Hoare triple {12215#true} assume true; {12215#true} is VALID [2018-11-23 12:06:46,224 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12215#true} {12215#true} #49#return; {12215#true} is VALID [2018-11-23 12:06:46,225 INFO L256 TraceCheckUtils]: 4: Hoare triple {12215#true} call #t~ret5 := main(); {12215#true} is VALID [2018-11-23 12:06:46,225 INFO L273 TraceCheckUtils]: 5: Hoare triple {12215#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {12266#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:46,226 INFO L273 TraceCheckUtils]: 6: Hoare triple {12266#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12266#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:46,226 INFO L273 TraceCheckUtils]: 7: Hoare triple {12266#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12218#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:46,227 INFO L273 TraceCheckUtils]: 8: Hoare triple {12218#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12218#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:46,227 INFO L273 TraceCheckUtils]: 9: Hoare triple {12218#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12219#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:46,227 INFO L273 TraceCheckUtils]: 10: Hoare triple {12219#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12219#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:46,228 INFO L273 TraceCheckUtils]: 11: Hoare triple {12219#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12220#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:46,228 INFO L273 TraceCheckUtils]: 12: Hoare triple {12220#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12220#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:46,229 INFO L273 TraceCheckUtils]: 13: Hoare triple {12220#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12221#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:46,230 INFO L273 TraceCheckUtils]: 14: Hoare triple {12221#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12221#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:46,230 INFO L273 TraceCheckUtils]: 15: Hoare triple {12221#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12222#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:46,231 INFO L273 TraceCheckUtils]: 16: Hoare triple {12222#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12222#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:46,232 INFO L273 TraceCheckUtils]: 17: Hoare triple {12222#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12223#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:46,232 INFO L273 TraceCheckUtils]: 18: Hoare triple {12223#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12223#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:46,233 INFO L273 TraceCheckUtils]: 19: Hoare triple {12223#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12224#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:46,234 INFO L273 TraceCheckUtils]: 20: Hoare triple {12224#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12224#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:46,234 INFO L273 TraceCheckUtils]: 21: Hoare triple {12224#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12225#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:46,235 INFO L273 TraceCheckUtils]: 22: Hoare triple {12225#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12225#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:46,236 INFO L273 TraceCheckUtils]: 23: Hoare triple {12225#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12226#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:46,243 INFO L273 TraceCheckUtils]: 24: Hoare triple {12226#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12226#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:46,244 INFO L273 TraceCheckUtils]: 25: Hoare triple {12226#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12227#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:46,244 INFO L273 TraceCheckUtils]: 26: Hoare triple {12227#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12227#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:46,245 INFO L273 TraceCheckUtils]: 27: Hoare triple {12227#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12228#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:46,245 INFO L273 TraceCheckUtils]: 28: Hoare triple {12228#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12228#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:46,246 INFO L273 TraceCheckUtils]: 29: Hoare triple {12228#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12229#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:46,246 INFO L273 TraceCheckUtils]: 30: Hoare triple {12229#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12229#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:46,247 INFO L273 TraceCheckUtils]: 31: Hoare triple {12229#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12230#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:46,247 INFO L273 TraceCheckUtils]: 32: Hoare triple {12230#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12230#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:46,248 INFO L273 TraceCheckUtils]: 33: Hoare triple {12230#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12231#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:46,248 INFO L273 TraceCheckUtils]: 34: Hoare triple {12231#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12231#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:46,249 INFO L273 TraceCheckUtils]: 35: Hoare triple {12231#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12232#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:46,250 INFO L273 TraceCheckUtils]: 36: Hoare triple {12232#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12232#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:46,250 INFO L273 TraceCheckUtils]: 37: Hoare triple {12232#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12233#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:46,251 INFO L273 TraceCheckUtils]: 38: Hoare triple {12233#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12233#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:46,252 INFO L273 TraceCheckUtils]: 39: Hoare triple {12233#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12234#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:46,252 INFO L273 TraceCheckUtils]: 40: Hoare triple {12234#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12234#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:46,253 INFO L273 TraceCheckUtils]: 41: Hoare triple {12234#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12235#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:46,254 INFO L273 TraceCheckUtils]: 42: Hoare triple {12235#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12235#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:46,254 INFO L273 TraceCheckUtils]: 43: Hoare triple {12235#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12236#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:46,255 INFO L273 TraceCheckUtils]: 44: Hoare triple {12236#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12236#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:46,256 INFO L273 TraceCheckUtils]: 45: Hoare triple {12236#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12237#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:46,256 INFO L273 TraceCheckUtils]: 46: Hoare triple {12237#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12237#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:46,257 INFO L273 TraceCheckUtils]: 47: Hoare triple {12237#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12238#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:46,257 INFO L273 TraceCheckUtils]: 48: Hoare triple {12238#(<= main_~i~0 21)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12238#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:46,258 INFO L273 TraceCheckUtils]: 49: Hoare triple {12238#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12239#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:46,259 INFO L273 TraceCheckUtils]: 50: Hoare triple {12239#(<= main_~i~0 22)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12239#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:46,259 INFO L273 TraceCheckUtils]: 51: Hoare triple {12239#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12240#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:46,260 INFO L273 TraceCheckUtils]: 52: Hoare triple {12240#(<= main_~i~0 23)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12240#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:46,261 INFO L273 TraceCheckUtils]: 53: Hoare triple {12240#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12241#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:46,261 INFO L273 TraceCheckUtils]: 54: Hoare triple {12241#(<= main_~i~0 24)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12241#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:46,262 INFO L273 TraceCheckUtils]: 55: Hoare triple {12241#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12242#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:46,262 INFO L273 TraceCheckUtils]: 56: Hoare triple {12242#(<= main_~i~0 25)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12242#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:46,263 INFO L273 TraceCheckUtils]: 57: Hoare triple {12242#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12243#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:46,264 INFO L273 TraceCheckUtils]: 58: Hoare triple {12243#(<= main_~i~0 26)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12243#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:46,264 INFO L273 TraceCheckUtils]: 59: Hoare triple {12243#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12244#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:46,265 INFO L273 TraceCheckUtils]: 60: Hoare triple {12244#(<= main_~i~0 27)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12244#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:46,266 INFO L273 TraceCheckUtils]: 61: Hoare triple {12244#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12245#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:46,266 INFO L273 TraceCheckUtils]: 62: Hoare triple {12245#(<= main_~i~0 28)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12245#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:46,267 INFO L273 TraceCheckUtils]: 63: Hoare triple {12245#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12246#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:46,268 INFO L273 TraceCheckUtils]: 64: Hoare triple {12246#(<= main_~i~0 29)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12246#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:46,268 INFO L273 TraceCheckUtils]: 65: Hoare triple {12246#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12247#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:46,269 INFO L273 TraceCheckUtils]: 66: Hoare triple {12247#(<= main_~i~0 30)} assume !(~i~0 < 50000); {12216#false} is VALID [2018-11-23 12:06:46,269 INFO L273 TraceCheckUtils]: 67: Hoare triple {12216#false} havoc ~x~0;~x~0 := 0; {12216#false} is VALID [2018-11-23 12:06:46,269 INFO L273 TraceCheckUtils]: 68: Hoare triple {12216#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {12216#false} is VALID [2018-11-23 12:06:46,270 INFO L256 TraceCheckUtils]: 69: Hoare triple {12216#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {12216#false} is VALID [2018-11-23 12:06:46,270 INFO L273 TraceCheckUtils]: 70: Hoare triple {12216#false} ~cond := #in~cond; {12216#false} is VALID [2018-11-23 12:06:46,270 INFO L273 TraceCheckUtils]: 71: Hoare triple {12216#false} assume 0 == ~cond; {12216#false} is VALID [2018-11-23 12:06:46,270 INFO L273 TraceCheckUtils]: 72: Hoare triple {12216#false} assume !false; {12216#false} is VALID [2018-11-23 12:06:46,275 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:46,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:46,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-11-23 12:06:46,300 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 73 [2018-11-23 12:06:46,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:46,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 12:06:46,378 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:46,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 12:06:46,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 12:06:46,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:06:46,380 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 34 states. [2018-11-23 12:06:46,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:46,879 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2018-11-23 12:06:46,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 12:06:46,880 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 73 [2018-11-23 12:06:46,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:46,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:06:46,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 94 transitions. [2018-11-23 12:06:46,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:06:46,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 94 transitions. [2018-11-23 12:06:46,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 94 transitions. [2018-11-23 12:06:46,972 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:46,974 INFO L225 Difference]: With dead ends: 92 [2018-11-23 12:06:46,974 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 12:06:46,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:06:46,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 12:06:47,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-11-23 12:06:47,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:47,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 80 states. [2018-11-23 12:06:47,003 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 80 states. [2018-11-23 12:06:47,003 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 80 states. [2018-11-23 12:06:47,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:47,004 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2018-11-23 12:06:47,004 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-11-23 12:06:47,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:47,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:47,005 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 81 states. [2018-11-23 12:06:47,005 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 81 states. [2018-11-23 12:06:47,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:47,006 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2018-11-23 12:06:47,006 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-11-23 12:06:47,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:47,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:47,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:47,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:47,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 12:06:47,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2018-11-23 12:06:47,008 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 73 [2018-11-23 12:06:47,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:47,008 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2018-11-23 12:06:47,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 12:06:47,009 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2018-11-23 12:06:47,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 12:06:47,009 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:47,009 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:47,010 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:47,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:47,010 INFO L82 PathProgramCache]: Analyzing trace with hash 946905748, now seen corresponding path program 31 times [2018-11-23 12:06:47,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:47,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:47,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:47,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:47,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:47,915 INFO L256 TraceCheckUtils]: 0: Hoare triple {12882#true} call ULTIMATE.init(); {12882#true} is VALID [2018-11-23 12:06:47,915 INFO L273 TraceCheckUtils]: 1: Hoare triple {12882#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12882#true} is VALID [2018-11-23 12:06:47,915 INFO L273 TraceCheckUtils]: 2: Hoare triple {12882#true} assume true; {12882#true} is VALID [2018-11-23 12:06:47,916 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12882#true} {12882#true} #49#return; {12882#true} is VALID [2018-11-23 12:06:47,916 INFO L256 TraceCheckUtils]: 4: Hoare triple {12882#true} call #t~ret5 := main(); {12882#true} is VALID [2018-11-23 12:06:47,916 INFO L273 TraceCheckUtils]: 5: Hoare triple {12882#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {12884#(= main_~i~0 0)} is VALID [2018-11-23 12:06:47,917 INFO L273 TraceCheckUtils]: 6: Hoare triple {12884#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12884#(= main_~i~0 0)} is VALID [2018-11-23 12:06:47,918 INFO L273 TraceCheckUtils]: 7: Hoare triple {12884#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12885#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:47,918 INFO L273 TraceCheckUtils]: 8: Hoare triple {12885#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12885#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:47,919 INFO L273 TraceCheckUtils]: 9: Hoare triple {12885#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12886#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:47,919 INFO L273 TraceCheckUtils]: 10: Hoare triple {12886#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12886#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:47,919 INFO L273 TraceCheckUtils]: 11: Hoare triple {12886#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:47,920 INFO L273 TraceCheckUtils]: 12: Hoare triple {12887#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12887#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:47,920 INFO L273 TraceCheckUtils]: 13: Hoare triple {12887#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12888#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:47,921 INFO L273 TraceCheckUtils]: 14: Hoare triple {12888#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12888#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:47,921 INFO L273 TraceCheckUtils]: 15: Hoare triple {12888#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12889#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:47,922 INFO L273 TraceCheckUtils]: 16: Hoare triple {12889#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12889#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:47,923 INFO L273 TraceCheckUtils]: 17: Hoare triple {12889#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12890#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:47,923 INFO L273 TraceCheckUtils]: 18: Hoare triple {12890#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12890#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:47,924 INFO L273 TraceCheckUtils]: 19: Hoare triple {12890#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12891#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:47,924 INFO L273 TraceCheckUtils]: 20: Hoare triple {12891#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12891#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:47,925 INFO L273 TraceCheckUtils]: 21: Hoare triple {12891#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12892#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:47,928 INFO L273 TraceCheckUtils]: 22: Hoare triple {12892#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12892#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:47,928 INFO L273 TraceCheckUtils]: 23: Hoare triple {12892#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12893#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:47,928 INFO L273 TraceCheckUtils]: 24: Hoare triple {12893#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12893#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:47,929 INFO L273 TraceCheckUtils]: 25: Hoare triple {12893#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12894#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:47,929 INFO L273 TraceCheckUtils]: 26: Hoare triple {12894#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12894#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:47,930 INFO L273 TraceCheckUtils]: 27: Hoare triple {12894#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12895#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:47,930 INFO L273 TraceCheckUtils]: 28: Hoare triple {12895#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12895#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:47,930 INFO L273 TraceCheckUtils]: 29: Hoare triple {12895#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12896#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:47,931 INFO L273 TraceCheckUtils]: 30: Hoare triple {12896#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12896#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:47,931 INFO L273 TraceCheckUtils]: 31: Hoare triple {12896#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12897#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:47,931 INFO L273 TraceCheckUtils]: 32: Hoare triple {12897#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12897#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:47,932 INFO L273 TraceCheckUtils]: 33: Hoare triple {12897#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12898#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:47,932 INFO L273 TraceCheckUtils]: 34: Hoare triple {12898#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12898#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:47,933 INFO L273 TraceCheckUtils]: 35: Hoare triple {12898#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12899#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:47,934 INFO L273 TraceCheckUtils]: 36: Hoare triple {12899#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12899#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:47,934 INFO L273 TraceCheckUtils]: 37: Hoare triple {12899#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12900#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:47,935 INFO L273 TraceCheckUtils]: 38: Hoare triple {12900#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12900#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:47,936 INFO L273 TraceCheckUtils]: 39: Hoare triple {12900#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12901#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:47,936 INFO L273 TraceCheckUtils]: 40: Hoare triple {12901#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12901#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:47,937 INFO L273 TraceCheckUtils]: 41: Hoare triple {12901#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12902#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:47,937 INFO L273 TraceCheckUtils]: 42: Hoare triple {12902#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12902#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:47,938 INFO L273 TraceCheckUtils]: 43: Hoare triple {12902#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12903#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:47,939 INFO L273 TraceCheckUtils]: 44: Hoare triple {12903#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12903#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:47,939 INFO L273 TraceCheckUtils]: 45: Hoare triple {12903#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12904#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:47,940 INFO L273 TraceCheckUtils]: 46: Hoare triple {12904#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12904#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:47,941 INFO L273 TraceCheckUtils]: 47: Hoare triple {12904#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12905#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:47,941 INFO L273 TraceCheckUtils]: 48: Hoare triple {12905#(<= main_~i~0 21)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12905#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:47,942 INFO L273 TraceCheckUtils]: 49: Hoare triple {12905#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12906#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:47,942 INFO L273 TraceCheckUtils]: 50: Hoare triple {12906#(<= main_~i~0 22)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12906#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:47,943 INFO L273 TraceCheckUtils]: 51: Hoare triple {12906#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12907#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:47,944 INFO L273 TraceCheckUtils]: 52: Hoare triple {12907#(<= main_~i~0 23)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12907#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:47,944 INFO L273 TraceCheckUtils]: 53: Hoare triple {12907#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12908#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:47,945 INFO L273 TraceCheckUtils]: 54: Hoare triple {12908#(<= main_~i~0 24)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12908#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:47,962 INFO L273 TraceCheckUtils]: 55: Hoare triple {12908#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12909#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:47,973 INFO L273 TraceCheckUtils]: 56: Hoare triple {12909#(<= main_~i~0 25)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12909#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:47,974 INFO L273 TraceCheckUtils]: 57: Hoare triple {12909#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12910#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:47,974 INFO L273 TraceCheckUtils]: 58: Hoare triple {12910#(<= main_~i~0 26)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12910#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:47,974 INFO L273 TraceCheckUtils]: 59: Hoare triple {12910#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12911#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:47,975 INFO L273 TraceCheckUtils]: 60: Hoare triple {12911#(<= main_~i~0 27)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12911#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:47,975 INFO L273 TraceCheckUtils]: 61: Hoare triple {12911#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12912#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:47,975 INFO L273 TraceCheckUtils]: 62: Hoare triple {12912#(<= main_~i~0 28)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12912#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:47,976 INFO L273 TraceCheckUtils]: 63: Hoare triple {12912#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12913#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:47,976 INFO L273 TraceCheckUtils]: 64: Hoare triple {12913#(<= main_~i~0 29)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12913#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:47,977 INFO L273 TraceCheckUtils]: 65: Hoare triple {12913#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12914#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:47,978 INFO L273 TraceCheckUtils]: 66: Hoare triple {12914#(<= main_~i~0 30)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12914#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:47,978 INFO L273 TraceCheckUtils]: 67: Hoare triple {12914#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12915#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:47,979 INFO L273 TraceCheckUtils]: 68: Hoare triple {12915#(<= main_~i~0 31)} assume !(~i~0 < 50000); {12883#false} is VALID [2018-11-23 12:06:47,979 INFO L273 TraceCheckUtils]: 69: Hoare triple {12883#false} havoc ~x~0;~x~0 := 0; {12883#false} is VALID [2018-11-23 12:06:47,979 INFO L273 TraceCheckUtils]: 70: Hoare triple {12883#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {12883#false} is VALID [2018-11-23 12:06:47,980 INFO L256 TraceCheckUtils]: 71: Hoare triple {12883#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {12883#false} is VALID [2018-11-23 12:06:47,980 INFO L273 TraceCheckUtils]: 72: Hoare triple {12883#false} ~cond := #in~cond; {12883#false} is VALID [2018-11-23 12:06:47,980 INFO L273 TraceCheckUtils]: 73: Hoare triple {12883#false} assume 0 == ~cond; {12883#false} is VALID [2018-11-23 12:06:47,980 INFO L273 TraceCheckUtils]: 74: Hoare triple {12883#false} assume !false; {12883#false} is VALID [2018-11-23 12:06:47,984 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:47,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:47,985 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-23 12:06:47,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:48,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:48,272 INFO L256 TraceCheckUtils]: 0: Hoare triple {12882#true} call ULTIMATE.init(); {12882#true} is VALID [2018-11-23 12:06:48,272 INFO L273 TraceCheckUtils]: 1: Hoare triple {12882#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12882#true} is VALID [2018-11-23 12:06:48,272 INFO L273 TraceCheckUtils]: 2: Hoare triple {12882#true} assume true; {12882#true} is VALID [2018-11-23 12:06:48,272 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12882#true} {12882#true} #49#return; {12882#true} is VALID [2018-11-23 12:06:48,273 INFO L256 TraceCheckUtils]: 4: Hoare triple {12882#true} call #t~ret5 := main(); {12882#true} is VALID [2018-11-23 12:06:48,273 INFO L273 TraceCheckUtils]: 5: Hoare triple {12882#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {12934#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:48,274 INFO L273 TraceCheckUtils]: 6: Hoare triple {12934#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12934#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:48,274 INFO L273 TraceCheckUtils]: 7: Hoare triple {12934#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12885#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:48,275 INFO L273 TraceCheckUtils]: 8: Hoare triple {12885#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12885#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:48,275 INFO L273 TraceCheckUtils]: 9: Hoare triple {12885#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12886#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:48,275 INFO L273 TraceCheckUtils]: 10: Hoare triple {12886#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12886#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:48,279 INFO L273 TraceCheckUtils]: 11: Hoare triple {12886#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:48,279 INFO L273 TraceCheckUtils]: 12: Hoare triple {12887#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12887#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:48,280 INFO L273 TraceCheckUtils]: 13: Hoare triple {12887#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12888#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:48,280 INFO L273 TraceCheckUtils]: 14: Hoare triple {12888#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12888#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:48,280 INFO L273 TraceCheckUtils]: 15: Hoare triple {12888#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12889#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:48,281 INFO L273 TraceCheckUtils]: 16: Hoare triple {12889#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12889#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:48,281 INFO L273 TraceCheckUtils]: 17: Hoare triple {12889#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12890#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:48,282 INFO L273 TraceCheckUtils]: 18: Hoare triple {12890#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12890#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:48,282 INFO L273 TraceCheckUtils]: 19: Hoare triple {12890#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12891#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:48,282 INFO L273 TraceCheckUtils]: 20: Hoare triple {12891#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12891#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:48,283 INFO L273 TraceCheckUtils]: 21: Hoare triple {12891#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12892#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:48,284 INFO L273 TraceCheckUtils]: 22: Hoare triple {12892#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12892#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:48,285 INFO L273 TraceCheckUtils]: 23: Hoare triple {12892#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12893#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:48,285 INFO L273 TraceCheckUtils]: 24: Hoare triple {12893#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12893#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:48,286 INFO L273 TraceCheckUtils]: 25: Hoare triple {12893#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12894#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:48,286 INFO L273 TraceCheckUtils]: 26: Hoare triple {12894#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12894#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:48,286 INFO L273 TraceCheckUtils]: 27: Hoare triple {12894#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12895#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:48,287 INFO L273 TraceCheckUtils]: 28: Hoare triple {12895#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12895#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:48,287 INFO L273 TraceCheckUtils]: 29: Hoare triple {12895#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12896#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:48,288 INFO L273 TraceCheckUtils]: 30: Hoare triple {12896#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12896#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:48,289 INFO L273 TraceCheckUtils]: 31: Hoare triple {12896#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12897#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:48,289 INFO L273 TraceCheckUtils]: 32: Hoare triple {12897#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12897#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:48,290 INFO L273 TraceCheckUtils]: 33: Hoare triple {12897#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12898#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:48,290 INFO L273 TraceCheckUtils]: 34: Hoare triple {12898#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12898#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:48,291 INFO L273 TraceCheckUtils]: 35: Hoare triple {12898#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12899#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:48,292 INFO L273 TraceCheckUtils]: 36: Hoare triple {12899#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12899#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:48,292 INFO L273 TraceCheckUtils]: 37: Hoare triple {12899#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12900#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:48,293 INFO L273 TraceCheckUtils]: 38: Hoare triple {12900#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12900#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:48,294 INFO L273 TraceCheckUtils]: 39: Hoare triple {12900#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12901#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:48,294 INFO L273 TraceCheckUtils]: 40: Hoare triple {12901#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12901#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:48,295 INFO L273 TraceCheckUtils]: 41: Hoare triple {12901#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12902#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:48,296 INFO L273 TraceCheckUtils]: 42: Hoare triple {12902#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12902#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:48,296 INFO L273 TraceCheckUtils]: 43: Hoare triple {12902#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12903#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:48,297 INFO L273 TraceCheckUtils]: 44: Hoare triple {12903#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12903#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:48,298 INFO L273 TraceCheckUtils]: 45: Hoare triple {12903#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12904#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:48,298 INFO L273 TraceCheckUtils]: 46: Hoare triple {12904#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12904#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:48,299 INFO L273 TraceCheckUtils]: 47: Hoare triple {12904#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12905#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:48,299 INFO L273 TraceCheckUtils]: 48: Hoare triple {12905#(<= main_~i~0 21)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12905#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:48,300 INFO L273 TraceCheckUtils]: 49: Hoare triple {12905#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12906#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:48,301 INFO L273 TraceCheckUtils]: 50: Hoare triple {12906#(<= main_~i~0 22)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12906#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:48,301 INFO L273 TraceCheckUtils]: 51: Hoare triple {12906#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12907#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:48,302 INFO L273 TraceCheckUtils]: 52: Hoare triple {12907#(<= main_~i~0 23)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12907#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:48,303 INFO L273 TraceCheckUtils]: 53: Hoare triple {12907#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12908#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:48,303 INFO L273 TraceCheckUtils]: 54: Hoare triple {12908#(<= main_~i~0 24)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12908#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:48,304 INFO L273 TraceCheckUtils]: 55: Hoare triple {12908#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12909#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:48,304 INFO L273 TraceCheckUtils]: 56: Hoare triple {12909#(<= main_~i~0 25)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12909#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:48,305 INFO L273 TraceCheckUtils]: 57: Hoare triple {12909#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12910#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:48,306 INFO L273 TraceCheckUtils]: 58: Hoare triple {12910#(<= main_~i~0 26)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12910#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:48,306 INFO L273 TraceCheckUtils]: 59: Hoare triple {12910#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12911#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:48,307 INFO L273 TraceCheckUtils]: 60: Hoare triple {12911#(<= main_~i~0 27)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12911#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:48,308 INFO L273 TraceCheckUtils]: 61: Hoare triple {12911#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12912#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:48,308 INFO L273 TraceCheckUtils]: 62: Hoare triple {12912#(<= main_~i~0 28)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12912#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:48,309 INFO L273 TraceCheckUtils]: 63: Hoare triple {12912#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12913#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:48,310 INFO L273 TraceCheckUtils]: 64: Hoare triple {12913#(<= main_~i~0 29)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12913#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:48,310 INFO L273 TraceCheckUtils]: 65: Hoare triple {12913#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12914#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:48,311 INFO L273 TraceCheckUtils]: 66: Hoare triple {12914#(<= main_~i~0 30)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12914#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:48,312 INFO L273 TraceCheckUtils]: 67: Hoare triple {12914#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12915#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:48,312 INFO L273 TraceCheckUtils]: 68: Hoare triple {12915#(<= main_~i~0 31)} assume !(~i~0 < 50000); {12883#false} is VALID [2018-11-23 12:06:48,312 INFO L273 TraceCheckUtils]: 69: Hoare triple {12883#false} havoc ~x~0;~x~0 := 0; {12883#false} is VALID [2018-11-23 12:06:48,313 INFO L273 TraceCheckUtils]: 70: Hoare triple {12883#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {12883#false} is VALID [2018-11-23 12:06:48,313 INFO L256 TraceCheckUtils]: 71: Hoare triple {12883#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {12883#false} is VALID [2018-11-23 12:06:48,313 INFO L273 TraceCheckUtils]: 72: Hoare triple {12883#false} ~cond := #in~cond; {12883#false} is VALID [2018-11-23 12:06:48,313 INFO L273 TraceCheckUtils]: 73: Hoare triple {12883#false} assume 0 == ~cond; {12883#false} is VALID [2018-11-23 12:06:48,314 INFO L273 TraceCheckUtils]: 74: Hoare triple {12883#false} assume !false; {12883#false} is VALID [2018-11-23 12:06:48,319 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:48,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:48,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-11-23 12:06:48,337 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 75 [2018-11-23 12:06:48,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:48,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 12:06:48,425 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-23 12:06:48,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 12:06:48,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 12:06:48,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:06:48,427 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 35 states. [2018-11-23 12:06:49,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:49,204 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2018-11-23 12:06:49,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:06:49,204 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 75 [2018-11-23 12:06:49,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:49,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:06:49,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 96 transitions. [2018-11-23 12:06:49,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:06:49,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 96 transitions. [2018-11-23 12:06:49,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 96 transitions. [2018-11-23 12:06:49,299 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-23 12:06:49,300 INFO L225 Difference]: With dead ends: 94 [2018-11-23 12:06:49,301 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 12:06:49,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:06:49,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 12:06:49,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-11-23 12:06:49,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:49,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 82 states. [2018-11-23 12:06:49,327 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 82 states. [2018-11-23 12:06:49,327 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 82 states. [2018-11-23 12:06:49,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:49,328 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2018-11-23 12:06:49,328 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-11-23 12:06:49,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:49,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:49,329 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 83 states. [2018-11-23 12:06:49,329 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 83 states. [2018-11-23 12:06:49,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:49,330 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2018-11-23 12:06:49,330 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-11-23 12:06:49,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:49,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:49,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:49,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:49,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 12:06:49,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2018-11-23 12:06:49,332 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 75 [2018-11-23 12:06:49,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:49,333 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2018-11-23 12:06:49,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 12:06:49,333 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2018-11-23 12:06:49,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 12:06:49,333 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:49,334 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:49,334 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:49,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:49,334 INFO L82 PathProgramCache]: Analyzing trace with hash -526691534, now seen corresponding path program 32 times [2018-11-23 12:06:49,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:49,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:49,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:49,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:49,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:49,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:50,142 INFO L256 TraceCheckUtils]: 0: Hoare triple {13566#true} call ULTIMATE.init(); {13566#true} is VALID [2018-11-23 12:06:50,142 INFO L273 TraceCheckUtils]: 1: Hoare triple {13566#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13566#true} is VALID [2018-11-23 12:06:50,142 INFO L273 TraceCheckUtils]: 2: Hoare triple {13566#true} assume true; {13566#true} is VALID [2018-11-23 12:06:50,142 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13566#true} {13566#true} #49#return; {13566#true} is VALID [2018-11-23 12:06:50,142 INFO L256 TraceCheckUtils]: 4: Hoare triple {13566#true} call #t~ret5 := main(); {13566#true} is VALID [2018-11-23 12:06:50,143 INFO L273 TraceCheckUtils]: 5: Hoare triple {13566#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {13568#(= main_~i~0 0)} is VALID [2018-11-23 12:06:50,143 INFO L273 TraceCheckUtils]: 6: Hoare triple {13568#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13568#(= main_~i~0 0)} is VALID [2018-11-23 12:06:50,144 INFO L273 TraceCheckUtils]: 7: Hoare triple {13568#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13569#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:50,144 INFO L273 TraceCheckUtils]: 8: Hoare triple {13569#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13569#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:50,144 INFO L273 TraceCheckUtils]: 9: Hoare triple {13569#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13570#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:50,145 INFO L273 TraceCheckUtils]: 10: Hoare triple {13570#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13570#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:50,145 INFO L273 TraceCheckUtils]: 11: Hoare triple {13570#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13571#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:50,145 INFO L273 TraceCheckUtils]: 12: Hoare triple {13571#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13571#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:50,146 INFO L273 TraceCheckUtils]: 13: Hoare triple {13571#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13572#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:50,147 INFO L273 TraceCheckUtils]: 14: Hoare triple {13572#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13572#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:50,147 INFO L273 TraceCheckUtils]: 15: Hoare triple {13572#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13573#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:50,148 INFO L273 TraceCheckUtils]: 16: Hoare triple {13573#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13573#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:50,149 INFO L273 TraceCheckUtils]: 17: Hoare triple {13573#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13574#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:50,149 INFO L273 TraceCheckUtils]: 18: Hoare triple {13574#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13574#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:50,150 INFO L273 TraceCheckUtils]: 19: Hoare triple {13574#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13575#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:50,151 INFO L273 TraceCheckUtils]: 20: Hoare triple {13575#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13575#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:50,151 INFO L273 TraceCheckUtils]: 21: Hoare triple {13575#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13576#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:50,156 INFO L273 TraceCheckUtils]: 22: Hoare triple {13576#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13576#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:50,156 INFO L273 TraceCheckUtils]: 23: Hoare triple {13576#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13577#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:50,156 INFO L273 TraceCheckUtils]: 24: Hoare triple {13577#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13577#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:50,157 INFO L273 TraceCheckUtils]: 25: Hoare triple {13577#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13578#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:50,157 INFO L273 TraceCheckUtils]: 26: Hoare triple {13578#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13578#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:50,158 INFO L273 TraceCheckUtils]: 27: Hoare triple {13578#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13579#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:50,158 INFO L273 TraceCheckUtils]: 28: Hoare triple {13579#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13579#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:50,158 INFO L273 TraceCheckUtils]: 29: Hoare triple {13579#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13580#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:50,159 INFO L273 TraceCheckUtils]: 30: Hoare triple {13580#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13580#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:50,159 INFO L273 TraceCheckUtils]: 31: Hoare triple {13580#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13581#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:50,160 INFO L273 TraceCheckUtils]: 32: Hoare triple {13581#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13581#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:50,160 INFO L273 TraceCheckUtils]: 33: Hoare triple {13581#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13582#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:50,161 INFO L273 TraceCheckUtils]: 34: Hoare triple {13582#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13582#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:50,162 INFO L273 TraceCheckUtils]: 35: Hoare triple {13582#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13583#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:50,162 INFO L273 TraceCheckUtils]: 36: Hoare triple {13583#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13583#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:50,163 INFO L273 TraceCheckUtils]: 37: Hoare triple {13583#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13584#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:50,163 INFO L273 TraceCheckUtils]: 38: Hoare triple {13584#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13584#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:50,164 INFO L273 TraceCheckUtils]: 39: Hoare triple {13584#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13585#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:50,165 INFO L273 TraceCheckUtils]: 40: Hoare triple {13585#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13585#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:50,165 INFO L273 TraceCheckUtils]: 41: Hoare triple {13585#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13586#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:50,166 INFO L273 TraceCheckUtils]: 42: Hoare triple {13586#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13586#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:50,167 INFO L273 TraceCheckUtils]: 43: Hoare triple {13586#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13587#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:50,167 INFO L273 TraceCheckUtils]: 44: Hoare triple {13587#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13587#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:50,168 INFO L273 TraceCheckUtils]: 45: Hoare triple {13587#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13588#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:50,168 INFO L273 TraceCheckUtils]: 46: Hoare triple {13588#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13588#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:50,169 INFO L273 TraceCheckUtils]: 47: Hoare triple {13588#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13589#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:50,170 INFO L273 TraceCheckUtils]: 48: Hoare triple {13589#(<= main_~i~0 21)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13589#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:50,170 INFO L273 TraceCheckUtils]: 49: Hoare triple {13589#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13590#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:50,171 INFO L273 TraceCheckUtils]: 50: Hoare triple {13590#(<= main_~i~0 22)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13590#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:50,172 INFO L273 TraceCheckUtils]: 51: Hoare triple {13590#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13591#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:50,172 INFO L273 TraceCheckUtils]: 52: Hoare triple {13591#(<= main_~i~0 23)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13591#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:50,173 INFO L273 TraceCheckUtils]: 53: Hoare triple {13591#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13592#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:50,173 INFO L273 TraceCheckUtils]: 54: Hoare triple {13592#(<= main_~i~0 24)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13592#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:50,174 INFO L273 TraceCheckUtils]: 55: Hoare triple {13592#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13593#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:50,175 INFO L273 TraceCheckUtils]: 56: Hoare triple {13593#(<= main_~i~0 25)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13593#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:50,175 INFO L273 TraceCheckUtils]: 57: Hoare triple {13593#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13594#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:50,176 INFO L273 TraceCheckUtils]: 58: Hoare triple {13594#(<= main_~i~0 26)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13594#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:50,177 INFO L273 TraceCheckUtils]: 59: Hoare triple {13594#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13595#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:50,177 INFO L273 TraceCheckUtils]: 60: Hoare triple {13595#(<= main_~i~0 27)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13595#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:50,178 INFO L273 TraceCheckUtils]: 61: Hoare triple {13595#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13596#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:50,178 INFO L273 TraceCheckUtils]: 62: Hoare triple {13596#(<= main_~i~0 28)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13596#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:50,179 INFO L273 TraceCheckUtils]: 63: Hoare triple {13596#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13597#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:50,180 INFO L273 TraceCheckUtils]: 64: Hoare triple {13597#(<= main_~i~0 29)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13597#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:50,180 INFO L273 TraceCheckUtils]: 65: Hoare triple {13597#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13598#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:50,181 INFO L273 TraceCheckUtils]: 66: Hoare triple {13598#(<= main_~i~0 30)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13598#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:50,182 INFO L273 TraceCheckUtils]: 67: Hoare triple {13598#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13599#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:50,182 INFO L273 TraceCheckUtils]: 68: Hoare triple {13599#(<= main_~i~0 31)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13599#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:50,183 INFO L273 TraceCheckUtils]: 69: Hoare triple {13599#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13600#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:50,184 INFO L273 TraceCheckUtils]: 70: Hoare triple {13600#(<= main_~i~0 32)} assume !(~i~0 < 50000); {13567#false} is VALID [2018-11-23 12:06:50,184 INFO L273 TraceCheckUtils]: 71: Hoare triple {13567#false} havoc ~x~0;~x~0 := 0; {13567#false} is VALID [2018-11-23 12:06:50,184 INFO L273 TraceCheckUtils]: 72: Hoare triple {13567#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {13567#false} is VALID [2018-11-23 12:06:50,184 INFO L256 TraceCheckUtils]: 73: Hoare triple {13567#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {13567#false} is VALID [2018-11-23 12:06:50,184 INFO L273 TraceCheckUtils]: 74: Hoare triple {13567#false} ~cond := #in~cond; {13567#false} is VALID [2018-11-23 12:06:50,185 INFO L273 TraceCheckUtils]: 75: Hoare triple {13567#false} assume 0 == ~cond; {13567#false} is VALID [2018-11-23 12:06:50,185 INFO L273 TraceCheckUtils]: 76: Hoare triple {13567#false} assume !false; {13567#false} is VALID [2018-11-23 12:06:50,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:50,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:50,190 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-23 12:06:50,199 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:06:50,234 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:06:50,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:50,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:50,521 INFO L256 TraceCheckUtils]: 0: Hoare triple {13566#true} call ULTIMATE.init(); {13566#true} is VALID [2018-11-23 12:06:50,521 INFO L273 TraceCheckUtils]: 1: Hoare triple {13566#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13566#true} is VALID [2018-11-23 12:06:50,522 INFO L273 TraceCheckUtils]: 2: Hoare triple {13566#true} assume true; {13566#true} is VALID [2018-11-23 12:06:50,522 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13566#true} {13566#true} #49#return; {13566#true} is VALID [2018-11-23 12:06:50,522 INFO L256 TraceCheckUtils]: 4: Hoare triple {13566#true} call #t~ret5 := main(); {13566#true} is VALID [2018-11-23 12:06:50,522 INFO L273 TraceCheckUtils]: 5: Hoare triple {13566#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {13619#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:50,523 INFO L273 TraceCheckUtils]: 6: Hoare triple {13619#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13619#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:50,523 INFO L273 TraceCheckUtils]: 7: Hoare triple {13619#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13569#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:50,523 INFO L273 TraceCheckUtils]: 8: Hoare triple {13569#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13569#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:50,524 INFO L273 TraceCheckUtils]: 9: Hoare triple {13569#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13570#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:50,524 INFO L273 TraceCheckUtils]: 10: Hoare triple {13570#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13570#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:50,525 INFO L273 TraceCheckUtils]: 11: Hoare triple {13570#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13571#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:50,526 INFO L273 TraceCheckUtils]: 12: Hoare triple {13571#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13571#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:50,532 INFO L273 TraceCheckUtils]: 13: Hoare triple {13571#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13572#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:50,533 INFO L273 TraceCheckUtils]: 14: Hoare triple {13572#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13572#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:50,533 INFO L273 TraceCheckUtils]: 15: Hoare triple {13572#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13573#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:50,534 INFO L273 TraceCheckUtils]: 16: Hoare triple {13573#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13573#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:50,534 INFO L273 TraceCheckUtils]: 17: Hoare triple {13573#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13574#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:50,534 INFO L273 TraceCheckUtils]: 18: Hoare triple {13574#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13574#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:50,535 INFO L273 TraceCheckUtils]: 19: Hoare triple {13574#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13575#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:50,535 INFO L273 TraceCheckUtils]: 20: Hoare triple {13575#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13575#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:50,535 INFO L273 TraceCheckUtils]: 21: Hoare triple {13575#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13576#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:50,536 INFO L273 TraceCheckUtils]: 22: Hoare triple {13576#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13576#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:50,536 INFO L273 TraceCheckUtils]: 23: Hoare triple {13576#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13577#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:50,537 INFO L273 TraceCheckUtils]: 24: Hoare triple {13577#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13577#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:50,538 INFO L273 TraceCheckUtils]: 25: Hoare triple {13577#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13578#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:50,538 INFO L273 TraceCheckUtils]: 26: Hoare triple {13578#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13578#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:50,539 INFO L273 TraceCheckUtils]: 27: Hoare triple {13578#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13579#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:50,539 INFO L273 TraceCheckUtils]: 28: Hoare triple {13579#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13579#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:50,540 INFO L273 TraceCheckUtils]: 29: Hoare triple {13579#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13580#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:50,541 INFO L273 TraceCheckUtils]: 30: Hoare triple {13580#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13580#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:50,542 INFO L273 TraceCheckUtils]: 31: Hoare triple {13580#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13581#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:50,542 INFO L273 TraceCheckUtils]: 32: Hoare triple {13581#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13581#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:50,543 INFO L273 TraceCheckUtils]: 33: Hoare triple {13581#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13582#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:50,543 INFO L273 TraceCheckUtils]: 34: Hoare triple {13582#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13582#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:50,544 INFO L273 TraceCheckUtils]: 35: Hoare triple {13582#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13583#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:50,545 INFO L273 TraceCheckUtils]: 36: Hoare triple {13583#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13583#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:50,545 INFO L273 TraceCheckUtils]: 37: Hoare triple {13583#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13584#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:50,546 INFO L273 TraceCheckUtils]: 38: Hoare triple {13584#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13584#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:50,547 INFO L273 TraceCheckUtils]: 39: Hoare triple {13584#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13585#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:50,547 INFO L273 TraceCheckUtils]: 40: Hoare triple {13585#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13585#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:50,548 INFO L273 TraceCheckUtils]: 41: Hoare triple {13585#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13586#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:50,548 INFO L273 TraceCheckUtils]: 42: Hoare triple {13586#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13586#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:50,549 INFO L273 TraceCheckUtils]: 43: Hoare triple {13586#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13587#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:50,550 INFO L273 TraceCheckUtils]: 44: Hoare triple {13587#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13587#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:50,550 INFO L273 TraceCheckUtils]: 45: Hoare triple {13587#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13588#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:50,551 INFO L273 TraceCheckUtils]: 46: Hoare triple {13588#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13588#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:50,552 INFO L273 TraceCheckUtils]: 47: Hoare triple {13588#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13589#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:50,552 INFO L273 TraceCheckUtils]: 48: Hoare triple {13589#(<= main_~i~0 21)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13589#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:50,553 INFO L273 TraceCheckUtils]: 49: Hoare triple {13589#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13590#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:50,553 INFO L273 TraceCheckUtils]: 50: Hoare triple {13590#(<= main_~i~0 22)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13590#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:50,554 INFO L273 TraceCheckUtils]: 51: Hoare triple {13590#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13591#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:50,555 INFO L273 TraceCheckUtils]: 52: Hoare triple {13591#(<= main_~i~0 23)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13591#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:50,555 INFO L273 TraceCheckUtils]: 53: Hoare triple {13591#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13592#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:50,556 INFO L273 TraceCheckUtils]: 54: Hoare triple {13592#(<= main_~i~0 24)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13592#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:50,557 INFO L273 TraceCheckUtils]: 55: Hoare triple {13592#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13593#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:50,557 INFO L273 TraceCheckUtils]: 56: Hoare triple {13593#(<= main_~i~0 25)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13593#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:50,558 INFO L273 TraceCheckUtils]: 57: Hoare triple {13593#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13594#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:50,558 INFO L273 TraceCheckUtils]: 58: Hoare triple {13594#(<= main_~i~0 26)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13594#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:50,559 INFO L273 TraceCheckUtils]: 59: Hoare triple {13594#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13595#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:50,560 INFO L273 TraceCheckUtils]: 60: Hoare triple {13595#(<= main_~i~0 27)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13595#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:50,560 INFO L273 TraceCheckUtils]: 61: Hoare triple {13595#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13596#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:50,561 INFO L273 TraceCheckUtils]: 62: Hoare triple {13596#(<= main_~i~0 28)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13596#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:50,562 INFO L273 TraceCheckUtils]: 63: Hoare triple {13596#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13597#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:50,562 INFO L273 TraceCheckUtils]: 64: Hoare triple {13597#(<= main_~i~0 29)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13597#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:50,563 INFO L273 TraceCheckUtils]: 65: Hoare triple {13597#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13598#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:50,563 INFO L273 TraceCheckUtils]: 66: Hoare triple {13598#(<= main_~i~0 30)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13598#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:50,564 INFO L273 TraceCheckUtils]: 67: Hoare triple {13598#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13599#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:50,565 INFO L273 TraceCheckUtils]: 68: Hoare triple {13599#(<= main_~i~0 31)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {13599#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:50,565 INFO L273 TraceCheckUtils]: 69: Hoare triple {13599#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13600#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:50,566 INFO L273 TraceCheckUtils]: 70: Hoare triple {13600#(<= main_~i~0 32)} assume !(~i~0 < 50000); {13567#false} is VALID [2018-11-23 12:06:50,566 INFO L273 TraceCheckUtils]: 71: Hoare triple {13567#false} havoc ~x~0;~x~0 := 0; {13567#false} is VALID [2018-11-23 12:06:50,567 INFO L273 TraceCheckUtils]: 72: Hoare triple {13567#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {13567#false} is VALID [2018-11-23 12:06:50,567 INFO L256 TraceCheckUtils]: 73: Hoare triple {13567#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {13567#false} is VALID [2018-11-23 12:06:50,567 INFO L273 TraceCheckUtils]: 74: Hoare triple {13567#false} ~cond := #in~cond; {13567#false} is VALID [2018-11-23 12:06:50,567 INFO L273 TraceCheckUtils]: 75: Hoare triple {13567#false} assume 0 == ~cond; {13567#false} is VALID [2018-11-23 12:06:50,567 INFO L273 TraceCheckUtils]: 76: Hoare triple {13567#false} assume !false; {13567#false} is VALID [2018-11-23 12:06:50,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:50,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:50,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-11-23 12:06:50,591 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 77 [2018-11-23 12:06:50,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:50,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 12:06:50,679 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-23 12:06:50,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 12:06:50,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 12:06:50,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:06:50,681 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 36 states. [2018-11-23 12:06:52,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:52,004 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2018-11-23 12:06:52,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 12:06:52,005 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 77 [2018-11-23 12:06:52,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:52,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:06:52,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 98 transitions. [2018-11-23 12:06:52,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:06:52,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 98 transitions. [2018-11-23 12:06:52,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 98 transitions. [2018-11-23 12:06:52,152 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-23 12:06:52,153 INFO L225 Difference]: With dead ends: 96 [2018-11-23 12:06:52,153 INFO L226 Difference]: Without dead ends: 85 [2018-11-23 12:06:52,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:06:52,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-23 12:06:52,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-11-23 12:06:52,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:52,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 84 states. [2018-11-23 12:06:52,197 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 84 states. [2018-11-23 12:06:52,197 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 84 states. [2018-11-23 12:06:52,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:52,199 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2018-11-23 12:06:52,200 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-11-23 12:06:52,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:52,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:52,200 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 85 states. [2018-11-23 12:06:52,201 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 85 states. [2018-11-23 12:06:52,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:52,202 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2018-11-23 12:06:52,202 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-11-23 12:06:52,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:52,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:52,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:52,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:52,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 12:06:52,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2018-11-23 12:06:52,204 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 77 [2018-11-23 12:06:52,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:52,205 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2018-11-23 12:06:52,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 12:06:52,205 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-11-23 12:06:52,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 12:06:52,205 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:52,206 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:52,206 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:52,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:52,206 INFO L82 PathProgramCache]: Analyzing trace with hash 685528144, now seen corresponding path program 33 times [2018-11-23 12:06:52,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:52,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:52,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:52,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:52,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:52,892 INFO L256 TraceCheckUtils]: 0: Hoare triple {14267#true} call ULTIMATE.init(); {14267#true} is VALID [2018-11-23 12:06:52,893 INFO L273 TraceCheckUtils]: 1: Hoare triple {14267#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14267#true} is VALID [2018-11-23 12:06:52,893 INFO L273 TraceCheckUtils]: 2: Hoare triple {14267#true} assume true; {14267#true} is VALID [2018-11-23 12:06:52,893 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14267#true} {14267#true} #49#return; {14267#true} is VALID [2018-11-23 12:06:52,893 INFO L256 TraceCheckUtils]: 4: Hoare triple {14267#true} call #t~ret5 := main(); {14267#true} is VALID [2018-11-23 12:06:52,893 INFO L273 TraceCheckUtils]: 5: Hoare triple {14267#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {14269#(= main_~i~0 0)} is VALID [2018-11-23 12:06:52,894 INFO L273 TraceCheckUtils]: 6: Hoare triple {14269#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14269#(= main_~i~0 0)} is VALID [2018-11-23 12:06:52,894 INFO L273 TraceCheckUtils]: 7: Hoare triple {14269#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14270#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:52,894 INFO L273 TraceCheckUtils]: 8: Hoare triple {14270#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14270#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:52,895 INFO L273 TraceCheckUtils]: 9: Hoare triple {14270#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14271#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:52,896 INFO L273 TraceCheckUtils]: 10: Hoare triple {14271#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14271#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:52,896 INFO L273 TraceCheckUtils]: 11: Hoare triple {14271#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14272#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:52,897 INFO L273 TraceCheckUtils]: 12: Hoare triple {14272#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14272#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:52,898 INFO L273 TraceCheckUtils]: 13: Hoare triple {14272#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14273#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:52,898 INFO L273 TraceCheckUtils]: 14: Hoare triple {14273#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14273#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:52,899 INFO L273 TraceCheckUtils]: 15: Hoare triple {14273#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14274#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:52,899 INFO L273 TraceCheckUtils]: 16: Hoare triple {14274#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14274#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:52,900 INFO L273 TraceCheckUtils]: 17: Hoare triple {14274#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14275#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:52,901 INFO L273 TraceCheckUtils]: 18: Hoare triple {14275#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14275#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:52,901 INFO L273 TraceCheckUtils]: 19: Hoare triple {14275#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14276#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:52,902 INFO L273 TraceCheckUtils]: 20: Hoare triple {14276#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14276#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:52,903 INFO L273 TraceCheckUtils]: 21: Hoare triple {14276#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14277#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:52,903 INFO L273 TraceCheckUtils]: 22: Hoare triple {14277#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14277#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:52,904 INFO L273 TraceCheckUtils]: 23: Hoare triple {14277#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14278#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:52,904 INFO L273 TraceCheckUtils]: 24: Hoare triple {14278#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14278#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:52,905 INFO L273 TraceCheckUtils]: 25: Hoare triple {14278#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14279#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:52,906 INFO L273 TraceCheckUtils]: 26: Hoare triple {14279#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14279#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:52,906 INFO L273 TraceCheckUtils]: 27: Hoare triple {14279#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14280#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:52,907 INFO L273 TraceCheckUtils]: 28: Hoare triple {14280#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14280#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:52,908 INFO L273 TraceCheckUtils]: 29: Hoare triple {14280#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14281#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:52,908 INFO L273 TraceCheckUtils]: 30: Hoare triple {14281#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14281#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:52,909 INFO L273 TraceCheckUtils]: 31: Hoare triple {14281#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14282#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:52,909 INFO L273 TraceCheckUtils]: 32: Hoare triple {14282#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14282#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:52,910 INFO L273 TraceCheckUtils]: 33: Hoare triple {14282#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14283#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:52,911 INFO L273 TraceCheckUtils]: 34: Hoare triple {14283#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14283#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:52,911 INFO L273 TraceCheckUtils]: 35: Hoare triple {14283#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14284#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:52,912 INFO L273 TraceCheckUtils]: 36: Hoare triple {14284#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14284#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:52,913 INFO L273 TraceCheckUtils]: 37: Hoare triple {14284#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14285#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:52,913 INFO L273 TraceCheckUtils]: 38: Hoare triple {14285#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14285#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:52,914 INFO L273 TraceCheckUtils]: 39: Hoare triple {14285#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14286#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:52,914 INFO L273 TraceCheckUtils]: 40: Hoare triple {14286#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14286#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:52,915 INFO L273 TraceCheckUtils]: 41: Hoare triple {14286#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14287#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:52,916 INFO L273 TraceCheckUtils]: 42: Hoare triple {14287#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14287#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:52,916 INFO L273 TraceCheckUtils]: 43: Hoare triple {14287#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14288#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:52,917 INFO L273 TraceCheckUtils]: 44: Hoare triple {14288#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14288#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:52,918 INFO L273 TraceCheckUtils]: 45: Hoare triple {14288#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14289#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:52,918 INFO L273 TraceCheckUtils]: 46: Hoare triple {14289#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14289#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:52,919 INFO L273 TraceCheckUtils]: 47: Hoare triple {14289#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14290#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:52,919 INFO L273 TraceCheckUtils]: 48: Hoare triple {14290#(<= main_~i~0 21)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14290#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:52,920 INFO L273 TraceCheckUtils]: 49: Hoare triple {14290#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14291#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:52,921 INFO L273 TraceCheckUtils]: 50: Hoare triple {14291#(<= main_~i~0 22)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14291#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:52,921 INFO L273 TraceCheckUtils]: 51: Hoare triple {14291#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14292#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:52,922 INFO L273 TraceCheckUtils]: 52: Hoare triple {14292#(<= main_~i~0 23)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14292#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:52,923 INFO L273 TraceCheckUtils]: 53: Hoare triple {14292#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14293#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:52,923 INFO L273 TraceCheckUtils]: 54: Hoare triple {14293#(<= main_~i~0 24)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14293#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:52,924 INFO L273 TraceCheckUtils]: 55: Hoare triple {14293#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14294#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:52,924 INFO L273 TraceCheckUtils]: 56: Hoare triple {14294#(<= main_~i~0 25)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14294#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:52,925 INFO L273 TraceCheckUtils]: 57: Hoare triple {14294#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14295#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:52,926 INFO L273 TraceCheckUtils]: 58: Hoare triple {14295#(<= main_~i~0 26)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14295#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:52,926 INFO L273 TraceCheckUtils]: 59: Hoare triple {14295#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14296#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:52,927 INFO L273 TraceCheckUtils]: 60: Hoare triple {14296#(<= main_~i~0 27)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14296#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:52,928 INFO L273 TraceCheckUtils]: 61: Hoare triple {14296#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14297#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:52,928 INFO L273 TraceCheckUtils]: 62: Hoare triple {14297#(<= main_~i~0 28)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14297#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:52,929 INFO L273 TraceCheckUtils]: 63: Hoare triple {14297#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14298#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:52,929 INFO L273 TraceCheckUtils]: 64: Hoare triple {14298#(<= main_~i~0 29)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14298#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:52,930 INFO L273 TraceCheckUtils]: 65: Hoare triple {14298#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14299#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:52,931 INFO L273 TraceCheckUtils]: 66: Hoare triple {14299#(<= main_~i~0 30)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14299#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:52,931 INFO L273 TraceCheckUtils]: 67: Hoare triple {14299#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14300#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:52,932 INFO L273 TraceCheckUtils]: 68: Hoare triple {14300#(<= main_~i~0 31)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14300#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:52,933 INFO L273 TraceCheckUtils]: 69: Hoare triple {14300#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14301#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:52,933 INFO L273 TraceCheckUtils]: 70: Hoare triple {14301#(<= main_~i~0 32)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14301#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:52,935 INFO L273 TraceCheckUtils]: 71: Hoare triple {14301#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14302#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:52,936 INFO L273 TraceCheckUtils]: 72: Hoare triple {14302#(<= main_~i~0 33)} assume !(~i~0 < 50000); {14268#false} is VALID [2018-11-23 12:06:52,936 INFO L273 TraceCheckUtils]: 73: Hoare triple {14268#false} havoc ~x~0;~x~0 := 0; {14268#false} is VALID [2018-11-23 12:06:52,936 INFO L273 TraceCheckUtils]: 74: Hoare triple {14268#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {14268#false} is VALID [2018-11-23 12:06:52,936 INFO L256 TraceCheckUtils]: 75: Hoare triple {14268#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {14268#false} is VALID [2018-11-23 12:06:52,936 INFO L273 TraceCheckUtils]: 76: Hoare triple {14268#false} ~cond := #in~cond; {14268#false} is VALID [2018-11-23 12:06:52,937 INFO L273 TraceCheckUtils]: 77: Hoare triple {14268#false} assume 0 == ~cond; {14268#false} is VALID [2018-11-23 12:06:52,937 INFO L273 TraceCheckUtils]: 78: Hoare triple {14268#false} assume !false; {14268#false} is VALID [2018-11-23 12:06:52,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:52,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:52,941 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-23 12:06:52,950 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:07:20,371 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-11-23 12:07:20,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:20,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:20,606 INFO L256 TraceCheckUtils]: 0: Hoare triple {14267#true} call ULTIMATE.init(); {14267#true} is VALID [2018-11-23 12:07:20,606 INFO L273 TraceCheckUtils]: 1: Hoare triple {14267#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14267#true} is VALID [2018-11-23 12:07:20,606 INFO L273 TraceCheckUtils]: 2: Hoare triple {14267#true} assume true; {14267#true} is VALID [2018-11-23 12:07:20,606 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14267#true} {14267#true} #49#return; {14267#true} is VALID [2018-11-23 12:07:20,607 INFO L256 TraceCheckUtils]: 4: Hoare triple {14267#true} call #t~ret5 := main(); {14267#true} is VALID [2018-11-23 12:07:20,607 INFO L273 TraceCheckUtils]: 5: Hoare triple {14267#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {14321#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:20,608 INFO L273 TraceCheckUtils]: 6: Hoare triple {14321#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14321#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:20,608 INFO L273 TraceCheckUtils]: 7: Hoare triple {14321#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14270#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:20,609 INFO L273 TraceCheckUtils]: 8: Hoare triple {14270#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14270#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:20,609 INFO L273 TraceCheckUtils]: 9: Hoare triple {14270#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14271#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:20,609 INFO L273 TraceCheckUtils]: 10: Hoare triple {14271#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14271#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:20,610 INFO L273 TraceCheckUtils]: 11: Hoare triple {14271#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14272#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:20,610 INFO L273 TraceCheckUtils]: 12: Hoare triple {14272#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14272#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:20,611 INFO L273 TraceCheckUtils]: 13: Hoare triple {14272#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14273#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:20,612 INFO L273 TraceCheckUtils]: 14: Hoare triple {14273#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14273#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:20,612 INFO L273 TraceCheckUtils]: 15: Hoare triple {14273#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14274#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:20,613 INFO L273 TraceCheckUtils]: 16: Hoare triple {14274#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14274#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:20,614 INFO L273 TraceCheckUtils]: 17: Hoare triple {14274#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14275#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:20,614 INFO L273 TraceCheckUtils]: 18: Hoare triple {14275#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14275#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:20,615 INFO L273 TraceCheckUtils]: 19: Hoare triple {14275#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14276#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:20,615 INFO L273 TraceCheckUtils]: 20: Hoare triple {14276#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14276#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:20,616 INFO L273 TraceCheckUtils]: 21: Hoare triple {14276#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14277#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:20,617 INFO L273 TraceCheckUtils]: 22: Hoare triple {14277#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14277#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:20,617 INFO L273 TraceCheckUtils]: 23: Hoare triple {14277#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14278#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:20,618 INFO L273 TraceCheckUtils]: 24: Hoare triple {14278#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14278#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:20,619 INFO L273 TraceCheckUtils]: 25: Hoare triple {14278#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14279#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:20,619 INFO L273 TraceCheckUtils]: 26: Hoare triple {14279#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14279#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:20,620 INFO L273 TraceCheckUtils]: 27: Hoare triple {14279#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14280#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:20,620 INFO L273 TraceCheckUtils]: 28: Hoare triple {14280#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14280#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:20,621 INFO L273 TraceCheckUtils]: 29: Hoare triple {14280#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14281#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:20,622 INFO L273 TraceCheckUtils]: 30: Hoare triple {14281#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14281#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:20,622 INFO L273 TraceCheckUtils]: 31: Hoare triple {14281#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14282#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:20,623 INFO L273 TraceCheckUtils]: 32: Hoare triple {14282#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14282#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:20,624 INFO L273 TraceCheckUtils]: 33: Hoare triple {14282#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14283#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:20,624 INFO L273 TraceCheckUtils]: 34: Hoare triple {14283#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14283#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:20,625 INFO L273 TraceCheckUtils]: 35: Hoare triple {14283#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14284#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:20,625 INFO L273 TraceCheckUtils]: 36: Hoare triple {14284#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14284#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:20,626 INFO L273 TraceCheckUtils]: 37: Hoare triple {14284#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14285#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:20,627 INFO L273 TraceCheckUtils]: 38: Hoare triple {14285#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14285#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:20,627 INFO L273 TraceCheckUtils]: 39: Hoare triple {14285#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14286#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:20,628 INFO L273 TraceCheckUtils]: 40: Hoare triple {14286#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14286#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:20,629 INFO L273 TraceCheckUtils]: 41: Hoare triple {14286#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14287#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:20,629 INFO L273 TraceCheckUtils]: 42: Hoare triple {14287#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14287#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:20,630 INFO L273 TraceCheckUtils]: 43: Hoare triple {14287#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14288#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:20,630 INFO L273 TraceCheckUtils]: 44: Hoare triple {14288#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14288#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:20,631 INFO L273 TraceCheckUtils]: 45: Hoare triple {14288#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14289#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:20,632 INFO L273 TraceCheckUtils]: 46: Hoare triple {14289#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14289#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:20,632 INFO L273 TraceCheckUtils]: 47: Hoare triple {14289#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14290#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:20,633 INFO L273 TraceCheckUtils]: 48: Hoare triple {14290#(<= main_~i~0 21)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14290#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:20,634 INFO L273 TraceCheckUtils]: 49: Hoare triple {14290#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14291#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:20,634 INFO L273 TraceCheckUtils]: 50: Hoare triple {14291#(<= main_~i~0 22)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14291#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:20,635 INFO L273 TraceCheckUtils]: 51: Hoare triple {14291#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14292#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:20,635 INFO L273 TraceCheckUtils]: 52: Hoare triple {14292#(<= main_~i~0 23)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14292#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:20,636 INFO L273 TraceCheckUtils]: 53: Hoare triple {14292#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14293#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:20,637 INFO L273 TraceCheckUtils]: 54: Hoare triple {14293#(<= main_~i~0 24)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14293#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:20,637 INFO L273 TraceCheckUtils]: 55: Hoare triple {14293#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14294#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:20,638 INFO L273 TraceCheckUtils]: 56: Hoare triple {14294#(<= main_~i~0 25)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14294#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:20,639 INFO L273 TraceCheckUtils]: 57: Hoare triple {14294#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14295#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:20,639 INFO L273 TraceCheckUtils]: 58: Hoare triple {14295#(<= main_~i~0 26)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14295#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:20,640 INFO L273 TraceCheckUtils]: 59: Hoare triple {14295#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14296#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:20,640 INFO L273 TraceCheckUtils]: 60: Hoare triple {14296#(<= main_~i~0 27)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14296#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:20,641 INFO L273 TraceCheckUtils]: 61: Hoare triple {14296#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14297#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:20,642 INFO L273 TraceCheckUtils]: 62: Hoare triple {14297#(<= main_~i~0 28)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14297#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:20,642 INFO L273 TraceCheckUtils]: 63: Hoare triple {14297#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14298#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:20,643 INFO L273 TraceCheckUtils]: 64: Hoare triple {14298#(<= main_~i~0 29)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14298#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:20,644 INFO L273 TraceCheckUtils]: 65: Hoare triple {14298#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14299#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:20,644 INFO L273 TraceCheckUtils]: 66: Hoare triple {14299#(<= main_~i~0 30)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14299#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:20,645 INFO L273 TraceCheckUtils]: 67: Hoare triple {14299#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14300#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:20,645 INFO L273 TraceCheckUtils]: 68: Hoare triple {14300#(<= main_~i~0 31)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14300#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:20,646 INFO L273 TraceCheckUtils]: 69: Hoare triple {14300#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14301#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:20,647 INFO L273 TraceCheckUtils]: 70: Hoare triple {14301#(<= main_~i~0 32)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14301#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:20,647 INFO L273 TraceCheckUtils]: 71: Hoare triple {14301#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14302#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:20,648 INFO L273 TraceCheckUtils]: 72: Hoare triple {14302#(<= main_~i~0 33)} assume !(~i~0 < 50000); {14268#false} is VALID [2018-11-23 12:07:20,648 INFO L273 TraceCheckUtils]: 73: Hoare triple {14268#false} havoc ~x~0;~x~0 := 0; {14268#false} is VALID [2018-11-23 12:07:20,649 INFO L273 TraceCheckUtils]: 74: Hoare triple {14268#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {14268#false} is VALID [2018-11-23 12:07:20,649 INFO L256 TraceCheckUtils]: 75: Hoare triple {14268#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {14268#false} is VALID [2018-11-23 12:07:20,649 INFO L273 TraceCheckUtils]: 76: Hoare triple {14268#false} ~cond := #in~cond; {14268#false} is VALID [2018-11-23 12:07:20,649 INFO L273 TraceCheckUtils]: 77: Hoare triple {14268#false} assume 0 == ~cond; {14268#false} is VALID [2018-11-23 12:07:20,649 INFO L273 TraceCheckUtils]: 78: Hoare triple {14268#false} assume !false; {14268#false} is VALID [2018-11-23 12:07:20,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:20,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:20,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-11-23 12:07:20,679 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 79 [2018-11-23 12:07:20,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:20,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-23 12:07:20,761 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:20,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-23 12:07:20,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-23 12:07:20,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 12:07:20,763 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 37 states. [2018-11-23 12:07:21,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:21,381 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2018-11-23 12:07:21,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 12:07:21,381 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 79 [2018-11-23 12:07:21,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:21,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:07:21,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 100 transitions. [2018-11-23 12:07:21,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:07:21,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 100 transitions. [2018-11-23 12:07:21,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 100 transitions. [2018-11-23 12:07:22,450 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:22,451 INFO L225 Difference]: With dead ends: 98 [2018-11-23 12:07:22,451 INFO L226 Difference]: Without dead ends: 87 [2018-11-23 12:07:22,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 12:07:22,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-23 12:07:22,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-11-23 12:07:22,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:22,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 86 states. [2018-11-23 12:07:22,621 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 86 states. [2018-11-23 12:07:22,621 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 86 states. [2018-11-23 12:07:22,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:22,623 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2018-11-23 12:07:22,623 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-11-23 12:07:22,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:22,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:22,624 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 87 states. [2018-11-23 12:07:22,624 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 87 states. [2018-11-23 12:07:22,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:22,625 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2018-11-23 12:07:22,625 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-11-23 12:07:22,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:22,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:22,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:22,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:22,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 12:07:22,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2018-11-23 12:07:22,626 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 79 [2018-11-23 12:07:22,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:22,627 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2018-11-23 12:07:22,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-23 12:07:22,627 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2018-11-23 12:07:22,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 12:07:22,627 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:22,627 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:22,628 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:22,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:22,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1692501486, now seen corresponding path program 34 times [2018-11-23 12:07:22,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:22,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:22,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:22,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:22,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:23,301 INFO L256 TraceCheckUtils]: 0: Hoare triple {14985#true} call ULTIMATE.init(); {14985#true} is VALID [2018-11-23 12:07:23,301 INFO L273 TraceCheckUtils]: 1: Hoare triple {14985#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14985#true} is VALID [2018-11-23 12:07:23,301 INFO L273 TraceCheckUtils]: 2: Hoare triple {14985#true} assume true; {14985#true} is VALID [2018-11-23 12:07:23,301 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14985#true} {14985#true} #49#return; {14985#true} is VALID [2018-11-23 12:07:23,302 INFO L256 TraceCheckUtils]: 4: Hoare triple {14985#true} call #t~ret5 := main(); {14985#true} is VALID [2018-11-23 12:07:23,302 INFO L273 TraceCheckUtils]: 5: Hoare triple {14985#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {14987#(= main_~i~0 0)} is VALID [2018-11-23 12:07:23,303 INFO L273 TraceCheckUtils]: 6: Hoare triple {14987#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14987#(= main_~i~0 0)} is VALID [2018-11-23 12:07:23,303 INFO L273 TraceCheckUtils]: 7: Hoare triple {14987#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14988#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:23,304 INFO L273 TraceCheckUtils]: 8: Hoare triple {14988#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14988#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:23,304 INFO L273 TraceCheckUtils]: 9: Hoare triple {14988#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14989#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:23,305 INFO L273 TraceCheckUtils]: 10: Hoare triple {14989#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14989#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:23,305 INFO L273 TraceCheckUtils]: 11: Hoare triple {14989#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14990#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:23,305 INFO L273 TraceCheckUtils]: 12: Hoare triple {14990#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14990#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:23,306 INFO L273 TraceCheckUtils]: 13: Hoare triple {14990#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14991#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:23,306 INFO L273 TraceCheckUtils]: 14: Hoare triple {14991#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14991#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:23,307 INFO L273 TraceCheckUtils]: 15: Hoare triple {14991#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14992#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:23,307 INFO L273 TraceCheckUtils]: 16: Hoare triple {14992#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14992#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:23,308 INFO L273 TraceCheckUtils]: 17: Hoare triple {14992#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14993#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:23,308 INFO L273 TraceCheckUtils]: 18: Hoare triple {14993#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14993#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:23,309 INFO L273 TraceCheckUtils]: 19: Hoare triple {14993#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14994#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:23,309 INFO L273 TraceCheckUtils]: 20: Hoare triple {14994#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14994#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:23,310 INFO L273 TraceCheckUtils]: 21: Hoare triple {14994#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14995#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:23,311 INFO L273 TraceCheckUtils]: 22: Hoare triple {14995#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14995#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:23,311 INFO L273 TraceCheckUtils]: 23: Hoare triple {14995#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14996#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:23,312 INFO L273 TraceCheckUtils]: 24: Hoare triple {14996#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14996#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:23,313 INFO L273 TraceCheckUtils]: 25: Hoare triple {14996#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14997#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:23,313 INFO L273 TraceCheckUtils]: 26: Hoare triple {14997#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14997#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:23,314 INFO L273 TraceCheckUtils]: 27: Hoare triple {14997#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14998#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:23,314 INFO L273 TraceCheckUtils]: 28: Hoare triple {14998#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14998#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:23,315 INFO L273 TraceCheckUtils]: 29: Hoare triple {14998#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14999#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:23,316 INFO L273 TraceCheckUtils]: 30: Hoare triple {14999#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14999#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:23,316 INFO L273 TraceCheckUtils]: 31: Hoare triple {14999#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15000#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:23,317 INFO L273 TraceCheckUtils]: 32: Hoare triple {15000#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15000#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:23,318 INFO L273 TraceCheckUtils]: 33: Hoare triple {15000#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15001#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:23,318 INFO L273 TraceCheckUtils]: 34: Hoare triple {15001#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15001#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:23,319 INFO L273 TraceCheckUtils]: 35: Hoare triple {15001#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15002#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:23,319 INFO L273 TraceCheckUtils]: 36: Hoare triple {15002#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15002#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:23,320 INFO L273 TraceCheckUtils]: 37: Hoare triple {15002#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15003#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:23,321 INFO L273 TraceCheckUtils]: 38: Hoare triple {15003#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15003#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:23,321 INFO L273 TraceCheckUtils]: 39: Hoare triple {15003#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15004#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:23,322 INFO L273 TraceCheckUtils]: 40: Hoare triple {15004#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15004#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:23,323 INFO L273 TraceCheckUtils]: 41: Hoare triple {15004#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15005#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:23,323 INFO L273 TraceCheckUtils]: 42: Hoare triple {15005#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15005#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:23,324 INFO L273 TraceCheckUtils]: 43: Hoare triple {15005#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15006#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:23,324 INFO L273 TraceCheckUtils]: 44: Hoare triple {15006#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15006#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:23,325 INFO L273 TraceCheckUtils]: 45: Hoare triple {15006#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15007#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:23,326 INFO L273 TraceCheckUtils]: 46: Hoare triple {15007#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15007#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:23,326 INFO L273 TraceCheckUtils]: 47: Hoare triple {15007#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15008#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:23,327 INFO L273 TraceCheckUtils]: 48: Hoare triple {15008#(<= main_~i~0 21)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15008#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:23,328 INFO L273 TraceCheckUtils]: 49: Hoare triple {15008#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15009#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:23,328 INFO L273 TraceCheckUtils]: 50: Hoare triple {15009#(<= main_~i~0 22)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15009#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:23,329 INFO L273 TraceCheckUtils]: 51: Hoare triple {15009#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15010#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:23,329 INFO L273 TraceCheckUtils]: 52: Hoare triple {15010#(<= main_~i~0 23)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15010#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:23,330 INFO L273 TraceCheckUtils]: 53: Hoare triple {15010#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15011#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:23,331 INFO L273 TraceCheckUtils]: 54: Hoare triple {15011#(<= main_~i~0 24)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15011#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:23,331 INFO L273 TraceCheckUtils]: 55: Hoare triple {15011#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15012#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:23,332 INFO L273 TraceCheckUtils]: 56: Hoare triple {15012#(<= main_~i~0 25)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15012#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:23,333 INFO L273 TraceCheckUtils]: 57: Hoare triple {15012#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15013#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:23,333 INFO L273 TraceCheckUtils]: 58: Hoare triple {15013#(<= main_~i~0 26)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15013#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:23,334 INFO L273 TraceCheckUtils]: 59: Hoare triple {15013#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15014#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:23,334 INFO L273 TraceCheckUtils]: 60: Hoare triple {15014#(<= main_~i~0 27)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15014#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:23,335 INFO L273 TraceCheckUtils]: 61: Hoare triple {15014#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15015#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:23,336 INFO L273 TraceCheckUtils]: 62: Hoare triple {15015#(<= main_~i~0 28)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15015#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:23,336 INFO L273 TraceCheckUtils]: 63: Hoare triple {15015#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15016#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:23,337 INFO L273 TraceCheckUtils]: 64: Hoare triple {15016#(<= main_~i~0 29)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15016#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:23,337 INFO L273 TraceCheckUtils]: 65: Hoare triple {15016#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15017#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:23,338 INFO L273 TraceCheckUtils]: 66: Hoare triple {15017#(<= main_~i~0 30)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15017#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:23,339 INFO L273 TraceCheckUtils]: 67: Hoare triple {15017#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15018#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:23,339 INFO L273 TraceCheckUtils]: 68: Hoare triple {15018#(<= main_~i~0 31)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15018#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:23,340 INFO L273 TraceCheckUtils]: 69: Hoare triple {15018#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15019#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:23,341 INFO L273 TraceCheckUtils]: 70: Hoare triple {15019#(<= main_~i~0 32)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15019#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:23,341 INFO L273 TraceCheckUtils]: 71: Hoare triple {15019#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15020#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:23,343 INFO L273 TraceCheckUtils]: 72: Hoare triple {15020#(<= main_~i~0 33)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15020#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:23,344 INFO L273 TraceCheckUtils]: 73: Hoare triple {15020#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15021#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:23,344 INFO L273 TraceCheckUtils]: 74: Hoare triple {15021#(<= main_~i~0 34)} assume !(~i~0 < 50000); {14986#false} is VALID [2018-11-23 12:07:23,345 INFO L273 TraceCheckUtils]: 75: Hoare triple {14986#false} havoc ~x~0;~x~0 := 0; {14986#false} is VALID [2018-11-23 12:07:23,345 INFO L273 TraceCheckUtils]: 76: Hoare triple {14986#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {14986#false} is VALID [2018-11-23 12:07:23,345 INFO L256 TraceCheckUtils]: 77: Hoare triple {14986#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {14986#false} is VALID [2018-11-23 12:07:23,345 INFO L273 TraceCheckUtils]: 78: Hoare triple {14986#false} ~cond := #in~cond; {14986#false} is VALID [2018-11-23 12:07:23,345 INFO L273 TraceCheckUtils]: 79: Hoare triple {14986#false} assume 0 == ~cond; {14986#false} is VALID [2018-11-23 12:07:23,345 INFO L273 TraceCheckUtils]: 80: Hoare triple {14986#false} assume !false; {14986#false} is VALID [2018-11-23 12:07:23,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:23,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:23,350 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:23,358 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:07:23,397 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:07:23,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:23,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:23,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:23,639 INFO L256 TraceCheckUtils]: 0: Hoare triple {14985#true} call ULTIMATE.init(); {14985#true} is VALID [2018-11-23 12:07:23,639 INFO L273 TraceCheckUtils]: 1: Hoare triple {14985#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14985#true} is VALID [2018-11-23 12:07:23,639 INFO L273 TraceCheckUtils]: 2: Hoare triple {14985#true} assume true; {14985#true} is VALID [2018-11-23 12:07:23,639 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14985#true} {14985#true} #49#return; {14985#true} is VALID [2018-11-23 12:07:23,640 INFO L256 TraceCheckUtils]: 4: Hoare triple {14985#true} call #t~ret5 := main(); {14985#true} is VALID [2018-11-23 12:07:23,640 INFO L273 TraceCheckUtils]: 5: Hoare triple {14985#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {15040#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:23,640 INFO L273 TraceCheckUtils]: 6: Hoare triple {15040#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15040#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:23,641 INFO L273 TraceCheckUtils]: 7: Hoare triple {15040#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14988#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:23,641 INFO L273 TraceCheckUtils]: 8: Hoare triple {14988#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14988#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:23,641 INFO L273 TraceCheckUtils]: 9: Hoare triple {14988#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14989#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:23,642 INFO L273 TraceCheckUtils]: 10: Hoare triple {14989#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14989#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:23,642 INFO L273 TraceCheckUtils]: 11: Hoare triple {14989#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14990#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:23,643 INFO L273 TraceCheckUtils]: 12: Hoare triple {14990#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14990#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:23,643 INFO L273 TraceCheckUtils]: 13: Hoare triple {14990#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14991#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:23,643 INFO L273 TraceCheckUtils]: 14: Hoare triple {14991#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14991#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:23,644 INFO L273 TraceCheckUtils]: 15: Hoare triple {14991#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14992#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:23,644 INFO L273 TraceCheckUtils]: 16: Hoare triple {14992#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14992#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:23,645 INFO L273 TraceCheckUtils]: 17: Hoare triple {14992#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14993#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:23,646 INFO L273 TraceCheckUtils]: 18: Hoare triple {14993#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14993#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:23,646 INFO L273 TraceCheckUtils]: 19: Hoare triple {14993#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14994#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:23,647 INFO L273 TraceCheckUtils]: 20: Hoare triple {14994#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14994#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:23,648 INFO L273 TraceCheckUtils]: 21: Hoare triple {14994#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14995#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:23,648 INFO L273 TraceCheckUtils]: 22: Hoare triple {14995#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14995#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:23,649 INFO L273 TraceCheckUtils]: 23: Hoare triple {14995#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14996#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:23,649 INFO L273 TraceCheckUtils]: 24: Hoare triple {14996#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14996#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:23,650 INFO L273 TraceCheckUtils]: 25: Hoare triple {14996#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14997#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:23,651 INFO L273 TraceCheckUtils]: 26: Hoare triple {14997#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14997#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:23,651 INFO L273 TraceCheckUtils]: 27: Hoare triple {14997#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14998#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:23,652 INFO L273 TraceCheckUtils]: 28: Hoare triple {14998#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14998#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:23,653 INFO L273 TraceCheckUtils]: 29: Hoare triple {14998#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14999#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:23,653 INFO L273 TraceCheckUtils]: 30: Hoare triple {14999#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14999#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:23,654 INFO L273 TraceCheckUtils]: 31: Hoare triple {14999#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15000#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:23,654 INFO L273 TraceCheckUtils]: 32: Hoare triple {15000#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15000#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:23,655 INFO L273 TraceCheckUtils]: 33: Hoare triple {15000#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15001#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:23,656 INFO L273 TraceCheckUtils]: 34: Hoare triple {15001#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15001#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:23,656 INFO L273 TraceCheckUtils]: 35: Hoare triple {15001#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15002#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:23,657 INFO L273 TraceCheckUtils]: 36: Hoare triple {15002#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15002#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:23,658 INFO L273 TraceCheckUtils]: 37: Hoare triple {15002#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15003#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:23,658 INFO L273 TraceCheckUtils]: 38: Hoare triple {15003#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15003#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:23,659 INFO L273 TraceCheckUtils]: 39: Hoare triple {15003#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15004#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:23,659 INFO L273 TraceCheckUtils]: 40: Hoare triple {15004#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15004#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:23,660 INFO L273 TraceCheckUtils]: 41: Hoare triple {15004#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15005#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:23,661 INFO L273 TraceCheckUtils]: 42: Hoare triple {15005#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15005#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:23,661 INFO L273 TraceCheckUtils]: 43: Hoare triple {15005#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15006#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:23,662 INFO L273 TraceCheckUtils]: 44: Hoare triple {15006#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15006#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:23,663 INFO L273 TraceCheckUtils]: 45: Hoare triple {15006#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15007#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:23,663 INFO L273 TraceCheckUtils]: 46: Hoare triple {15007#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15007#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:23,664 INFO L273 TraceCheckUtils]: 47: Hoare triple {15007#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15008#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:23,664 INFO L273 TraceCheckUtils]: 48: Hoare triple {15008#(<= main_~i~0 21)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15008#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:23,665 INFO L273 TraceCheckUtils]: 49: Hoare triple {15008#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15009#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:23,666 INFO L273 TraceCheckUtils]: 50: Hoare triple {15009#(<= main_~i~0 22)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15009#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:23,666 INFO L273 TraceCheckUtils]: 51: Hoare triple {15009#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15010#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:23,667 INFO L273 TraceCheckUtils]: 52: Hoare triple {15010#(<= main_~i~0 23)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15010#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:23,668 INFO L273 TraceCheckUtils]: 53: Hoare triple {15010#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15011#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:23,668 INFO L273 TraceCheckUtils]: 54: Hoare triple {15011#(<= main_~i~0 24)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15011#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:23,669 INFO L273 TraceCheckUtils]: 55: Hoare triple {15011#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15012#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:23,669 INFO L273 TraceCheckUtils]: 56: Hoare triple {15012#(<= main_~i~0 25)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15012#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:23,670 INFO L273 TraceCheckUtils]: 57: Hoare triple {15012#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15013#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:23,671 INFO L273 TraceCheckUtils]: 58: Hoare triple {15013#(<= main_~i~0 26)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15013#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:23,671 INFO L273 TraceCheckUtils]: 59: Hoare triple {15013#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15014#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:23,672 INFO L273 TraceCheckUtils]: 60: Hoare triple {15014#(<= main_~i~0 27)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15014#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:23,673 INFO L273 TraceCheckUtils]: 61: Hoare triple {15014#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15015#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:23,673 INFO L273 TraceCheckUtils]: 62: Hoare triple {15015#(<= main_~i~0 28)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15015#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:23,674 INFO L273 TraceCheckUtils]: 63: Hoare triple {15015#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15016#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:23,674 INFO L273 TraceCheckUtils]: 64: Hoare triple {15016#(<= main_~i~0 29)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15016#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:23,675 INFO L273 TraceCheckUtils]: 65: Hoare triple {15016#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15017#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:23,694 INFO L273 TraceCheckUtils]: 66: Hoare triple {15017#(<= main_~i~0 30)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15017#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:23,707 INFO L273 TraceCheckUtils]: 67: Hoare triple {15017#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15018#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:23,716 INFO L273 TraceCheckUtils]: 68: Hoare triple {15018#(<= main_~i~0 31)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15018#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:23,726 INFO L273 TraceCheckUtils]: 69: Hoare triple {15018#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15019#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:23,735 INFO L273 TraceCheckUtils]: 70: Hoare triple {15019#(<= main_~i~0 32)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15019#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:23,749 INFO L273 TraceCheckUtils]: 71: Hoare triple {15019#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15020#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:23,758 INFO L273 TraceCheckUtils]: 72: Hoare triple {15020#(<= main_~i~0 33)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15020#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:23,772 INFO L273 TraceCheckUtils]: 73: Hoare triple {15020#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15021#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:23,781 INFO L273 TraceCheckUtils]: 74: Hoare triple {15021#(<= main_~i~0 34)} assume !(~i~0 < 50000); {14986#false} is VALID [2018-11-23 12:07:23,781 INFO L273 TraceCheckUtils]: 75: Hoare triple {14986#false} havoc ~x~0;~x~0 := 0; {14986#false} is VALID [2018-11-23 12:07:23,781 INFO L273 TraceCheckUtils]: 76: Hoare triple {14986#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {14986#false} is VALID [2018-11-23 12:07:23,781 INFO L256 TraceCheckUtils]: 77: Hoare triple {14986#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {14986#false} is VALID [2018-11-23 12:07:23,782 INFO L273 TraceCheckUtils]: 78: Hoare triple {14986#false} ~cond := #in~cond; {14986#false} is VALID [2018-11-23 12:07:23,782 INFO L273 TraceCheckUtils]: 79: Hoare triple {14986#false} assume 0 == ~cond; {14986#false} is VALID [2018-11-23 12:07:23,782 INFO L273 TraceCheckUtils]: 80: Hoare triple {14986#false} assume !false; {14986#false} is VALID [2018-11-23 12:07:23,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:23,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:23,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2018-11-23 12:07:23,819 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 81 [2018-11-23 12:07:23,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:23,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 12:07:24,086 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-23 12:07:24,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 12:07:24,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 12:07:24,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:07:24,087 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 38 states. [2018-11-23 12:07:24,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:24,900 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2018-11-23 12:07:24,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 12:07:24,901 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 81 [2018-11-23 12:07:24,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:24,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:07:24,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 102 transitions. [2018-11-23 12:07:24,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:07:24,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 102 transitions. [2018-11-23 12:07:24,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 102 transitions. [2018-11-23 12:07:25,026 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-23 12:07:25,028 INFO L225 Difference]: With dead ends: 100 [2018-11-23 12:07:25,028 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 12:07:25,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:07:25,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 12:07:25,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2018-11-23 12:07:25,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:25,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 88 states. [2018-11-23 12:07:25,061 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 88 states. [2018-11-23 12:07:25,062 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 88 states. [2018-11-23 12:07:25,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:25,063 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2018-11-23 12:07:25,063 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-11-23 12:07:25,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:25,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:25,064 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 89 states. [2018-11-23 12:07:25,064 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 89 states. [2018-11-23 12:07:25,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:25,065 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2018-11-23 12:07:25,065 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-11-23 12:07:25,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:25,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:25,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:25,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:25,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 12:07:25,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2018-11-23 12:07:25,067 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 81 [2018-11-23 12:07:25,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:25,068 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2018-11-23 12:07:25,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 12:07:25,068 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2018-11-23 12:07:25,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 12:07:25,068 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:25,069 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:25,069 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:25,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:25,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1268725748, now seen corresponding path program 35 times [2018-11-23 12:07:25,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:25,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:25,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:25,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:25,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:25,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:25,844 INFO L256 TraceCheckUtils]: 0: Hoare triple {15720#true} call ULTIMATE.init(); {15720#true} is VALID [2018-11-23 12:07:25,845 INFO L273 TraceCheckUtils]: 1: Hoare triple {15720#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15720#true} is VALID [2018-11-23 12:07:25,845 INFO L273 TraceCheckUtils]: 2: Hoare triple {15720#true} assume true; {15720#true} is VALID [2018-11-23 12:07:25,845 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15720#true} {15720#true} #49#return; {15720#true} is VALID [2018-11-23 12:07:25,846 INFO L256 TraceCheckUtils]: 4: Hoare triple {15720#true} call #t~ret5 := main(); {15720#true} is VALID [2018-11-23 12:07:25,846 INFO L273 TraceCheckUtils]: 5: Hoare triple {15720#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {15722#(= main_~i~0 0)} is VALID [2018-11-23 12:07:25,847 INFO L273 TraceCheckUtils]: 6: Hoare triple {15722#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15722#(= main_~i~0 0)} is VALID [2018-11-23 12:07:25,847 INFO L273 TraceCheckUtils]: 7: Hoare triple {15722#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15723#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:25,848 INFO L273 TraceCheckUtils]: 8: Hoare triple {15723#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15723#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:25,849 INFO L273 TraceCheckUtils]: 9: Hoare triple {15723#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15724#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:25,849 INFO L273 TraceCheckUtils]: 10: Hoare triple {15724#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15724#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:25,850 INFO L273 TraceCheckUtils]: 11: Hoare triple {15724#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15725#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:25,850 INFO L273 TraceCheckUtils]: 12: Hoare triple {15725#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15725#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:25,851 INFO L273 TraceCheckUtils]: 13: Hoare triple {15725#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15726#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:25,852 INFO L273 TraceCheckUtils]: 14: Hoare triple {15726#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15726#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:25,852 INFO L273 TraceCheckUtils]: 15: Hoare triple {15726#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15727#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:25,853 INFO L273 TraceCheckUtils]: 16: Hoare triple {15727#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15727#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:25,854 INFO L273 TraceCheckUtils]: 17: Hoare triple {15727#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15728#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:25,854 INFO L273 TraceCheckUtils]: 18: Hoare triple {15728#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15728#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:25,855 INFO L273 TraceCheckUtils]: 19: Hoare triple {15728#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15729#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:25,855 INFO L273 TraceCheckUtils]: 20: Hoare triple {15729#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15729#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:25,856 INFO L273 TraceCheckUtils]: 21: Hoare triple {15729#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15730#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:25,857 INFO L273 TraceCheckUtils]: 22: Hoare triple {15730#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15730#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:25,857 INFO L273 TraceCheckUtils]: 23: Hoare triple {15730#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15731#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:25,858 INFO L273 TraceCheckUtils]: 24: Hoare triple {15731#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15731#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:25,858 INFO L273 TraceCheckUtils]: 25: Hoare triple {15731#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15732#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:25,859 INFO L273 TraceCheckUtils]: 26: Hoare triple {15732#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15732#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:25,860 INFO L273 TraceCheckUtils]: 27: Hoare triple {15732#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15733#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:25,860 INFO L273 TraceCheckUtils]: 28: Hoare triple {15733#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15733#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:25,861 INFO L273 TraceCheckUtils]: 29: Hoare triple {15733#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15734#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:25,861 INFO L273 TraceCheckUtils]: 30: Hoare triple {15734#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15734#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:25,862 INFO L273 TraceCheckUtils]: 31: Hoare triple {15734#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15735#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:25,863 INFO L273 TraceCheckUtils]: 32: Hoare triple {15735#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15735#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:25,863 INFO L273 TraceCheckUtils]: 33: Hoare triple {15735#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15736#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:25,864 INFO L273 TraceCheckUtils]: 34: Hoare triple {15736#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15736#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:25,865 INFO L273 TraceCheckUtils]: 35: Hoare triple {15736#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15737#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:25,865 INFO L273 TraceCheckUtils]: 36: Hoare triple {15737#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15737#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:25,866 INFO L273 TraceCheckUtils]: 37: Hoare triple {15737#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15738#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:25,866 INFO L273 TraceCheckUtils]: 38: Hoare triple {15738#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15738#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:25,867 INFO L273 TraceCheckUtils]: 39: Hoare triple {15738#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15739#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:25,868 INFO L273 TraceCheckUtils]: 40: Hoare triple {15739#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15739#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:25,868 INFO L273 TraceCheckUtils]: 41: Hoare triple {15739#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15740#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:25,869 INFO L273 TraceCheckUtils]: 42: Hoare triple {15740#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15740#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:25,870 INFO L273 TraceCheckUtils]: 43: Hoare triple {15740#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15741#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:25,870 INFO L273 TraceCheckUtils]: 44: Hoare triple {15741#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15741#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:25,871 INFO L273 TraceCheckUtils]: 45: Hoare triple {15741#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15742#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:25,871 INFO L273 TraceCheckUtils]: 46: Hoare triple {15742#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15742#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:25,872 INFO L273 TraceCheckUtils]: 47: Hoare triple {15742#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15743#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:25,873 INFO L273 TraceCheckUtils]: 48: Hoare triple {15743#(<= main_~i~0 21)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15743#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:25,873 INFO L273 TraceCheckUtils]: 49: Hoare triple {15743#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15744#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:25,874 INFO L273 TraceCheckUtils]: 50: Hoare triple {15744#(<= main_~i~0 22)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15744#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:25,874 INFO L273 TraceCheckUtils]: 51: Hoare triple {15744#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15745#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:25,875 INFO L273 TraceCheckUtils]: 52: Hoare triple {15745#(<= main_~i~0 23)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15745#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:25,876 INFO L273 TraceCheckUtils]: 53: Hoare triple {15745#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15746#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:25,876 INFO L273 TraceCheckUtils]: 54: Hoare triple {15746#(<= main_~i~0 24)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15746#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:25,877 INFO L273 TraceCheckUtils]: 55: Hoare triple {15746#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15747#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:25,877 INFO L273 TraceCheckUtils]: 56: Hoare triple {15747#(<= main_~i~0 25)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15747#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:25,878 INFO L273 TraceCheckUtils]: 57: Hoare triple {15747#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15748#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:25,879 INFO L273 TraceCheckUtils]: 58: Hoare triple {15748#(<= main_~i~0 26)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15748#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:25,879 INFO L273 TraceCheckUtils]: 59: Hoare triple {15748#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15749#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:25,880 INFO L273 TraceCheckUtils]: 60: Hoare triple {15749#(<= main_~i~0 27)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15749#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:25,881 INFO L273 TraceCheckUtils]: 61: Hoare triple {15749#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15750#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:25,881 INFO L273 TraceCheckUtils]: 62: Hoare triple {15750#(<= main_~i~0 28)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15750#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:25,882 INFO L273 TraceCheckUtils]: 63: Hoare triple {15750#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15751#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:25,882 INFO L273 TraceCheckUtils]: 64: Hoare triple {15751#(<= main_~i~0 29)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15751#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:25,883 INFO L273 TraceCheckUtils]: 65: Hoare triple {15751#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15752#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:25,884 INFO L273 TraceCheckUtils]: 66: Hoare triple {15752#(<= main_~i~0 30)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15752#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:25,884 INFO L273 TraceCheckUtils]: 67: Hoare triple {15752#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15753#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:25,885 INFO L273 TraceCheckUtils]: 68: Hoare triple {15753#(<= main_~i~0 31)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15753#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:25,886 INFO L273 TraceCheckUtils]: 69: Hoare triple {15753#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15754#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:25,886 INFO L273 TraceCheckUtils]: 70: Hoare triple {15754#(<= main_~i~0 32)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15754#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:25,887 INFO L273 TraceCheckUtils]: 71: Hoare triple {15754#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15755#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:25,887 INFO L273 TraceCheckUtils]: 72: Hoare triple {15755#(<= main_~i~0 33)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15755#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:25,888 INFO L273 TraceCheckUtils]: 73: Hoare triple {15755#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15756#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:25,889 INFO L273 TraceCheckUtils]: 74: Hoare triple {15756#(<= main_~i~0 34)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15756#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:25,889 INFO L273 TraceCheckUtils]: 75: Hoare triple {15756#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15757#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:25,890 INFO L273 TraceCheckUtils]: 76: Hoare triple {15757#(<= main_~i~0 35)} assume !(~i~0 < 50000); {15721#false} is VALID [2018-11-23 12:07:25,890 INFO L273 TraceCheckUtils]: 77: Hoare triple {15721#false} havoc ~x~0;~x~0 := 0; {15721#false} is VALID [2018-11-23 12:07:25,890 INFO L273 TraceCheckUtils]: 78: Hoare triple {15721#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {15721#false} is VALID [2018-11-23 12:07:25,891 INFO L256 TraceCheckUtils]: 79: Hoare triple {15721#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {15721#false} is VALID [2018-11-23 12:07:25,891 INFO L273 TraceCheckUtils]: 80: Hoare triple {15721#false} ~cond := #in~cond; {15721#false} is VALID [2018-11-23 12:07:25,891 INFO L273 TraceCheckUtils]: 81: Hoare triple {15721#false} assume 0 == ~cond; {15721#false} is VALID [2018-11-23 12:07:25,891 INFO L273 TraceCheckUtils]: 82: Hoare triple {15721#false} assume !false; {15721#false} is VALID [2018-11-23 12:07:25,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:25,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:25,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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:25,904 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:07:33,683 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-11-23 12:07:33,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:33,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:33,968 INFO L256 TraceCheckUtils]: 0: Hoare triple {15720#true} call ULTIMATE.init(); {15720#true} is VALID [2018-11-23 12:07:33,968 INFO L273 TraceCheckUtils]: 1: Hoare triple {15720#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15720#true} is VALID [2018-11-23 12:07:33,968 INFO L273 TraceCheckUtils]: 2: Hoare triple {15720#true} assume true; {15720#true} is VALID [2018-11-23 12:07:33,968 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15720#true} {15720#true} #49#return; {15720#true} is VALID [2018-11-23 12:07:33,969 INFO L256 TraceCheckUtils]: 4: Hoare triple {15720#true} call #t~ret5 := main(); {15720#true} is VALID [2018-11-23 12:07:33,969 INFO L273 TraceCheckUtils]: 5: Hoare triple {15720#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {15776#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:33,970 INFO L273 TraceCheckUtils]: 6: Hoare triple {15776#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15776#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:33,970 INFO L273 TraceCheckUtils]: 7: Hoare triple {15776#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15723#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:33,971 INFO L273 TraceCheckUtils]: 8: Hoare triple {15723#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15723#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:33,971 INFO L273 TraceCheckUtils]: 9: Hoare triple {15723#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15724#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:33,972 INFO L273 TraceCheckUtils]: 10: Hoare triple {15724#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15724#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:33,972 INFO L273 TraceCheckUtils]: 11: Hoare triple {15724#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15725#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:33,972 INFO L273 TraceCheckUtils]: 12: Hoare triple {15725#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15725#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:33,973 INFO L273 TraceCheckUtils]: 13: Hoare triple {15725#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15726#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:33,974 INFO L273 TraceCheckUtils]: 14: Hoare triple {15726#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15726#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:33,974 INFO L273 TraceCheckUtils]: 15: Hoare triple {15726#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15727#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:33,975 INFO L273 TraceCheckUtils]: 16: Hoare triple {15727#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15727#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:33,976 INFO L273 TraceCheckUtils]: 17: Hoare triple {15727#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15728#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:33,976 INFO L273 TraceCheckUtils]: 18: Hoare triple {15728#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15728#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:33,977 INFO L273 TraceCheckUtils]: 19: Hoare triple {15728#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15729#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:33,977 INFO L273 TraceCheckUtils]: 20: Hoare triple {15729#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15729#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:33,978 INFO L273 TraceCheckUtils]: 21: Hoare triple {15729#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15730#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:33,979 INFO L273 TraceCheckUtils]: 22: Hoare triple {15730#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15730#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:33,979 INFO L273 TraceCheckUtils]: 23: Hoare triple {15730#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15731#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:33,980 INFO L273 TraceCheckUtils]: 24: Hoare triple {15731#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15731#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:33,981 INFO L273 TraceCheckUtils]: 25: Hoare triple {15731#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15732#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:33,981 INFO L273 TraceCheckUtils]: 26: Hoare triple {15732#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15732#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:33,982 INFO L273 TraceCheckUtils]: 27: Hoare triple {15732#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15733#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:33,982 INFO L273 TraceCheckUtils]: 28: Hoare triple {15733#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15733#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:33,983 INFO L273 TraceCheckUtils]: 29: Hoare triple {15733#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15734#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:33,984 INFO L273 TraceCheckUtils]: 30: Hoare triple {15734#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15734#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:33,984 INFO L273 TraceCheckUtils]: 31: Hoare triple {15734#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15735#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:33,985 INFO L273 TraceCheckUtils]: 32: Hoare triple {15735#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15735#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:33,985 INFO L273 TraceCheckUtils]: 33: Hoare triple {15735#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15736#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:33,986 INFO L273 TraceCheckUtils]: 34: Hoare triple {15736#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15736#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:33,987 INFO L273 TraceCheckUtils]: 35: Hoare triple {15736#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15737#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:33,987 INFO L273 TraceCheckUtils]: 36: Hoare triple {15737#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15737#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:33,988 INFO L273 TraceCheckUtils]: 37: Hoare triple {15737#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15738#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:33,988 INFO L273 TraceCheckUtils]: 38: Hoare triple {15738#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15738#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:33,989 INFO L273 TraceCheckUtils]: 39: Hoare triple {15738#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15739#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:33,990 INFO L273 TraceCheckUtils]: 40: Hoare triple {15739#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15739#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:33,990 INFO L273 TraceCheckUtils]: 41: Hoare triple {15739#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15740#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:33,991 INFO L273 TraceCheckUtils]: 42: Hoare triple {15740#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15740#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:33,992 INFO L273 TraceCheckUtils]: 43: Hoare triple {15740#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15741#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:33,992 INFO L273 TraceCheckUtils]: 44: Hoare triple {15741#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15741#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:33,993 INFO L273 TraceCheckUtils]: 45: Hoare triple {15741#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15742#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:33,993 INFO L273 TraceCheckUtils]: 46: Hoare triple {15742#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15742#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:33,994 INFO L273 TraceCheckUtils]: 47: Hoare triple {15742#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15743#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:33,995 INFO L273 TraceCheckUtils]: 48: Hoare triple {15743#(<= main_~i~0 21)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15743#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:33,995 INFO L273 TraceCheckUtils]: 49: Hoare triple {15743#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15744#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:33,996 INFO L273 TraceCheckUtils]: 50: Hoare triple {15744#(<= main_~i~0 22)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15744#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:33,997 INFO L273 TraceCheckUtils]: 51: Hoare triple {15744#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15745#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:33,997 INFO L273 TraceCheckUtils]: 52: Hoare triple {15745#(<= main_~i~0 23)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15745#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:33,998 INFO L273 TraceCheckUtils]: 53: Hoare triple {15745#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15746#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:33,998 INFO L273 TraceCheckUtils]: 54: Hoare triple {15746#(<= main_~i~0 24)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15746#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:33,999 INFO L273 TraceCheckUtils]: 55: Hoare triple {15746#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15747#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:34,000 INFO L273 TraceCheckUtils]: 56: Hoare triple {15747#(<= main_~i~0 25)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15747#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:34,000 INFO L273 TraceCheckUtils]: 57: Hoare triple {15747#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15748#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:34,001 INFO L273 TraceCheckUtils]: 58: Hoare triple {15748#(<= main_~i~0 26)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15748#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:34,002 INFO L273 TraceCheckUtils]: 59: Hoare triple {15748#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15749#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:34,002 INFO L273 TraceCheckUtils]: 60: Hoare triple {15749#(<= main_~i~0 27)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15749#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:34,003 INFO L273 TraceCheckUtils]: 61: Hoare triple {15749#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15750#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:34,003 INFO L273 TraceCheckUtils]: 62: Hoare triple {15750#(<= main_~i~0 28)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15750#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:34,004 INFO L273 TraceCheckUtils]: 63: Hoare triple {15750#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15751#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:34,005 INFO L273 TraceCheckUtils]: 64: Hoare triple {15751#(<= main_~i~0 29)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15751#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:34,005 INFO L273 TraceCheckUtils]: 65: Hoare triple {15751#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15752#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:34,006 INFO L273 TraceCheckUtils]: 66: Hoare triple {15752#(<= main_~i~0 30)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15752#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:34,007 INFO L273 TraceCheckUtils]: 67: Hoare triple {15752#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15753#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:34,007 INFO L273 TraceCheckUtils]: 68: Hoare triple {15753#(<= main_~i~0 31)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15753#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:34,008 INFO L273 TraceCheckUtils]: 69: Hoare triple {15753#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15754#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:34,008 INFO L273 TraceCheckUtils]: 70: Hoare triple {15754#(<= main_~i~0 32)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15754#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:34,009 INFO L273 TraceCheckUtils]: 71: Hoare triple {15754#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15755#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:34,010 INFO L273 TraceCheckUtils]: 72: Hoare triple {15755#(<= main_~i~0 33)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15755#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:34,010 INFO L273 TraceCheckUtils]: 73: Hoare triple {15755#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15756#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:34,011 INFO L273 TraceCheckUtils]: 74: Hoare triple {15756#(<= main_~i~0 34)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {15756#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:34,012 INFO L273 TraceCheckUtils]: 75: Hoare triple {15756#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15757#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:34,012 INFO L273 TraceCheckUtils]: 76: Hoare triple {15757#(<= main_~i~0 35)} assume !(~i~0 < 50000); {15721#false} is VALID [2018-11-23 12:07:34,012 INFO L273 TraceCheckUtils]: 77: Hoare triple {15721#false} havoc ~x~0;~x~0 := 0; {15721#false} is VALID [2018-11-23 12:07:34,013 INFO L273 TraceCheckUtils]: 78: Hoare triple {15721#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {15721#false} is VALID [2018-11-23 12:07:34,013 INFO L256 TraceCheckUtils]: 79: Hoare triple {15721#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {15721#false} is VALID [2018-11-23 12:07:34,013 INFO L273 TraceCheckUtils]: 80: Hoare triple {15721#false} ~cond := #in~cond; {15721#false} is VALID [2018-11-23 12:07:34,013 INFO L273 TraceCheckUtils]: 81: Hoare triple {15721#false} assume 0 == ~cond; {15721#false} is VALID [2018-11-23 12:07:34,013 INFO L273 TraceCheckUtils]: 82: Hoare triple {15721#false} assume !false; {15721#false} is VALID [2018-11-23 12:07:34,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:34,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:34,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2018-11-23 12:07:34,042 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 83 [2018-11-23 12:07:34,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:34,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2018-11-23 12:07:34,128 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-23 12:07:34,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-23 12:07:34,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-23 12:07:34,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 12:07:34,129 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 39 states. [2018-11-23 12:07:34,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:34,512 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2018-11-23 12:07:34,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 12:07:34,513 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 83 [2018-11-23 12:07:34,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:34,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:07:34,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 104 transitions. [2018-11-23 12:07:34,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:07:34,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 104 transitions. [2018-11-23 12:07:34,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 104 transitions. [2018-11-23 12:07:34,616 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-23 12:07:34,618 INFO L225 Difference]: With dead ends: 102 [2018-11-23 12:07:34,618 INFO L226 Difference]: Without dead ends: 91 [2018-11-23 12:07:34,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 12:07:34,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-23 12:07:34,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-11-23 12:07:34,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:34,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 90 states. [2018-11-23 12:07:34,657 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 90 states. [2018-11-23 12:07:34,657 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 90 states. [2018-11-23 12:07:34,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:34,659 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2018-11-23 12:07:34,659 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-11-23 12:07:34,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:34,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:34,660 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 91 states. [2018-11-23 12:07:34,660 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 91 states. [2018-11-23 12:07:34,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:34,661 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2018-11-23 12:07:34,662 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-11-23 12:07:34,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:34,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:34,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:34,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:34,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 12:07:34,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2018-11-23 12:07:34,664 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 83 [2018-11-23 12:07:34,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:34,664 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2018-11-23 12:07:34,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-23 12:07:34,664 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2018-11-23 12:07:34,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 12:07:34,665 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:34,665 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:34,665 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:34,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:34,665 INFO L82 PathProgramCache]: Analyzing trace with hash 555219626, now seen corresponding path program 36 times [2018-11-23 12:07:34,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:34,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:34,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:34,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:34,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:36,480 INFO L256 TraceCheckUtils]: 0: Hoare triple {16472#true} call ULTIMATE.init(); {16472#true} is VALID [2018-11-23 12:07:36,480 INFO L273 TraceCheckUtils]: 1: Hoare triple {16472#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16472#true} is VALID [2018-11-23 12:07:36,480 INFO L273 TraceCheckUtils]: 2: Hoare triple {16472#true} assume true; {16472#true} is VALID [2018-11-23 12:07:36,480 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16472#true} {16472#true} #49#return; {16472#true} is VALID [2018-11-23 12:07:36,481 INFO L256 TraceCheckUtils]: 4: Hoare triple {16472#true} call #t~ret5 := main(); {16472#true} is VALID [2018-11-23 12:07:36,481 INFO L273 TraceCheckUtils]: 5: Hoare triple {16472#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {16474#(= main_~i~0 0)} is VALID [2018-11-23 12:07:36,481 INFO L273 TraceCheckUtils]: 6: Hoare triple {16474#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16474#(= main_~i~0 0)} is VALID [2018-11-23 12:07:36,482 INFO L273 TraceCheckUtils]: 7: Hoare triple {16474#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16475#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:36,483 INFO L273 TraceCheckUtils]: 8: Hoare triple {16475#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16475#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:36,483 INFO L273 TraceCheckUtils]: 9: Hoare triple {16475#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16476#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:36,483 INFO L273 TraceCheckUtils]: 10: Hoare triple {16476#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16476#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:36,484 INFO L273 TraceCheckUtils]: 11: Hoare triple {16476#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16477#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:36,484 INFO L273 TraceCheckUtils]: 12: Hoare triple {16477#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16477#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:36,485 INFO L273 TraceCheckUtils]: 13: Hoare triple {16477#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16478#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:36,485 INFO L273 TraceCheckUtils]: 14: Hoare triple {16478#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16478#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:36,485 INFO L273 TraceCheckUtils]: 15: Hoare triple {16478#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16479#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:36,486 INFO L273 TraceCheckUtils]: 16: Hoare triple {16479#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16479#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:36,486 INFO L273 TraceCheckUtils]: 17: Hoare triple {16479#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16480#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:36,487 INFO L273 TraceCheckUtils]: 18: Hoare triple {16480#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16480#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:36,487 INFO L273 TraceCheckUtils]: 19: Hoare triple {16480#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16481#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:36,488 INFO L273 TraceCheckUtils]: 20: Hoare triple {16481#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16481#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:36,489 INFO L273 TraceCheckUtils]: 21: Hoare triple {16481#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16482#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:36,489 INFO L273 TraceCheckUtils]: 22: Hoare triple {16482#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16482#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:36,490 INFO L273 TraceCheckUtils]: 23: Hoare triple {16482#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16483#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:36,490 INFO L273 TraceCheckUtils]: 24: Hoare triple {16483#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16483#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:36,491 INFO L273 TraceCheckUtils]: 25: Hoare triple {16483#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16484#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:36,492 INFO L273 TraceCheckUtils]: 26: Hoare triple {16484#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16484#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:36,492 INFO L273 TraceCheckUtils]: 27: Hoare triple {16484#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16485#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:36,493 INFO L273 TraceCheckUtils]: 28: Hoare triple {16485#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16485#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:36,494 INFO L273 TraceCheckUtils]: 29: Hoare triple {16485#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16486#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:36,494 INFO L273 TraceCheckUtils]: 30: Hoare triple {16486#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16486#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:36,495 INFO L273 TraceCheckUtils]: 31: Hoare triple {16486#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16487#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:36,495 INFO L273 TraceCheckUtils]: 32: Hoare triple {16487#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16487#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:36,496 INFO L273 TraceCheckUtils]: 33: Hoare triple {16487#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16488#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:36,497 INFO L273 TraceCheckUtils]: 34: Hoare triple {16488#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16488#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:36,497 INFO L273 TraceCheckUtils]: 35: Hoare triple {16488#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16489#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:36,498 INFO L273 TraceCheckUtils]: 36: Hoare triple {16489#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16489#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:36,499 INFO L273 TraceCheckUtils]: 37: Hoare triple {16489#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16490#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:36,499 INFO L273 TraceCheckUtils]: 38: Hoare triple {16490#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16490#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:36,500 INFO L273 TraceCheckUtils]: 39: Hoare triple {16490#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16491#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:36,500 INFO L273 TraceCheckUtils]: 40: Hoare triple {16491#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16491#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:36,501 INFO L273 TraceCheckUtils]: 41: Hoare triple {16491#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16492#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:36,502 INFO L273 TraceCheckUtils]: 42: Hoare triple {16492#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16492#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:36,502 INFO L273 TraceCheckUtils]: 43: Hoare triple {16492#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16493#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:36,503 INFO L273 TraceCheckUtils]: 44: Hoare triple {16493#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16493#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:36,504 INFO L273 TraceCheckUtils]: 45: Hoare triple {16493#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16494#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:36,504 INFO L273 TraceCheckUtils]: 46: Hoare triple {16494#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16494#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:36,505 INFO L273 TraceCheckUtils]: 47: Hoare triple {16494#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16495#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:36,505 INFO L273 TraceCheckUtils]: 48: Hoare triple {16495#(<= main_~i~0 21)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16495#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:36,506 INFO L273 TraceCheckUtils]: 49: Hoare triple {16495#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16496#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:36,507 INFO L273 TraceCheckUtils]: 50: Hoare triple {16496#(<= main_~i~0 22)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16496#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:36,507 INFO L273 TraceCheckUtils]: 51: Hoare triple {16496#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16497#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:36,508 INFO L273 TraceCheckUtils]: 52: Hoare triple {16497#(<= main_~i~0 23)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16497#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:36,508 INFO L273 TraceCheckUtils]: 53: Hoare triple {16497#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16498#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:36,509 INFO L273 TraceCheckUtils]: 54: Hoare triple {16498#(<= main_~i~0 24)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16498#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:36,510 INFO L273 TraceCheckUtils]: 55: Hoare triple {16498#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16499#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:36,510 INFO L273 TraceCheckUtils]: 56: Hoare triple {16499#(<= main_~i~0 25)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16499#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:36,511 INFO L273 TraceCheckUtils]: 57: Hoare triple {16499#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16500#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:36,511 INFO L273 TraceCheckUtils]: 58: Hoare triple {16500#(<= main_~i~0 26)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16500#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:36,512 INFO L273 TraceCheckUtils]: 59: Hoare triple {16500#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16501#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:36,513 INFO L273 TraceCheckUtils]: 60: Hoare triple {16501#(<= main_~i~0 27)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16501#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:36,513 INFO L273 TraceCheckUtils]: 61: Hoare triple {16501#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16502#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:36,514 INFO L273 TraceCheckUtils]: 62: Hoare triple {16502#(<= main_~i~0 28)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16502#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:36,515 INFO L273 TraceCheckUtils]: 63: Hoare triple {16502#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16503#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:36,515 INFO L273 TraceCheckUtils]: 64: Hoare triple {16503#(<= main_~i~0 29)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16503#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:36,516 INFO L273 TraceCheckUtils]: 65: Hoare triple {16503#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16504#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:36,516 INFO L273 TraceCheckUtils]: 66: Hoare triple {16504#(<= main_~i~0 30)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16504#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:36,517 INFO L273 TraceCheckUtils]: 67: Hoare triple {16504#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16505#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:36,518 INFO L273 TraceCheckUtils]: 68: Hoare triple {16505#(<= main_~i~0 31)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16505#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:36,518 INFO L273 TraceCheckUtils]: 69: Hoare triple {16505#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16506#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:36,519 INFO L273 TraceCheckUtils]: 70: Hoare triple {16506#(<= main_~i~0 32)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16506#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:36,520 INFO L273 TraceCheckUtils]: 71: Hoare triple {16506#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16507#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:36,520 INFO L273 TraceCheckUtils]: 72: Hoare triple {16507#(<= main_~i~0 33)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16507#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:36,521 INFO L273 TraceCheckUtils]: 73: Hoare triple {16507#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16508#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:36,525 INFO L273 TraceCheckUtils]: 74: Hoare triple {16508#(<= main_~i~0 34)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16508#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:36,525 INFO L273 TraceCheckUtils]: 75: Hoare triple {16508#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16509#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:36,526 INFO L273 TraceCheckUtils]: 76: Hoare triple {16509#(<= main_~i~0 35)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16509#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:36,526 INFO L273 TraceCheckUtils]: 77: Hoare triple {16509#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16510#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:36,527 INFO L273 TraceCheckUtils]: 78: Hoare triple {16510#(<= main_~i~0 36)} assume !(~i~0 < 50000); {16473#false} is VALID [2018-11-23 12:07:36,527 INFO L273 TraceCheckUtils]: 79: Hoare triple {16473#false} havoc ~x~0;~x~0 := 0; {16473#false} is VALID [2018-11-23 12:07:36,527 INFO L273 TraceCheckUtils]: 80: Hoare triple {16473#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {16473#false} is VALID [2018-11-23 12:07:36,527 INFO L256 TraceCheckUtils]: 81: Hoare triple {16473#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {16473#false} is VALID [2018-11-23 12:07:36,527 INFO L273 TraceCheckUtils]: 82: Hoare triple {16473#false} ~cond := #in~cond; {16473#false} is VALID [2018-11-23 12:07:36,527 INFO L273 TraceCheckUtils]: 83: Hoare triple {16473#false} assume 0 == ~cond; {16473#false} is VALID [2018-11-23 12:07:36,527 INFO L273 TraceCheckUtils]: 84: Hoare triple {16473#false} assume !false; {16473#false} is VALID [2018-11-23 12:07:36,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:36,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:36,532 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:36,542 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:08:06,502 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-11-23 12:08:06,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:06,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:07,192 INFO L256 TraceCheckUtils]: 0: Hoare triple {16472#true} call ULTIMATE.init(); {16472#true} is VALID [2018-11-23 12:08:07,193 INFO L273 TraceCheckUtils]: 1: Hoare triple {16472#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16472#true} is VALID [2018-11-23 12:08:07,193 INFO L273 TraceCheckUtils]: 2: Hoare triple {16472#true} assume true; {16472#true} is VALID [2018-11-23 12:08:07,193 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16472#true} {16472#true} #49#return; {16472#true} is VALID [2018-11-23 12:08:07,194 INFO L256 TraceCheckUtils]: 4: Hoare triple {16472#true} call #t~ret5 := main(); {16472#true} is VALID [2018-11-23 12:08:07,194 INFO L273 TraceCheckUtils]: 5: Hoare triple {16472#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {16529#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:07,195 INFO L273 TraceCheckUtils]: 6: Hoare triple {16529#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16529#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:07,195 INFO L273 TraceCheckUtils]: 7: Hoare triple {16529#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16475#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:07,196 INFO L273 TraceCheckUtils]: 8: Hoare triple {16475#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16475#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:07,196 INFO L273 TraceCheckUtils]: 9: Hoare triple {16475#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16476#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:07,196 INFO L273 TraceCheckUtils]: 10: Hoare triple {16476#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16476#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:07,197 INFO L273 TraceCheckUtils]: 11: Hoare triple {16476#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16477#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:07,197 INFO L273 TraceCheckUtils]: 12: Hoare triple {16477#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16477#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:07,198 INFO L273 TraceCheckUtils]: 13: Hoare triple {16477#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16478#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:07,199 INFO L273 TraceCheckUtils]: 14: Hoare triple {16478#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16478#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:07,199 INFO L273 TraceCheckUtils]: 15: Hoare triple {16478#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16479#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:07,200 INFO L273 TraceCheckUtils]: 16: Hoare triple {16479#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16479#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:07,201 INFO L273 TraceCheckUtils]: 17: Hoare triple {16479#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16480#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:07,201 INFO L273 TraceCheckUtils]: 18: Hoare triple {16480#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16480#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:07,202 INFO L273 TraceCheckUtils]: 19: Hoare triple {16480#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16481#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:07,202 INFO L273 TraceCheckUtils]: 20: Hoare triple {16481#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16481#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:07,203 INFO L273 TraceCheckUtils]: 21: Hoare triple {16481#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16482#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:07,204 INFO L273 TraceCheckUtils]: 22: Hoare triple {16482#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16482#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:07,204 INFO L273 TraceCheckUtils]: 23: Hoare triple {16482#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16483#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:07,205 INFO L273 TraceCheckUtils]: 24: Hoare triple {16483#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16483#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:07,206 INFO L273 TraceCheckUtils]: 25: Hoare triple {16483#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16484#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:07,206 INFO L273 TraceCheckUtils]: 26: Hoare triple {16484#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16484#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:07,207 INFO L273 TraceCheckUtils]: 27: Hoare triple {16484#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16485#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:07,207 INFO L273 TraceCheckUtils]: 28: Hoare triple {16485#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16485#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:07,208 INFO L273 TraceCheckUtils]: 29: Hoare triple {16485#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16486#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:07,209 INFO L273 TraceCheckUtils]: 30: Hoare triple {16486#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16486#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:07,209 INFO L273 TraceCheckUtils]: 31: Hoare triple {16486#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16487#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:07,210 INFO L273 TraceCheckUtils]: 32: Hoare triple {16487#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16487#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:07,210 INFO L273 TraceCheckUtils]: 33: Hoare triple {16487#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16488#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:07,211 INFO L273 TraceCheckUtils]: 34: Hoare triple {16488#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16488#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:07,232 INFO L273 TraceCheckUtils]: 35: Hoare triple {16488#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16489#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:07,243 INFO L273 TraceCheckUtils]: 36: Hoare triple {16489#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16489#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:07,244 INFO L273 TraceCheckUtils]: 37: Hoare triple {16489#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16490#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:07,244 INFO L273 TraceCheckUtils]: 38: Hoare triple {16490#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16490#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:07,245 INFO L273 TraceCheckUtils]: 39: Hoare triple {16490#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16491#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:07,245 INFO L273 TraceCheckUtils]: 40: Hoare triple {16491#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16491#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:07,245 INFO L273 TraceCheckUtils]: 41: Hoare triple {16491#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16492#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:07,246 INFO L273 TraceCheckUtils]: 42: Hoare triple {16492#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16492#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:07,246 INFO L273 TraceCheckUtils]: 43: Hoare triple {16492#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16493#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:07,246 INFO L273 TraceCheckUtils]: 44: Hoare triple {16493#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16493#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:07,247 INFO L273 TraceCheckUtils]: 45: Hoare triple {16493#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16494#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:07,247 INFO L273 TraceCheckUtils]: 46: Hoare triple {16494#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16494#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:07,248 INFO L273 TraceCheckUtils]: 47: Hoare triple {16494#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16495#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:07,248 INFO L273 TraceCheckUtils]: 48: Hoare triple {16495#(<= main_~i~0 21)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16495#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:07,249 INFO L273 TraceCheckUtils]: 49: Hoare triple {16495#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16496#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:07,250 INFO L273 TraceCheckUtils]: 50: Hoare triple {16496#(<= main_~i~0 22)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16496#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:07,250 INFO L273 TraceCheckUtils]: 51: Hoare triple {16496#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16497#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:07,251 INFO L273 TraceCheckUtils]: 52: Hoare triple {16497#(<= main_~i~0 23)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16497#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:07,252 INFO L273 TraceCheckUtils]: 53: Hoare triple {16497#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16498#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:07,252 INFO L273 TraceCheckUtils]: 54: Hoare triple {16498#(<= main_~i~0 24)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16498#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:07,253 INFO L273 TraceCheckUtils]: 55: Hoare triple {16498#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16499#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:07,253 INFO L273 TraceCheckUtils]: 56: Hoare triple {16499#(<= main_~i~0 25)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16499#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:07,254 INFO L273 TraceCheckUtils]: 57: Hoare triple {16499#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16500#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:07,255 INFO L273 TraceCheckUtils]: 58: Hoare triple {16500#(<= main_~i~0 26)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16500#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:07,255 INFO L273 TraceCheckUtils]: 59: Hoare triple {16500#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16501#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:07,256 INFO L273 TraceCheckUtils]: 60: Hoare triple {16501#(<= main_~i~0 27)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16501#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:07,257 INFO L273 TraceCheckUtils]: 61: Hoare triple {16501#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16502#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:07,257 INFO L273 TraceCheckUtils]: 62: Hoare triple {16502#(<= main_~i~0 28)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16502#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:07,258 INFO L273 TraceCheckUtils]: 63: Hoare triple {16502#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16503#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:07,258 INFO L273 TraceCheckUtils]: 64: Hoare triple {16503#(<= main_~i~0 29)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16503#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:07,259 INFO L273 TraceCheckUtils]: 65: Hoare triple {16503#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16504#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:07,260 INFO L273 TraceCheckUtils]: 66: Hoare triple {16504#(<= main_~i~0 30)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16504#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:07,260 INFO L273 TraceCheckUtils]: 67: Hoare triple {16504#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16505#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:07,261 INFO L273 TraceCheckUtils]: 68: Hoare triple {16505#(<= main_~i~0 31)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16505#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:07,262 INFO L273 TraceCheckUtils]: 69: Hoare triple {16505#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16506#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:07,262 INFO L273 TraceCheckUtils]: 70: Hoare triple {16506#(<= main_~i~0 32)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16506#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:07,263 INFO L273 TraceCheckUtils]: 71: Hoare triple {16506#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16507#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:07,263 INFO L273 TraceCheckUtils]: 72: Hoare triple {16507#(<= main_~i~0 33)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16507#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:07,264 INFO L273 TraceCheckUtils]: 73: Hoare triple {16507#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16508#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:07,264 INFO L273 TraceCheckUtils]: 74: Hoare triple {16508#(<= main_~i~0 34)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16508#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:07,265 INFO L273 TraceCheckUtils]: 75: Hoare triple {16508#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16509#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:07,266 INFO L273 TraceCheckUtils]: 76: Hoare triple {16509#(<= main_~i~0 35)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16509#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:07,266 INFO L273 TraceCheckUtils]: 77: Hoare triple {16509#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16510#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:07,267 INFO L273 TraceCheckUtils]: 78: Hoare triple {16510#(<= main_~i~0 36)} assume !(~i~0 < 50000); {16473#false} is VALID [2018-11-23 12:08:07,267 INFO L273 TraceCheckUtils]: 79: Hoare triple {16473#false} havoc ~x~0;~x~0 := 0; {16473#false} is VALID [2018-11-23 12:08:07,268 INFO L273 TraceCheckUtils]: 80: Hoare triple {16473#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {16473#false} is VALID [2018-11-23 12:08:07,268 INFO L256 TraceCheckUtils]: 81: Hoare triple {16473#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {16473#false} is VALID [2018-11-23 12:08:07,268 INFO L273 TraceCheckUtils]: 82: Hoare triple {16473#false} ~cond := #in~cond; {16473#false} is VALID [2018-11-23 12:08:07,268 INFO L273 TraceCheckUtils]: 83: Hoare triple {16473#false} assume 0 == ~cond; {16473#false} is VALID [2018-11-23 12:08:07,268 INFO L273 TraceCheckUtils]: 84: Hoare triple {16473#false} assume !false; {16473#false} is VALID [2018-11-23 12:08:07,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:08:07,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:07,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2018-11-23 12:08:07,299 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 85 [2018-11-23 12:08:07,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:07,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-23 12:08:07,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:07,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 12:08:07,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 12:08:07,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:08:07,389 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 40 states. [2018-11-23 12:08:08,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:08,029 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2018-11-23 12:08:08,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 12:08:08,030 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 85 [2018-11-23 12:08:08,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:08,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:08:08,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 106 transitions. [2018-11-23 12:08:08,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:08:08,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 106 transitions. [2018-11-23 12:08:08,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 106 transitions. [2018-11-23 12:08:08,134 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:08,136 INFO L225 Difference]: With dead ends: 104 [2018-11-23 12:08:08,136 INFO L226 Difference]: Without dead ends: 93 [2018-11-23 12:08:08,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:08:08,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-23 12:08:08,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-11-23 12:08:08,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:08,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 92 states. [2018-11-23 12:08:08,167 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 92 states. [2018-11-23 12:08:08,167 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 92 states. [2018-11-23 12:08:08,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:08,169 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2018-11-23 12:08:08,169 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-11-23 12:08:08,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:08,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:08,170 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 93 states. [2018-11-23 12:08:08,170 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 93 states. [2018-11-23 12:08:08,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:08,171 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2018-11-23 12:08:08,171 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-11-23 12:08:08,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:08,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:08,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:08,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:08,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-23 12:08:08,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2018-11-23 12:08:08,173 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 85 [2018-11-23 12:08:08,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:08,174 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2018-11-23 12:08:08,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 12:08:08,174 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2018-11-23 12:08:08,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-23 12:08:08,175 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:08,175 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:08,175 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:08,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:08,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1020067272, now seen corresponding path program 37 times [2018-11-23 12:08:08,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:08,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:08,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:08,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:08,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:09,210 INFO L256 TraceCheckUtils]: 0: Hoare triple {17241#true} call ULTIMATE.init(); {17241#true} is VALID [2018-11-23 12:08:09,211 INFO L273 TraceCheckUtils]: 1: Hoare triple {17241#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17241#true} is VALID [2018-11-23 12:08:09,211 INFO L273 TraceCheckUtils]: 2: Hoare triple {17241#true} assume true; {17241#true} is VALID [2018-11-23 12:08:09,211 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17241#true} {17241#true} #49#return; {17241#true} is VALID [2018-11-23 12:08:09,211 INFO L256 TraceCheckUtils]: 4: Hoare triple {17241#true} call #t~ret5 := main(); {17241#true} is VALID [2018-11-23 12:08:09,211 INFO L273 TraceCheckUtils]: 5: Hoare triple {17241#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {17243#(= main_~i~0 0)} is VALID [2018-11-23 12:08:09,212 INFO L273 TraceCheckUtils]: 6: Hoare triple {17243#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17243#(= main_~i~0 0)} is VALID [2018-11-23 12:08:09,212 INFO L273 TraceCheckUtils]: 7: Hoare triple {17243#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17244#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:09,213 INFO L273 TraceCheckUtils]: 8: Hoare triple {17244#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17244#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:09,213 INFO L273 TraceCheckUtils]: 9: Hoare triple {17244#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17245#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:09,213 INFO L273 TraceCheckUtils]: 10: Hoare triple {17245#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17245#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:09,214 INFO L273 TraceCheckUtils]: 11: Hoare triple {17245#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17246#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:09,214 INFO L273 TraceCheckUtils]: 12: Hoare triple {17246#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17246#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:09,214 INFO L273 TraceCheckUtils]: 13: Hoare triple {17246#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17247#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:09,215 INFO L273 TraceCheckUtils]: 14: Hoare triple {17247#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17247#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:09,215 INFO L273 TraceCheckUtils]: 15: Hoare triple {17247#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17248#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:09,216 INFO L273 TraceCheckUtils]: 16: Hoare triple {17248#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17248#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:09,217 INFO L273 TraceCheckUtils]: 17: Hoare triple {17248#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17249#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:09,217 INFO L273 TraceCheckUtils]: 18: Hoare triple {17249#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17249#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:09,218 INFO L273 TraceCheckUtils]: 19: Hoare triple {17249#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17250#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:09,218 INFO L273 TraceCheckUtils]: 20: Hoare triple {17250#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17250#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:09,219 INFO L273 TraceCheckUtils]: 21: Hoare triple {17250#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17251#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:09,220 INFO L273 TraceCheckUtils]: 22: Hoare triple {17251#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17251#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:09,220 INFO L273 TraceCheckUtils]: 23: Hoare triple {17251#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17252#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:09,221 INFO L273 TraceCheckUtils]: 24: Hoare triple {17252#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17252#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:09,222 INFO L273 TraceCheckUtils]: 25: Hoare triple {17252#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17253#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:09,222 INFO L273 TraceCheckUtils]: 26: Hoare triple {17253#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17253#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:09,223 INFO L273 TraceCheckUtils]: 27: Hoare triple {17253#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17254#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:09,223 INFO L273 TraceCheckUtils]: 28: Hoare triple {17254#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17254#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:09,224 INFO L273 TraceCheckUtils]: 29: Hoare triple {17254#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17255#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:09,225 INFO L273 TraceCheckUtils]: 30: Hoare triple {17255#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17255#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:09,225 INFO L273 TraceCheckUtils]: 31: Hoare triple {17255#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17256#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:09,226 INFO L273 TraceCheckUtils]: 32: Hoare triple {17256#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17256#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:09,227 INFO L273 TraceCheckUtils]: 33: Hoare triple {17256#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17257#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:09,227 INFO L273 TraceCheckUtils]: 34: Hoare triple {17257#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17257#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:09,228 INFO L273 TraceCheckUtils]: 35: Hoare triple {17257#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17258#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:09,228 INFO L273 TraceCheckUtils]: 36: Hoare triple {17258#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17258#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:09,229 INFO L273 TraceCheckUtils]: 37: Hoare triple {17258#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17259#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:09,230 INFO L273 TraceCheckUtils]: 38: Hoare triple {17259#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17259#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:09,230 INFO L273 TraceCheckUtils]: 39: Hoare triple {17259#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17260#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:09,231 INFO L273 TraceCheckUtils]: 40: Hoare triple {17260#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17260#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:09,231 INFO L273 TraceCheckUtils]: 41: Hoare triple {17260#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17261#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:09,232 INFO L273 TraceCheckUtils]: 42: Hoare triple {17261#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17261#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:09,233 INFO L273 TraceCheckUtils]: 43: Hoare triple {17261#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17262#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:09,233 INFO L273 TraceCheckUtils]: 44: Hoare triple {17262#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17262#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:09,234 INFO L273 TraceCheckUtils]: 45: Hoare triple {17262#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17263#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:09,235 INFO L273 TraceCheckUtils]: 46: Hoare triple {17263#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17263#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:09,238 INFO L273 TraceCheckUtils]: 47: Hoare triple {17263#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17264#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:09,238 INFO L273 TraceCheckUtils]: 48: Hoare triple {17264#(<= main_~i~0 21)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17264#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:09,239 INFO L273 TraceCheckUtils]: 49: Hoare triple {17264#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17265#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:09,239 INFO L273 TraceCheckUtils]: 50: Hoare triple {17265#(<= main_~i~0 22)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17265#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:09,240 INFO L273 TraceCheckUtils]: 51: Hoare triple {17265#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17266#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:09,240 INFO L273 TraceCheckUtils]: 52: Hoare triple {17266#(<= main_~i~0 23)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17266#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:09,240 INFO L273 TraceCheckUtils]: 53: Hoare triple {17266#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17267#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:09,241 INFO L273 TraceCheckUtils]: 54: Hoare triple {17267#(<= main_~i~0 24)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17267#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:09,241 INFO L273 TraceCheckUtils]: 55: Hoare triple {17267#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17268#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:09,242 INFO L273 TraceCheckUtils]: 56: Hoare triple {17268#(<= main_~i~0 25)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17268#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:09,243 INFO L273 TraceCheckUtils]: 57: Hoare triple {17268#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17269#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:09,243 INFO L273 TraceCheckUtils]: 58: Hoare triple {17269#(<= main_~i~0 26)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17269#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:09,244 INFO L273 TraceCheckUtils]: 59: Hoare triple {17269#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17270#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:09,244 INFO L273 TraceCheckUtils]: 60: Hoare triple {17270#(<= main_~i~0 27)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17270#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:09,245 INFO L273 TraceCheckUtils]: 61: Hoare triple {17270#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17271#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:09,246 INFO L273 TraceCheckUtils]: 62: Hoare triple {17271#(<= main_~i~0 28)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17271#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:09,246 INFO L273 TraceCheckUtils]: 63: Hoare triple {17271#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17272#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:09,247 INFO L273 TraceCheckUtils]: 64: Hoare triple {17272#(<= main_~i~0 29)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17272#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:09,248 INFO L273 TraceCheckUtils]: 65: Hoare triple {17272#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17273#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:09,248 INFO L273 TraceCheckUtils]: 66: Hoare triple {17273#(<= main_~i~0 30)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17273#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:09,249 INFO L273 TraceCheckUtils]: 67: Hoare triple {17273#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17274#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:09,249 INFO L273 TraceCheckUtils]: 68: Hoare triple {17274#(<= main_~i~0 31)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17274#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:09,250 INFO L273 TraceCheckUtils]: 69: Hoare triple {17274#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17275#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:09,251 INFO L273 TraceCheckUtils]: 70: Hoare triple {17275#(<= main_~i~0 32)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17275#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:09,251 INFO L273 TraceCheckUtils]: 71: Hoare triple {17275#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17276#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:09,252 INFO L273 TraceCheckUtils]: 72: Hoare triple {17276#(<= main_~i~0 33)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17276#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:09,253 INFO L273 TraceCheckUtils]: 73: Hoare triple {17276#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17277#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:09,253 INFO L273 TraceCheckUtils]: 74: Hoare triple {17277#(<= main_~i~0 34)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17277#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:09,254 INFO L273 TraceCheckUtils]: 75: Hoare triple {17277#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17278#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:09,254 INFO L273 TraceCheckUtils]: 76: Hoare triple {17278#(<= main_~i~0 35)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17278#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:09,255 INFO L273 TraceCheckUtils]: 77: Hoare triple {17278#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17279#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:09,256 INFO L273 TraceCheckUtils]: 78: Hoare triple {17279#(<= main_~i~0 36)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17279#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:09,256 INFO L273 TraceCheckUtils]: 79: Hoare triple {17279#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17280#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:09,257 INFO L273 TraceCheckUtils]: 80: Hoare triple {17280#(<= main_~i~0 37)} assume !(~i~0 < 50000); {17242#false} is VALID [2018-11-23 12:08:09,257 INFO L273 TraceCheckUtils]: 81: Hoare triple {17242#false} havoc ~x~0;~x~0 := 0; {17242#false} is VALID [2018-11-23 12:08:09,257 INFO L273 TraceCheckUtils]: 82: Hoare triple {17242#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {17242#false} is VALID [2018-11-23 12:08:09,258 INFO L256 TraceCheckUtils]: 83: Hoare triple {17242#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {17242#false} is VALID [2018-11-23 12:08:09,258 INFO L273 TraceCheckUtils]: 84: Hoare triple {17242#false} ~cond := #in~cond; {17242#false} is VALID [2018-11-23 12:08:09,258 INFO L273 TraceCheckUtils]: 85: Hoare triple {17242#false} assume 0 == ~cond; {17242#false} is VALID [2018-11-23 12:08:09,258 INFO L273 TraceCheckUtils]: 86: Hoare triple {17242#false} assume !false; {17242#false} is VALID [2018-11-23 12:08:09,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:08:09,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:09,264 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:09,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:08:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:09,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:09,590 INFO L256 TraceCheckUtils]: 0: Hoare triple {17241#true} call ULTIMATE.init(); {17241#true} is VALID [2018-11-23 12:08:09,590 INFO L273 TraceCheckUtils]: 1: Hoare triple {17241#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17241#true} is VALID [2018-11-23 12:08:09,591 INFO L273 TraceCheckUtils]: 2: Hoare triple {17241#true} assume true; {17241#true} is VALID [2018-11-23 12:08:09,591 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17241#true} {17241#true} #49#return; {17241#true} is VALID [2018-11-23 12:08:09,591 INFO L256 TraceCheckUtils]: 4: Hoare triple {17241#true} call #t~ret5 := main(); {17241#true} is VALID [2018-11-23 12:08:09,592 INFO L273 TraceCheckUtils]: 5: Hoare triple {17241#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {17299#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:09,592 INFO L273 TraceCheckUtils]: 6: Hoare triple {17299#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17299#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:09,593 INFO L273 TraceCheckUtils]: 7: Hoare triple {17299#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17244#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:09,593 INFO L273 TraceCheckUtils]: 8: Hoare triple {17244#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17244#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:09,594 INFO L273 TraceCheckUtils]: 9: Hoare triple {17244#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17245#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:09,594 INFO L273 TraceCheckUtils]: 10: Hoare triple {17245#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17245#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:09,594 INFO L273 TraceCheckUtils]: 11: Hoare triple {17245#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17246#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:09,595 INFO L273 TraceCheckUtils]: 12: Hoare triple {17246#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17246#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:09,595 INFO L273 TraceCheckUtils]: 13: Hoare triple {17246#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17247#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:09,596 INFO L273 TraceCheckUtils]: 14: Hoare triple {17247#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17247#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:09,597 INFO L273 TraceCheckUtils]: 15: Hoare triple {17247#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17248#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:09,597 INFO L273 TraceCheckUtils]: 16: Hoare triple {17248#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17248#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:09,598 INFO L273 TraceCheckUtils]: 17: Hoare triple {17248#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17249#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:09,600 INFO L273 TraceCheckUtils]: 18: Hoare triple {17249#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17249#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:09,600 INFO L273 TraceCheckUtils]: 19: Hoare triple {17249#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17250#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:09,601 INFO L273 TraceCheckUtils]: 20: Hoare triple {17250#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17250#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:09,602 INFO L273 TraceCheckUtils]: 21: Hoare triple {17250#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17251#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:09,602 INFO L273 TraceCheckUtils]: 22: Hoare triple {17251#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17251#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:09,603 INFO L273 TraceCheckUtils]: 23: Hoare triple {17251#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17252#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:09,603 INFO L273 TraceCheckUtils]: 24: Hoare triple {17252#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17252#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:09,604 INFO L273 TraceCheckUtils]: 25: Hoare triple {17252#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17253#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:09,605 INFO L273 TraceCheckUtils]: 26: Hoare triple {17253#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17253#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:09,605 INFO L273 TraceCheckUtils]: 27: Hoare triple {17253#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17254#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:09,606 INFO L273 TraceCheckUtils]: 28: Hoare triple {17254#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17254#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:09,606 INFO L273 TraceCheckUtils]: 29: Hoare triple {17254#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17255#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:09,607 INFO L273 TraceCheckUtils]: 30: Hoare triple {17255#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17255#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:09,608 INFO L273 TraceCheckUtils]: 31: Hoare triple {17255#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17256#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:09,608 INFO L273 TraceCheckUtils]: 32: Hoare triple {17256#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17256#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:09,609 INFO L273 TraceCheckUtils]: 33: Hoare triple {17256#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17257#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:09,609 INFO L273 TraceCheckUtils]: 34: Hoare triple {17257#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17257#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:09,610 INFO L273 TraceCheckUtils]: 35: Hoare triple {17257#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17258#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:09,611 INFO L273 TraceCheckUtils]: 36: Hoare triple {17258#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17258#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:09,611 INFO L273 TraceCheckUtils]: 37: Hoare triple {17258#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17259#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:09,612 INFO L273 TraceCheckUtils]: 38: Hoare triple {17259#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17259#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:09,613 INFO L273 TraceCheckUtils]: 39: Hoare triple {17259#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17260#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:09,613 INFO L273 TraceCheckUtils]: 40: Hoare triple {17260#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17260#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:09,614 INFO L273 TraceCheckUtils]: 41: Hoare triple {17260#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17261#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:09,614 INFO L273 TraceCheckUtils]: 42: Hoare triple {17261#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17261#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:09,615 INFO L273 TraceCheckUtils]: 43: Hoare triple {17261#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17262#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:09,616 INFO L273 TraceCheckUtils]: 44: Hoare triple {17262#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17262#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:09,616 INFO L273 TraceCheckUtils]: 45: Hoare triple {17262#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17263#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:09,617 INFO L273 TraceCheckUtils]: 46: Hoare triple {17263#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17263#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:09,618 INFO L273 TraceCheckUtils]: 47: Hoare triple {17263#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17264#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:09,618 INFO L273 TraceCheckUtils]: 48: Hoare triple {17264#(<= main_~i~0 21)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17264#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:09,619 INFO L273 TraceCheckUtils]: 49: Hoare triple {17264#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17265#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:09,619 INFO L273 TraceCheckUtils]: 50: Hoare triple {17265#(<= main_~i~0 22)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17265#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:09,620 INFO L273 TraceCheckUtils]: 51: Hoare triple {17265#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17266#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:09,621 INFO L273 TraceCheckUtils]: 52: Hoare triple {17266#(<= main_~i~0 23)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17266#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:09,621 INFO L273 TraceCheckUtils]: 53: Hoare triple {17266#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17267#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:09,622 INFO L273 TraceCheckUtils]: 54: Hoare triple {17267#(<= main_~i~0 24)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17267#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:09,623 INFO L273 TraceCheckUtils]: 55: Hoare triple {17267#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17268#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:09,623 INFO L273 TraceCheckUtils]: 56: Hoare triple {17268#(<= main_~i~0 25)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17268#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:09,643 INFO L273 TraceCheckUtils]: 57: Hoare triple {17268#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17269#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:09,657 INFO L273 TraceCheckUtils]: 58: Hoare triple {17269#(<= main_~i~0 26)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17269#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:09,666 INFO L273 TraceCheckUtils]: 59: Hoare triple {17269#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17270#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:09,682 INFO L273 TraceCheckUtils]: 60: Hoare triple {17270#(<= main_~i~0 27)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17270#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:09,690 INFO L273 TraceCheckUtils]: 61: Hoare triple {17270#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17271#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:09,707 INFO L273 TraceCheckUtils]: 62: Hoare triple {17271#(<= main_~i~0 28)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17271#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:09,707 INFO L273 TraceCheckUtils]: 63: Hoare triple {17271#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17272#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:09,709 INFO L273 TraceCheckUtils]: 64: Hoare triple {17272#(<= main_~i~0 29)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17272#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:09,709 INFO L273 TraceCheckUtils]: 65: Hoare triple {17272#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17273#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:09,711 INFO L273 TraceCheckUtils]: 66: Hoare triple {17273#(<= main_~i~0 30)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17273#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:09,711 INFO L273 TraceCheckUtils]: 67: Hoare triple {17273#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17274#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:09,712 INFO L273 TraceCheckUtils]: 68: Hoare triple {17274#(<= main_~i~0 31)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17274#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:09,713 INFO L273 TraceCheckUtils]: 69: Hoare triple {17274#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17275#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:09,713 INFO L273 TraceCheckUtils]: 70: Hoare triple {17275#(<= main_~i~0 32)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17275#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:09,713 INFO L273 TraceCheckUtils]: 71: Hoare triple {17275#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17276#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:09,714 INFO L273 TraceCheckUtils]: 72: Hoare triple {17276#(<= main_~i~0 33)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17276#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:09,714 INFO L273 TraceCheckUtils]: 73: Hoare triple {17276#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17277#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:09,714 INFO L273 TraceCheckUtils]: 74: Hoare triple {17277#(<= main_~i~0 34)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17277#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:09,715 INFO L273 TraceCheckUtils]: 75: Hoare triple {17277#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17278#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:09,716 INFO L273 TraceCheckUtils]: 76: Hoare triple {17278#(<= main_~i~0 35)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17278#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:09,716 INFO L273 TraceCheckUtils]: 77: Hoare triple {17278#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17279#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:09,717 INFO L273 TraceCheckUtils]: 78: Hoare triple {17279#(<= main_~i~0 36)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {17279#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:09,717 INFO L273 TraceCheckUtils]: 79: Hoare triple {17279#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17280#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:09,718 INFO L273 TraceCheckUtils]: 80: Hoare triple {17280#(<= main_~i~0 37)} assume !(~i~0 < 50000); {17242#false} is VALID [2018-11-23 12:08:09,719 INFO L273 TraceCheckUtils]: 81: Hoare triple {17242#false} havoc ~x~0;~x~0 := 0; {17242#false} is VALID [2018-11-23 12:08:09,719 INFO L273 TraceCheckUtils]: 82: Hoare triple {17242#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {17242#false} is VALID [2018-11-23 12:08:09,719 INFO L256 TraceCheckUtils]: 83: Hoare triple {17242#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {17242#false} is VALID [2018-11-23 12:08:09,719 INFO L273 TraceCheckUtils]: 84: Hoare triple {17242#false} ~cond := #in~cond; {17242#false} is VALID [2018-11-23 12:08:09,719 INFO L273 TraceCheckUtils]: 85: Hoare triple {17242#false} assume 0 == ~cond; {17242#false} is VALID [2018-11-23 12:08:09,720 INFO L273 TraceCheckUtils]: 86: Hoare triple {17242#false} assume !false; {17242#false} is VALID [2018-11-23 12:08:09,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:08:09,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:09,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2018-11-23 12:08:09,748 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 87 [2018-11-23 12:08:09,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:09,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-23 12:08:09,848 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:09,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 12:08:09,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 12:08:09,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:08:09,850 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 41 states. [2018-11-23 12:08:10,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:10,123 INFO L93 Difference]: Finished difference Result 106 states and 108 transitions. [2018-11-23 12:08:10,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 12:08:10,124 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 87 [2018-11-23 12:08:10,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:10,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:08:10,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 108 transitions. [2018-11-23 12:08:10,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:08:10,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 108 transitions. [2018-11-23 12:08:10,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 108 transitions. [2018-11-23 12:08:10,230 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-23 12:08:10,232 INFO L225 Difference]: With dead ends: 106 [2018-11-23 12:08:10,232 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 12:08:10,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:08:10,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 12:08:10,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-11-23 12:08:10,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:10,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 94 states. [2018-11-23 12:08:10,262 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 94 states. [2018-11-23 12:08:10,262 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 94 states. [2018-11-23 12:08:10,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:10,264 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2018-11-23 12:08:10,264 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-11-23 12:08:10,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:10,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:10,265 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 95 states. [2018-11-23 12:08:10,265 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 95 states. [2018-11-23 12:08:10,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:10,266 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2018-11-23 12:08:10,266 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-11-23 12:08:10,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:10,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:10,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:10,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:10,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-23 12:08:10,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2018-11-23 12:08:10,268 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 87 [2018-11-23 12:08:10,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:10,268 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2018-11-23 12:08:10,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 12:08:10,269 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2018-11-23 12:08:10,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-23 12:08:10,269 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:10,269 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:10,269 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:10,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:10,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1062056294, now seen corresponding path program 38 times [2018-11-23 12:08:10,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:10,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:10,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:10,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:08:10,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:11,286 INFO L256 TraceCheckUtils]: 0: Hoare triple {18027#true} call ULTIMATE.init(); {18027#true} is VALID [2018-11-23 12:08:11,286 INFO L273 TraceCheckUtils]: 1: Hoare triple {18027#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18027#true} is VALID [2018-11-23 12:08:11,287 INFO L273 TraceCheckUtils]: 2: Hoare triple {18027#true} assume true; {18027#true} is VALID [2018-11-23 12:08:11,287 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18027#true} {18027#true} #49#return; {18027#true} is VALID [2018-11-23 12:08:11,287 INFO L256 TraceCheckUtils]: 4: Hoare triple {18027#true} call #t~ret5 := main(); {18027#true} is VALID [2018-11-23 12:08:11,287 INFO L273 TraceCheckUtils]: 5: Hoare triple {18027#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {18029#(= main_~i~0 0)} is VALID [2018-11-23 12:08:11,287 INFO L273 TraceCheckUtils]: 6: Hoare triple {18029#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18029#(= main_~i~0 0)} is VALID [2018-11-23 12:08:11,288 INFO L273 TraceCheckUtils]: 7: Hoare triple {18029#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18030#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:11,288 INFO L273 TraceCheckUtils]: 8: Hoare triple {18030#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18030#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:11,289 INFO L273 TraceCheckUtils]: 9: Hoare triple {18030#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18031#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:11,290 INFO L273 TraceCheckUtils]: 10: Hoare triple {18031#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18031#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:11,290 INFO L273 TraceCheckUtils]: 11: Hoare triple {18031#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18032#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:11,291 INFO L273 TraceCheckUtils]: 12: Hoare triple {18032#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18032#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:11,292 INFO L273 TraceCheckUtils]: 13: Hoare triple {18032#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18033#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:11,292 INFO L273 TraceCheckUtils]: 14: Hoare triple {18033#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18033#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:11,293 INFO L273 TraceCheckUtils]: 15: Hoare triple {18033#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18034#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:11,293 INFO L273 TraceCheckUtils]: 16: Hoare triple {18034#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18034#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:11,294 INFO L273 TraceCheckUtils]: 17: Hoare triple {18034#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18035#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:11,295 INFO L273 TraceCheckUtils]: 18: Hoare triple {18035#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18035#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:11,295 INFO L273 TraceCheckUtils]: 19: Hoare triple {18035#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18036#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:11,296 INFO L273 TraceCheckUtils]: 20: Hoare triple {18036#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18036#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:11,297 INFO L273 TraceCheckUtils]: 21: Hoare triple {18036#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18037#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:11,297 INFO L273 TraceCheckUtils]: 22: Hoare triple {18037#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18037#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:11,298 INFO L273 TraceCheckUtils]: 23: Hoare triple {18037#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18038#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:11,298 INFO L273 TraceCheckUtils]: 24: Hoare triple {18038#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18038#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:11,299 INFO L273 TraceCheckUtils]: 25: Hoare triple {18038#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18039#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:11,300 INFO L273 TraceCheckUtils]: 26: Hoare triple {18039#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18039#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:11,300 INFO L273 TraceCheckUtils]: 27: Hoare triple {18039#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18040#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:11,301 INFO L273 TraceCheckUtils]: 28: Hoare triple {18040#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18040#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:11,302 INFO L273 TraceCheckUtils]: 29: Hoare triple {18040#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18041#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:11,302 INFO L273 TraceCheckUtils]: 30: Hoare triple {18041#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18041#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:11,303 INFO L273 TraceCheckUtils]: 31: Hoare triple {18041#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18042#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:11,303 INFO L273 TraceCheckUtils]: 32: Hoare triple {18042#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18042#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:11,304 INFO L273 TraceCheckUtils]: 33: Hoare triple {18042#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18043#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:11,305 INFO L273 TraceCheckUtils]: 34: Hoare triple {18043#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18043#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:11,305 INFO L273 TraceCheckUtils]: 35: Hoare triple {18043#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18044#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:11,306 INFO L273 TraceCheckUtils]: 36: Hoare triple {18044#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18044#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:11,306 INFO L273 TraceCheckUtils]: 37: Hoare triple {18044#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18045#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:11,307 INFO L273 TraceCheckUtils]: 38: Hoare triple {18045#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18045#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:11,308 INFO L273 TraceCheckUtils]: 39: Hoare triple {18045#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18046#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:11,308 INFO L273 TraceCheckUtils]: 40: Hoare triple {18046#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18046#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:11,309 INFO L273 TraceCheckUtils]: 41: Hoare triple {18046#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18047#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:11,309 INFO L273 TraceCheckUtils]: 42: Hoare triple {18047#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18047#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:11,310 INFO L273 TraceCheckUtils]: 43: Hoare triple {18047#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18048#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:11,311 INFO L273 TraceCheckUtils]: 44: Hoare triple {18048#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18048#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:11,311 INFO L273 TraceCheckUtils]: 45: Hoare triple {18048#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18049#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:11,312 INFO L273 TraceCheckUtils]: 46: Hoare triple {18049#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18049#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:11,313 INFO L273 TraceCheckUtils]: 47: Hoare triple {18049#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18050#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:11,313 INFO L273 TraceCheckUtils]: 48: Hoare triple {18050#(<= main_~i~0 21)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18050#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:11,314 INFO L273 TraceCheckUtils]: 49: Hoare triple {18050#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18051#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:11,314 INFO L273 TraceCheckUtils]: 50: Hoare triple {18051#(<= main_~i~0 22)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18051#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:11,315 INFO L273 TraceCheckUtils]: 51: Hoare triple {18051#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18052#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:11,316 INFO L273 TraceCheckUtils]: 52: Hoare triple {18052#(<= main_~i~0 23)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18052#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:11,316 INFO L273 TraceCheckUtils]: 53: Hoare triple {18052#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18053#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:11,317 INFO L273 TraceCheckUtils]: 54: Hoare triple {18053#(<= main_~i~0 24)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18053#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:11,318 INFO L273 TraceCheckUtils]: 55: Hoare triple {18053#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18054#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:11,318 INFO L273 TraceCheckUtils]: 56: Hoare triple {18054#(<= main_~i~0 25)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18054#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:11,319 INFO L273 TraceCheckUtils]: 57: Hoare triple {18054#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18055#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:11,319 INFO L273 TraceCheckUtils]: 58: Hoare triple {18055#(<= main_~i~0 26)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18055#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:11,320 INFO L273 TraceCheckUtils]: 59: Hoare triple {18055#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18056#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:11,321 INFO L273 TraceCheckUtils]: 60: Hoare triple {18056#(<= main_~i~0 27)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18056#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:11,321 INFO L273 TraceCheckUtils]: 61: Hoare triple {18056#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18057#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:11,322 INFO L273 TraceCheckUtils]: 62: Hoare triple {18057#(<= main_~i~0 28)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18057#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:11,323 INFO L273 TraceCheckUtils]: 63: Hoare triple {18057#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18058#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:11,323 INFO L273 TraceCheckUtils]: 64: Hoare triple {18058#(<= main_~i~0 29)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18058#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:11,324 INFO L273 TraceCheckUtils]: 65: Hoare triple {18058#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18059#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:11,324 INFO L273 TraceCheckUtils]: 66: Hoare triple {18059#(<= main_~i~0 30)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18059#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:11,325 INFO L273 TraceCheckUtils]: 67: Hoare triple {18059#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18060#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:11,326 INFO L273 TraceCheckUtils]: 68: Hoare triple {18060#(<= main_~i~0 31)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18060#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:11,326 INFO L273 TraceCheckUtils]: 69: Hoare triple {18060#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18061#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:11,327 INFO L273 TraceCheckUtils]: 70: Hoare triple {18061#(<= main_~i~0 32)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18061#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:11,327 INFO L273 TraceCheckUtils]: 71: Hoare triple {18061#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18062#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:11,328 INFO L273 TraceCheckUtils]: 72: Hoare triple {18062#(<= main_~i~0 33)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18062#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:11,329 INFO L273 TraceCheckUtils]: 73: Hoare triple {18062#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18063#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:11,329 INFO L273 TraceCheckUtils]: 74: Hoare triple {18063#(<= main_~i~0 34)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18063#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:11,330 INFO L273 TraceCheckUtils]: 75: Hoare triple {18063#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18064#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:11,330 INFO L273 TraceCheckUtils]: 76: Hoare triple {18064#(<= main_~i~0 35)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18064#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:11,331 INFO L273 TraceCheckUtils]: 77: Hoare triple {18064#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18065#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:11,332 INFO L273 TraceCheckUtils]: 78: Hoare triple {18065#(<= main_~i~0 36)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18065#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:11,332 INFO L273 TraceCheckUtils]: 79: Hoare triple {18065#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18066#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:11,333 INFO L273 TraceCheckUtils]: 80: Hoare triple {18066#(<= main_~i~0 37)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18066#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:11,334 INFO L273 TraceCheckUtils]: 81: Hoare triple {18066#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18067#(<= main_~i~0 38)} is VALID [2018-11-23 12:08:11,334 INFO L273 TraceCheckUtils]: 82: Hoare triple {18067#(<= main_~i~0 38)} assume !(~i~0 < 50000); {18028#false} is VALID [2018-11-23 12:08:11,334 INFO L273 TraceCheckUtils]: 83: Hoare triple {18028#false} havoc ~x~0;~x~0 := 0; {18028#false} is VALID [2018-11-23 12:08:11,335 INFO L273 TraceCheckUtils]: 84: Hoare triple {18028#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {18028#false} is VALID [2018-11-23 12:08:11,335 INFO L256 TraceCheckUtils]: 85: Hoare triple {18028#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {18028#false} is VALID [2018-11-23 12:08:11,335 INFO L273 TraceCheckUtils]: 86: Hoare triple {18028#false} ~cond := #in~cond; {18028#false} is VALID [2018-11-23 12:08:11,335 INFO L273 TraceCheckUtils]: 87: Hoare triple {18028#false} assume 0 == ~cond; {18028#false} is VALID [2018-11-23 12:08:11,335 INFO L273 TraceCheckUtils]: 88: Hoare triple {18028#false} assume !false; {18028#false} is VALID [2018-11-23 12:08:11,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:08:11,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:11,342 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:11,350 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:08:11,411 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:08:11,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:11,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:11,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:11,821 INFO L256 TraceCheckUtils]: 0: Hoare triple {18027#true} call ULTIMATE.init(); {18027#true} is VALID [2018-11-23 12:08:11,821 INFO L273 TraceCheckUtils]: 1: Hoare triple {18027#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18027#true} is VALID [2018-11-23 12:08:11,822 INFO L273 TraceCheckUtils]: 2: Hoare triple {18027#true} assume true; {18027#true} is VALID [2018-11-23 12:08:11,822 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18027#true} {18027#true} #49#return; {18027#true} is VALID [2018-11-23 12:08:11,822 INFO L256 TraceCheckUtils]: 4: Hoare triple {18027#true} call #t~ret5 := main(); {18027#true} is VALID [2018-11-23 12:08:11,823 INFO L273 TraceCheckUtils]: 5: Hoare triple {18027#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {18086#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:11,823 INFO L273 TraceCheckUtils]: 6: Hoare triple {18086#(<= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18086#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:11,824 INFO L273 TraceCheckUtils]: 7: Hoare triple {18086#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18030#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:11,825 INFO L273 TraceCheckUtils]: 8: Hoare triple {18030#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18030#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:11,825 INFO L273 TraceCheckUtils]: 9: Hoare triple {18030#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18031#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:11,826 INFO L273 TraceCheckUtils]: 10: Hoare triple {18031#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18031#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:11,826 INFO L273 TraceCheckUtils]: 11: Hoare triple {18031#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18032#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:11,827 INFO L273 TraceCheckUtils]: 12: Hoare triple {18032#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18032#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:11,828 INFO L273 TraceCheckUtils]: 13: Hoare triple {18032#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18033#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:11,828 INFO L273 TraceCheckUtils]: 14: Hoare triple {18033#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18033#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:11,829 INFO L273 TraceCheckUtils]: 15: Hoare triple {18033#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18034#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:11,829 INFO L273 TraceCheckUtils]: 16: Hoare triple {18034#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18034#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:11,830 INFO L273 TraceCheckUtils]: 17: Hoare triple {18034#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18035#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:11,831 INFO L273 TraceCheckUtils]: 18: Hoare triple {18035#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18035#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:11,831 INFO L273 TraceCheckUtils]: 19: Hoare triple {18035#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18036#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:11,832 INFO L273 TraceCheckUtils]: 20: Hoare triple {18036#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18036#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:11,833 INFO L273 TraceCheckUtils]: 21: Hoare triple {18036#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18037#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:11,833 INFO L273 TraceCheckUtils]: 22: Hoare triple {18037#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18037#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:11,834 INFO L273 TraceCheckUtils]: 23: Hoare triple {18037#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18038#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:11,834 INFO L273 TraceCheckUtils]: 24: Hoare triple {18038#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18038#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:11,835 INFO L273 TraceCheckUtils]: 25: Hoare triple {18038#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18039#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:11,836 INFO L273 TraceCheckUtils]: 26: Hoare triple {18039#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18039#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:11,836 INFO L273 TraceCheckUtils]: 27: Hoare triple {18039#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18040#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:11,837 INFO L273 TraceCheckUtils]: 28: Hoare triple {18040#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18040#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:11,838 INFO L273 TraceCheckUtils]: 29: Hoare triple {18040#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18041#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:11,838 INFO L273 TraceCheckUtils]: 30: Hoare triple {18041#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18041#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:11,839 INFO L273 TraceCheckUtils]: 31: Hoare triple {18041#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18042#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:11,839 INFO L273 TraceCheckUtils]: 32: Hoare triple {18042#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18042#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:11,840 INFO L273 TraceCheckUtils]: 33: Hoare triple {18042#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18043#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:11,841 INFO L273 TraceCheckUtils]: 34: Hoare triple {18043#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18043#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:11,841 INFO L273 TraceCheckUtils]: 35: Hoare triple {18043#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18044#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:11,842 INFO L273 TraceCheckUtils]: 36: Hoare triple {18044#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18044#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:11,842 INFO L273 TraceCheckUtils]: 37: Hoare triple {18044#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18045#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:11,843 INFO L273 TraceCheckUtils]: 38: Hoare triple {18045#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18045#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:11,844 INFO L273 TraceCheckUtils]: 39: Hoare triple {18045#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18046#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:11,844 INFO L273 TraceCheckUtils]: 40: Hoare triple {18046#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18046#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:11,845 INFO L273 TraceCheckUtils]: 41: Hoare triple {18046#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18047#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:11,845 INFO L273 TraceCheckUtils]: 42: Hoare triple {18047#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18047#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:11,846 INFO L273 TraceCheckUtils]: 43: Hoare triple {18047#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18048#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:11,847 INFO L273 TraceCheckUtils]: 44: Hoare triple {18048#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18048#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:11,847 INFO L273 TraceCheckUtils]: 45: Hoare triple {18048#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18049#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:11,848 INFO L273 TraceCheckUtils]: 46: Hoare triple {18049#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18049#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:11,849 INFO L273 TraceCheckUtils]: 47: Hoare triple {18049#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18050#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:11,849 INFO L273 TraceCheckUtils]: 48: Hoare triple {18050#(<= main_~i~0 21)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18050#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:11,850 INFO L273 TraceCheckUtils]: 49: Hoare triple {18050#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18051#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:11,850 INFO L273 TraceCheckUtils]: 50: Hoare triple {18051#(<= main_~i~0 22)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18051#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:11,851 INFO L273 TraceCheckUtils]: 51: Hoare triple {18051#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18052#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:11,852 INFO L273 TraceCheckUtils]: 52: Hoare triple {18052#(<= main_~i~0 23)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18052#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:11,852 INFO L273 TraceCheckUtils]: 53: Hoare triple {18052#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18053#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:11,853 INFO L273 TraceCheckUtils]: 54: Hoare triple {18053#(<= main_~i~0 24)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18053#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:11,854 INFO L273 TraceCheckUtils]: 55: Hoare triple {18053#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18054#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:11,854 INFO L273 TraceCheckUtils]: 56: Hoare triple {18054#(<= main_~i~0 25)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18054#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:11,855 INFO L273 TraceCheckUtils]: 57: Hoare triple {18054#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18055#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:11,855 INFO L273 TraceCheckUtils]: 58: Hoare triple {18055#(<= main_~i~0 26)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18055#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:11,856 INFO L273 TraceCheckUtils]: 59: Hoare triple {18055#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18056#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:11,857 INFO L273 TraceCheckUtils]: 60: Hoare triple {18056#(<= main_~i~0 27)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18056#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:11,857 INFO L273 TraceCheckUtils]: 61: Hoare triple {18056#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18057#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:11,858 INFO L273 TraceCheckUtils]: 62: Hoare triple {18057#(<= main_~i~0 28)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18057#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:11,859 INFO L273 TraceCheckUtils]: 63: Hoare triple {18057#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18058#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:11,859 INFO L273 TraceCheckUtils]: 64: Hoare triple {18058#(<= main_~i~0 29)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18058#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:11,860 INFO L273 TraceCheckUtils]: 65: Hoare triple {18058#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18059#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:11,860 INFO L273 TraceCheckUtils]: 66: Hoare triple {18059#(<= main_~i~0 30)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18059#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:11,861 INFO L273 TraceCheckUtils]: 67: Hoare triple {18059#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18060#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:11,862 INFO L273 TraceCheckUtils]: 68: Hoare triple {18060#(<= main_~i~0 31)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18060#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:11,862 INFO L273 TraceCheckUtils]: 69: Hoare triple {18060#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18061#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:11,863 INFO L273 TraceCheckUtils]: 70: Hoare triple {18061#(<= main_~i~0 32)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18061#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:11,863 INFO L273 TraceCheckUtils]: 71: Hoare triple {18061#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18062#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:11,864 INFO L273 TraceCheckUtils]: 72: Hoare triple {18062#(<= main_~i~0 33)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18062#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:11,869 INFO L273 TraceCheckUtils]: 73: Hoare triple {18062#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18063#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:11,869 INFO L273 TraceCheckUtils]: 74: Hoare triple {18063#(<= main_~i~0 34)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18063#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:11,870 INFO L273 TraceCheckUtils]: 75: Hoare triple {18063#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18064#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:11,870 INFO L273 TraceCheckUtils]: 76: Hoare triple {18064#(<= main_~i~0 35)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18064#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:11,870 INFO L273 TraceCheckUtils]: 77: Hoare triple {18064#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18065#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:11,871 INFO L273 TraceCheckUtils]: 78: Hoare triple {18065#(<= main_~i~0 36)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18065#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:11,871 INFO L273 TraceCheckUtils]: 79: Hoare triple {18065#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18066#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:11,871 INFO L273 TraceCheckUtils]: 80: Hoare triple {18066#(<= main_~i~0 37)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18066#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:11,872 INFO L273 TraceCheckUtils]: 81: Hoare triple {18066#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18067#(<= main_~i~0 38)} is VALID [2018-11-23 12:08:11,872 INFO L273 TraceCheckUtils]: 82: Hoare triple {18067#(<= main_~i~0 38)} assume !(~i~0 < 50000); {18028#false} is VALID [2018-11-23 12:08:11,873 INFO L273 TraceCheckUtils]: 83: Hoare triple {18028#false} havoc ~x~0;~x~0 := 0; {18028#false} is VALID [2018-11-23 12:08:11,873 INFO L273 TraceCheckUtils]: 84: Hoare triple {18028#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {18028#false} is VALID [2018-11-23 12:08:11,873 INFO L256 TraceCheckUtils]: 85: Hoare triple {18028#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {18028#false} is VALID [2018-11-23 12:08:11,873 INFO L273 TraceCheckUtils]: 86: Hoare triple {18028#false} ~cond := #in~cond; {18028#false} is VALID [2018-11-23 12:08:11,873 INFO L273 TraceCheckUtils]: 87: Hoare triple {18028#false} assume 0 == ~cond; {18028#false} is VALID [2018-11-23 12:08:11,874 INFO L273 TraceCheckUtils]: 88: Hoare triple {18028#false} assume !false; {18028#false} is VALID [2018-11-23 12:08:11,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:08:11,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:11,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2018-11-23 12:08:11,899 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 89 [2018-11-23 12:08:11,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:11,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:08:12,040 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-23 12:08:12,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:08:12,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:08:12,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:08:12,042 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 42 states. [2018-11-23 12:08:12,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:12,510 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2018-11-23 12:08:12,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 12:08:12,510 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 89 [2018-11-23 12:08:12,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:12,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:08:12,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 110 transitions. [2018-11-23 12:08:12,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:08:12,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 110 transitions. [2018-11-23 12:08:12,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 110 transitions. [2018-11-23 12:08:12,619 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-23 12:08:12,620 INFO L225 Difference]: With dead ends: 108 [2018-11-23 12:08:12,621 INFO L226 Difference]: Without dead ends: 97 [2018-11-23 12:08:12,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:08:12,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-23 12:08:12,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-11-23 12:08:12,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:12,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 96 states. [2018-11-23 12:08:12,657 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 96 states. [2018-11-23 12:08:12,657 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 96 states. [2018-11-23 12:08:12,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:12,659 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2018-11-23 12:08:12,659 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-11-23 12:08:12,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:12,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:12,659 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 97 states. [2018-11-23 12:08:12,659 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 97 states. [2018-11-23 12:08:12,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:12,660 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2018-11-23 12:08:12,660 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-11-23 12:08:12,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:12,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:12,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:12,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:12,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 12:08:12,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2018-11-23 12:08:12,663 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 89 [2018-11-23 12:08:12,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:12,663 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2018-11-23 12:08:12,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:08:12,663 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2018-11-23 12:08:12,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 12:08:12,664 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:12,664 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:12,664 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:12,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:12,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1536166524, now seen corresponding path program 39 times [2018-11-23 12:08:12,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:12,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:12,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:12,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:12,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:13,741 INFO L256 TraceCheckUtils]: 0: Hoare triple {18830#true} call ULTIMATE.init(); {18830#true} is VALID [2018-11-23 12:08:13,742 INFO L273 TraceCheckUtils]: 1: Hoare triple {18830#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18830#true} is VALID [2018-11-23 12:08:13,742 INFO L273 TraceCheckUtils]: 2: Hoare triple {18830#true} assume true; {18830#true} is VALID [2018-11-23 12:08:13,742 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18830#true} {18830#true} #49#return; {18830#true} is VALID [2018-11-23 12:08:13,743 INFO L256 TraceCheckUtils]: 4: Hoare triple {18830#true} call #t~ret5 := main(); {18830#true} is VALID [2018-11-23 12:08:13,743 INFO L273 TraceCheckUtils]: 5: Hoare triple {18830#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 0; {18832#(= main_~i~0 0)} is VALID [2018-11-23 12:08:13,744 INFO L273 TraceCheckUtils]: 6: Hoare triple {18832#(= main_~i~0 0)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18832#(= main_~i~0 0)} is VALID [2018-11-23 12:08:13,744 INFO L273 TraceCheckUtils]: 7: Hoare triple {18832#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18833#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:13,745 INFO L273 TraceCheckUtils]: 8: Hoare triple {18833#(<= main_~i~0 1)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18833#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:13,745 INFO L273 TraceCheckUtils]: 9: Hoare triple {18833#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18834#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:13,745 INFO L273 TraceCheckUtils]: 10: Hoare triple {18834#(<= main_~i~0 2)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18834#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:13,746 INFO L273 TraceCheckUtils]: 11: Hoare triple {18834#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18835#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:13,746 INFO L273 TraceCheckUtils]: 12: Hoare triple {18835#(<= main_~i~0 3)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18835#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:13,747 INFO L273 TraceCheckUtils]: 13: Hoare triple {18835#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18836#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:13,747 INFO L273 TraceCheckUtils]: 14: Hoare triple {18836#(<= main_~i~0 4)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18836#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:13,748 INFO L273 TraceCheckUtils]: 15: Hoare triple {18836#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18837#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:13,748 INFO L273 TraceCheckUtils]: 16: Hoare triple {18837#(<= main_~i~0 5)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18837#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:13,749 INFO L273 TraceCheckUtils]: 17: Hoare triple {18837#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18838#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:13,750 INFO L273 TraceCheckUtils]: 18: Hoare triple {18838#(<= main_~i~0 6)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18838#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:13,750 INFO L273 TraceCheckUtils]: 19: Hoare triple {18838#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18839#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:13,751 INFO L273 TraceCheckUtils]: 20: Hoare triple {18839#(<= main_~i~0 7)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18839#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:13,752 INFO L273 TraceCheckUtils]: 21: Hoare triple {18839#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18840#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:13,752 INFO L273 TraceCheckUtils]: 22: Hoare triple {18840#(<= main_~i~0 8)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18840#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:13,753 INFO L273 TraceCheckUtils]: 23: Hoare triple {18840#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18841#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:13,753 INFO L273 TraceCheckUtils]: 24: Hoare triple {18841#(<= main_~i~0 9)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18841#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:13,754 INFO L273 TraceCheckUtils]: 25: Hoare triple {18841#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18842#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:13,755 INFO L273 TraceCheckUtils]: 26: Hoare triple {18842#(<= main_~i~0 10)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18842#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:13,755 INFO L273 TraceCheckUtils]: 27: Hoare triple {18842#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18843#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:13,756 INFO L273 TraceCheckUtils]: 28: Hoare triple {18843#(<= main_~i~0 11)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18843#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:13,756 INFO L273 TraceCheckUtils]: 29: Hoare triple {18843#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18844#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:13,757 INFO L273 TraceCheckUtils]: 30: Hoare triple {18844#(<= main_~i~0 12)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18844#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:13,758 INFO L273 TraceCheckUtils]: 31: Hoare triple {18844#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18845#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:13,758 INFO L273 TraceCheckUtils]: 32: Hoare triple {18845#(<= main_~i~0 13)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18845#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:13,759 INFO L273 TraceCheckUtils]: 33: Hoare triple {18845#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18846#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:13,759 INFO L273 TraceCheckUtils]: 34: Hoare triple {18846#(<= main_~i~0 14)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18846#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:13,760 INFO L273 TraceCheckUtils]: 35: Hoare triple {18846#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18847#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:13,761 INFO L273 TraceCheckUtils]: 36: Hoare triple {18847#(<= main_~i~0 15)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18847#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:13,761 INFO L273 TraceCheckUtils]: 37: Hoare triple {18847#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18848#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:13,762 INFO L273 TraceCheckUtils]: 38: Hoare triple {18848#(<= main_~i~0 16)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18848#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:13,763 INFO L273 TraceCheckUtils]: 39: Hoare triple {18848#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18849#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:13,763 INFO L273 TraceCheckUtils]: 40: Hoare triple {18849#(<= main_~i~0 17)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18849#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:13,764 INFO L273 TraceCheckUtils]: 41: Hoare triple {18849#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18850#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:13,764 INFO L273 TraceCheckUtils]: 42: Hoare triple {18850#(<= main_~i~0 18)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18850#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:13,765 INFO L273 TraceCheckUtils]: 43: Hoare triple {18850#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18851#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:13,766 INFO L273 TraceCheckUtils]: 44: Hoare triple {18851#(<= main_~i~0 19)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18851#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:13,766 INFO L273 TraceCheckUtils]: 45: Hoare triple {18851#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18852#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:13,767 INFO L273 TraceCheckUtils]: 46: Hoare triple {18852#(<= main_~i~0 20)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18852#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:13,768 INFO L273 TraceCheckUtils]: 47: Hoare triple {18852#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18853#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:13,768 INFO L273 TraceCheckUtils]: 48: Hoare triple {18853#(<= main_~i~0 21)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18853#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:13,769 INFO L273 TraceCheckUtils]: 49: Hoare triple {18853#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18854#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:13,769 INFO L273 TraceCheckUtils]: 50: Hoare triple {18854#(<= main_~i~0 22)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18854#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:13,770 INFO L273 TraceCheckUtils]: 51: Hoare triple {18854#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18855#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:13,771 INFO L273 TraceCheckUtils]: 52: Hoare triple {18855#(<= main_~i~0 23)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18855#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:13,771 INFO L273 TraceCheckUtils]: 53: Hoare triple {18855#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18856#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:13,772 INFO L273 TraceCheckUtils]: 54: Hoare triple {18856#(<= main_~i~0 24)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18856#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:13,773 INFO L273 TraceCheckUtils]: 55: Hoare triple {18856#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18857#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:13,773 INFO L273 TraceCheckUtils]: 56: Hoare triple {18857#(<= main_~i~0 25)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18857#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:13,774 INFO L273 TraceCheckUtils]: 57: Hoare triple {18857#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18858#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:13,774 INFO L273 TraceCheckUtils]: 58: Hoare triple {18858#(<= main_~i~0 26)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18858#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:13,775 INFO L273 TraceCheckUtils]: 59: Hoare triple {18858#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18859#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:13,775 INFO L273 TraceCheckUtils]: 60: Hoare triple {18859#(<= main_~i~0 27)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18859#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:13,776 INFO L273 TraceCheckUtils]: 61: Hoare triple {18859#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18860#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:13,777 INFO L273 TraceCheckUtils]: 62: Hoare triple {18860#(<= main_~i~0 28)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18860#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:13,777 INFO L273 TraceCheckUtils]: 63: Hoare triple {18860#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18861#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:13,778 INFO L273 TraceCheckUtils]: 64: Hoare triple {18861#(<= main_~i~0 29)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18861#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:13,779 INFO L273 TraceCheckUtils]: 65: Hoare triple {18861#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18862#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:13,779 INFO L273 TraceCheckUtils]: 66: Hoare triple {18862#(<= main_~i~0 30)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18862#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:13,780 INFO L273 TraceCheckUtils]: 67: Hoare triple {18862#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18863#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:13,780 INFO L273 TraceCheckUtils]: 68: Hoare triple {18863#(<= main_~i~0 31)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18863#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:13,781 INFO L273 TraceCheckUtils]: 69: Hoare triple {18863#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18864#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:13,782 INFO L273 TraceCheckUtils]: 70: Hoare triple {18864#(<= main_~i~0 32)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18864#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:13,782 INFO L273 TraceCheckUtils]: 71: Hoare triple {18864#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18865#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:13,783 INFO L273 TraceCheckUtils]: 72: Hoare triple {18865#(<= main_~i~0 33)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18865#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:13,784 INFO L273 TraceCheckUtils]: 73: Hoare triple {18865#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18866#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:13,784 INFO L273 TraceCheckUtils]: 74: Hoare triple {18866#(<= main_~i~0 34)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18866#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:13,785 INFO L273 TraceCheckUtils]: 75: Hoare triple {18866#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18867#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:13,785 INFO L273 TraceCheckUtils]: 76: Hoare triple {18867#(<= main_~i~0 35)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18867#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:13,786 INFO L273 TraceCheckUtils]: 77: Hoare triple {18867#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18868#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:13,787 INFO L273 TraceCheckUtils]: 78: Hoare triple {18868#(<= main_~i~0 36)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18868#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:13,787 INFO L273 TraceCheckUtils]: 79: Hoare triple {18868#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18869#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:13,788 INFO L273 TraceCheckUtils]: 80: Hoare triple {18869#(<= main_~i~0 37)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18869#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:13,789 INFO L273 TraceCheckUtils]: 81: Hoare triple {18869#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18870#(<= main_~i~0 38)} is VALID [2018-11-23 12:08:13,789 INFO L273 TraceCheckUtils]: 82: Hoare triple {18870#(<= main_~i~0 38)} assume !!(~i~0 < 50000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~i~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {18870#(<= main_~i~0 38)} is VALID [2018-11-23 12:08:13,790 INFO L273 TraceCheckUtils]: 83: Hoare triple {18870#(<= main_~i~0 38)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18871#(<= main_~i~0 39)} is VALID [2018-11-23 12:08:13,790 INFO L273 TraceCheckUtils]: 84: Hoare triple {18871#(<= main_~i~0 39)} assume !(~i~0 < 50000); {18831#false} is VALID [2018-11-23 12:08:13,791 INFO L273 TraceCheckUtils]: 85: Hoare triple {18831#false} havoc ~x~0;~x~0 := 0; {18831#false} is VALID [2018-11-23 12:08:13,791 INFO L273 TraceCheckUtils]: 86: Hoare triple {18831#false} assume !!(~x~0 < 50000);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (100000 - ~x~0 - 1), 4); {18831#false} is VALID [2018-11-23 12:08:13,791 INFO L256 TraceCheckUtils]: 87: Hoare triple {18831#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {18831#false} is VALID [2018-11-23 12:08:13,791 INFO L273 TraceCheckUtils]: 88: Hoare triple {18831#false} ~cond := #in~cond; {18831#false} is VALID [2018-11-23 12:08:13,791 INFO L273 TraceCheckUtils]: 89: Hoare triple {18831#false} assume 0 == ~cond; {18831#false} is VALID [2018-11-23 12:08:13,792 INFO L273 TraceCheckUtils]: 90: Hoare triple {18831#false} assume !false; {18831#false} is VALID [2018-11-23 12:08:13,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:08:13,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:13,798 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:13,807 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2