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_copy5_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:51:45,146 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:51:45,148 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:51:45,161 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:51:45,161 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:51:45,162 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:51:45,166 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:51:45,168 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:51:45,171 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:51:45,172 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:51:45,173 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:51:45,175 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:51:45,177 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:51:45,178 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:51:45,179 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:51:45,183 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:51:45,184 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:51:45,187 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:51:45,194 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:51:45,200 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:51:45,201 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:51:45,202 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:51:45,208 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:51:45,208 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:51:45,208 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:51:45,209 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:51:45,210 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:51:45,211 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:51:45,212 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:51:45,214 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:51:45,214 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:51:45,215 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:51:45,215 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:51:45,215 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:51:45,218 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:51:45,219 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:51:45,219 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 11:51:45,245 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:51:45,245 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:51:45,246 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:51:45,246 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:51:45,247 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:51:45,247 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:51:45,247 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:51:45,248 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:51:45,248 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:51:45,248 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:51:45,248 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:51:45,248 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:51:45,249 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:51:45,249 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:51:45,249 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:51:45,249 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:51:45,251 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:51:45,251 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:51:45,251 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:51:45,251 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:51:45,251 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:51:45,252 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:51:45,252 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:51:45,252 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:51:45,252 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:51:45,252 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:51:45,253 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:51:45,253 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:51:45,253 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:51:45,253 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:51:45,253 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:51:45,335 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:51:45,349 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:51:45,353 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:51:45,355 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:51:45,355 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:51:45,356 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy5_false-unreach-call_ground.i [2018-11-23 11:51:45,422 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/755eee4b3/553123c99362440da7a61df7a17d5cb1/FLAG843f0dba7 [2018-11-23 11:51:45,942 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:51:45,943 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy5_false-unreach-call_ground.i [2018-11-23 11:51:45,951 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/755eee4b3/553123c99362440da7a61df7a17d5cb1/FLAG843f0dba7 [2018-11-23 11:51:46,333 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/755eee4b3/553123c99362440da7a61df7a17d5cb1 [2018-11-23 11:51:46,342 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:51:46,344 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:51:46,345 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:51:46,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:51:46,351 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:51:46,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,356 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a7bc8f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46, skipping insertion in model container [2018-11-23 11:51:46,356 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,367 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:51:46,393 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:51:46,645 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:51:46,651 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:51:46,708 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:51:46,742 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:51:46,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46 WrapperNode [2018-11-23 11:51:46,742 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:51:46,743 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:51:46,744 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:51:46,744 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:51:46,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,769 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,777 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:51:46,778 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:51:46,778 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:51:46,778 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:51:46,787 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,789 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,806 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,815 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,817 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,820 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:51:46,821 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:51:46,821 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:51:46,821 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:51:46,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:51:46,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:51:46,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:51:46,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:51:46,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:51:46,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:51:46,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:51:46,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:51:46,978 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:51:46,978 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:51:46,978 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:51:46,978 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:51:46,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:51:48,047 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:51:48,047 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 11:51:48,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:51:48 BoogieIcfgContainer [2018-11-23 11:51:48,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:51:48,050 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:51:48,050 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:51:48,054 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:51:48,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:51:46" (1/3) ... [2018-11-23 11:51:48,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2002eeae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:51:48, skipping insertion in model container [2018-11-23 11:51:48,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (2/3) ... [2018-11-23 11:51:48,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2002eeae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:51:48, skipping insertion in model container [2018-11-23 11:51:48,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:51:48" (3/3) ... [2018-11-23 11:51:48,059 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy5_false-unreach-call_ground.i [2018-11-23 11:51:48,070 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:51:48,079 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:51:48,097 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:51:48,131 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:51:48,132 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:51:48,133 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:51:48,133 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:51:48,134 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:51:48,134 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:51:48,134 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:51:48,134 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:51:48,135 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:51:48,155 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-11-23 11:51:48,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:51:48,163 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:48,164 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:48,166 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:48,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:48,173 INFO L82 PathProgramCache]: Analyzing trace with hash -2095174276, now seen corresponding path program 1 times [2018-11-23 11:51:48,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:48,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:48,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:48,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:48,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:48,349 INFO L256 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {42#true} is VALID [2018-11-23 11:51:48,353 INFO L273 TraceCheckUtils]: 1: Hoare triple {42#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {42#true} is VALID [2018-11-23 11:51:48,354 INFO L273 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2018-11-23 11:51:48,354 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #119#return; {42#true} is VALID [2018-11-23 11:51:48,354 INFO L256 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret16 := main(); {42#true} is VALID [2018-11-23 11:51:48,355 INFO L273 TraceCheckUtils]: 5: Hoare triple {42#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {42#true} is VALID [2018-11-23 11:51:48,356 INFO L273 TraceCheckUtils]: 6: Hoare triple {42#true} assume !true; {43#false} is VALID [2018-11-23 11:51:48,356 INFO L273 TraceCheckUtils]: 7: Hoare triple {43#false} havoc ~i~0;~i~0 := 0; {43#false} is VALID [2018-11-23 11:51:48,356 INFO L273 TraceCheckUtils]: 8: Hoare triple {43#false} assume !(~i~0 < 100000); {43#false} is VALID [2018-11-23 11:51:48,357 INFO L273 TraceCheckUtils]: 9: Hoare triple {43#false} ~i~0 := 0; {43#false} is VALID [2018-11-23 11:51:48,357 INFO L273 TraceCheckUtils]: 10: Hoare triple {43#false} assume !(~i~0 < 100000); {43#false} is VALID [2018-11-23 11:51:48,357 INFO L273 TraceCheckUtils]: 11: Hoare triple {43#false} ~i~0 := 0; {43#false} is VALID [2018-11-23 11:51:48,358 INFO L273 TraceCheckUtils]: 12: Hoare triple {43#false} assume !(~i~0 < 100000); {43#false} is VALID [2018-11-23 11:51:48,358 INFO L273 TraceCheckUtils]: 13: Hoare triple {43#false} ~i~0 := 0; {43#false} is VALID [2018-11-23 11:51:48,358 INFO L273 TraceCheckUtils]: 14: Hoare triple {43#false} assume !(~i~0 < 100000); {43#false} is VALID [2018-11-23 11:51:48,359 INFO L273 TraceCheckUtils]: 15: Hoare triple {43#false} ~i~0 := 0; {43#false} is VALID [2018-11-23 11:51:48,359 INFO L273 TraceCheckUtils]: 16: Hoare triple {43#false} assume !(~i~0 < 100000); {43#false} is VALID [2018-11-23 11:51:48,359 INFO L273 TraceCheckUtils]: 17: Hoare triple {43#false} havoc ~x~0;~x~0 := 0; {43#false} is VALID [2018-11-23 11:51:48,360 INFO L273 TraceCheckUtils]: 18: Hoare triple {43#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {43#false} is VALID [2018-11-23 11:51:48,360 INFO L256 TraceCheckUtils]: 19: Hoare triple {43#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {43#false} is VALID [2018-11-23 11:51:48,360 INFO L273 TraceCheckUtils]: 20: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2018-11-23 11:51:48,361 INFO L273 TraceCheckUtils]: 21: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2018-11-23 11:51:48,361 INFO L273 TraceCheckUtils]: 22: Hoare triple {43#false} assume !false; {43#false} is VALID [2018-11-23 11:51:48,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:48,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:48,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:51:48,374 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-11-23 11:51:48,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:48,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:51:48,552 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:48,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:51:48,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:51:48,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:51:48,567 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 2 states. [2018-11-23 11:51:48,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:48,739 INFO L93 Difference]: Finished difference Result 70 states and 97 transitions. [2018-11-23 11:51:48,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:51:48,739 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-11-23 11:51:48,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:48,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:51:48,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 97 transitions. [2018-11-23 11:51:48,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:51:48,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 97 transitions. [2018-11-23 11:51:48,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 97 transitions. [2018-11-23 11:51:49,139 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:49,153 INFO L225 Difference]: With dead ends: 70 [2018-11-23 11:51:49,154 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 11:51:49,158 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 11:51:49,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 11:51:49,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 11:51:49,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:49,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-23 11:51:49,368 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 11:51:49,368 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 11:51:49,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:49,373 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-11-23 11:51:49,374 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-23 11:51:49,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:49,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:49,375 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 11:51:49,375 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 11:51:49,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:49,381 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-11-23 11:51:49,381 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-23 11:51:49,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:49,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:49,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:49,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:49,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:51:49,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2018-11-23 11:51:49,388 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 23 [2018-11-23 11:51:49,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:49,388 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-11-23 11:51:49,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:51:49,389 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-23 11:51:49,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:51:49,390 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:49,391 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:49,391 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:49,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:49,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1625097866, now seen corresponding path program 1 times [2018-11-23 11:51:49,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:49,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:49,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:49,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:49,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:49,532 INFO L256 TraceCheckUtils]: 0: Hoare triple {252#true} call ULTIMATE.init(); {252#true} is VALID [2018-11-23 11:51:49,533 INFO L273 TraceCheckUtils]: 1: Hoare triple {252#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {252#true} is VALID [2018-11-23 11:51:49,533 INFO L273 TraceCheckUtils]: 2: Hoare triple {252#true} assume true; {252#true} is VALID [2018-11-23 11:51:49,533 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {252#true} {252#true} #119#return; {252#true} is VALID [2018-11-23 11:51:49,534 INFO L256 TraceCheckUtils]: 4: Hoare triple {252#true} call #t~ret16 := main(); {252#true} is VALID [2018-11-23 11:51:49,536 INFO L273 TraceCheckUtils]: 5: Hoare triple {252#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {254#(= main_~a~0 0)} is VALID [2018-11-23 11:51:49,537 INFO L273 TraceCheckUtils]: 6: Hoare triple {254#(= main_~a~0 0)} assume !(~a~0 < 100000); {253#false} is VALID [2018-11-23 11:51:49,537 INFO L273 TraceCheckUtils]: 7: Hoare triple {253#false} havoc ~i~0;~i~0 := 0; {253#false} is VALID [2018-11-23 11:51:49,537 INFO L273 TraceCheckUtils]: 8: Hoare triple {253#false} assume !(~i~0 < 100000); {253#false} is VALID [2018-11-23 11:51:49,538 INFO L273 TraceCheckUtils]: 9: Hoare triple {253#false} ~i~0 := 0; {253#false} is VALID [2018-11-23 11:51:49,538 INFO L273 TraceCheckUtils]: 10: Hoare triple {253#false} assume !(~i~0 < 100000); {253#false} is VALID [2018-11-23 11:51:49,538 INFO L273 TraceCheckUtils]: 11: Hoare triple {253#false} ~i~0 := 0; {253#false} is VALID [2018-11-23 11:51:49,538 INFO L273 TraceCheckUtils]: 12: Hoare triple {253#false} assume !(~i~0 < 100000); {253#false} is VALID [2018-11-23 11:51:49,539 INFO L273 TraceCheckUtils]: 13: Hoare triple {253#false} ~i~0 := 0; {253#false} is VALID [2018-11-23 11:51:49,539 INFO L273 TraceCheckUtils]: 14: Hoare triple {253#false} assume !(~i~0 < 100000); {253#false} is VALID [2018-11-23 11:51:49,539 INFO L273 TraceCheckUtils]: 15: Hoare triple {253#false} ~i~0 := 0; {253#false} is VALID [2018-11-23 11:51:49,540 INFO L273 TraceCheckUtils]: 16: Hoare triple {253#false} assume !(~i~0 < 100000); {253#false} is VALID [2018-11-23 11:51:49,540 INFO L273 TraceCheckUtils]: 17: Hoare triple {253#false} havoc ~x~0;~x~0 := 0; {253#false} is VALID [2018-11-23 11:51:49,540 INFO L273 TraceCheckUtils]: 18: Hoare triple {253#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {253#false} is VALID [2018-11-23 11:51:49,541 INFO L256 TraceCheckUtils]: 19: Hoare triple {253#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {253#false} is VALID [2018-11-23 11:51:49,541 INFO L273 TraceCheckUtils]: 20: Hoare triple {253#false} ~cond := #in~cond; {253#false} is VALID [2018-11-23 11:51:49,542 INFO L273 TraceCheckUtils]: 21: Hoare triple {253#false} assume 0 == ~cond; {253#false} is VALID [2018-11-23 11:51:49,542 INFO L273 TraceCheckUtils]: 22: Hoare triple {253#false} assume !false; {253#false} is VALID [2018-11-23 11:51:49,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:49,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:49,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:51:49,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 11:51:49,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:49,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:51:49,665 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:49,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:51:49,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:51:49,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:49,667 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 3 states. [2018-11-23 11:51:50,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,052 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2018-11-23 11:51:50,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:51:50,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 11:51:50,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:50,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:50,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2018-11-23 11:51:50,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:50,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2018-11-23 11:51:50,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2018-11-23 11:51:50,250 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 11:51:50,253 INFO L225 Difference]: With dead ends: 62 [2018-11-23 11:51:50,254 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 11:51:50,255 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 11:51:50,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 11:51:50,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-23 11:51:50,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:50,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2018-11-23 11:51:50,271 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2018-11-23 11:51:50,271 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2018-11-23 11:51:50,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,275 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2018-11-23 11:51:50,275 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-23 11:51:50,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:50,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:50,276 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2018-11-23 11:51:50,277 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2018-11-23 11:51:50,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,280 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2018-11-23 11:51:50,280 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-23 11:51:50,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:50,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:50,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:50,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:50,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 11:51:50,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-11-23 11:51:50,285 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 23 [2018-11-23 11:51:50,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:50,285 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-23 11:51:50,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:51:50,285 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-23 11:51:50,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:51:50,287 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:50,287 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:50,287 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:50,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:50,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1623092332, now seen corresponding path program 1 times [2018-11-23 11:51:50,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:50,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:50,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:50,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:50,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:50,391 INFO L256 TraceCheckUtils]: 0: Hoare triple {462#true} call ULTIMATE.init(); {462#true} is VALID [2018-11-23 11:51:50,392 INFO L273 TraceCheckUtils]: 1: Hoare triple {462#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {462#true} is VALID [2018-11-23 11:51:50,392 INFO L273 TraceCheckUtils]: 2: Hoare triple {462#true} assume true; {462#true} is VALID [2018-11-23 11:51:50,393 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {462#true} {462#true} #119#return; {462#true} is VALID [2018-11-23 11:51:50,393 INFO L256 TraceCheckUtils]: 4: Hoare triple {462#true} call #t~ret16 := main(); {462#true} is VALID [2018-11-23 11:51:50,394 INFO L273 TraceCheckUtils]: 5: Hoare triple {462#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {462#true} is VALID [2018-11-23 11:51:50,394 INFO L273 TraceCheckUtils]: 6: Hoare triple {462#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {462#true} is VALID [2018-11-23 11:51:50,394 INFO L273 TraceCheckUtils]: 7: Hoare triple {462#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {462#true} is VALID [2018-11-23 11:51:50,395 INFO L273 TraceCheckUtils]: 8: Hoare triple {462#true} assume !(~a~0 < 100000); {462#true} is VALID [2018-11-23 11:51:50,398 INFO L273 TraceCheckUtils]: 9: Hoare triple {462#true} havoc ~i~0;~i~0 := 0; {464#(= main_~i~0 0)} is VALID [2018-11-23 11:51:50,400 INFO L273 TraceCheckUtils]: 10: Hoare triple {464#(= main_~i~0 0)} assume !(~i~0 < 100000); {463#false} is VALID [2018-11-23 11:51:50,400 INFO L273 TraceCheckUtils]: 11: Hoare triple {463#false} ~i~0 := 0; {463#false} is VALID [2018-11-23 11:51:50,400 INFO L273 TraceCheckUtils]: 12: Hoare triple {463#false} assume !(~i~0 < 100000); {463#false} is VALID [2018-11-23 11:51:50,401 INFO L273 TraceCheckUtils]: 13: Hoare triple {463#false} ~i~0 := 0; {463#false} is VALID [2018-11-23 11:51:50,401 INFO L273 TraceCheckUtils]: 14: Hoare triple {463#false} assume !(~i~0 < 100000); {463#false} is VALID [2018-11-23 11:51:50,401 INFO L273 TraceCheckUtils]: 15: Hoare triple {463#false} ~i~0 := 0; {463#false} is VALID [2018-11-23 11:51:50,401 INFO L273 TraceCheckUtils]: 16: Hoare triple {463#false} assume !(~i~0 < 100000); {463#false} is VALID [2018-11-23 11:51:50,402 INFO L273 TraceCheckUtils]: 17: Hoare triple {463#false} ~i~0 := 0; {463#false} is VALID [2018-11-23 11:51:50,402 INFO L273 TraceCheckUtils]: 18: Hoare triple {463#false} assume !(~i~0 < 100000); {463#false} is VALID [2018-11-23 11:51:50,402 INFO L273 TraceCheckUtils]: 19: Hoare triple {463#false} havoc ~x~0;~x~0 := 0; {463#false} is VALID [2018-11-23 11:51:50,403 INFO L273 TraceCheckUtils]: 20: Hoare triple {463#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {463#false} is VALID [2018-11-23 11:51:50,403 INFO L256 TraceCheckUtils]: 21: Hoare triple {463#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {463#false} is VALID [2018-11-23 11:51:50,403 INFO L273 TraceCheckUtils]: 22: Hoare triple {463#false} ~cond := #in~cond; {463#false} is VALID [2018-11-23 11:51:50,404 INFO L273 TraceCheckUtils]: 23: Hoare triple {463#false} assume 0 == ~cond; {463#false} is VALID [2018-11-23 11:51:50,404 INFO L273 TraceCheckUtils]: 24: Hoare triple {463#false} assume !false; {463#false} is VALID [2018-11-23 11:51:50,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:51:50,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:50,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:51:50,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 11:51:50,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:50,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:51:50,477 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:50,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:51:50,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:51:50,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:50,478 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 3 states. [2018-11-23 11:51:50,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,726 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2018-11-23 11:51:50,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:51:50,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 11:51:50,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:50,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:50,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2018-11-23 11:51:50,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:50,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2018-11-23 11:51:50,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 82 transitions. [2018-11-23 11:51:50,910 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 11:51:50,913 INFO L225 Difference]: With dead ends: 68 [2018-11-23 11:51:50,913 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 11:51:50,914 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 11:51:50,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 11:51:50,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2018-11-23 11:51:50,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:50,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 40 states. [2018-11-23 11:51:50,972 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 40 states. [2018-11-23 11:51:50,972 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 40 states. [2018-11-23 11:51:50,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,978 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-23 11:51:50,978 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-23 11:51:50,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:50,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:50,980 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 45 states. [2018-11-23 11:51:50,980 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 45 states. [2018-11-23 11:51:50,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,985 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-23 11:51:50,985 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-23 11:51:50,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:50,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:50,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:50,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:50,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 11:51:50,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-11-23 11:51:50,991 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 25 [2018-11-23 11:51:50,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:50,992 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-11-23 11:51:50,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:51:50,995 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-23 11:51:50,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 11:51:50,996 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:50,996 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:50,996 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:50,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:50,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1928668694, now seen corresponding path program 1 times [2018-11-23 11:51:50,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:50,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:50,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:50,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:50,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:51,157 INFO L256 TraceCheckUtils]: 0: Hoare triple {710#true} call ULTIMATE.init(); {710#true} is VALID [2018-11-23 11:51:51,157 INFO L273 TraceCheckUtils]: 1: Hoare triple {710#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {710#true} is VALID [2018-11-23 11:51:51,158 INFO L273 TraceCheckUtils]: 2: Hoare triple {710#true} assume true; {710#true} is VALID [2018-11-23 11:51:51,158 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {710#true} {710#true} #119#return; {710#true} is VALID [2018-11-23 11:51:51,158 INFO L256 TraceCheckUtils]: 4: Hoare triple {710#true} call #t~ret16 := main(); {710#true} is VALID [2018-11-23 11:51:51,163 INFO L273 TraceCheckUtils]: 5: Hoare triple {710#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {712#(= main_~a~0 0)} is VALID [2018-11-23 11:51:51,163 INFO L273 TraceCheckUtils]: 6: Hoare triple {712#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {712#(= main_~a~0 0)} is VALID [2018-11-23 11:51:51,164 INFO L273 TraceCheckUtils]: 7: Hoare triple {712#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {713#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:51,165 INFO L273 TraceCheckUtils]: 8: Hoare triple {713#(<= main_~a~0 1)} assume !(~a~0 < 100000); {711#false} is VALID [2018-11-23 11:51:51,165 INFO L273 TraceCheckUtils]: 9: Hoare triple {711#false} havoc ~i~0;~i~0 := 0; {711#false} is VALID [2018-11-23 11:51:51,166 INFO L273 TraceCheckUtils]: 10: Hoare triple {711#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {711#false} is VALID [2018-11-23 11:51:51,166 INFO L273 TraceCheckUtils]: 11: Hoare triple {711#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {711#false} is VALID [2018-11-23 11:51:51,166 INFO L273 TraceCheckUtils]: 12: Hoare triple {711#false} assume !(~i~0 < 100000); {711#false} is VALID [2018-11-23 11:51:51,166 INFO L273 TraceCheckUtils]: 13: Hoare triple {711#false} ~i~0 := 0; {711#false} is VALID [2018-11-23 11:51:51,167 INFO L273 TraceCheckUtils]: 14: Hoare triple {711#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {711#false} is VALID [2018-11-23 11:51:51,168 INFO L273 TraceCheckUtils]: 15: Hoare triple {711#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {711#false} is VALID [2018-11-23 11:51:51,168 INFO L273 TraceCheckUtils]: 16: Hoare triple {711#false} assume !(~i~0 < 100000); {711#false} is VALID [2018-11-23 11:51:51,169 INFO L273 TraceCheckUtils]: 17: Hoare triple {711#false} ~i~0 := 0; {711#false} is VALID [2018-11-23 11:51:51,169 INFO L273 TraceCheckUtils]: 18: Hoare triple {711#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {711#false} is VALID [2018-11-23 11:51:51,169 INFO L273 TraceCheckUtils]: 19: Hoare triple {711#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {711#false} is VALID [2018-11-23 11:51:51,170 INFO L273 TraceCheckUtils]: 20: Hoare triple {711#false} assume !(~i~0 < 100000); {711#false} is VALID [2018-11-23 11:51:51,170 INFO L273 TraceCheckUtils]: 21: Hoare triple {711#false} ~i~0 := 0; {711#false} is VALID [2018-11-23 11:51:51,170 INFO L273 TraceCheckUtils]: 22: Hoare triple {711#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {711#false} is VALID [2018-11-23 11:51:51,171 INFO L273 TraceCheckUtils]: 23: Hoare triple {711#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {711#false} is VALID [2018-11-23 11:51:51,171 INFO L273 TraceCheckUtils]: 24: Hoare triple {711#false} assume !(~i~0 < 100000); {711#false} is VALID [2018-11-23 11:51:51,171 INFO L273 TraceCheckUtils]: 25: Hoare triple {711#false} ~i~0 := 0; {711#false} is VALID [2018-11-23 11:51:51,172 INFO L273 TraceCheckUtils]: 26: Hoare triple {711#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {711#false} is VALID [2018-11-23 11:51:51,172 INFO L273 TraceCheckUtils]: 27: Hoare triple {711#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {711#false} is VALID [2018-11-23 11:51:51,172 INFO L273 TraceCheckUtils]: 28: Hoare triple {711#false} assume !(~i~0 < 100000); {711#false} is VALID [2018-11-23 11:51:51,172 INFO L273 TraceCheckUtils]: 29: Hoare triple {711#false} havoc ~x~0;~x~0 := 0; {711#false} is VALID [2018-11-23 11:51:51,173 INFO L273 TraceCheckUtils]: 30: Hoare triple {711#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {711#false} is VALID [2018-11-23 11:51:51,173 INFO L256 TraceCheckUtils]: 31: Hoare triple {711#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {711#false} is VALID [2018-11-23 11:51:51,173 INFO L273 TraceCheckUtils]: 32: Hoare triple {711#false} ~cond := #in~cond; {711#false} is VALID [2018-11-23 11:51:51,173 INFO L273 TraceCheckUtils]: 33: Hoare triple {711#false} assume 0 == ~cond; {711#false} is VALID [2018-11-23 11:51:51,174 INFO L273 TraceCheckUtils]: 34: Hoare triple {711#false} assume !false; {711#false} is VALID [2018-11-23 11:51:51,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 11:51:51,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:51,176 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 11:51:51,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:51,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:51,514 INFO L256 TraceCheckUtils]: 0: Hoare triple {710#true} call ULTIMATE.init(); {710#true} is VALID [2018-11-23 11:51:51,515 INFO L273 TraceCheckUtils]: 1: Hoare triple {710#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {710#true} is VALID [2018-11-23 11:51:51,515 INFO L273 TraceCheckUtils]: 2: Hoare triple {710#true} assume true; {710#true} is VALID [2018-11-23 11:51:51,515 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {710#true} {710#true} #119#return; {710#true} is VALID [2018-11-23 11:51:51,515 INFO L256 TraceCheckUtils]: 4: Hoare triple {710#true} call #t~ret16 := main(); {710#true} is VALID [2018-11-23 11:51:51,517 INFO L273 TraceCheckUtils]: 5: Hoare triple {710#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {732#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:51,517 INFO L273 TraceCheckUtils]: 6: Hoare triple {732#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {732#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:51,518 INFO L273 TraceCheckUtils]: 7: Hoare triple {732#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {713#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:51,519 INFO L273 TraceCheckUtils]: 8: Hoare triple {713#(<= main_~a~0 1)} assume !(~a~0 < 100000); {711#false} is VALID [2018-11-23 11:51:51,520 INFO L273 TraceCheckUtils]: 9: Hoare triple {711#false} havoc ~i~0;~i~0 := 0; {711#false} is VALID [2018-11-23 11:51:51,520 INFO L273 TraceCheckUtils]: 10: Hoare triple {711#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {711#false} is VALID [2018-11-23 11:51:51,520 INFO L273 TraceCheckUtils]: 11: Hoare triple {711#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {711#false} is VALID [2018-11-23 11:51:51,520 INFO L273 TraceCheckUtils]: 12: Hoare triple {711#false} assume !(~i~0 < 100000); {711#false} is VALID [2018-11-23 11:51:51,521 INFO L273 TraceCheckUtils]: 13: Hoare triple {711#false} ~i~0 := 0; {711#false} is VALID [2018-11-23 11:51:51,521 INFO L273 TraceCheckUtils]: 14: Hoare triple {711#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {711#false} is VALID [2018-11-23 11:51:51,521 INFO L273 TraceCheckUtils]: 15: Hoare triple {711#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {711#false} is VALID [2018-11-23 11:51:51,521 INFO L273 TraceCheckUtils]: 16: Hoare triple {711#false} assume !(~i~0 < 100000); {711#false} is VALID [2018-11-23 11:51:51,522 INFO L273 TraceCheckUtils]: 17: Hoare triple {711#false} ~i~0 := 0; {711#false} is VALID [2018-11-23 11:51:51,522 INFO L273 TraceCheckUtils]: 18: Hoare triple {711#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {711#false} is VALID [2018-11-23 11:51:51,523 INFO L273 TraceCheckUtils]: 19: Hoare triple {711#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {711#false} is VALID [2018-11-23 11:51:51,523 INFO L273 TraceCheckUtils]: 20: Hoare triple {711#false} assume !(~i~0 < 100000); {711#false} is VALID [2018-11-23 11:51:51,524 INFO L273 TraceCheckUtils]: 21: Hoare triple {711#false} ~i~0 := 0; {711#false} is VALID [2018-11-23 11:51:51,524 INFO L273 TraceCheckUtils]: 22: Hoare triple {711#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {711#false} is VALID [2018-11-23 11:51:51,524 INFO L273 TraceCheckUtils]: 23: Hoare triple {711#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {711#false} is VALID [2018-11-23 11:51:51,525 INFO L273 TraceCheckUtils]: 24: Hoare triple {711#false} assume !(~i~0 < 100000); {711#false} is VALID [2018-11-23 11:51:51,525 INFO L273 TraceCheckUtils]: 25: Hoare triple {711#false} ~i~0 := 0; {711#false} is VALID [2018-11-23 11:51:51,525 INFO L273 TraceCheckUtils]: 26: Hoare triple {711#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {711#false} is VALID [2018-11-23 11:51:51,525 INFO L273 TraceCheckUtils]: 27: Hoare triple {711#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {711#false} is VALID [2018-11-23 11:51:51,526 INFO L273 TraceCheckUtils]: 28: Hoare triple {711#false} assume !(~i~0 < 100000); {711#false} is VALID [2018-11-23 11:51:51,526 INFO L273 TraceCheckUtils]: 29: Hoare triple {711#false} havoc ~x~0;~x~0 := 0; {711#false} is VALID [2018-11-23 11:51:51,526 INFO L273 TraceCheckUtils]: 30: Hoare triple {711#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {711#false} is VALID [2018-11-23 11:51:51,527 INFO L256 TraceCheckUtils]: 31: Hoare triple {711#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {711#false} is VALID [2018-11-23 11:51:51,527 INFO L273 TraceCheckUtils]: 32: Hoare triple {711#false} ~cond := #in~cond; {711#false} is VALID [2018-11-23 11:51:51,527 INFO L273 TraceCheckUtils]: 33: Hoare triple {711#false} assume 0 == ~cond; {711#false} is VALID [2018-11-23 11:51:51,527 INFO L273 TraceCheckUtils]: 34: Hoare triple {711#false} assume !false; {711#false} is VALID [2018-11-23 11:51:51,530 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 11:51:51,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:51,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 11:51:51,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-23 11:51:51,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:51,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:51:51,694 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:51,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:51:51,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:51:51,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:51:51,696 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 5 states. [2018-11-23 11:51:51,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:51,931 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2018-11-23 11:51:51,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:51:51,931 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-23 11:51:51,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:51,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:51:51,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2018-11-23 11:51:51,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:51:51,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2018-11-23 11:51:51,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 76 transitions. [2018-11-23 11:51:52,064 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 11:51:52,066 INFO L225 Difference]: With dead ends: 74 [2018-11-23 11:51:52,066 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 11:51:52,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:51:52,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 11:51:52,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-11-23 11:51:52,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:52,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 42 states. [2018-11-23 11:51:52,104 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 42 states. [2018-11-23 11:51:52,104 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 42 states. [2018-11-23 11:51:52,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:52,107 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-23 11:51:52,107 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-23 11:51:52,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:52,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:52,108 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 43 states. [2018-11-23 11:51:52,109 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 43 states. [2018-11-23 11:51:52,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:52,111 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-23 11:51:52,112 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-23 11:51:52,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:52,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:52,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:52,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:52,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:51:52,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-11-23 11:51:52,115 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 35 [2018-11-23 11:51:52,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:52,116 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-11-23 11:51:52,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:51:52,116 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-23 11:51:52,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 11:51:52,117 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:52,117 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:52,118 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:52,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:52,118 INFO L82 PathProgramCache]: Analyzing trace with hash 359479048, now seen corresponding path program 2 times [2018-11-23 11:51:52,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:52,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:52,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:52,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:52,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:52,234 INFO L256 TraceCheckUtils]: 0: Hoare triple {1074#true} call ULTIMATE.init(); {1074#true} is VALID [2018-11-23 11:51:52,235 INFO L273 TraceCheckUtils]: 1: Hoare triple {1074#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1074#true} is VALID [2018-11-23 11:51:52,235 INFO L273 TraceCheckUtils]: 2: Hoare triple {1074#true} assume true; {1074#true} is VALID [2018-11-23 11:51:52,235 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1074#true} {1074#true} #119#return; {1074#true} is VALID [2018-11-23 11:51:52,236 INFO L256 TraceCheckUtils]: 4: Hoare triple {1074#true} call #t~ret16 := main(); {1074#true} is VALID [2018-11-23 11:51:52,236 INFO L273 TraceCheckUtils]: 5: Hoare triple {1074#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1076#(= main_~a~0 0)} is VALID [2018-11-23 11:51:52,240 INFO L273 TraceCheckUtils]: 6: Hoare triple {1076#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1076#(= main_~a~0 0)} is VALID [2018-11-23 11:51:52,254 INFO L273 TraceCheckUtils]: 7: Hoare triple {1076#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1077#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:52,256 INFO L273 TraceCheckUtils]: 8: Hoare triple {1077#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1077#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:52,258 INFO L273 TraceCheckUtils]: 9: Hoare triple {1077#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1078#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:52,259 INFO L273 TraceCheckUtils]: 10: Hoare triple {1078#(<= main_~a~0 2)} assume !(~a~0 < 100000); {1075#false} is VALID [2018-11-23 11:51:52,259 INFO L273 TraceCheckUtils]: 11: Hoare triple {1075#false} havoc ~i~0;~i~0 := 0; {1075#false} is VALID [2018-11-23 11:51:52,259 INFO L273 TraceCheckUtils]: 12: Hoare triple {1075#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1075#false} is VALID [2018-11-23 11:51:52,260 INFO L273 TraceCheckUtils]: 13: Hoare triple {1075#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1075#false} is VALID [2018-11-23 11:51:52,260 INFO L273 TraceCheckUtils]: 14: Hoare triple {1075#false} assume !(~i~0 < 100000); {1075#false} is VALID [2018-11-23 11:51:52,260 INFO L273 TraceCheckUtils]: 15: Hoare triple {1075#false} ~i~0 := 0; {1075#false} is VALID [2018-11-23 11:51:52,260 INFO L273 TraceCheckUtils]: 16: Hoare triple {1075#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1075#false} is VALID [2018-11-23 11:51:52,261 INFO L273 TraceCheckUtils]: 17: Hoare triple {1075#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1075#false} is VALID [2018-11-23 11:51:52,261 INFO L273 TraceCheckUtils]: 18: Hoare triple {1075#false} assume !(~i~0 < 100000); {1075#false} is VALID [2018-11-23 11:51:52,261 INFO L273 TraceCheckUtils]: 19: Hoare triple {1075#false} ~i~0 := 0; {1075#false} is VALID [2018-11-23 11:51:52,261 INFO L273 TraceCheckUtils]: 20: Hoare triple {1075#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1075#false} is VALID [2018-11-23 11:51:52,261 INFO L273 TraceCheckUtils]: 21: Hoare triple {1075#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1075#false} is VALID [2018-11-23 11:51:52,262 INFO L273 TraceCheckUtils]: 22: Hoare triple {1075#false} assume !(~i~0 < 100000); {1075#false} is VALID [2018-11-23 11:51:52,262 INFO L273 TraceCheckUtils]: 23: Hoare triple {1075#false} ~i~0 := 0; {1075#false} is VALID [2018-11-23 11:51:52,262 INFO L273 TraceCheckUtils]: 24: Hoare triple {1075#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {1075#false} is VALID [2018-11-23 11:51:52,262 INFO L273 TraceCheckUtils]: 25: Hoare triple {1075#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1075#false} is VALID [2018-11-23 11:51:52,262 INFO L273 TraceCheckUtils]: 26: Hoare triple {1075#false} assume !(~i~0 < 100000); {1075#false} is VALID [2018-11-23 11:51:52,263 INFO L273 TraceCheckUtils]: 27: Hoare triple {1075#false} ~i~0 := 0; {1075#false} is VALID [2018-11-23 11:51:52,263 INFO L273 TraceCheckUtils]: 28: Hoare triple {1075#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {1075#false} is VALID [2018-11-23 11:51:52,263 INFO L273 TraceCheckUtils]: 29: Hoare triple {1075#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {1075#false} is VALID [2018-11-23 11:51:52,263 INFO L273 TraceCheckUtils]: 30: Hoare triple {1075#false} assume !(~i~0 < 100000); {1075#false} is VALID [2018-11-23 11:51:52,263 INFO L273 TraceCheckUtils]: 31: Hoare triple {1075#false} havoc ~x~0;~x~0 := 0; {1075#false} is VALID [2018-11-23 11:51:52,264 INFO L273 TraceCheckUtils]: 32: Hoare triple {1075#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {1075#false} is VALID [2018-11-23 11:51:52,264 INFO L256 TraceCheckUtils]: 33: Hoare triple {1075#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {1075#false} is VALID [2018-11-23 11:51:52,264 INFO L273 TraceCheckUtils]: 34: Hoare triple {1075#false} ~cond := #in~cond; {1075#false} is VALID [2018-11-23 11:51:52,264 INFO L273 TraceCheckUtils]: 35: Hoare triple {1075#false} assume 0 == ~cond; {1075#false} is VALID [2018-11-23 11:51:52,265 INFO L273 TraceCheckUtils]: 36: Hoare triple {1075#false} assume !false; {1075#false} is VALID [2018-11-23 11:51:52,267 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 11:51:52,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:52,267 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 11:51:52,282 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:51:52,334 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:51:52,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:52,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:52,489 INFO L256 TraceCheckUtils]: 0: Hoare triple {1074#true} call ULTIMATE.init(); {1074#true} is VALID [2018-11-23 11:51:52,490 INFO L273 TraceCheckUtils]: 1: Hoare triple {1074#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1074#true} is VALID [2018-11-23 11:51:52,490 INFO L273 TraceCheckUtils]: 2: Hoare triple {1074#true} assume true; {1074#true} is VALID [2018-11-23 11:51:52,491 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1074#true} {1074#true} #119#return; {1074#true} is VALID [2018-11-23 11:51:52,491 INFO L256 TraceCheckUtils]: 4: Hoare triple {1074#true} call #t~ret16 := main(); {1074#true} is VALID [2018-11-23 11:51:52,493 INFO L273 TraceCheckUtils]: 5: Hoare triple {1074#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1097#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:52,493 INFO L273 TraceCheckUtils]: 6: Hoare triple {1097#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1097#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:52,501 INFO L273 TraceCheckUtils]: 7: Hoare triple {1097#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1077#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:52,502 INFO L273 TraceCheckUtils]: 8: Hoare triple {1077#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1077#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:52,502 INFO L273 TraceCheckUtils]: 9: Hoare triple {1077#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1078#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:52,503 INFO L273 TraceCheckUtils]: 10: Hoare triple {1078#(<= main_~a~0 2)} assume !(~a~0 < 100000); {1075#false} is VALID [2018-11-23 11:51:52,503 INFO L273 TraceCheckUtils]: 11: Hoare triple {1075#false} havoc ~i~0;~i~0 := 0; {1075#false} is VALID [2018-11-23 11:51:52,503 INFO L273 TraceCheckUtils]: 12: Hoare triple {1075#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1075#false} is VALID [2018-11-23 11:51:52,504 INFO L273 TraceCheckUtils]: 13: Hoare triple {1075#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1075#false} is VALID [2018-11-23 11:51:52,504 INFO L273 TraceCheckUtils]: 14: Hoare triple {1075#false} assume !(~i~0 < 100000); {1075#false} is VALID [2018-11-23 11:51:52,504 INFO L273 TraceCheckUtils]: 15: Hoare triple {1075#false} ~i~0 := 0; {1075#false} is VALID [2018-11-23 11:51:52,505 INFO L273 TraceCheckUtils]: 16: Hoare triple {1075#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1075#false} is VALID [2018-11-23 11:51:52,505 INFO L273 TraceCheckUtils]: 17: Hoare triple {1075#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1075#false} is VALID [2018-11-23 11:51:52,506 INFO L273 TraceCheckUtils]: 18: Hoare triple {1075#false} assume !(~i~0 < 100000); {1075#false} is VALID [2018-11-23 11:51:52,506 INFO L273 TraceCheckUtils]: 19: Hoare triple {1075#false} ~i~0 := 0; {1075#false} is VALID [2018-11-23 11:51:52,506 INFO L273 TraceCheckUtils]: 20: Hoare triple {1075#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1075#false} is VALID [2018-11-23 11:51:52,507 INFO L273 TraceCheckUtils]: 21: Hoare triple {1075#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1075#false} is VALID [2018-11-23 11:51:52,507 INFO L273 TraceCheckUtils]: 22: Hoare triple {1075#false} assume !(~i~0 < 100000); {1075#false} is VALID [2018-11-23 11:51:52,507 INFO L273 TraceCheckUtils]: 23: Hoare triple {1075#false} ~i~0 := 0; {1075#false} is VALID [2018-11-23 11:51:52,507 INFO L273 TraceCheckUtils]: 24: Hoare triple {1075#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {1075#false} is VALID [2018-11-23 11:51:52,508 INFO L273 TraceCheckUtils]: 25: Hoare triple {1075#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1075#false} is VALID [2018-11-23 11:51:52,509 INFO L273 TraceCheckUtils]: 26: Hoare triple {1075#false} assume !(~i~0 < 100000); {1075#false} is VALID [2018-11-23 11:51:52,509 INFO L273 TraceCheckUtils]: 27: Hoare triple {1075#false} ~i~0 := 0; {1075#false} is VALID [2018-11-23 11:51:52,509 INFO L273 TraceCheckUtils]: 28: Hoare triple {1075#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {1075#false} is VALID [2018-11-23 11:51:52,510 INFO L273 TraceCheckUtils]: 29: Hoare triple {1075#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {1075#false} is VALID [2018-11-23 11:51:52,510 INFO L273 TraceCheckUtils]: 30: Hoare triple {1075#false} assume !(~i~0 < 100000); {1075#false} is VALID [2018-11-23 11:51:52,510 INFO L273 TraceCheckUtils]: 31: Hoare triple {1075#false} havoc ~x~0;~x~0 := 0; {1075#false} is VALID [2018-11-23 11:51:52,511 INFO L273 TraceCheckUtils]: 32: Hoare triple {1075#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {1075#false} is VALID [2018-11-23 11:51:52,511 INFO L256 TraceCheckUtils]: 33: Hoare triple {1075#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {1075#false} is VALID [2018-11-23 11:51:52,511 INFO L273 TraceCheckUtils]: 34: Hoare triple {1075#false} ~cond := #in~cond; {1075#false} is VALID [2018-11-23 11:51:52,511 INFO L273 TraceCheckUtils]: 35: Hoare triple {1075#false} assume 0 == ~cond; {1075#false} is VALID [2018-11-23 11:51:52,512 INFO L273 TraceCheckUtils]: 36: Hoare triple {1075#false} assume !false; {1075#false} is VALID [2018-11-23 11:51:52,514 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 11:51:52,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:52,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 11:51:52,535 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-11-23 11:51:52,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:52,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:51:52,588 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 11:51:52,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:51:52,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:51:52,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:51:52,589 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 6 states. [2018-11-23 11:51:52,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:52,938 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2018-11-23 11:51:52,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:51:52,939 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-11-23 11:51:52,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:52,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:51:52,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2018-11-23 11:51:52,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:51:52,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2018-11-23 11:51:52,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 78 transitions. [2018-11-23 11:51:53,084 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 11:51:53,087 INFO L225 Difference]: With dead ends: 76 [2018-11-23 11:51:53,087 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 11:51:53,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 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 11:51:53,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 11:51:53,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-23 11:51:53,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:53,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 44 states. [2018-11-23 11:51:53,108 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 44 states. [2018-11-23 11:51:53,108 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 44 states. [2018-11-23 11:51:53,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:53,111 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-23 11:51:53,111 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-23 11:51:53,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:53,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:53,112 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 45 states. [2018-11-23 11:51:53,112 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 45 states. [2018-11-23 11:51:53,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:53,115 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-23 11:51:53,115 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-23 11:51:53,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:53,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:53,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:53,116 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:53,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 11:51:53,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-11-23 11:51:53,119 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 37 [2018-11-23 11:51:53,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:53,119 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-11-23 11:51:53,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:51:53,119 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-11-23 11:51:53,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 11:51:53,120 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:53,121 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:53,121 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:53,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:53,121 INFO L82 PathProgramCache]: Analyzing trace with hash 246203558, now seen corresponding path program 3 times [2018-11-23 11:51:53,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:53,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:53,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:53,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:53,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:53,412 INFO L256 TraceCheckUtils]: 0: Hoare triple {1455#true} call ULTIMATE.init(); {1455#true} is VALID [2018-11-23 11:51:53,413 INFO L273 TraceCheckUtils]: 1: Hoare triple {1455#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1455#true} is VALID [2018-11-23 11:51:53,413 INFO L273 TraceCheckUtils]: 2: Hoare triple {1455#true} assume true; {1455#true} is VALID [2018-11-23 11:51:53,413 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1455#true} {1455#true} #119#return; {1455#true} is VALID [2018-11-23 11:51:53,414 INFO L256 TraceCheckUtils]: 4: Hoare triple {1455#true} call #t~ret16 := main(); {1455#true} is VALID [2018-11-23 11:51:53,414 INFO L273 TraceCheckUtils]: 5: Hoare triple {1455#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1457#(= main_~a~0 0)} is VALID [2018-11-23 11:51:53,415 INFO L273 TraceCheckUtils]: 6: Hoare triple {1457#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1457#(= main_~a~0 0)} is VALID [2018-11-23 11:51:53,416 INFO L273 TraceCheckUtils]: 7: Hoare triple {1457#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1458#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:53,416 INFO L273 TraceCheckUtils]: 8: Hoare triple {1458#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1458#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:53,417 INFO L273 TraceCheckUtils]: 9: Hoare triple {1458#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1459#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:53,418 INFO L273 TraceCheckUtils]: 10: Hoare triple {1459#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1459#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:53,418 INFO L273 TraceCheckUtils]: 11: Hoare triple {1459#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1460#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:53,419 INFO L273 TraceCheckUtils]: 12: Hoare triple {1460#(<= main_~a~0 3)} assume !(~a~0 < 100000); {1456#false} is VALID [2018-11-23 11:51:53,419 INFO L273 TraceCheckUtils]: 13: Hoare triple {1456#false} havoc ~i~0;~i~0 := 0; {1456#false} is VALID [2018-11-23 11:51:53,420 INFO L273 TraceCheckUtils]: 14: Hoare triple {1456#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1456#false} is VALID [2018-11-23 11:51:53,420 INFO L273 TraceCheckUtils]: 15: Hoare triple {1456#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1456#false} is VALID [2018-11-23 11:51:53,420 INFO L273 TraceCheckUtils]: 16: Hoare triple {1456#false} assume !(~i~0 < 100000); {1456#false} is VALID [2018-11-23 11:51:53,421 INFO L273 TraceCheckUtils]: 17: Hoare triple {1456#false} ~i~0 := 0; {1456#false} is VALID [2018-11-23 11:51:53,421 INFO L273 TraceCheckUtils]: 18: Hoare triple {1456#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1456#false} is VALID [2018-11-23 11:51:53,422 INFO L273 TraceCheckUtils]: 19: Hoare triple {1456#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1456#false} is VALID [2018-11-23 11:51:53,422 INFO L273 TraceCheckUtils]: 20: Hoare triple {1456#false} assume !(~i~0 < 100000); {1456#false} is VALID [2018-11-23 11:51:53,423 INFO L273 TraceCheckUtils]: 21: Hoare triple {1456#false} ~i~0 := 0; {1456#false} is VALID [2018-11-23 11:51:53,423 INFO L273 TraceCheckUtils]: 22: Hoare triple {1456#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1456#false} is VALID [2018-11-23 11:51:53,423 INFO L273 TraceCheckUtils]: 23: Hoare triple {1456#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1456#false} is VALID [2018-11-23 11:51:53,423 INFO L273 TraceCheckUtils]: 24: Hoare triple {1456#false} assume !(~i~0 < 100000); {1456#false} is VALID [2018-11-23 11:51:53,424 INFO L273 TraceCheckUtils]: 25: Hoare triple {1456#false} ~i~0 := 0; {1456#false} is VALID [2018-11-23 11:51:53,424 INFO L273 TraceCheckUtils]: 26: Hoare triple {1456#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {1456#false} is VALID [2018-11-23 11:51:53,424 INFO L273 TraceCheckUtils]: 27: Hoare triple {1456#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1456#false} is VALID [2018-11-23 11:51:53,424 INFO L273 TraceCheckUtils]: 28: Hoare triple {1456#false} assume !(~i~0 < 100000); {1456#false} is VALID [2018-11-23 11:51:53,424 INFO L273 TraceCheckUtils]: 29: Hoare triple {1456#false} ~i~0 := 0; {1456#false} is VALID [2018-11-23 11:51:53,425 INFO L273 TraceCheckUtils]: 30: Hoare triple {1456#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {1456#false} is VALID [2018-11-23 11:51:53,425 INFO L273 TraceCheckUtils]: 31: Hoare triple {1456#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {1456#false} is VALID [2018-11-23 11:51:53,425 INFO L273 TraceCheckUtils]: 32: Hoare triple {1456#false} assume !(~i~0 < 100000); {1456#false} is VALID [2018-11-23 11:51:53,425 INFO L273 TraceCheckUtils]: 33: Hoare triple {1456#false} havoc ~x~0;~x~0 := 0; {1456#false} is VALID [2018-11-23 11:51:53,425 INFO L273 TraceCheckUtils]: 34: Hoare triple {1456#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {1456#false} is VALID [2018-11-23 11:51:53,426 INFO L256 TraceCheckUtils]: 35: Hoare triple {1456#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {1456#false} is VALID [2018-11-23 11:51:53,426 INFO L273 TraceCheckUtils]: 36: Hoare triple {1456#false} ~cond := #in~cond; {1456#false} is VALID [2018-11-23 11:51:53,426 INFO L273 TraceCheckUtils]: 37: Hoare triple {1456#false} assume 0 == ~cond; {1456#false} is VALID [2018-11-23 11:51:53,426 INFO L273 TraceCheckUtils]: 38: Hoare triple {1456#false} assume !false; {1456#false} is VALID [2018-11-23 11:51:53,429 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 11:51:53,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:53,429 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 11:51:53,448 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:51:53,494 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 11:51:53,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:53,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:53,604 INFO L256 TraceCheckUtils]: 0: Hoare triple {1455#true} call ULTIMATE.init(); {1455#true} is VALID [2018-11-23 11:51:53,605 INFO L273 TraceCheckUtils]: 1: Hoare triple {1455#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1455#true} is VALID [2018-11-23 11:51:53,605 INFO L273 TraceCheckUtils]: 2: Hoare triple {1455#true} assume true; {1455#true} is VALID [2018-11-23 11:51:53,606 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1455#true} {1455#true} #119#return; {1455#true} is VALID [2018-11-23 11:51:53,606 INFO L256 TraceCheckUtils]: 4: Hoare triple {1455#true} call #t~ret16 := main(); {1455#true} is VALID [2018-11-23 11:51:53,606 INFO L273 TraceCheckUtils]: 5: Hoare triple {1455#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1455#true} is VALID [2018-11-23 11:51:53,607 INFO L273 TraceCheckUtils]: 6: Hoare triple {1455#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1455#true} is VALID [2018-11-23 11:51:53,607 INFO L273 TraceCheckUtils]: 7: Hoare triple {1455#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1455#true} is VALID [2018-11-23 11:51:53,607 INFO L273 TraceCheckUtils]: 8: Hoare triple {1455#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1455#true} is VALID [2018-11-23 11:51:53,608 INFO L273 TraceCheckUtils]: 9: Hoare triple {1455#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1455#true} is VALID [2018-11-23 11:51:53,608 INFO L273 TraceCheckUtils]: 10: Hoare triple {1455#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1455#true} is VALID [2018-11-23 11:51:53,608 INFO L273 TraceCheckUtils]: 11: Hoare triple {1455#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1455#true} is VALID [2018-11-23 11:51:53,608 INFO L273 TraceCheckUtils]: 12: Hoare triple {1455#true} assume !(~a~0 < 100000); {1455#true} is VALID [2018-11-23 11:51:53,609 INFO L273 TraceCheckUtils]: 13: Hoare triple {1455#true} havoc ~i~0;~i~0 := 0; {1455#true} is VALID [2018-11-23 11:51:53,609 INFO L273 TraceCheckUtils]: 14: Hoare triple {1455#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1455#true} is VALID [2018-11-23 11:51:53,609 INFO L273 TraceCheckUtils]: 15: Hoare triple {1455#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1455#true} is VALID [2018-11-23 11:51:53,609 INFO L273 TraceCheckUtils]: 16: Hoare triple {1455#true} assume !(~i~0 < 100000); {1455#true} is VALID [2018-11-23 11:51:53,613 INFO L273 TraceCheckUtils]: 17: Hoare triple {1455#true} ~i~0 := 0; {1515#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:53,615 INFO L273 TraceCheckUtils]: 18: Hoare triple {1515#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1515#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:53,617 INFO L273 TraceCheckUtils]: 19: Hoare triple {1515#(<= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1522#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:53,618 INFO L273 TraceCheckUtils]: 20: Hoare triple {1522#(<= main_~i~0 1)} assume !(~i~0 < 100000); {1456#false} is VALID [2018-11-23 11:51:53,618 INFO L273 TraceCheckUtils]: 21: Hoare triple {1456#false} ~i~0 := 0; {1456#false} is VALID [2018-11-23 11:51:53,618 INFO L273 TraceCheckUtils]: 22: Hoare triple {1456#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1456#false} is VALID [2018-11-23 11:51:53,619 INFO L273 TraceCheckUtils]: 23: Hoare triple {1456#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1456#false} is VALID [2018-11-23 11:51:53,619 INFO L273 TraceCheckUtils]: 24: Hoare triple {1456#false} assume !(~i~0 < 100000); {1456#false} is VALID [2018-11-23 11:51:53,619 INFO L273 TraceCheckUtils]: 25: Hoare triple {1456#false} ~i~0 := 0; {1456#false} is VALID [2018-11-23 11:51:53,620 INFO L273 TraceCheckUtils]: 26: Hoare triple {1456#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {1456#false} is VALID [2018-11-23 11:51:53,620 INFO L273 TraceCheckUtils]: 27: Hoare triple {1456#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1456#false} is VALID [2018-11-23 11:51:53,620 INFO L273 TraceCheckUtils]: 28: Hoare triple {1456#false} assume !(~i~0 < 100000); {1456#false} is VALID [2018-11-23 11:51:53,621 INFO L273 TraceCheckUtils]: 29: Hoare triple {1456#false} ~i~0 := 0; {1456#false} is VALID [2018-11-23 11:51:53,621 INFO L273 TraceCheckUtils]: 30: Hoare triple {1456#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {1456#false} is VALID [2018-11-23 11:51:53,621 INFO L273 TraceCheckUtils]: 31: Hoare triple {1456#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {1456#false} is VALID [2018-11-23 11:51:53,621 INFO L273 TraceCheckUtils]: 32: Hoare triple {1456#false} assume !(~i~0 < 100000); {1456#false} is VALID [2018-11-23 11:51:53,621 INFO L273 TraceCheckUtils]: 33: Hoare triple {1456#false} havoc ~x~0;~x~0 := 0; {1456#false} is VALID [2018-11-23 11:51:53,622 INFO L273 TraceCheckUtils]: 34: Hoare triple {1456#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {1456#false} is VALID [2018-11-23 11:51:53,622 INFO L256 TraceCheckUtils]: 35: Hoare triple {1456#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {1456#false} is VALID [2018-11-23 11:51:53,622 INFO L273 TraceCheckUtils]: 36: Hoare triple {1456#false} ~cond := #in~cond; {1456#false} is VALID [2018-11-23 11:51:53,622 INFO L273 TraceCheckUtils]: 37: Hoare triple {1456#false} assume 0 == ~cond; {1456#false} is VALID [2018-11-23 11:51:53,622 INFO L273 TraceCheckUtils]: 38: Hoare triple {1456#false} assume !false; {1456#false} is VALID [2018-11-23 11:51:53,624 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 11:51:53,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:53,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-23 11:51:53,646 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-11-23 11:51:53,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:53,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:51:53,715 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:53,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:51:53,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:51:53,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:51:53,716 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 8 states. [2018-11-23 11:51:54,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:54,194 INFO L93 Difference]: Finished difference Result 93 states and 110 transitions. [2018-11-23 11:51:54,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:51:54,195 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-11-23 11:51:54,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:54,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:51:54,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2018-11-23 11:51:54,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:51:54,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2018-11-23 11:51:54,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 105 transitions. [2018-11-23 11:51:54,570 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:54,573 INFO L225 Difference]: With dead ends: 93 [2018-11-23 11:51:54,573 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 11:51:54,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:51:54,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 11:51:54,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2018-11-23 11:51:54,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:54,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 56 states. [2018-11-23 11:51:54,611 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 56 states. [2018-11-23 11:51:54,611 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 56 states. [2018-11-23 11:51:54,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:54,613 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-11-23 11:51:54,613 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-11-23 11:51:54,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:54,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:54,614 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 62 states. [2018-11-23 11:51:54,614 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 62 states. [2018-11-23 11:51:54,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:54,617 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-11-23 11:51:54,617 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-11-23 11:51:54,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:54,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:54,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:54,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:54,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 11:51:54,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2018-11-23 11:51:54,620 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 39 [2018-11-23 11:51:54,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:54,620 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2018-11-23 11:51:54,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:51:54,621 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2018-11-23 11:51:54,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 11:51:54,622 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:54,622 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:54,622 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:54,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:54,623 INFO L82 PathProgramCache]: Analyzing trace with hash 575548698, now seen corresponding path program 4 times [2018-11-23 11:51:54,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:54,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:54,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:54,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:54,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:54,797 INFO L256 TraceCheckUtils]: 0: Hoare triple {1919#true} call ULTIMATE.init(); {1919#true} is VALID [2018-11-23 11:51:54,797 INFO L273 TraceCheckUtils]: 1: Hoare triple {1919#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1919#true} is VALID [2018-11-23 11:51:54,798 INFO L273 TraceCheckUtils]: 2: Hoare triple {1919#true} assume true; {1919#true} is VALID [2018-11-23 11:51:54,798 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1919#true} {1919#true} #119#return; {1919#true} is VALID [2018-11-23 11:51:54,799 INFO L256 TraceCheckUtils]: 4: Hoare triple {1919#true} call #t~ret16 := main(); {1919#true} is VALID [2018-11-23 11:51:54,802 INFO L273 TraceCheckUtils]: 5: Hoare triple {1919#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1921#(= main_~a~0 0)} is VALID [2018-11-23 11:51:54,803 INFO L273 TraceCheckUtils]: 6: Hoare triple {1921#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1921#(= main_~a~0 0)} is VALID [2018-11-23 11:51:54,803 INFO L273 TraceCheckUtils]: 7: Hoare triple {1921#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1922#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:54,804 INFO L273 TraceCheckUtils]: 8: Hoare triple {1922#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1922#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:54,804 INFO L273 TraceCheckUtils]: 9: Hoare triple {1922#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1923#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:54,805 INFO L273 TraceCheckUtils]: 10: Hoare triple {1923#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1923#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:54,805 INFO L273 TraceCheckUtils]: 11: Hoare triple {1923#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1924#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:54,806 INFO L273 TraceCheckUtils]: 12: Hoare triple {1924#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1924#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:54,807 INFO L273 TraceCheckUtils]: 13: Hoare triple {1924#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1925#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:54,808 INFO L273 TraceCheckUtils]: 14: Hoare triple {1925#(<= main_~a~0 4)} assume !(~a~0 < 100000); {1920#false} is VALID [2018-11-23 11:51:54,808 INFO L273 TraceCheckUtils]: 15: Hoare triple {1920#false} havoc ~i~0;~i~0 := 0; {1920#false} is VALID [2018-11-23 11:51:54,809 INFO L273 TraceCheckUtils]: 16: Hoare triple {1920#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1920#false} is VALID [2018-11-23 11:51:54,809 INFO L273 TraceCheckUtils]: 17: Hoare triple {1920#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1920#false} is VALID [2018-11-23 11:51:54,809 INFO L273 TraceCheckUtils]: 18: Hoare triple {1920#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1920#false} is VALID [2018-11-23 11:51:54,810 INFO L273 TraceCheckUtils]: 19: Hoare triple {1920#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1920#false} is VALID [2018-11-23 11:51:54,810 INFO L273 TraceCheckUtils]: 20: Hoare triple {1920#false} assume !(~i~0 < 100000); {1920#false} is VALID [2018-11-23 11:51:54,811 INFO L273 TraceCheckUtils]: 21: Hoare triple {1920#false} ~i~0 := 0; {1920#false} is VALID [2018-11-23 11:51:54,811 INFO L273 TraceCheckUtils]: 22: Hoare triple {1920#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1920#false} is VALID [2018-11-23 11:51:54,812 INFO L273 TraceCheckUtils]: 23: Hoare triple {1920#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1920#false} is VALID [2018-11-23 11:51:54,812 INFO L273 TraceCheckUtils]: 24: Hoare triple {1920#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1920#false} is VALID [2018-11-23 11:51:54,812 INFO L273 TraceCheckUtils]: 25: Hoare triple {1920#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1920#false} is VALID [2018-11-23 11:51:54,812 INFO L273 TraceCheckUtils]: 26: Hoare triple {1920#false} assume !(~i~0 < 100000); {1920#false} is VALID [2018-11-23 11:51:54,812 INFO L273 TraceCheckUtils]: 27: Hoare triple {1920#false} ~i~0 := 0; {1920#false} is VALID [2018-11-23 11:51:54,812 INFO L273 TraceCheckUtils]: 28: Hoare triple {1920#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1920#false} is VALID [2018-11-23 11:51:54,813 INFO L273 TraceCheckUtils]: 29: Hoare triple {1920#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1920#false} is VALID [2018-11-23 11:51:54,813 INFO L273 TraceCheckUtils]: 30: Hoare triple {1920#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1920#false} is VALID [2018-11-23 11:51:54,813 INFO L273 TraceCheckUtils]: 31: Hoare triple {1920#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1920#false} is VALID [2018-11-23 11:51:54,813 INFO L273 TraceCheckUtils]: 32: Hoare triple {1920#false} assume !(~i~0 < 100000); {1920#false} is VALID [2018-11-23 11:51:54,813 INFO L273 TraceCheckUtils]: 33: Hoare triple {1920#false} ~i~0 := 0; {1920#false} is VALID [2018-11-23 11:51:54,814 INFO L273 TraceCheckUtils]: 34: Hoare triple {1920#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {1920#false} is VALID [2018-11-23 11:51:54,814 INFO L273 TraceCheckUtils]: 35: Hoare triple {1920#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1920#false} is VALID [2018-11-23 11:51:54,814 INFO L273 TraceCheckUtils]: 36: Hoare triple {1920#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {1920#false} is VALID [2018-11-23 11:51:54,814 INFO L273 TraceCheckUtils]: 37: Hoare triple {1920#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1920#false} is VALID [2018-11-23 11:51:54,815 INFO L273 TraceCheckUtils]: 38: Hoare triple {1920#false} assume !(~i~0 < 100000); {1920#false} is VALID [2018-11-23 11:51:54,815 INFO L273 TraceCheckUtils]: 39: Hoare triple {1920#false} ~i~0 := 0; {1920#false} is VALID [2018-11-23 11:51:54,815 INFO L273 TraceCheckUtils]: 40: Hoare triple {1920#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {1920#false} is VALID [2018-11-23 11:51:54,815 INFO L273 TraceCheckUtils]: 41: Hoare triple {1920#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {1920#false} is VALID [2018-11-23 11:51:54,816 INFO L273 TraceCheckUtils]: 42: Hoare triple {1920#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {1920#false} is VALID [2018-11-23 11:51:54,816 INFO L273 TraceCheckUtils]: 43: Hoare triple {1920#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {1920#false} is VALID [2018-11-23 11:51:54,816 INFO L273 TraceCheckUtils]: 44: Hoare triple {1920#false} assume !(~i~0 < 100000); {1920#false} is VALID [2018-11-23 11:51:54,816 INFO L273 TraceCheckUtils]: 45: Hoare triple {1920#false} havoc ~x~0;~x~0 := 0; {1920#false} is VALID [2018-11-23 11:51:54,817 INFO L273 TraceCheckUtils]: 46: Hoare triple {1920#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {1920#false} is VALID [2018-11-23 11:51:54,817 INFO L256 TraceCheckUtils]: 47: Hoare triple {1920#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {1920#false} is VALID [2018-11-23 11:51:54,817 INFO L273 TraceCheckUtils]: 48: Hoare triple {1920#false} ~cond := #in~cond; {1920#false} is VALID [2018-11-23 11:51:54,817 INFO L273 TraceCheckUtils]: 49: Hoare triple {1920#false} assume 0 == ~cond; {1920#false} is VALID [2018-11-23 11:51:54,818 INFO L273 TraceCheckUtils]: 50: Hoare triple {1920#false} assume !false; {1920#false} is VALID [2018-11-23 11:51:54,821 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 11:51:54,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:54,821 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 11:51:54,830 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:51:54,880 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:51:54,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:54,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:55,040 INFO L256 TraceCheckUtils]: 0: Hoare triple {1919#true} call ULTIMATE.init(); {1919#true} is VALID [2018-11-23 11:51:55,041 INFO L273 TraceCheckUtils]: 1: Hoare triple {1919#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1919#true} is VALID [2018-11-23 11:51:55,041 INFO L273 TraceCheckUtils]: 2: Hoare triple {1919#true} assume true; {1919#true} is VALID [2018-11-23 11:51:55,041 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1919#true} {1919#true} #119#return; {1919#true} is VALID [2018-11-23 11:51:55,042 INFO L256 TraceCheckUtils]: 4: Hoare triple {1919#true} call #t~ret16 := main(); {1919#true} is VALID [2018-11-23 11:51:55,043 INFO L273 TraceCheckUtils]: 5: Hoare triple {1919#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1944#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:55,044 INFO L273 TraceCheckUtils]: 6: Hoare triple {1944#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1944#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:55,048 INFO L273 TraceCheckUtils]: 7: Hoare triple {1944#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1922#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:55,048 INFO L273 TraceCheckUtils]: 8: Hoare triple {1922#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1922#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:55,049 INFO L273 TraceCheckUtils]: 9: Hoare triple {1922#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1923#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:55,049 INFO L273 TraceCheckUtils]: 10: Hoare triple {1923#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1923#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:55,057 INFO L273 TraceCheckUtils]: 11: Hoare triple {1923#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1924#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:55,059 INFO L273 TraceCheckUtils]: 12: Hoare triple {1924#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1924#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:55,060 INFO L273 TraceCheckUtils]: 13: Hoare triple {1924#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1925#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:55,061 INFO L273 TraceCheckUtils]: 14: Hoare triple {1925#(<= main_~a~0 4)} assume !(~a~0 < 100000); {1920#false} is VALID [2018-11-23 11:51:55,061 INFO L273 TraceCheckUtils]: 15: Hoare triple {1920#false} havoc ~i~0;~i~0 := 0; {1920#false} is VALID [2018-11-23 11:51:55,061 INFO L273 TraceCheckUtils]: 16: Hoare triple {1920#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1920#false} is VALID [2018-11-23 11:51:55,061 INFO L273 TraceCheckUtils]: 17: Hoare triple {1920#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1920#false} is VALID [2018-11-23 11:51:55,061 INFO L273 TraceCheckUtils]: 18: Hoare triple {1920#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1920#false} is VALID [2018-11-23 11:51:55,062 INFO L273 TraceCheckUtils]: 19: Hoare triple {1920#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1920#false} is VALID [2018-11-23 11:51:55,062 INFO L273 TraceCheckUtils]: 20: Hoare triple {1920#false} assume !(~i~0 < 100000); {1920#false} is VALID [2018-11-23 11:51:55,062 INFO L273 TraceCheckUtils]: 21: Hoare triple {1920#false} ~i~0 := 0; {1920#false} is VALID [2018-11-23 11:51:55,062 INFO L273 TraceCheckUtils]: 22: Hoare triple {1920#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1920#false} is VALID [2018-11-23 11:51:55,062 INFO L273 TraceCheckUtils]: 23: Hoare triple {1920#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1920#false} is VALID [2018-11-23 11:51:55,062 INFO L273 TraceCheckUtils]: 24: Hoare triple {1920#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1920#false} is VALID [2018-11-23 11:51:55,063 INFO L273 TraceCheckUtils]: 25: Hoare triple {1920#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1920#false} is VALID [2018-11-23 11:51:55,063 INFO L273 TraceCheckUtils]: 26: Hoare triple {1920#false} assume !(~i~0 < 100000); {1920#false} is VALID [2018-11-23 11:51:55,063 INFO L273 TraceCheckUtils]: 27: Hoare triple {1920#false} ~i~0 := 0; {1920#false} is VALID [2018-11-23 11:51:55,063 INFO L273 TraceCheckUtils]: 28: Hoare triple {1920#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1920#false} is VALID [2018-11-23 11:51:55,063 INFO L273 TraceCheckUtils]: 29: Hoare triple {1920#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1920#false} is VALID [2018-11-23 11:51:55,064 INFO L273 TraceCheckUtils]: 30: Hoare triple {1920#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1920#false} is VALID [2018-11-23 11:51:55,064 INFO L273 TraceCheckUtils]: 31: Hoare triple {1920#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1920#false} is VALID [2018-11-23 11:51:55,064 INFO L273 TraceCheckUtils]: 32: Hoare triple {1920#false} assume !(~i~0 < 100000); {1920#false} is VALID [2018-11-23 11:51:55,064 INFO L273 TraceCheckUtils]: 33: Hoare triple {1920#false} ~i~0 := 0; {1920#false} is VALID [2018-11-23 11:51:55,064 INFO L273 TraceCheckUtils]: 34: Hoare triple {1920#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {1920#false} is VALID [2018-11-23 11:51:55,064 INFO L273 TraceCheckUtils]: 35: Hoare triple {1920#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1920#false} is VALID [2018-11-23 11:51:55,065 INFO L273 TraceCheckUtils]: 36: Hoare triple {1920#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {1920#false} is VALID [2018-11-23 11:51:55,065 INFO L273 TraceCheckUtils]: 37: Hoare triple {1920#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1920#false} is VALID [2018-11-23 11:51:55,065 INFO L273 TraceCheckUtils]: 38: Hoare triple {1920#false} assume !(~i~0 < 100000); {1920#false} is VALID [2018-11-23 11:51:55,066 INFO L273 TraceCheckUtils]: 39: Hoare triple {1920#false} ~i~0 := 0; {1920#false} is VALID [2018-11-23 11:51:55,066 INFO L273 TraceCheckUtils]: 40: Hoare triple {1920#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {1920#false} is VALID [2018-11-23 11:51:55,066 INFO L273 TraceCheckUtils]: 41: Hoare triple {1920#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {1920#false} is VALID [2018-11-23 11:51:55,066 INFO L273 TraceCheckUtils]: 42: Hoare triple {1920#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {1920#false} is VALID [2018-11-23 11:51:55,067 INFO L273 TraceCheckUtils]: 43: Hoare triple {1920#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {1920#false} is VALID [2018-11-23 11:51:55,067 INFO L273 TraceCheckUtils]: 44: Hoare triple {1920#false} assume !(~i~0 < 100000); {1920#false} is VALID [2018-11-23 11:51:55,067 INFO L273 TraceCheckUtils]: 45: Hoare triple {1920#false} havoc ~x~0;~x~0 := 0; {1920#false} is VALID [2018-11-23 11:51:55,067 INFO L273 TraceCheckUtils]: 46: Hoare triple {1920#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {1920#false} is VALID [2018-11-23 11:51:55,068 INFO L256 TraceCheckUtils]: 47: Hoare triple {1920#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {1920#false} is VALID [2018-11-23 11:51:55,068 INFO L273 TraceCheckUtils]: 48: Hoare triple {1920#false} ~cond := #in~cond; {1920#false} is VALID [2018-11-23 11:51:55,068 INFO L273 TraceCheckUtils]: 49: Hoare triple {1920#false} assume 0 == ~cond; {1920#false} is VALID [2018-11-23 11:51:55,068 INFO L273 TraceCheckUtils]: 50: Hoare triple {1920#false} assume !false; {1920#false} is VALID [2018-11-23 11:51:55,072 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 11:51:55,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:55,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 11:51:55,094 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-11-23 11:51:55,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:55,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:51:55,191 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 11:51:55,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:51:55,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:51:55,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:51:55,192 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 8 states. [2018-11-23 11:51:55,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:55,643 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2018-11-23 11:51:55,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:51:55,644 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-11-23 11:51:55,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:55,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:51:55,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2018-11-23 11:51:55,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:51:55,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2018-11-23 11:51:55,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 82 transitions. [2018-11-23 11:51:55,824 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 11:51:55,826 INFO L225 Difference]: With dead ends: 100 [2018-11-23 11:51:55,826 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 11:51:55,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 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 11:51:55,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 11:51:55,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-11-23 11:51:55,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:55,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 58 states. [2018-11-23 11:51:55,861 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 58 states. [2018-11-23 11:51:55,861 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 58 states. [2018-11-23 11:51:55,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:55,864 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2018-11-23 11:51:55,864 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2018-11-23 11:51:55,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:55,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:55,865 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 59 states. [2018-11-23 11:51:55,865 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 59 states. [2018-11-23 11:51:55,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:55,868 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2018-11-23 11:51:55,868 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2018-11-23 11:51:55,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:55,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:55,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:55,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:55,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 11:51:55,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-11-23 11:51:55,871 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 51 [2018-11-23 11:51:55,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:55,872 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-11-23 11:51:55,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:51:55,872 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-11-23 11:51:55,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 11:51:55,873 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:55,873 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:55,873 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:55,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:55,874 INFO L82 PathProgramCache]: Analyzing trace with hash -801206728, now seen corresponding path program 5 times [2018-11-23 11:51:55,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:55,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:55,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:55,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:55,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:56,045 INFO L256 TraceCheckUtils]: 0: Hoare triple {2429#true} call ULTIMATE.init(); {2429#true} is VALID [2018-11-23 11:51:56,045 INFO L273 TraceCheckUtils]: 1: Hoare triple {2429#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2429#true} is VALID [2018-11-23 11:51:56,046 INFO L273 TraceCheckUtils]: 2: Hoare triple {2429#true} assume true; {2429#true} is VALID [2018-11-23 11:51:56,046 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2429#true} {2429#true} #119#return; {2429#true} is VALID [2018-11-23 11:51:56,046 INFO L256 TraceCheckUtils]: 4: Hoare triple {2429#true} call #t~ret16 := main(); {2429#true} is VALID [2018-11-23 11:51:56,052 INFO L273 TraceCheckUtils]: 5: Hoare triple {2429#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2431#(= main_~a~0 0)} is VALID [2018-11-23 11:51:56,052 INFO L273 TraceCheckUtils]: 6: Hoare triple {2431#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2431#(= main_~a~0 0)} is VALID [2018-11-23 11:51:56,053 INFO L273 TraceCheckUtils]: 7: Hoare triple {2431#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2432#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:56,053 INFO L273 TraceCheckUtils]: 8: Hoare triple {2432#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2432#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:56,054 INFO L273 TraceCheckUtils]: 9: Hoare triple {2432#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2433#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:56,054 INFO L273 TraceCheckUtils]: 10: Hoare triple {2433#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2433#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:56,055 INFO L273 TraceCheckUtils]: 11: Hoare triple {2433#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2434#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:56,055 INFO L273 TraceCheckUtils]: 12: Hoare triple {2434#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2434#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:56,055 INFO L273 TraceCheckUtils]: 13: Hoare triple {2434#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2435#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:56,056 INFO L273 TraceCheckUtils]: 14: Hoare triple {2435#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2435#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:56,056 INFO L273 TraceCheckUtils]: 15: Hoare triple {2435#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2436#(<= main_~a~0 5)} is VALID [2018-11-23 11:51:56,057 INFO L273 TraceCheckUtils]: 16: Hoare triple {2436#(<= main_~a~0 5)} assume !(~a~0 < 100000); {2430#false} is VALID [2018-11-23 11:51:56,057 INFO L273 TraceCheckUtils]: 17: Hoare triple {2430#false} havoc ~i~0;~i~0 := 0; {2430#false} is VALID [2018-11-23 11:51:56,057 INFO L273 TraceCheckUtils]: 18: Hoare triple {2430#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2430#false} is VALID [2018-11-23 11:51:56,057 INFO L273 TraceCheckUtils]: 19: Hoare triple {2430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2430#false} is VALID [2018-11-23 11:51:56,058 INFO L273 TraceCheckUtils]: 20: Hoare triple {2430#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2430#false} is VALID [2018-11-23 11:51:56,058 INFO L273 TraceCheckUtils]: 21: Hoare triple {2430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2430#false} is VALID [2018-11-23 11:51:56,058 INFO L273 TraceCheckUtils]: 22: Hoare triple {2430#false} assume !(~i~0 < 100000); {2430#false} is VALID [2018-11-23 11:51:56,058 INFO L273 TraceCheckUtils]: 23: Hoare triple {2430#false} ~i~0 := 0; {2430#false} is VALID [2018-11-23 11:51:56,059 INFO L273 TraceCheckUtils]: 24: Hoare triple {2430#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2430#false} is VALID [2018-11-23 11:51:56,059 INFO L273 TraceCheckUtils]: 25: Hoare triple {2430#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2430#false} is VALID [2018-11-23 11:51:56,059 INFO L273 TraceCheckUtils]: 26: Hoare triple {2430#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2430#false} is VALID [2018-11-23 11:51:56,059 INFO L273 TraceCheckUtils]: 27: Hoare triple {2430#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2430#false} is VALID [2018-11-23 11:51:56,060 INFO L273 TraceCheckUtils]: 28: Hoare triple {2430#false} assume !(~i~0 < 100000); {2430#false} is VALID [2018-11-23 11:51:56,060 INFO L273 TraceCheckUtils]: 29: Hoare triple {2430#false} ~i~0 := 0; {2430#false} is VALID [2018-11-23 11:51:56,060 INFO L273 TraceCheckUtils]: 30: Hoare triple {2430#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2430#false} is VALID [2018-11-23 11:51:56,060 INFO L273 TraceCheckUtils]: 31: Hoare triple {2430#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2430#false} is VALID [2018-11-23 11:51:56,060 INFO L273 TraceCheckUtils]: 32: Hoare triple {2430#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2430#false} is VALID [2018-11-23 11:51:56,060 INFO L273 TraceCheckUtils]: 33: Hoare triple {2430#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2430#false} is VALID [2018-11-23 11:51:56,061 INFO L273 TraceCheckUtils]: 34: Hoare triple {2430#false} assume !(~i~0 < 100000); {2430#false} is VALID [2018-11-23 11:51:56,061 INFO L273 TraceCheckUtils]: 35: Hoare triple {2430#false} ~i~0 := 0; {2430#false} is VALID [2018-11-23 11:51:56,061 INFO L273 TraceCheckUtils]: 36: Hoare triple {2430#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2430#false} is VALID [2018-11-23 11:51:56,061 INFO L273 TraceCheckUtils]: 37: Hoare triple {2430#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2430#false} is VALID [2018-11-23 11:51:56,061 INFO L273 TraceCheckUtils]: 38: Hoare triple {2430#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2430#false} is VALID [2018-11-23 11:51:56,061 INFO L273 TraceCheckUtils]: 39: Hoare triple {2430#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2430#false} is VALID [2018-11-23 11:51:56,062 INFO L273 TraceCheckUtils]: 40: Hoare triple {2430#false} assume !(~i~0 < 100000); {2430#false} is VALID [2018-11-23 11:51:56,062 INFO L273 TraceCheckUtils]: 41: Hoare triple {2430#false} ~i~0 := 0; {2430#false} is VALID [2018-11-23 11:51:56,062 INFO L273 TraceCheckUtils]: 42: Hoare triple {2430#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {2430#false} is VALID [2018-11-23 11:51:56,062 INFO L273 TraceCheckUtils]: 43: Hoare triple {2430#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {2430#false} is VALID [2018-11-23 11:51:56,063 INFO L273 TraceCheckUtils]: 44: Hoare triple {2430#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {2430#false} is VALID [2018-11-23 11:51:56,063 INFO L273 TraceCheckUtils]: 45: Hoare triple {2430#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {2430#false} is VALID [2018-11-23 11:51:56,063 INFO L273 TraceCheckUtils]: 46: Hoare triple {2430#false} assume !(~i~0 < 100000); {2430#false} is VALID [2018-11-23 11:51:56,063 INFO L273 TraceCheckUtils]: 47: Hoare triple {2430#false} havoc ~x~0;~x~0 := 0; {2430#false} is VALID [2018-11-23 11:51:56,063 INFO L273 TraceCheckUtils]: 48: Hoare triple {2430#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {2430#false} is VALID [2018-11-23 11:51:56,064 INFO L256 TraceCheckUtils]: 49: Hoare triple {2430#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {2430#false} is VALID [2018-11-23 11:51:56,064 INFO L273 TraceCheckUtils]: 50: Hoare triple {2430#false} ~cond := #in~cond; {2430#false} is VALID [2018-11-23 11:51:56,064 INFO L273 TraceCheckUtils]: 51: Hoare triple {2430#false} assume 0 == ~cond; {2430#false} is VALID [2018-11-23 11:51:56,064 INFO L273 TraceCheckUtils]: 52: Hoare triple {2430#false} assume !false; {2430#false} is VALID [2018-11-23 11:51:56,066 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 11:51:56,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:56,066 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 11:51:56,083 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:51:58,900 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 11:51:58,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:58,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:59,131 INFO L256 TraceCheckUtils]: 0: Hoare triple {2429#true} call ULTIMATE.init(); {2429#true} is VALID [2018-11-23 11:51:59,132 INFO L273 TraceCheckUtils]: 1: Hoare triple {2429#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2429#true} is VALID [2018-11-23 11:51:59,132 INFO L273 TraceCheckUtils]: 2: Hoare triple {2429#true} assume true; {2429#true} is VALID [2018-11-23 11:51:59,132 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2429#true} {2429#true} #119#return; {2429#true} is VALID [2018-11-23 11:51:59,132 INFO L256 TraceCheckUtils]: 4: Hoare triple {2429#true} call #t~ret16 := main(); {2429#true} is VALID [2018-11-23 11:51:59,132 INFO L273 TraceCheckUtils]: 5: Hoare triple {2429#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2429#true} is VALID [2018-11-23 11:51:59,132 INFO L273 TraceCheckUtils]: 6: Hoare triple {2429#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2429#true} is VALID [2018-11-23 11:51:59,133 INFO L273 TraceCheckUtils]: 7: Hoare triple {2429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2429#true} is VALID [2018-11-23 11:51:59,133 INFO L273 TraceCheckUtils]: 8: Hoare triple {2429#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2429#true} is VALID [2018-11-23 11:51:59,133 INFO L273 TraceCheckUtils]: 9: Hoare triple {2429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2429#true} is VALID [2018-11-23 11:51:59,133 INFO L273 TraceCheckUtils]: 10: Hoare triple {2429#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2429#true} is VALID [2018-11-23 11:51:59,134 INFO L273 TraceCheckUtils]: 11: Hoare triple {2429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2429#true} is VALID [2018-11-23 11:51:59,134 INFO L273 TraceCheckUtils]: 12: Hoare triple {2429#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2429#true} is VALID [2018-11-23 11:51:59,134 INFO L273 TraceCheckUtils]: 13: Hoare triple {2429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2429#true} is VALID [2018-11-23 11:51:59,134 INFO L273 TraceCheckUtils]: 14: Hoare triple {2429#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2429#true} is VALID [2018-11-23 11:51:59,134 INFO L273 TraceCheckUtils]: 15: Hoare triple {2429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2429#true} is VALID [2018-11-23 11:51:59,134 INFO L273 TraceCheckUtils]: 16: Hoare triple {2429#true} assume !(~a~0 < 100000); {2429#true} is VALID [2018-11-23 11:51:59,134 INFO L273 TraceCheckUtils]: 17: Hoare triple {2429#true} havoc ~i~0;~i~0 := 0; {2429#true} is VALID [2018-11-23 11:51:59,134 INFO L273 TraceCheckUtils]: 18: Hoare triple {2429#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2429#true} is VALID [2018-11-23 11:51:59,135 INFO L273 TraceCheckUtils]: 19: Hoare triple {2429#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2429#true} is VALID [2018-11-23 11:51:59,135 INFO L273 TraceCheckUtils]: 20: Hoare triple {2429#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2429#true} is VALID [2018-11-23 11:51:59,135 INFO L273 TraceCheckUtils]: 21: Hoare triple {2429#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2429#true} is VALID [2018-11-23 11:51:59,135 INFO L273 TraceCheckUtils]: 22: Hoare triple {2429#true} assume !(~i~0 < 100000); {2429#true} is VALID [2018-11-23 11:51:59,135 INFO L273 TraceCheckUtils]: 23: Hoare triple {2429#true} ~i~0 := 0; {2429#true} is VALID [2018-11-23 11:51:59,135 INFO L273 TraceCheckUtils]: 24: Hoare triple {2429#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2429#true} is VALID [2018-11-23 11:51:59,135 INFO L273 TraceCheckUtils]: 25: Hoare triple {2429#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2429#true} is VALID [2018-11-23 11:51:59,136 INFO L273 TraceCheckUtils]: 26: Hoare triple {2429#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2429#true} is VALID [2018-11-23 11:51:59,136 INFO L273 TraceCheckUtils]: 27: Hoare triple {2429#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2429#true} is VALID [2018-11-23 11:51:59,136 INFO L273 TraceCheckUtils]: 28: Hoare triple {2429#true} assume !(~i~0 < 100000); {2429#true} is VALID [2018-11-23 11:51:59,136 INFO L273 TraceCheckUtils]: 29: Hoare triple {2429#true} ~i~0 := 0; {2429#true} is VALID [2018-11-23 11:51:59,136 INFO L273 TraceCheckUtils]: 30: Hoare triple {2429#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2429#true} is VALID [2018-11-23 11:51:59,136 INFO L273 TraceCheckUtils]: 31: Hoare triple {2429#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2429#true} is VALID [2018-11-23 11:51:59,136 INFO L273 TraceCheckUtils]: 32: Hoare triple {2429#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2429#true} is VALID [2018-11-23 11:51:59,137 INFO L273 TraceCheckUtils]: 33: Hoare triple {2429#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2429#true} is VALID [2018-11-23 11:51:59,137 INFO L273 TraceCheckUtils]: 34: Hoare triple {2429#true} assume !(~i~0 < 100000); {2429#true} is VALID [2018-11-23 11:51:59,137 INFO L273 TraceCheckUtils]: 35: Hoare triple {2429#true} ~i~0 := 0; {2545#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:59,137 INFO L273 TraceCheckUtils]: 36: Hoare triple {2545#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2545#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:59,138 INFO L273 TraceCheckUtils]: 37: Hoare triple {2545#(<= main_~i~0 0)} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2552#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:59,138 INFO L273 TraceCheckUtils]: 38: Hoare triple {2552#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2552#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:59,139 INFO L273 TraceCheckUtils]: 39: Hoare triple {2552#(<= main_~i~0 1)} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2559#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:59,139 INFO L273 TraceCheckUtils]: 40: Hoare triple {2559#(<= main_~i~0 2)} assume !(~i~0 < 100000); {2430#false} is VALID [2018-11-23 11:51:59,139 INFO L273 TraceCheckUtils]: 41: Hoare triple {2430#false} ~i~0 := 0; {2430#false} is VALID [2018-11-23 11:51:59,140 INFO L273 TraceCheckUtils]: 42: Hoare triple {2430#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {2430#false} is VALID [2018-11-23 11:51:59,140 INFO L273 TraceCheckUtils]: 43: Hoare triple {2430#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {2430#false} is VALID [2018-11-23 11:51:59,140 INFO L273 TraceCheckUtils]: 44: Hoare triple {2430#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {2430#false} is VALID [2018-11-23 11:51:59,140 INFO L273 TraceCheckUtils]: 45: Hoare triple {2430#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {2430#false} is VALID [2018-11-23 11:51:59,140 INFO L273 TraceCheckUtils]: 46: Hoare triple {2430#false} assume !(~i~0 < 100000); {2430#false} is VALID [2018-11-23 11:51:59,140 INFO L273 TraceCheckUtils]: 47: Hoare triple {2430#false} havoc ~x~0;~x~0 := 0; {2430#false} is VALID [2018-11-23 11:51:59,140 INFO L273 TraceCheckUtils]: 48: Hoare triple {2430#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {2430#false} is VALID [2018-11-23 11:51:59,141 INFO L256 TraceCheckUtils]: 49: Hoare triple {2430#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {2430#false} is VALID [2018-11-23 11:51:59,141 INFO L273 TraceCheckUtils]: 50: Hoare triple {2430#false} ~cond := #in~cond; {2430#false} is VALID [2018-11-23 11:51:59,141 INFO L273 TraceCheckUtils]: 51: Hoare triple {2430#false} assume 0 == ~cond; {2430#false} is VALID [2018-11-23 11:51:59,141 INFO L273 TraceCheckUtils]: 52: Hoare triple {2430#false} assume !false; {2430#false} is VALID [2018-11-23 11:51:59,143 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-23 11:51:59,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:59,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-23 11:51:59,164 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2018-11-23 11:51:59,165 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:59,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:51:59,411 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:59,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:51:59,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:51:59,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:51:59,412 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 11 states. [2018-11-23 11:52:00,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:00,089 INFO L93 Difference]: Finished difference Result 117 states and 134 transitions. [2018-11-23 11:52:00,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:52:00,090 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2018-11-23 11:52:00,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:00,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:52:00,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2018-11-23 11:52:00,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:52:00,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2018-11-23 11:52:00,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 119 transitions. [2018-11-23 11:52:00,328 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:00,331 INFO L225 Difference]: With dead ends: 117 [2018-11-23 11:52:00,331 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 11:52:00,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:52:00,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 11:52:00,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2018-11-23 11:52:00,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:00,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 70 states. [2018-11-23 11:52:00,364 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 70 states. [2018-11-23 11:52:00,365 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 70 states. [2018-11-23 11:52:00,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:00,368 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-11-23 11:52:00,368 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-11-23 11:52:00,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:00,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:00,369 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 76 states. [2018-11-23 11:52:00,369 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 76 states. [2018-11-23 11:52:00,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:00,371 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-11-23 11:52:00,371 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-11-23 11:52:00,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:00,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:00,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:00,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:00,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 11:52:00,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-11-23 11:52:00,374 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 53 [2018-11-23 11:52:00,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:00,375 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-11-23 11:52:00,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:52:00,375 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-11-23 11:52:00,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 11:52:00,375 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:00,376 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:00,376 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:00,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:00,376 INFO L82 PathProgramCache]: Analyzing trace with hash -371655764, now seen corresponding path program 6 times [2018-11-23 11:52:00,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:00,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:00,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:00,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:00,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:00,555 INFO L256 TraceCheckUtils]: 0: Hoare triple {3023#true} call ULTIMATE.init(); {3023#true} is VALID [2018-11-23 11:52:00,556 INFO L273 TraceCheckUtils]: 1: Hoare triple {3023#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3023#true} is VALID [2018-11-23 11:52:00,556 INFO L273 TraceCheckUtils]: 2: Hoare triple {3023#true} assume true; {3023#true} is VALID [2018-11-23 11:52:00,556 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3023#true} {3023#true} #119#return; {3023#true} is VALID [2018-11-23 11:52:00,557 INFO L256 TraceCheckUtils]: 4: Hoare triple {3023#true} call #t~ret16 := main(); {3023#true} is VALID [2018-11-23 11:52:00,557 INFO L273 TraceCheckUtils]: 5: Hoare triple {3023#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3025#(= main_~a~0 0)} is VALID [2018-11-23 11:52:00,558 INFO L273 TraceCheckUtils]: 6: Hoare triple {3025#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3025#(= main_~a~0 0)} is VALID [2018-11-23 11:52:00,558 INFO L273 TraceCheckUtils]: 7: Hoare triple {3025#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3026#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:00,560 INFO L273 TraceCheckUtils]: 8: Hoare triple {3026#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3026#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:00,560 INFO L273 TraceCheckUtils]: 9: Hoare triple {3026#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3027#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:00,561 INFO L273 TraceCheckUtils]: 10: Hoare triple {3027#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3027#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:00,571 INFO L273 TraceCheckUtils]: 11: Hoare triple {3027#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3028#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:00,578 INFO L273 TraceCheckUtils]: 12: Hoare triple {3028#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3028#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:00,580 INFO L273 TraceCheckUtils]: 13: Hoare triple {3028#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3029#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:00,581 INFO L273 TraceCheckUtils]: 14: Hoare triple {3029#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3029#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:00,581 INFO L273 TraceCheckUtils]: 15: Hoare triple {3029#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3030#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:00,584 INFO L273 TraceCheckUtils]: 16: Hoare triple {3030#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3030#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:00,584 INFO L273 TraceCheckUtils]: 17: Hoare triple {3030#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3031#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:00,586 INFO L273 TraceCheckUtils]: 18: Hoare triple {3031#(<= main_~a~0 6)} assume !(~a~0 < 100000); {3024#false} is VALID [2018-11-23 11:52:00,586 INFO L273 TraceCheckUtils]: 19: Hoare triple {3024#false} havoc ~i~0;~i~0 := 0; {3024#false} is VALID [2018-11-23 11:52:00,586 INFO L273 TraceCheckUtils]: 20: Hoare triple {3024#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3024#false} is VALID [2018-11-23 11:52:00,586 INFO L273 TraceCheckUtils]: 21: Hoare triple {3024#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3024#false} is VALID [2018-11-23 11:52:00,586 INFO L273 TraceCheckUtils]: 22: Hoare triple {3024#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3024#false} is VALID [2018-11-23 11:52:00,586 INFO L273 TraceCheckUtils]: 23: Hoare triple {3024#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3024#false} is VALID [2018-11-23 11:52:00,587 INFO L273 TraceCheckUtils]: 24: Hoare triple {3024#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3024#false} is VALID [2018-11-23 11:52:00,587 INFO L273 TraceCheckUtils]: 25: Hoare triple {3024#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3024#false} is VALID [2018-11-23 11:52:00,587 INFO L273 TraceCheckUtils]: 26: Hoare triple {3024#false} assume !(~i~0 < 100000); {3024#false} is VALID [2018-11-23 11:52:00,587 INFO L273 TraceCheckUtils]: 27: Hoare triple {3024#false} ~i~0 := 0; {3024#false} is VALID [2018-11-23 11:52:00,587 INFO L273 TraceCheckUtils]: 28: Hoare triple {3024#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3024#false} is VALID [2018-11-23 11:52:00,587 INFO L273 TraceCheckUtils]: 29: Hoare triple {3024#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3024#false} is VALID [2018-11-23 11:52:00,587 INFO L273 TraceCheckUtils]: 30: Hoare triple {3024#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3024#false} is VALID [2018-11-23 11:52:00,588 INFO L273 TraceCheckUtils]: 31: Hoare triple {3024#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3024#false} is VALID [2018-11-23 11:52:00,588 INFO L273 TraceCheckUtils]: 32: Hoare triple {3024#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3024#false} is VALID [2018-11-23 11:52:00,588 INFO L273 TraceCheckUtils]: 33: Hoare triple {3024#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3024#false} is VALID [2018-11-23 11:52:00,588 INFO L273 TraceCheckUtils]: 34: Hoare triple {3024#false} assume !(~i~0 < 100000); {3024#false} is VALID [2018-11-23 11:52:00,588 INFO L273 TraceCheckUtils]: 35: Hoare triple {3024#false} ~i~0 := 0; {3024#false} is VALID [2018-11-23 11:52:00,588 INFO L273 TraceCheckUtils]: 36: Hoare triple {3024#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3024#false} is VALID [2018-11-23 11:52:00,588 INFO L273 TraceCheckUtils]: 37: Hoare triple {3024#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3024#false} is VALID [2018-11-23 11:52:00,588 INFO L273 TraceCheckUtils]: 38: Hoare triple {3024#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3024#false} is VALID [2018-11-23 11:52:00,589 INFO L273 TraceCheckUtils]: 39: Hoare triple {3024#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3024#false} is VALID [2018-11-23 11:52:00,589 INFO L273 TraceCheckUtils]: 40: Hoare triple {3024#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3024#false} is VALID [2018-11-23 11:52:00,589 INFO L273 TraceCheckUtils]: 41: Hoare triple {3024#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3024#false} is VALID [2018-11-23 11:52:00,589 INFO L273 TraceCheckUtils]: 42: Hoare triple {3024#false} assume !(~i~0 < 100000); {3024#false} is VALID [2018-11-23 11:52:00,589 INFO L273 TraceCheckUtils]: 43: Hoare triple {3024#false} ~i~0 := 0; {3024#false} is VALID [2018-11-23 11:52:00,589 INFO L273 TraceCheckUtils]: 44: Hoare triple {3024#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3024#false} is VALID [2018-11-23 11:52:00,590 INFO L273 TraceCheckUtils]: 45: Hoare triple {3024#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3024#false} is VALID [2018-11-23 11:52:00,590 INFO L273 TraceCheckUtils]: 46: Hoare triple {3024#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3024#false} is VALID [2018-11-23 11:52:00,590 INFO L273 TraceCheckUtils]: 47: Hoare triple {3024#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3024#false} is VALID [2018-11-23 11:52:00,590 INFO L273 TraceCheckUtils]: 48: Hoare triple {3024#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3024#false} is VALID [2018-11-23 11:52:00,590 INFO L273 TraceCheckUtils]: 49: Hoare triple {3024#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3024#false} is VALID [2018-11-23 11:52:00,590 INFO L273 TraceCheckUtils]: 50: Hoare triple {3024#false} assume !(~i~0 < 100000); {3024#false} is VALID [2018-11-23 11:52:00,591 INFO L273 TraceCheckUtils]: 51: Hoare triple {3024#false} ~i~0 := 0; {3024#false} is VALID [2018-11-23 11:52:00,591 INFO L273 TraceCheckUtils]: 52: Hoare triple {3024#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {3024#false} is VALID [2018-11-23 11:52:00,591 INFO L273 TraceCheckUtils]: 53: Hoare triple {3024#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3024#false} is VALID [2018-11-23 11:52:00,591 INFO L273 TraceCheckUtils]: 54: Hoare triple {3024#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {3024#false} is VALID [2018-11-23 11:52:00,591 INFO L273 TraceCheckUtils]: 55: Hoare triple {3024#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3024#false} is VALID [2018-11-23 11:52:00,591 INFO L273 TraceCheckUtils]: 56: Hoare triple {3024#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {3024#false} is VALID [2018-11-23 11:52:00,592 INFO L273 TraceCheckUtils]: 57: Hoare triple {3024#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3024#false} is VALID [2018-11-23 11:52:00,592 INFO L273 TraceCheckUtils]: 58: Hoare triple {3024#false} assume !(~i~0 < 100000); {3024#false} is VALID [2018-11-23 11:52:00,592 INFO L273 TraceCheckUtils]: 59: Hoare triple {3024#false} havoc ~x~0;~x~0 := 0; {3024#false} is VALID [2018-11-23 11:52:00,592 INFO L273 TraceCheckUtils]: 60: Hoare triple {3024#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {3024#false} is VALID [2018-11-23 11:52:00,592 INFO L256 TraceCheckUtils]: 61: Hoare triple {3024#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {3024#false} is VALID [2018-11-23 11:52:00,592 INFO L273 TraceCheckUtils]: 62: Hoare triple {3024#false} ~cond := #in~cond; {3024#false} is VALID [2018-11-23 11:52:00,593 INFO L273 TraceCheckUtils]: 63: Hoare triple {3024#false} assume 0 == ~cond; {3024#false} is VALID [2018-11-23 11:52:00,593 INFO L273 TraceCheckUtils]: 64: Hoare triple {3024#false} assume !false; {3024#false} is VALID [2018-11-23 11:52:00,597 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 11:52:00,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:00,597 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 11:52:00,606 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:52:01,015 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 11:52:01,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:01,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:01,462 INFO L256 TraceCheckUtils]: 0: Hoare triple {3023#true} call ULTIMATE.init(); {3023#true} is VALID [2018-11-23 11:52:01,462 INFO L273 TraceCheckUtils]: 1: Hoare triple {3023#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3023#true} is VALID [2018-11-23 11:52:01,463 INFO L273 TraceCheckUtils]: 2: Hoare triple {3023#true} assume true; {3023#true} is VALID [2018-11-23 11:52:01,463 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3023#true} {3023#true} #119#return; {3023#true} is VALID [2018-11-23 11:52:01,463 INFO L256 TraceCheckUtils]: 4: Hoare triple {3023#true} call #t~ret16 := main(); {3023#true} is VALID [2018-11-23 11:52:01,463 INFO L273 TraceCheckUtils]: 5: Hoare triple {3023#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3023#true} is VALID [2018-11-23 11:52:01,464 INFO L273 TraceCheckUtils]: 6: Hoare triple {3023#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3023#true} is VALID [2018-11-23 11:52:01,464 INFO L273 TraceCheckUtils]: 7: Hoare triple {3023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3023#true} is VALID [2018-11-23 11:52:01,464 INFO L273 TraceCheckUtils]: 8: Hoare triple {3023#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3023#true} is VALID [2018-11-23 11:52:01,464 INFO L273 TraceCheckUtils]: 9: Hoare triple {3023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3023#true} is VALID [2018-11-23 11:52:01,465 INFO L273 TraceCheckUtils]: 10: Hoare triple {3023#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3023#true} is VALID [2018-11-23 11:52:01,465 INFO L273 TraceCheckUtils]: 11: Hoare triple {3023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3023#true} is VALID [2018-11-23 11:52:01,465 INFO L273 TraceCheckUtils]: 12: Hoare triple {3023#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3023#true} is VALID [2018-11-23 11:52:01,465 INFO L273 TraceCheckUtils]: 13: Hoare triple {3023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3023#true} is VALID [2018-11-23 11:52:01,465 INFO L273 TraceCheckUtils]: 14: Hoare triple {3023#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3023#true} is VALID [2018-11-23 11:52:01,465 INFO L273 TraceCheckUtils]: 15: Hoare triple {3023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3023#true} is VALID [2018-11-23 11:52:01,465 INFO L273 TraceCheckUtils]: 16: Hoare triple {3023#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3023#true} is VALID [2018-11-23 11:52:01,466 INFO L273 TraceCheckUtils]: 17: Hoare triple {3023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3023#true} is VALID [2018-11-23 11:52:01,466 INFO L273 TraceCheckUtils]: 18: Hoare triple {3023#true} assume !(~a~0 < 100000); {3023#true} is VALID [2018-11-23 11:52:01,466 INFO L273 TraceCheckUtils]: 19: Hoare triple {3023#true} havoc ~i~0;~i~0 := 0; {3092#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:01,467 INFO L273 TraceCheckUtils]: 20: Hoare triple {3092#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3092#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:01,467 INFO L273 TraceCheckUtils]: 21: Hoare triple {3092#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3099#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:01,467 INFO L273 TraceCheckUtils]: 22: Hoare triple {3099#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3099#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:01,468 INFO L273 TraceCheckUtils]: 23: Hoare triple {3099#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3106#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:01,468 INFO L273 TraceCheckUtils]: 24: Hoare triple {3106#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3106#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:01,469 INFO L273 TraceCheckUtils]: 25: Hoare triple {3106#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3113#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:01,469 INFO L273 TraceCheckUtils]: 26: Hoare triple {3113#(<= main_~i~0 3)} assume !(~i~0 < 100000); {3024#false} is VALID [2018-11-23 11:52:01,469 INFO L273 TraceCheckUtils]: 27: Hoare triple {3024#false} ~i~0 := 0; {3024#false} is VALID [2018-11-23 11:52:01,469 INFO L273 TraceCheckUtils]: 28: Hoare triple {3024#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3024#false} is VALID [2018-11-23 11:52:01,470 INFO L273 TraceCheckUtils]: 29: Hoare triple {3024#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3024#false} is VALID [2018-11-23 11:52:01,470 INFO L273 TraceCheckUtils]: 30: Hoare triple {3024#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3024#false} is VALID [2018-11-23 11:52:01,470 INFO L273 TraceCheckUtils]: 31: Hoare triple {3024#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3024#false} is VALID [2018-11-23 11:52:01,470 INFO L273 TraceCheckUtils]: 32: Hoare triple {3024#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3024#false} is VALID [2018-11-23 11:52:01,470 INFO L273 TraceCheckUtils]: 33: Hoare triple {3024#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3024#false} is VALID [2018-11-23 11:52:01,470 INFO L273 TraceCheckUtils]: 34: Hoare triple {3024#false} assume !(~i~0 < 100000); {3024#false} is VALID [2018-11-23 11:52:01,471 INFO L273 TraceCheckUtils]: 35: Hoare triple {3024#false} ~i~0 := 0; {3024#false} is VALID [2018-11-23 11:52:01,471 INFO L273 TraceCheckUtils]: 36: Hoare triple {3024#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3024#false} is VALID [2018-11-23 11:52:01,471 INFO L273 TraceCheckUtils]: 37: Hoare triple {3024#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3024#false} is VALID [2018-11-23 11:52:01,471 INFO L273 TraceCheckUtils]: 38: Hoare triple {3024#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3024#false} is VALID [2018-11-23 11:52:01,471 INFO L273 TraceCheckUtils]: 39: Hoare triple {3024#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3024#false} is VALID [2018-11-23 11:52:01,472 INFO L273 TraceCheckUtils]: 40: Hoare triple {3024#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3024#false} is VALID [2018-11-23 11:52:01,472 INFO L273 TraceCheckUtils]: 41: Hoare triple {3024#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3024#false} is VALID [2018-11-23 11:52:01,472 INFO L273 TraceCheckUtils]: 42: Hoare triple {3024#false} assume !(~i~0 < 100000); {3024#false} is VALID [2018-11-23 11:52:01,472 INFO L273 TraceCheckUtils]: 43: Hoare triple {3024#false} ~i~0 := 0; {3024#false} is VALID [2018-11-23 11:52:01,473 INFO L273 TraceCheckUtils]: 44: Hoare triple {3024#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3024#false} is VALID [2018-11-23 11:52:01,473 INFO L273 TraceCheckUtils]: 45: Hoare triple {3024#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3024#false} is VALID [2018-11-23 11:52:01,473 INFO L273 TraceCheckUtils]: 46: Hoare triple {3024#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3024#false} is VALID [2018-11-23 11:52:01,473 INFO L273 TraceCheckUtils]: 47: Hoare triple {3024#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3024#false} is VALID [2018-11-23 11:52:01,473 INFO L273 TraceCheckUtils]: 48: Hoare triple {3024#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3024#false} is VALID [2018-11-23 11:52:01,473 INFO L273 TraceCheckUtils]: 49: Hoare triple {3024#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3024#false} is VALID [2018-11-23 11:52:01,473 INFO L273 TraceCheckUtils]: 50: Hoare triple {3024#false} assume !(~i~0 < 100000); {3024#false} is VALID [2018-11-23 11:52:01,474 INFO L273 TraceCheckUtils]: 51: Hoare triple {3024#false} ~i~0 := 0; {3024#false} is VALID [2018-11-23 11:52:01,474 INFO L273 TraceCheckUtils]: 52: Hoare triple {3024#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {3024#false} is VALID [2018-11-23 11:52:01,474 INFO L273 TraceCheckUtils]: 53: Hoare triple {3024#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3024#false} is VALID [2018-11-23 11:52:01,474 INFO L273 TraceCheckUtils]: 54: Hoare triple {3024#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {3024#false} is VALID [2018-11-23 11:52:01,474 INFO L273 TraceCheckUtils]: 55: Hoare triple {3024#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3024#false} is VALID [2018-11-23 11:52:01,474 INFO L273 TraceCheckUtils]: 56: Hoare triple {3024#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {3024#false} is VALID [2018-11-23 11:52:01,474 INFO L273 TraceCheckUtils]: 57: Hoare triple {3024#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3024#false} is VALID [2018-11-23 11:52:01,474 INFO L273 TraceCheckUtils]: 58: Hoare triple {3024#false} assume !(~i~0 < 100000); {3024#false} is VALID [2018-11-23 11:52:01,475 INFO L273 TraceCheckUtils]: 59: Hoare triple {3024#false} havoc ~x~0;~x~0 := 0; {3024#false} is VALID [2018-11-23 11:52:01,475 INFO L273 TraceCheckUtils]: 60: Hoare triple {3024#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {3024#false} is VALID [2018-11-23 11:52:01,475 INFO L256 TraceCheckUtils]: 61: Hoare triple {3024#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {3024#false} is VALID [2018-11-23 11:52:01,475 INFO L273 TraceCheckUtils]: 62: Hoare triple {3024#false} ~cond := #in~cond; {3024#false} is VALID [2018-11-23 11:52:01,475 INFO L273 TraceCheckUtils]: 63: Hoare triple {3024#false} assume 0 == ~cond; {3024#false} is VALID [2018-11-23 11:52:01,475 INFO L273 TraceCheckUtils]: 64: Hoare triple {3024#false} assume !false; {3024#false} is VALID [2018-11-23 11:52:01,477 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-23 11:52:01,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:01,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2018-11-23 11:52:01,498 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2018-11-23 11:52:01,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:01,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:52:01,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:01,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:52:01,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:52:01,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:52:01,577 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 13 states. [2018-11-23 11:52:02,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:02,208 INFO L93 Difference]: Finished difference Result 139 states and 156 transitions. [2018-11-23 11:52:02,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:52:02,208 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2018-11-23 11:52:02,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:02,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:52:02,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 131 transitions. [2018-11-23 11:52:02,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:52:02,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 131 transitions. [2018-11-23 11:52:02,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 131 transitions. [2018-11-23 11:52:02,393 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:02,395 INFO L225 Difference]: With dead ends: 139 [2018-11-23 11:52:02,395 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 11:52:02,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:52:02,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 11:52:02,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 82. [2018-11-23 11:52:02,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:02,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 82 states. [2018-11-23 11:52:02,437 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 82 states. [2018-11-23 11:52:02,437 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 82 states. [2018-11-23 11:52:02,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:02,440 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2018-11-23 11:52:02,441 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-11-23 11:52:02,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:02,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:02,441 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 88 states. [2018-11-23 11:52:02,441 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 88 states. [2018-11-23 11:52:02,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:02,444 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2018-11-23 11:52:02,444 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-11-23 11:52:02,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:02,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:02,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:02,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:02,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 11:52:02,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2018-11-23 11:52:02,448 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 65 [2018-11-23 11:52:02,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:02,448 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2018-11-23 11:52:02,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:52:02,449 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2018-11-23 11:52:02,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 11:52:02,449 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:02,450 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:02,450 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:02,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:02,450 INFO L82 PathProgramCache]: Analyzing trace with hash 996125472, now seen corresponding path program 7 times [2018-11-23 11:52:02,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:02,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:02,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:02,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:02,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:02,719 INFO L256 TraceCheckUtils]: 0: Hoare triple {3730#true} call ULTIMATE.init(); {3730#true} is VALID [2018-11-23 11:52:02,719 INFO L273 TraceCheckUtils]: 1: Hoare triple {3730#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3730#true} is VALID [2018-11-23 11:52:02,720 INFO L273 TraceCheckUtils]: 2: Hoare triple {3730#true} assume true; {3730#true} is VALID [2018-11-23 11:52:02,720 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3730#true} {3730#true} #119#return; {3730#true} is VALID [2018-11-23 11:52:02,720 INFO L256 TraceCheckUtils]: 4: Hoare triple {3730#true} call #t~ret16 := main(); {3730#true} is VALID [2018-11-23 11:52:02,724 INFO L273 TraceCheckUtils]: 5: Hoare triple {3730#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3732#(= main_~a~0 0)} is VALID [2018-11-23 11:52:02,724 INFO L273 TraceCheckUtils]: 6: Hoare triple {3732#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3732#(= main_~a~0 0)} is VALID [2018-11-23 11:52:02,725 INFO L273 TraceCheckUtils]: 7: Hoare triple {3732#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3733#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:02,725 INFO L273 TraceCheckUtils]: 8: Hoare triple {3733#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3733#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:02,726 INFO L273 TraceCheckUtils]: 9: Hoare triple {3733#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3734#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:02,726 INFO L273 TraceCheckUtils]: 10: Hoare triple {3734#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3734#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:02,726 INFO L273 TraceCheckUtils]: 11: Hoare triple {3734#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3735#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:02,727 INFO L273 TraceCheckUtils]: 12: Hoare triple {3735#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3735#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:02,727 INFO L273 TraceCheckUtils]: 13: Hoare triple {3735#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3736#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:02,728 INFO L273 TraceCheckUtils]: 14: Hoare triple {3736#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3736#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:02,728 INFO L273 TraceCheckUtils]: 15: Hoare triple {3736#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3737#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:02,729 INFO L273 TraceCheckUtils]: 16: Hoare triple {3737#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3737#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:02,730 INFO L273 TraceCheckUtils]: 17: Hoare triple {3737#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3738#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:02,730 INFO L273 TraceCheckUtils]: 18: Hoare triple {3738#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3738#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:02,731 INFO L273 TraceCheckUtils]: 19: Hoare triple {3738#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3739#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:02,732 INFO L273 TraceCheckUtils]: 20: Hoare triple {3739#(<= main_~a~0 7)} assume !(~a~0 < 100000); {3731#false} is VALID [2018-11-23 11:52:02,732 INFO L273 TraceCheckUtils]: 21: Hoare triple {3731#false} havoc ~i~0;~i~0 := 0; {3731#false} is VALID [2018-11-23 11:52:02,732 INFO L273 TraceCheckUtils]: 22: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3731#false} is VALID [2018-11-23 11:52:02,733 INFO L273 TraceCheckUtils]: 23: Hoare triple {3731#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3731#false} is VALID [2018-11-23 11:52:02,733 INFO L273 TraceCheckUtils]: 24: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3731#false} is VALID [2018-11-23 11:52:02,733 INFO L273 TraceCheckUtils]: 25: Hoare triple {3731#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3731#false} is VALID [2018-11-23 11:52:02,733 INFO L273 TraceCheckUtils]: 26: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3731#false} is VALID [2018-11-23 11:52:02,733 INFO L273 TraceCheckUtils]: 27: Hoare triple {3731#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3731#false} is VALID [2018-11-23 11:52:02,734 INFO L273 TraceCheckUtils]: 28: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3731#false} is VALID [2018-11-23 11:52:02,734 INFO L273 TraceCheckUtils]: 29: Hoare triple {3731#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3731#false} is VALID [2018-11-23 11:52:02,734 INFO L273 TraceCheckUtils]: 30: Hoare triple {3731#false} assume !(~i~0 < 100000); {3731#false} is VALID [2018-11-23 11:52:02,734 INFO L273 TraceCheckUtils]: 31: Hoare triple {3731#false} ~i~0 := 0; {3731#false} is VALID [2018-11-23 11:52:02,734 INFO L273 TraceCheckUtils]: 32: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3731#false} is VALID [2018-11-23 11:52:02,735 INFO L273 TraceCheckUtils]: 33: Hoare triple {3731#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3731#false} is VALID [2018-11-23 11:52:02,735 INFO L273 TraceCheckUtils]: 34: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3731#false} is VALID [2018-11-23 11:52:02,735 INFO L273 TraceCheckUtils]: 35: Hoare triple {3731#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3731#false} is VALID [2018-11-23 11:52:02,735 INFO L273 TraceCheckUtils]: 36: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3731#false} is VALID [2018-11-23 11:52:02,735 INFO L273 TraceCheckUtils]: 37: Hoare triple {3731#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3731#false} is VALID [2018-11-23 11:52:02,736 INFO L273 TraceCheckUtils]: 38: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3731#false} is VALID [2018-11-23 11:52:02,736 INFO L273 TraceCheckUtils]: 39: Hoare triple {3731#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3731#false} is VALID [2018-11-23 11:52:02,736 INFO L273 TraceCheckUtils]: 40: Hoare triple {3731#false} assume !(~i~0 < 100000); {3731#false} is VALID [2018-11-23 11:52:02,736 INFO L273 TraceCheckUtils]: 41: Hoare triple {3731#false} ~i~0 := 0; {3731#false} is VALID [2018-11-23 11:52:02,736 INFO L273 TraceCheckUtils]: 42: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3731#false} is VALID [2018-11-23 11:52:02,737 INFO L273 TraceCheckUtils]: 43: Hoare triple {3731#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3731#false} is VALID [2018-11-23 11:52:02,737 INFO L273 TraceCheckUtils]: 44: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3731#false} is VALID [2018-11-23 11:52:02,737 INFO L273 TraceCheckUtils]: 45: Hoare triple {3731#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3731#false} is VALID [2018-11-23 11:52:02,737 INFO L273 TraceCheckUtils]: 46: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3731#false} is VALID [2018-11-23 11:52:02,737 INFO L273 TraceCheckUtils]: 47: Hoare triple {3731#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3731#false} is VALID [2018-11-23 11:52:02,737 INFO L273 TraceCheckUtils]: 48: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3731#false} is VALID [2018-11-23 11:52:02,738 INFO L273 TraceCheckUtils]: 49: Hoare triple {3731#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3731#false} is VALID [2018-11-23 11:52:02,738 INFO L273 TraceCheckUtils]: 50: Hoare triple {3731#false} assume !(~i~0 < 100000); {3731#false} is VALID [2018-11-23 11:52:02,738 INFO L273 TraceCheckUtils]: 51: Hoare triple {3731#false} ~i~0 := 0; {3731#false} is VALID [2018-11-23 11:52:02,738 INFO L273 TraceCheckUtils]: 52: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3731#false} is VALID [2018-11-23 11:52:02,738 INFO L273 TraceCheckUtils]: 53: Hoare triple {3731#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3731#false} is VALID [2018-11-23 11:52:02,738 INFO L273 TraceCheckUtils]: 54: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3731#false} is VALID [2018-11-23 11:52:02,739 INFO L273 TraceCheckUtils]: 55: Hoare triple {3731#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3731#false} is VALID [2018-11-23 11:52:02,739 INFO L273 TraceCheckUtils]: 56: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3731#false} is VALID [2018-11-23 11:52:02,739 INFO L273 TraceCheckUtils]: 57: Hoare triple {3731#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3731#false} is VALID [2018-11-23 11:52:02,739 INFO L273 TraceCheckUtils]: 58: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3731#false} is VALID [2018-11-23 11:52:02,739 INFO L273 TraceCheckUtils]: 59: Hoare triple {3731#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3731#false} is VALID [2018-11-23 11:52:02,740 INFO L273 TraceCheckUtils]: 60: Hoare triple {3731#false} assume !(~i~0 < 100000); {3731#false} is VALID [2018-11-23 11:52:02,740 INFO L273 TraceCheckUtils]: 61: Hoare triple {3731#false} ~i~0 := 0; {3731#false} is VALID [2018-11-23 11:52:02,740 INFO L273 TraceCheckUtils]: 62: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {3731#false} is VALID [2018-11-23 11:52:02,740 INFO L273 TraceCheckUtils]: 63: Hoare triple {3731#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3731#false} is VALID [2018-11-23 11:52:02,740 INFO L273 TraceCheckUtils]: 64: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {3731#false} is VALID [2018-11-23 11:52:02,740 INFO L273 TraceCheckUtils]: 65: Hoare triple {3731#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3731#false} is VALID [2018-11-23 11:52:02,741 INFO L273 TraceCheckUtils]: 66: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {3731#false} is VALID [2018-11-23 11:52:02,741 INFO L273 TraceCheckUtils]: 67: Hoare triple {3731#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3731#false} is VALID [2018-11-23 11:52:02,741 INFO L273 TraceCheckUtils]: 68: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {3731#false} is VALID [2018-11-23 11:52:02,741 INFO L273 TraceCheckUtils]: 69: Hoare triple {3731#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3731#false} is VALID [2018-11-23 11:52:02,741 INFO L273 TraceCheckUtils]: 70: Hoare triple {3731#false} assume !(~i~0 < 100000); {3731#false} is VALID [2018-11-23 11:52:02,742 INFO L273 TraceCheckUtils]: 71: Hoare triple {3731#false} havoc ~x~0;~x~0 := 0; {3731#false} is VALID [2018-11-23 11:52:02,742 INFO L273 TraceCheckUtils]: 72: Hoare triple {3731#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {3731#false} is VALID [2018-11-23 11:52:02,742 INFO L256 TraceCheckUtils]: 73: Hoare triple {3731#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {3731#false} is VALID [2018-11-23 11:52:02,742 INFO L273 TraceCheckUtils]: 74: Hoare triple {3731#false} ~cond := #in~cond; {3731#false} is VALID [2018-11-23 11:52:02,742 INFO L273 TraceCheckUtils]: 75: Hoare triple {3731#false} assume 0 == ~cond; {3731#false} is VALID [2018-11-23 11:52:02,742 INFO L273 TraceCheckUtils]: 76: Hoare triple {3731#false} assume !false; {3731#false} is VALID [2018-11-23 11:52:02,746 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-23 11:52:02,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:02,746 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 11:52:02,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:02,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:03,090 INFO L256 TraceCheckUtils]: 0: Hoare triple {3730#true} call ULTIMATE.init(); {3730#true} is VALID [2018-11-23 11:52:03,090 INFO L273 TraceCheckUtils]: 1: Hoare triple {3730#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3730#true} is VALID [2018-11-23 11:52:03,090 INFO L273 TraceCheckUtils]: 2: Hoare triple {3730#true} assume true; {3730#true} is VALID [2018-11-23 11:52:03,091 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3730#true} {3730#true} #119#return; {3730#true} is VALID [2018-11-23 11:52:03,091 INFO L256 TraceCheckUtils]: 4: Hoare triple {3730#true} call #t~ret16 := main(); {3730#true} is VALID [2018-11-23 11:52:03,092 INFO L273 TraceCheckUtils]: 5: Hoare triple {3730#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3758#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:03,094 INFO L273 TraceCheckUtils]: 6: Hoare triple {3758#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3758#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:03,094 INFO L273 TraceCheckUtils]: 7: Hoare triple {3758#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3733#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:03,097 INFO L273 TraceCheckUtils]: 8: Hoare triple {3733#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3733#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:03,097 INFO L273 TraceCheckUtils]: 9: Hoare triple {3733#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3734#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:03,100 INFO L273 TraceCheckUtils]: 10: Hoare triple {3734#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3734#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:03,100 INFO L273 TraceCheckUtils]: 11: Hoare triple {3734#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3735#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:03,103 INFO L273 TraceCheckUtils]: 12: Hoare triple {3735#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3735#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:03,105 INFO L273 TraceCheckUtils]: 13: Hoare triple {3735#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3736#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:03,105 INFO L273 TraceCheckUtils]: 14: Hoare triple {3736#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3736#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:03,108 INFO L273 TraceCheckUtils]: 15: Hoare triple {3736#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3737#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:03,108 INFO L273 TraceCheckUtils]: 16: Hoare triple {3737#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3737#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:03,110 INFO L273 TraceCheckUtils]: 17: Hoare triple {3737#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3738#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:03,110 INFO L273 TraceCheckUtils]: 18: Hoare triple {3738#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3738#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:03,112 INFO L273 TraceCheckUtils]: 19: Hoare triple {3738#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3739#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:03,112 INFO L273 TraceCheckUtils]: 20: Hoare triple {3739#(<= main_~a~0 7)} assume !(~a~0 < 100000); {3731#false} is VALID [2018-11-23 11:52:03,112 INFO L273 TraceCheckUtils]: 21: Hoare triple {3731#false} havoc ~i~0;~i~0 := 0; {3731#false} is VALID [2018-11-23 11:52:03,112 INFO L273 TraceCheckUtils]: 22: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3731#false} is VALID [2018-11-23 11:52:03,113 INFO L273 TraceCheckUtils]: 23: Hoare triple {3731#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3731#false} is VALID [2018-11-23 11:52:03,113 INFO L273 TraceCheckUtils]: 24: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3731#false} is VALID [2018-11-23 11:52:03,113 INFO L273 TraceCheckUtils]: 25: Hoare triple {3731#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3731#false} is VALID [2018-11-23 11:52:03,113 INFO L273 TraceCheckUtils]: 26: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3731#false} is VALID [2018-11-23 11:52:03,113 INFO L273 TraceCheckUtils]: 27: Hoare triple {3731#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3731#false} is VALID [2018-11-23 11:52:03,113 INFO L273 TraceCheckUtils]: 28: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3731#false} is VALID [2018-11-23 11:52:03,113 INFO L273 TraceCheckUtils]: 29: Hoare triple {3731#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3731#false} is VALID [2018-11-23 11:52:03,113 INFO L273 TraceCheckUtils]: 30: Hoare triple {3731#false} assume !(~i~0 < 100000); {3731#false} is VALID [2018-11-23 11:52:03,114 INFO L273 TraceCheckUtils]: 31: Hoare triple {3731#false} ~i~0 := 0; {3731#false} is VALID [2018-11-23 11:52:03,114 INFO L273 TraceCheckUtils]: 32: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3731#false} is VALID [2018-11-23 11:52:03,114 INFO L273 TraceCheckUtils]: 33: Hoare triple {3731#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3731#false} is VALID [2018-11-23 11:52:03,114 INFO L273 TraceCheckUtils]: 34: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3731#false} is VALID [2018-11-23 11:52:03,114 INFO L273 TraceCheckUtils]: 35: Hoare triple {3731#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3731#false} is VALID [2018-11-23 11:52:03,114 INFO L273 TraceCheckUtils]: 36: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3731#false} is VALID [2018-11-23 11:52:03,114 INFO L273 TraceCheckUtils]: 37: Hoare triple {3731#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3731#false} is VALID [2018-11-23 11:52:03,115 INFO L273 TraceCheckUtils]: 38: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3731#false} is VALID [2018-11-23 11:52:03,115 INFO L273 TraceCheckUtils]: 39: Hoare triple {3731#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3731#false} is VALID [2018-11-23 11:52:03,115 INFO L273 TraceCheckUtils]: 40: Hoare triple {3731#false} assume !(~i~0 < 100000); {3731#false} is VALID [2018-11-23 11:52:03,115 INFO L273 TraceCheckUtils]: 41: Hoare triple {3731#false} ~i~0 := 0; {3731#false} is VALID [2018-11-23 11:52:03,115 INFO L273 TraceCheckUtils]: 42: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3731#false} is VALID [2018-11-23 11:52:03,115 INFO L273 TraceCheckUtils]: 43: Hoare triple {3731#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3731#false} is VALID [2018-11-23 11:52:03,116 INFO L273 TraceCheckUtils]: 44: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3731#false} is VALID [2018-11-23 11:52:03,116 INFO L273 TraceCheckUtils]: 45: Hoare triple {3731#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3731#false} is VALID [2018-11-23 11:52:03,116 INFO L273 TraceCheckUtils]: 46: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3731#false} is VALID [2018-11-23 11:52:03,116 INFO L273 TraceCheckUtils]: 47: Hoare triple {3731#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3731#false} is VALID [2018-11-23 11:52:03,116 INFO L273 TraceCheckUtils]: 48: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3731#false} is VALID [2018-11-23 11:52:03,116 INFO L273 TraceCheckUtils]: 49: Hoare triple {3731#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3731#false} is VALID [2018-11-23 11:52:03,117 INFO L273 TraceCheckUtils]: 50: Hoare triple {3731#false} assume !(~i~0 < 100000); {3731#false} is VALID [2018-11-23 11:52:03,117 INFO L273 TraceCheckUtils]: 51: Hoare triple {3731#false} ~i~0 := 0; {3731#false} is VALID [2018-11-23 11:52:03,117 INFO L273 TraceCheckUtils]: 52: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3731#false} is VALID [2018-11-23 11:52:03,117 INFO L273 TraceCheckUtils]: 53: Hoare triple {3731#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3731#false} is VALID [2018-11-23 11:52:03,117 INFO L273 TraceCheckUtils]: 54: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3731#false} is VALID [2018-11-23 11:52:03,118 INFO L273 TraceCheckUtils]: 55: Hoare triple {3731#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3731#false} is VALID [2018-11-23 11:52:03,118 INFO L273 TraceCheckUtils]: 56: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3731#false} is VALID [2018-11-23 11:52:03,118 INFO L273 TraceCheckUtils]: 57: Hoare triple {3731#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3731#false} is VALID [2018-11-23 11:52:03,118 INFO L273 TraceCheckUtils]: 58: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3731#false} is VALID [2018-11-23 11:52:03,118 INFO L273 TraceCheckUtils]: 59: Hoare triple {3731#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3731#false} is VALID [2018-11-23 11:52:03,118 INFO L273 TraceCheckUtils]: 60: Hoare triple {3731#false} assume !(~i~0 < 100000); {3731#false} is VALID [2018-11-23 11:52:03,119 INFO L273 TraceCheckUtils]: 61: Hoare triple {3731#false} ~i~0 := 0; {3731#false} is VALID [2018-11-23 11:52:03,119 INFO L273 TraceCheckUtils]: 62: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {3731#false} is VALID [2018-11-23 11:52:03,119 INFO L273 TraceCheckUtils]: 63: Hoare triple {3731#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3731#false} is VALID [2018-11-23 11:52:03,119 INFO L273 TraceCheckUtils]: 64: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {3731#false} is VALID [2018-11-23 11:52:03,119 INFO L273 TraceCheckUtils]: 65: Hoare triple {3731#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3731#false} is VALID [2018-11-23 11:52:03,119 INFO L273 TraceCheckUtils]: 66: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {3731#false} is VALID [2018-11-23 11:52:03,120 INFO L273 TraceCheckUtils]: 67: Hoare triple {3731#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3731#false} is VALID [2018-11-23 11:52:03,120 INFO L273 TraceCheckUtils]: 68: Hoare triple {3731#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {3731#false} is VALID [2018-11-23 11:52:03,120 INFO L273 TraceCheckUtils]: 69: Hoare triple {3731#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3731#false} is VALID [2018-11-23 11:52:03,120 INFO L273 TraceCheckUtils]: 70: Hoare triple {3731#false} assume !(~i~0 < 100000); {3731#false} is VALID [2018-11-23 11:52:03,120 INFO L273 TraceCheckUtils]: 71: Hoare triple {3731#false} havoc ~x~0;~x~0 := 0; {3731#false} is VALID [2018-11-23 11:52:03,121 INFO L273 TraceCheckUtils]: 72: Hoare triple {3731#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {3731#false} is VALID [2018-11-23 11:52:03,121 INFO L256 TraceCheckUtils]: 73: Hoare triple {3731#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {3731#false} is VALID [2018-11-23 11:52:03,121 INFO L273 TraceCheckUtils]: 74: Hoare triple {3731#false} ~cond := #in~cond; {3731#false} is VALID [2018-11-23 11:52:03,121 INFO L273 TraceCheckUtils]: 75: Hoare triple {3731#false} assume 0 == ~cond; {3731#false} is VALID [2018-11-23 11:52:03,121 INFO L273 TraceCheckUtils]: 76: Hoare triple {3731#false} assume !false; {3731#false} is VALID [2018-11-23 11:52:03,125 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-23 11:52:03,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:03,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 11:52:03,154 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 77 [2018-11-23 11:52:03,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:03,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:52:03,269 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:03,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:52:03,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:52:03,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:52:03,270 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand 11 states. [2018-11-23 11:52:03,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:03,635 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2018-11-23 11:52:03,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:52:03,636 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 77 [2018-11-23 11:52:03,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:03,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:52:03,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 88 transitions. [2018-11-23 11:52:03,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:52:03,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 88 transitions. [2018-11-23 11:52:03,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 88 transitions. [2018-11-23 11:52:03,796 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 11:52:03,798 INFO L225 Difference]: With dead ends: 146 [2018-11-23 11:52:03,798 INFO L226 Difference]: Without dead ends: 85 [2018-11-23 11:52:03,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 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 11:52:03,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-23 11:52:03,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-11-23 11:52:03,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:03,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 84 states. [2018-11-23 11:52:03,925 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 84 states. [2018-11-23 11:52:03,925 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 84 states. [2018-11-23 11:52:03,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:03,927 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-11-23 11:52:03,927 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2018-11-23 11:52:03,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:03,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:03,928 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 85 states. [2018-11-23 11:52:03,928 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 85 states. [2018-11-23 11:52:03,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:03,930 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-11-23 11:52:03,930 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2018-11-23 11:52:03,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:03,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:03,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:03,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:03,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 11:52:03,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2018-11-23 11:52:03,933 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 77 [2018-11-23 11:52:03,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:03,933 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2018-11-23 11:52:03,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:52:03,933 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2018-11-23 11:52:03,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 11:52:03,934 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:03,935 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:03,935 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:03,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:03,935 INFO L82 PathProgramCache]: Analyzing trace with hash -869743938, now seen corresponding path program 8 times [2018-11-23 11:52:03,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:03,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:03,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:03,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:03,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:04,674 INFO L256 TraceCheckUtils]: 0: Hoare triple {4481#true} call ULTIMATE.init(); {4481#true} is VALID [2018-11-23 11:52:04,675 INFO L273 TraceCheckUtils]: 1: Hoare triple {4481#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4481#true} is VALID [2018-11-23 11:52:04,675 INFO L273 TraceCheckUtils]: 2: Hoare triple {4481#true} assume true; {4481#true} is VALID [2018-11-23 11:52:04,675 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4481#true} {4481#true} #119#return; {4481#true} is VALID [2018-11-23 11:52:04,676 INFO L256 TraceCheckUtils]: 4: Hoare triple {4481#true} call #t~ret16 := main(); {4481#true} is VALID [2018-11-23 11:52:04,692 INFO L273 TraceCheckUtils]: 5: Hoare triple {4481#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4483#(= main_~a~0 0)} is VALID [2018-11-23 11:52:04,701 INFO L273 TraceCheckUtils]: 6: Hoare triple {4483#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4483#(= main_~a~0 0)} is VALID [2018-11-23 11:52:04,711 INFO L273 TraceCheckUtils]: 7: Hoare triple {4483#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4484#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:04,711 INFO L273 TraceCheckUtils]: 8: Hoare triple {4484#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4484#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:04,712 INFO L273 TraceCheckUtils]: 9: Hoare triple {4484#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4485#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:04,712 INFO L273 TraceCheckUtils]: 10: Hoare triple {4485#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4485#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:04,713 INFO L273 TraceCheckUtils]: 11: Hoare triple {4485#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4486#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:04,713 INFO L273 TraceCheckUtils]: 12: Hoare triple {4486#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4486#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:04,714 INFO L273 TraceCheckUtils]: 13: Hoare triple {4486#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4487#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:04,714 INFO L273 TraceCheckUtils]: 14: Hoare triple {4487#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4487#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:04,714 INFO L273 TraceCheckUtils]: 15: Hoare triple {4487#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4488#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:04,715 INFO L273 TraceCheckUtils]: 16: Hoare triple {4488#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4488#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:04,715 INFO L273 TraceCheckUtils]: 17: Hoare triple {4488#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4489#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:04,716 INFO L273 TraceCheckUtils]: 18: Hoare triple {4489#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4489#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:04,717 INFO L273 TraceCheckUtils]: 19: Hoare triple {4489#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4490#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:04,717 INFO L273 TraceCheckUtils]: 20: Hoare triple {4490#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4490#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:04,718 INFO L273 TraceCheckUtils]: 21: Hoare triple {4490#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4491#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:04,719 INFO L273 TraceCheckUtils]: 22: Hoare triple {4491#(<= main_~a~0 8)} assume !(~a~0 < 100000); {4482#false} is VALID [2018-11-23 11:52:04,719 INFO L273 TraceCheckUtils]: 23: Hoare triple {4482#false} havoc ~i~0;~i~0 := 0; {4482#false} is VALID [2018-11-23 11:52:04,719 INFO L273 TraceCheckUtils]: 24: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4482#false} is VALID [2018-11-23 11:52:04,719 INFO L273 TraceCheckUtils]: 25: Hoare triple {4482#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4482#false} is VALID [2018-11-23 11:52:04,719 INFO L273 TraceCheckUtils]: 26: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4482#false} is VALID [2018-11-23 11:52:04,720 INFO L273 TraceCheckUtils]: 27: Hoare triple {4482#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4482#false} is VALID [2018-11-23 11:52:04,720 INFO L273 TraceCheckUtils]: 28: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4482#false} is VALID [2018-11-23 11:52:04,720 INFO L273 TraceCheckUtils]: 29: Hoare triple {4482#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4482#false} is VALID [2018-11-23 11:52:04,720 INFO L273 TraceCheckUtils]: 30: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4482#false} is VALID [2018-11-23 11:52:04,721 INFO L273 TraceCheckUtils]: 31: Hoare triple {4482#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4482#false} is VALID [2018-11-23 11:52:04,721 INFO L273 TraceCheckUtils]: 32: Hoare triple {4482#false} assume !(~i~0 < 100000); {4482#false} is VALID [2018-11-23 11:52:04,721 INFO L273 TraceCheckUtils]: 33: Hoare triple {4482#false} ~i~0 := 0; {4482#false} is VALID [2018-11-23 11:52:04,721 INFO L273 TraceCheckUtils]: 34: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4482#false} is VALID [2018-11-23 11:52:04,721 INFO L273 TraceCheckUtils]: 35: Hoare triple {4482#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4482#false} is VALID [2018-11-23 11:52:04,721 INFO L273 TraceCheckUtils]: 36: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4482#false} is VALID [2018-11-23 11:52:04,721 INFO L273 TraceCheckUtils]: 37: Hoare triple {4482#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4482#false} is VALID [2018-11-23 11:52:04,722 INFO L273 TraceCheckUtils]: 38: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4482#false} is VALID [2018-11-23 11:52:04,722 INFO L273 TraceCheckUtils]: 39: Hoare triple {4482#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4482#false} is VALID [2018-11-23 11:52:04,722 INFO L273 TraceCheckUtils]: 40: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4482#false} is VALID [2018-11-23 11:52:04,722 INFO L273 TraceCheckUtils]: 41: Hoare triple {4482#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4482#false} is VALID [2018-11-23 11:52:04,722 INFO L273 TraceCheckUtils]: 42: Hoare triple {4482#false} assume !(~i~0 < 100000); {4482#false} is VALID [2018-11-23 11:52:04,722 INFO L273 TraceCheckUtils]: 43: Hoare triple {4482#false} ~i~0 := 0; {4482#false} is VALID [2018-11-23 11:52:04,722 INFO L273 TraceCheckUtils]: 44: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4482#false} is VALID [2018-11-23 11:52:04,722 INFO L273 TraceCheckUtils]: 45: Hoare triple {4482#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4482#false} is VALID [2018-11-23 11:52:04,723 INFO L273 TraceCheckUtils]: 46: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4482#false} is VALID [2018-11-23 11:52:04,723 INFO L273 TraceCheckUtils]: 47: Hoare triple {4482#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4482#false} is VALID [2018-11-23 11:52:04,723 INFO L273 TraceCheckUtils]: 48: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4482#false} is VALID [2018-11-23 11:52:04,723 INFO L273 TraceCheckUtils]: 49: Hoare triple {4482#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4482#false} is VALID [2018-11-23 11:52:04,723 INFO L273 TraceCheckUtils]: 50: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4482#false} is VALID [2018-11-23 11:52:04,723 INFO L273 TraceCheckUtils]: 51: Hoare triple {4482#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4482#false} is VALID [2018-11-23 11:52:04,723 INFO L273 TraceCheckUtils]: 52: Hoare triple {4482#false} assume !(~i~0 < 100000); {4482#false} is VALID [2018-11-23 11:52:04,723 INFO L273 TraceCheckUtils]: 53: Hoare triple {4482#false} ~i~0 := 0; {4482#false} is VALID [2018-11-23 11:52:04,724 INFO L273 TraceCheckUtils]: 54: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4482#false} is VALID [2018-11-23 11:52:04,724 INFO L273 TraceCheckUtils]: 55: Hoare triple {4482#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4482#false} is VALID [2018-11-23 11:52:04,724 INFO L273 TraceCheckUtils]: 56: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4482#false} is VALID [2018-11-23 11:52:04,724 INFO L273 TraceCheckUtils]: 57: Hoare triple {4482#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4482#false} is VALID [2018-11-23 11:52:04,724 INFO L273 TraceCheckUtils]: 58: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4482#false} is VALID [2018-11-23 11:52:04,724 INFO L273 TraceCheckUtils]: 59: Hoare triple {4482#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4482#false} is VALID [2018-11-23 11:52:04,724 INFO L273 TraceCheckUtils]: 60: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4482#false} is VALID [2018-11-23 11:52:04,724 INFO L273 TraceCheckUtils]: 61: Hoare triple {4482#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4482#false} is VALID [2018-11-23 11:52:04,725 INFO L273 TraceCheckUtils]: 62: Hoare triple {4482#false} assume !(~i~0 < 100000); {4482#false} is VALID [2018-11-23 11:52:04,725 INFO L273 TraceCheckUtils]: 63: Hoare triple {4482#false} ~i~0 := 0; {4482#false} is VALID [2018-11-23 11:52:04,725 INFO L273 TraceCheckUtils]: 64: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {4482#false} is VALID [2018-11-23 11:52:04,725 INFO L273 TraceCheckUtils]: 65: Hoare triple {4482#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4482#false} is VALID [2018-11-23 11:52:04,725 INFO L273 TraceCheckUtils]: 66: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {4482#false} is VALID [2018-11-23 11:52:04,725 INFO L273 TraceCheckUtils]: 67: Hoare triple {4482#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4482#false} is VALID [2018-11-23 11:52:04,725 INFO L273 TraceCheckUtils]: 68: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {4482#false} is VALID [2018-11-23 11:52:04,725 INFO L273 TraceCheckUtils]: 69: Hoare triple {4482#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4482#false} is VALID [2018-11-23 11:52:04,725 INFO L273 TraceCheckUtils]: 70: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {4482#false} is VALID [2018-11-23 11:52:04,726 INFO L273 TraceCheckUtils]: 71: Hoare triple {4482#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4482#false} is VALID [2018-11-23 11:52:04,726 INFO L273 TraceCheckUtils]: 72: Hoare triple {4482#false} assume !(~i~0 < 100000); {4482#false} is VALID [2018-11-23 11:52:04,726 INFO L273 TraceCheckUtils]: 73: Hoare triple {4482#false} havoc ~x~0;~x~0 := 0; {4482#false} is VALID [2018-11-23 11:52:04,726 INFO L273 TraceCheckUtils]: 74: Hoare triple {4482#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {4482#false} is VALID [2018-11-23 11:52:04,726 INFO L256 TraceCheckUtils]: 75: Hoare triple {4482#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {4482#false} is VALID [2018-11-23 11:52:04,726 INFO L273 TraceCheckUtils]: 76: Hoare triple {4482#false} ~cond := #in~cond; {4482#false} is VALID [2018-11-23 11:52:04,726 INFO L273 TraceCheckUtils]: 77: Hoare triple {4482#false} assume 0 == ~cond; {4482#false} is VALID [2018-11-23 11:52:04,726 INFO L273 TraceCheckUtils]: 78: Hoare triple {4482#false} assume !false; {4482#false} is VALID [2018-11-23 11:52:04,730 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-23 11:52:04,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:04,730 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 11:52:04,745 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:52:04,802 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:52:04,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:04,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:04,975 INFO L256 TraceCheckUtils]: 0: Hoare triple {4481#true} call ULTIMATE.init(); {4481#true} is VALID [2018-11-23 11:52:04,975 INFO L273 TraceCheckUtils]: 1: Hoare triple {4481#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4481#true} is VALID [2018-11-23 11:52:04,975 INFO L273 TraceCheckUtils]: 2: Hoare triple {4481#true} assume true; {4481#true} is VALID [2018-11-23 11:52:04,976 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4481#true} {4481#true} #119#return; {4481#true} is VALID [2018-11-23 11:52:04,976 INFO L256 TraceCheckUtils]: 4: Hoare triple {4481#true} call #t~ret16 := main(); {4481#true} is VALID [2018-11-23 11:52:04,977 INFO L273 TraceCheckUtils]: 5: Hoare triple {4481#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4510#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:04,978 INFO L273 TraceCheckUtils]: 6: Hoare triple {4510#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4510#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:04,978 INFO L273 TraceCheckUtils]: 7: Hoare triple {4510#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4484#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:04,979 INFO L273 TraceCheckUtils]: 8: Hoare triple {4484#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4484#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:04,979 INFO L273 TraceCheckUtils]: 9: Hoare triple {4484#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4485#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:04,980 INFO L273 TraceCheckUtils]: 10: Hoare triple {4485#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4485#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:04,981 INFO L273 TraceCheckUtils]: 11: Hoare triple {4485#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4486#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:04,981 INFO L273 TraceCheckUtils]: 12: Hoare triple {4486#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4486#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:04,982 INFO L273 TraceCheckUtils]: 13: Hoare triple {4486#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4487#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:04,983 INFO L273 TraceCheckUtils]: 14: Hoare triple {4487#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4487#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:04,984 INFO L273 TraceCheckUtils]: 15: Hoare triple {4487#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4488#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:04,984 INFO L273 TraceCheckUtils]: 16: Hoare triple {4488#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4488#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:04,985 INFO L273 TraceCheckUtils]: 17: Hoare triple {4488#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4489#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:04,986 INFO L273 TraceCheckUtils]: 18: Hoare triple {4489#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4489#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:04,987 INFO L273 TraceCheckUtils]: 19: Hoare triple {4489#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4490#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:04,987 INFO L273 TraceCheckUtils]: 20: Hoare triple {4490#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4490#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:04,988 INFO L273 TraceCheckUtils]: 21: Hoare triple {4490#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4491#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:04,989 INFO L273 TraceCheckUtils]: 22: Hoare triple {4491#(<= main_~a~0 8)} assume !(~a~0 < 100000); {4482#false} is VALID [2018-11-23 11:52:04,989 INFO L273 TraceCheckUtils]: 23: Hoare triple {4482#false} havoc ~i~0;~i~0 := 0; {4482#false} is VALID [2018-11-23 11:52:04,990 INFO L273 TraceCheckUtils]: 24: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4482#false} is VALID [2018-11-23 11:52:04,990 INFO L273 TraceCheckUtils]: 25: Hoare triple {4482#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4482#false} is VALID [2018-11-23 11:52:04,990 INFO L273 TraceCheckUtils]: 26: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4482#false} is VALID [2018-11-23 11:52:04,990 INFO L273 TraceCheckUtils]: 27: Hoare triple {4482#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4482#false} is VALID [2018-11-23 11:52:04,991 INFO L273 TraceCheckUtils]: 28: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4482#false} is VALID [2018-11-23 11:52:04,991 INFO L273 TraceCheckUtils]: 29: Hoare triple {4482#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4482#false} is VALID [2018-11-23 11:52:04,991 INFO L273 TraceCheckUtils]: 30: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4482#false} is VALID [2018-11-23 11:52:04,992 INFO L273 TraceCheckUtils]: 31: Hoare triple {4482#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4482#false} is VALID [2018-11-23 11:52:04,992 INFO L273 TraceCheckUtils]: 32: Hoare triple {4482#false} assume !(~i~0 < 100000); {4482#false} is VALID [2018-11-23 11:52:04,992 INFO L273 TraceCheckUtils]: 33: Hoare triple {4482#false} ~i~0 := 0; {4482#false} is VALID [2018-11-23 11:52:04,992 INFO L273 TraceCheckUtils]: 34: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4482#false} is VALID [2018-11-23 11:52:04,992 INFO L273 TraceCheckUtils]: 35: Hoare triple {4482#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4482#false} is VALID [2018-11-23 11:52:04,993 INFO L273 TraceCheckUtils]: 36: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4482#false} is VALID [2018-11-23 11:52:04,993 INFO L273 TraceCheckUtils]: 37: Hoare triple {4482#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4482#false} is VALID [2018-11-23 11:52:04,993 INFO L273 TraceCheckUtils]: 38: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4482#false} is VALID [2018-11-23 11:52:04,993 INFO L273 TraceCheckUtils]: 39: Hoare triple {4482#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4482#false} is VALID [2018-11-23 11:52:04,993 INFO L273 TraceCheckUtils]: 40: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4482#false} is VALID [2018-11-23 11:52:04,994 INFO L273 TraceCheckUtils]: 41: Hoare triple {4482#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4482#false} is VALID [2018-11-23 11:52:04,994 INFO L273 TraceCheckUtils]: 42: Hoare triple {4482#false} assume !(~i~0 < 100000); {4482#false} is VALID [2018-11-23 11:52:04,994 INFO L273 TraceCheckUtils]: 43: Hoare triple {4482#false} ~i~0 := 0; {4482#false} is VALID [2018-11-23 11:52:04,994 INFO L273 TraceCheckUtils]: 44: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4482#false} is VALID [2018-11-23 11:52:04,994 INFO L273 TraceCheckUtils]: 45: Hoare triple {4482#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4482#false} is VALID [2018-11-23 11:52:04,995 INFO L273 TraceCheckUtils]: 46: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4482#false} is VALID [2018-11-23 11:52:04,995 INFO L273 TraceCheckUtils]: 47: Hoare triple {4482#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4482#false} is VALID [2018-11-23 11:52:04,995 INFO L273 TraceCheckUtils]: 48: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4482#false} is VALID [2018-11-23 11:52:04,995 INFO L273 TraceCheckUtils]: 49: Hoare triple {4482#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4482#false} is VALID [2018-11-23 11:52:04,995 INFO L273 TraceCheckUtils]: 50: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4482#false} is VALID [2018-11-23 11:52:04,996 INFO L273 TraceCheckUtils]: 51: Hoare triple {4482#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4482#false} is VALID [2018-11-23 11:52:04,996 INFO L273 TraceCheckUtils]: 52: Hoare triple {4482#false} assume !(~i~0 < 100000); {4482#false} is VALID [2018-11-23 11:52:04,996 INFO L273 TraceCheckUtils]: 53: Hoare triple {4482#false} ~i~0 := 0; {4482#false} is VALID [2018-11-23 11:52:04,996 INFO L273 TraceCheckUtils]: 54: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4482#false} is VALID [2018-11-23 11:52:04,996 INFO L273 TraceCheckUtils]: 55: Hoare triple {4482#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4482#false} is VALID [2018-11-23 11:52:04,997 INFO L273 TraceCheckUtils]: 56: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4482#false} is VALID [2018-11-23 11:52:04,997 INFO L273 TraceCheckUtils]: 57: Hoare triple {4482#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4482#false} is VALID [2018-11-23 11:52:04,997 INFO L273 TraceCheckUtils]: 58: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4482#false} is VALID [2018-11-23 11:52:04,997 INFO L273 TraceCheckUtils]: 59: Hoare triple {4482#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4482#false} is VALID [2018-11-23 11:52:04,998 INFO L273 TraceCheckUtils]: 60: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4482#false} is VALID [2018-11-23 11:52:04,998 INFO L273 TraceCheckUtils]: 61: Hoare triple {4482#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4482#false} is VALID [2018-11-23 11:52:04,998 INFO L273 TraceCheckUtils]: 62: Hoare triple {4482#false} assume !(~i~0 < 100000); {4482#false} is VALID [2018-11-23 11:52:04,998 INFO L273 TraceCheckUtils]: 63: Hoare triple {4482#false} ~i~0 := 0; {4482#false} is VALID [2018-11-23 11:52:04,998 INFO L273 TraceCheckUtils]: 64: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {4482#false} is VALID [2018-11-23 11:52:04,999 INFO L273 TraceCheckUtils]: 65: Hoare triple {4482#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4482#false} is VALID [2018-11-23 11:52:04,999 INFO L273 TraceCheckUtils]: 66: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {4482#false} is VALID [2018-11-23 11:52:04,999 INFO L273 TraceCheckUtils]: 67: Hoare triple {4482#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4482#false} is VALID [2018-11-23 11:52:04,999 INFO L273 TraceCheckUtils]: 68: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {4482#false} is VALID [2018-11-23 11:52:04,999 INFO L273 TraceCheckUtils]: 69: Hoare triple {4482#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4482#false} is VALID [2018-11-23 11:52:05,000 INFO L273 TraceCheckUtils]: 70: Hoare triple {4482#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {4482#false} is VALID [2018-11-23 11:52:05,000 INFO L273 TraceCheckUtils]: 71: Hoare triple {4482#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4482#false} is VALID [2018-11-23 11:52:05,000 INFO L273 TraceCheckUtils]: 72: Hoare triple {4482#false} assume !(~i~0 < 100000); {4482#false} is VALID [2018-11-23 11:52:05,000 INFO L273 TraceCheckUtils]: 73: Hoare triple {4482#false} havoc ~x~0;~x~0 := 0; {4482#false} is VALID [2018-11-23 11:52:05,000 INFO L273 TraceCheckUtils]: 74: Hoare triple {4482#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {4482#false} is VALID [2018-11-23 11:52:05,001 INFO L256 TraceCheckUtils]: 75: Hoare triple {4482#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {4482#false} is VALID [2018-11-23 11:52:05,001 INFO L273 TraceCheckUtils]: 76: Hoare triple {4482#false} ~cond := #in~cond; {4482#false} is VALID [2018-11-23 11:52:05,001 INFO L273 TraceCheckUtils]: 77: Hoare triple {4482#false} assume 0 == ~cond; {4482#false} is VALID [2018-11-23 11:52:05,001 INFO L273 TraceCheckUtils]: 78: Hoare triple {4482#false} assume !false; {4482#false} is VALID [2018-11-23 11:52:05,008 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-23 11:52:05,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:05,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 11:52:05,028 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 79 [2018-11-23 11:52:05,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:05,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:52:05,088 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:05,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:52:05,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:52:05,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:52:05,089 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 12 states. [2018-11-23 11:52:05,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:05,490 INFO L93 Difference]: Finished difference Result 148 states and 160 transitions. [2018-11-23 11:52:05,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:52:05,491 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 79 [2018-11-23 11:52:05,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:05,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:52:05,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 90 transitions. [2018-11-23 11:52:05,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:52:05,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 90 transitions. [2018-11-23 11:52:05,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 90 transitions. [2018-11-23 11:52:06,052 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:06,054 INFO L225 Difference]: With dead ends: 148 [2018-11-23 11:52:06,055 INFO L226 Difference]: Without dead ends: 87 [2018-11-23 11:52:06,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:52:06,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-23 11:52:06,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-11-23 11:52:06,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:06,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 86 states. [2018-11-23 11:52:06,107 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 86 states. [2018-11-23 11:52:06,108 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 86 states. [2018-11-23 11:52:06,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:06,110 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2018-11-23 11:52:06,110 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-11-23 11:52:06,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:06,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:06,110 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 87 states. [2018-11-23 11:52:06,110 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 87 states. [2018-11-23 11:52:06,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:06,112 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2018-11-23 11:52:06,113 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-11-23 11:52:06,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:06,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:06,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:06,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:06,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 11:52:06,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2018-11-23 11:52:06,115 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 79 [2018-11-23 11:52:06,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:06,116 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2018-11-23 11:52:06,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:52:06,116 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2018-11-23 11:52:06,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 11:52:06,117 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:06,117 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:06,117 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:06,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:06,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1326082780, now seen corresponding path program 9 times [2018-11-23 11:52:06,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:06,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:06,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:06,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:06,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:06,936 INFO L256 TraceCheckUtils]: 0: Hoare triple {5249#true} call ULTIMATE.init(); {5249#true} is VALID [2018-11-23 11:52:06,936 INFO L273 TraceCheckUtils]: 1: Hoare triple {5249#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5249#true} is VALID [2018-11-23 11:52:06,936 INFO L273 TraceCheckUtils]: 2: Hoare triple {5249#true} assume true; {5249#true} is VALID [2018-11-23 11:52:06,936 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5249#true} {5249#true} #119#return; {5249#true} is VALID [2018-11-23 11:52:06,937 INFO L256 TraceCheckUtils]: 4: Hoare triple {5249#true} call #t~ret16 := main(); {5249#true} is VALID [2018-11-23 11:52:06,937 INFO L273 TraceCheckUtils]: 5: Hoare triple {5249#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {5251#(= main_~a~0 0)} is VALID [2018-11-23 11:52:06,938 INFO L273 TraceCheckUtils]: 6: Hoare triple {5251#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5251#(= main_~a~0 0)} is VALID [2018-11-23 11:52:06,938 INFO L273 TraceCheckUtils]: 7: Hoare triple {5251#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5252#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:06,939 INFO L273 TraceCheckUtils]: 8: Hoare triple {5252#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5252#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:06,939 INFO L273 TraceCheckUtils]: 9: Hoare triple {5252#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5253#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:06,940 INFO L273 TraceCheckUtils]: 10: Hoare triple {5253#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5253#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:06,940 INFO L273 TraceCheckUtils]: 11: Hoare triple {5253#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5254#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:06,959 INFO L273 TraceCheckUtils]: 12: Hoare triple {5254#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5254#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:06,968 INFO L273 TraceCheckUtils]: 13: Hoare triple {5254#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5255#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:06,981 INFO L273 TraceCheckUtils]: 14: Hoare triple {5255#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5255#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:06,986 INFO L273 TraceCheckUtils]: 15: Hoare triple {5255#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5256#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:06,986 INFO L273 TraceCheckUtils]: 16: Hoare triple {5256#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5256#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:06,987 INFO L273 TraceCheckUtils]: 17: Hoare triple {5256#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5257#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:06,987 INFO L273 TraceCheckUtils]: 18: Hoare triple {5257#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5257#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:06,988 INFO L273 TraceCheckUtils]: 19: Hoare triple {5257#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5258#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:06,988 INFO L273 TraceCheckUtils]: 20: Hoare triple {5258#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5258#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:06,989 INFO L273 TraceCheckUtils]: 21: Hoare triple {5258#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5259#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:06,990 INFO L273 TraceCheckUtils]: 22: Hoare triple {5259#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5259#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:06,990 INFO L273 TraceCheckUtils]: 23: Hoare triple {5259#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5260#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:06,991 INFO L273 TraceCheckUtils]: 24: Hoare triple {5260#(<= main_~a~0 9)} assume !(~a~0 < 100000); {5250#false} is VALID [2018-11-23 11:52:06,991 INFO L273 TraceCheckUtils]: 25: Hoare triple {5250#false} havoc ~i~0;~i~0 := 0; {5250#false} is VALID [2018-11-23 11:52:06,992 INFO L273 TraceCheckUtils]: 26: Hoare triple {5250#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5250#false} is VALID [2018-11-23 11:52:06,992 INFO L273 TraceCheckUtils]: 27: Hoare triple {5250#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5250#false} is VALID [2018-11-23 11:52:06,992 INFO L273 TraceCheckUtils]: 28: Hoare triple {5250#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5250#false} is VALID [2018-11-23 11:52:06,992 INFO L273 TraceCheckUtils]: 29: Hoare triple {5250#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5250#false} is VALID [2018-11-23 11:52:06,992 INFO L273 TraceCheckUtils]: 30: Hoare triple {5250#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5250#false} is VALID [2018-11-23 11:52:06,993 INFO L273 TraceCheckUtils]: 31: Hoare triple {5250#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5250#false} is VALID [2018-11-23 11:52:06,993 INFO L273 TraceCheckUtils]: 32: Hoare triple {5250#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5250#false} is VALID [2018-11-23 11:52:06,993 INFO L273 TraceCheckUtils]: 33: Hoare triple {5250#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5250#false} is VALID [2018-11-23 11:52:06,993 INFO L273 TraceCheckUtils]: 34: Hoare triple {5250#false} assume !(~i~0 < 100000); {5250#false} is VALID [2018-11-23 11:52:06,993 INFO L273 TraceCheckUtils]: 35: Hoare triple {5250#false} ~i~0 := 0; {5250#false} is VALID [2018-11-23 11:52:06,994 INFO L273 TraceCheckUtils]: 36: Hoare triple {5250#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5250#false} is VALID [2018-11-23 11:52:06,994 INFO L273 TraceCheckUtils]: 37: Hoare triple {5250#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5250#false} is VALID [2018-11-23 11:52:06,994 INFO L273 TraceCheckUtils]: 38: Hoare triple {5250#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5250#false} is VALID [2018-11-23 11:52:06,994 INFO L273 TraceCheckUtils]: 39: Hoare triple {5250#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5250#false} is VALID [2018-11-23 11:52:06,994 INFO L273 TraceCheckUtils]: 40: Hoare triple {5250#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5250#false} is VALID [2018-11-23 11:52:06,994 INFO L273 TraceCheckUtils]: 41: Hoare triple {5250#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5250#false} is VALID [2018-11-23 11:52:06,994 INFO L273 TraceCheckUtils]: 42: Hoare triple {5250#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5250#false} is VALID [2018-11-23 11:52:06,994 INFO L273 TraceCheckUtils]: 43: Hoare triple {5250#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5250#false} is VALID [2018-11-23 11:52:06,994 INFO L273 TraceCheckUtils]: 44: Hoare triple {5250#false} assume !(~i~0 < 100000); {5250#false} is VALID [2018-11-23 11:52:06,995 INFO L273 TraceCheckUtils]: 45: Hoare triple {5250#false} ~i~0 := 0; {5250#false} is VALID [2018-11-23 11:52:06,995 INFO L273 TraceCheckUtils]: 46: Hoare triple {5250#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5250#false} is VALID [2018-11-23 11:52:06,995 INFO L273 TraceCheckUtils]: 47: Hoare triple {5250#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5250#false} is VALID [2018-11-23 11:52:06,995 INFO L273 TraceCheckUtils]: 48: Hoare triple {5250#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5250#false} is VALID [2018-11-23 11:52:06,995 INFO L273 TraceCheckUtils]: 49: Hoare triple {5250#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5250#false} is VALID [2018-11-23 11:52:06,995 INFO L273 TraceCheckUtils]: 50: Hoare triple {5250#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5250#false} is VALID [2018-11-23 11:52:06,995 INFO L273 TraceCheckUtils]: 51: Hoare triple {5250#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5250#false} is VALID [2018-11-23 11:52:06,995 INFO L273 TraceCheckUtils]: 52: Hoare triple {5250#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5250#false} is VALID [2018-11-23 11:52:06,996 INFO L273 TraceCheckUtils]: 53: Hoare triple {5250#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5250#false} is VALID [2018-11-23 11:52:06,996 INFO L273 TraceCheckUtils]: 54: Hoare triple {5250#false} assume !(~i~0 < 100000); {5250#false} is VALID [2018-11-23 11:52:06,996 INFO L273 TraceCheckUtils]: 55: Hoare triple {5250#false} ~i~0 := 0; {5250#false} is VALID [2018-11-23 11:52:06,996 INFO L273 TraceCheckUtils]: 56: Hoare triple {5250#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5250#false} is VALID [2018-11-23 11:52:06,996 INFO L273 TraceCheckUtils]: 57: Hoare triple {5250#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5250#false} is VALID [2018-11-23 11:52:06,996 INFO L273 TraceCheckUtils]: 58: Hoare triple {5250#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5250#false} is VALID [2018-11-23 11:52:06,996 INFO L273 TraceCheckUtils]: 59: Hoare triple {5250#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5250#false} is VALID [2018-11-23 11:52:06,996 INFO L273 TraceCheckUtils]: 60: Hoare triple {5250#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5250#false} is VALID [2018-11-23 11:52:06,997 INFO L273 TraceCheckUtils]: 61: Hoare triple {5250#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5250#false} is VALID [2018-11-23 11:52:06,997 INFO L273 TraceCheckUtils]: 62: Hoare triple {5250#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5250#false} is VALID [2018-11-23 11:52:06,997 INFO L273 TraceCheckUtils]: 63: Hoare triple {5250#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5250#false} is VALID [2018-11-23 11:52:06,997 INFO L273 TraceCheckUtils]: 64: Hoare triple {5250#false} assume !(~i~0 < 100000); {5250#false} is VALID [2018-11-23 11:52:06,997 INFO L273 TraceCheckUtils]: 65: Hoare triple {5250#false} ~i~0 := 0; {5250#false} is VALID [2018-11-23 11:52:06,997 INFO L273 TraceCheckUtils]: 66: Hoare triple {5250#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {5250#false} is VALID [2018-11-23 11:52:06,997 INFO L273 TraceCheckUtils]: 67: Hoare triple {5250#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5250#false} is VALID [2018-11-23 11:52:06,997 INFO L273 TraceCheckUtils]: 68: Hoare triple {5250#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {5250#false} is VALID [2018-11-23 11:52:06,997 INFO L273 TraceCheckUtils]: 69: Hoare triple {5250#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5250#false} is VALID [2018-11-23 11:52:06,998 INFO L273 TraceCheckUtils]: 70: Hoare triple {5250#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {5250#false} is VALID [2018-11-23 11:52:06,998 INFO L273 TraceCheckUtils]: 71: Hoare triple {5250#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5250#false} is VALID [2018-11-23 11:52:06,998 INFO L273 TraceCheckUtils]: 72: Hoare triple {5250#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {5250#false} is VALID [2018-11-23 11:52:06,998 INFO L273 TraceCheckUtils]: 73: Hoare triple {5250#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5250#false} is VALID [2018-11-23 11:52:06,998 INFO L273 TraceCheckUtils]: 74: Hoare triple {5250#false} assume !(~i~0 < 100000); {5250#false} is VALID [2018-11-23 11:52:06,998 INFO L273 TraceCheckUtils]: 75: Hoare triple {5250#false} havoc ~x~0;~x~0 := 0; {5250#false} is VALID [2018-11-23 11:52:06,998 INFO L273 TraceCheckUtils]: 76: Hoare triple {5250#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {5250#false} is VALID [2018-11-23 11:52:06,998 INFO L256 TraceCheckUtils]: 77: Hoare triple {5250#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {5250#false} is VALID [2018-11-23 11:52:06,999 INFO L273 TraceCheckUtils]: 78: Hoare triple {5250#false} ~cond := #in~cond; {5250#false} is VALID [2018-11-23 11:52:06,999 INFO L273 TraceCheckUtils]: 79: Hoare triple {5250#false} assume 0 == ~cond; {5250#false} is VALID [2018-11-23 11:52:06,999 INFO L273 TraceCheckUtils]: 80: Hoare triple {5250#false} assume !false; {5250#false} is VALID [2018-11-23 11:52:07,003 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-23 11:52:07,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:07,003 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 11:52:07,023 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:52:07,466 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 11:52:07,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:07,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:07,801 INFO L256 TraceCheckUtils]: 0: Hoare triple {5249#true} call ULTIMATE.init(); {5249#true} is VALID [2018-11-23 11:52:07,801 INFO L273 TraceCheckUtils]: 1: Hoare triple {5249#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5249#true} is VALID [2018-11-23 11:52:07,801 INFO L273 TraceCheckUtils]: 2: Hoare triple {5249#true} assume true; {5249#true} is VALID [2018-11-23 11:52:07,802 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5249#true} {5249#true} #119#return; {5249#true} is VALID [2018-11-23 11:52:07,802 INFO L256 TraceCheckUtils]: 4: Hoare triple {5249#true} call #t~ret16 := main(); {5249#true} is VALID [2018-11-23 11:52:07,802 INFO L273 TraceCheckUtils]: 5: Hoare triple {5249#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {5249#true} is VALID [2018-11-23 11:52:07,802 INFO L273 TraceCheckUtils]: 6: Hoare triple {5249#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5249#true} is VALID [2018-11-23 11:52:07,802 INFO L273 TraceCheckUtils]: 7: Hoare triple {5249#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5249#true} is VALID [2018-11-23 11:52:07,803 INFO L273 TraceCheckUtils]: 8: Hoare triple {5249#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5249#true} is VALID [2018-11-23 11:52:07,803 INFO L273 TraceCheckUtils]: 9: Hoare triple {5249#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5249#true} is VALID [2018-11-23 11:52:07,803 INFO L273 TraceCheckUtils]: 10: Hoare triple {5249#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5249#true} is VALID [2018-11-23 11:52:07,803 INFO L273 TraceCheckUtils]: 11: Hoare triple {5249#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5249#true} is VALID [2018-11-23 11:52:07,803 INFO L273 TraceCheckUtils]: 12: Hoare triple {5249#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5249#true} is VALID [2018-11-23 11:52:07,803 INFO L273 TraceCheckUtils]: 13: Hoare triple {5249#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5249#true} is VALID [2018-11-23 11:52:07,803 INFO L273 TraceCheckUtils]: 14: Hoare triple {5249#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5249#true} is VALID [2018-11-23 11:52:07,804 INFO L273 TraceCheckUtils]: 15: Hoare triple {5249#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5249#true} is VALID [2018-11-23 11:52:07,804 INFO L273 TraceCheckUtils]: 16: Hoare triple {5249#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5249#true} is VALID [2018-11-23 11:52:07,804 INFO L273 TraceCheckUtils]: 17: Hoare triple {5249#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5249#true} is VALID [2018-11-23 11:52:07,804 INFO L273 TraceCheckUtils]: 18: Hoare triple {5249#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5249#true} is VALID [2018-11-23 11:52:07,804 INFO L273 TraceCheckUtils]: 19: Hoare triple {5249#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5249#true} is VALID [2018-11-23 11:52:07,804 INFO L273 TraceCheckUtils]: 20: Hoare triple {5249#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5249#true} is VALID [2018-11-23 11:52:07,804 INFO L273 TraceCheckUtils]: 21: Hoare triple {5249#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5249#true} is VALID [2018-11-23 11:52:07,805 INFO L273 TraceCheckUtils]: 22: Hoare triple {5249#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5330#(< main_~a~0 100000)} is VALID [2018-11-23 11:52:07,805 INFO L273 TraceCheckUtils]: 23: Hoare triple {5330#(< main_~a~0 100000)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5334#(<= main_~a~0 100000)} is VALID [2018-11-23 11:52:07,805 INFO L273 TraceCheckUtils]: 24: Hoare triple {5334#(<= main_~a~0 100000)} assume !(~a~0 < 100000); {5249#true} is VALID [2018-11-23 11:52:07,806 INFO L273 TraceCheckUtils]: 25: Hoare triple {5249#true} havoc ~i~0;~i~0 := 0; {5249#true} is VALID [2018-11-23 11:52:07,806 INFO L273 TraceCheckUtils]: 26: Hoare triple {5249#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5249#true} is VALID [2018-11-23 11:52:07,806 INFO L273 TraceCheckUtils]: 27: Hoare triple {5249#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5249#true} is VALID [2018-11-23 11:52:07,806 INFO L273 TraceCheckUtils]: 28: Hoare triple {5249#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5249#true} is VALID [2018-11-23 11:52:07,806 INFO L273 TraceCheckUtils]: 29: Hoare triple {5249#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5249#true} is VALID [2018-11-23 11:52:07,806 INFO L273 TraceCheckUtils]: 30: Hoare triple {5249#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5249#true} is VALID [2018-11-23 11:52:07,806 INFO L273 TraceCheckUtils]: 31: Hoare triple {5249#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5249#true} is VALID [2018-11-23 11:52:07,807 INFO L273 TraceCheckUtils]: 32: Hoare triple {5249#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5362#(< main_~i~0 100000)} is VALID [2018-11-23 11:52:07,807 INFO L273 TraceCheckUtils]: 33: Hoare triple {5362#(< main_~i~0 100000)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5366#(<= main_~i~0 100000)} is VALID [2018-11-23 11:52:07,807 INFO L273 TraceCheckUtils]: 34: Hoare triple {5366#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {5249#true} is VALID [2018-11-23 11:52:07,807 INFO L273 TraceCheckUtils]: 35: Hoare triple {5249#true} ~i~0 := 0; {5249#true} is VALID [2018-11-23 11:52:07,807 INFO L273 TraceCheckUtils]: 36: Hoare triple {5249#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5249#true} is VALID [2018-11-23 11:52:07,808 INFO L273 TraceCheckUtils]: 37: Hoare triple {5249#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5249#true} is VALID [2018-11-23 11:52:07,808 INFO L273 TraceCheckUtils]: 38: Hoare triple {5249#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5249#true} is VALID [2018-11-23 11:52:07,808 INFO L273 TraceCheckUtils]: 39: Hoare triple {5249#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5249#true} is VALID [2018-11-23 11:52:07,808 INFO L273 TraceCheckUtils]: 40: Hoare triple {5249#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5249#true} is VALID [2018-11-23 11:52:07,808 INFO L273 TraceCheckUtils]: 41: Hoare triple {5249#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5249#true} is VALID [2018-11-23 11:52:07,808 INFO L273 TraceCheckUtils]: 42: Hoare triple {5249#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5249#true} is VALID [2018-11-23 11:52:07,808 INFO L273 TraceCheckUtils]: 43: Hoare triple {5249#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5249#true} is VALID [2018-11-23 11:52:07,808 INFO L273 TraceCheckUtils]: 44: Hoare triple {5249#true} assume !(~i~0 < 100000); {5249#true} is VALID [2018-11-23 11:52:07,809 INFO L273 TraceCheckUtils]: 45: Hoare triple {5249#true} ~i~0 := 0; {5403#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:07,809 INFO L273 TraceCheckUtils]: 46: Hoare triple {5403#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5403#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:07,810 INFO L273 TraceCheckUtils]: 47: Hoare triple {5403#(<= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5410#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:07,810 INFO L273 TraceCheckUtils]: 48: Hoare triple {5410#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5410#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:07,810 INFO L273 TraceCheckUtils]: 49: Hoare triple {5410#(<= main_~i~0 1)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5417#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:07,811 INFO L273 TraceCheckUtils]: 50: Hoare triple {5417#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5417#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:07,811 INFO L273 TraceCheckUtils]: 51: Hoare triple {5417#(<= main_~i~0 2)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5424#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:07,811 INFO L273 TraceCheckUtils]: 52: Hoare triple {5424#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5424#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:07,812 INFO L273 TraceCheckUtils]: 53: Hoare triple {5424#(<= main_~i~0 3)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5431#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:07,813 INFO L273 TraceCheckUtils]: 54: Hoare triple {5431#(<= main_~i~0 4)} assume !(~i~0 < 100000); {5250#false} is VALID [2018-11-23 11:52:07,813 INFO L273 TraceCheckUtils]: 55: Hoare triple {5250#false} ~i~0 := 0; {5250#false} is VALID [2018-11-23 11:52:07,813 INFO L273 TraceCheckUtils]: 56: Hoare triple {5250#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5250#false} is VALID [2018-11-23 11:52:07,813 INFO L273 TraceCheckUtils]: 57: Hoare triple {5250#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5250#false} is VALID [2018-11-23 11:52:07,813 INFO L273 TraceCheckUtils]: 58: Hoare triple {5250#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5250#false} is VALID [2018-11-23 11:52:07,814 INFO L273 TraceCheckUtils]: 59: Hoare triple {5250#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5250#false} is VALID [2018-11-23 11:52:07,814 INFO L273 TraceCheckUtils]: 60: Hoare triple {5250#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5250#false} is VALID [2018-11-23 11:52:07,814 INFO L273 TraceCheckUtils]: 61: Hoare triple {5250#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5250#false} is VALID [2018-11-23 11:52:07,814 INFO L273 TraceCheckUtils]: 62: Hoare triple {5250#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5250#false} is VALID [2018-11-23 11:52:07,815 INFO L273 TraceCheckUtils]: 63: Hoare triple {5250#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5250#false} is VALID [2018-11-23 11:52:07,815 INFO L273 TraceCheckUtils]: 64: Hoare triple {5250#false} assume !(~i~0 < 100000); {5250#false} is VALID [2018-11-23 11:52:07,815 INFO L273 TraceCheckUtils]: 65: Hoare triple {5250#false} ~i~0 := 0; {5250#false} is VALID [2018-11-23 11:52:07,815 INFO L273 TraceCheckUtils]: 66: Hoare triple {5250#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {5250#false} is VALID [2018-11-23 11:52:07,815 INFO L273 TraceCheckUtils]: 67: Hoare triple {5250#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5250#false} is VALID [2018-11-23 11:52:07,816 INFO L273 TraceCheckUtils]: 68: Hoare triple {5250#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {5250#false} is VALID [2018-11-23 11:52:07,816 INFO L273 TraceCheckUtils]: 69: Hoare triple {5250#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5250#false} is VALID [2018-11-23 11:52:07,816 INFO L273 TraceCheckUtils]: 70: Hoare triple {5250#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {5250#false} is VALID [2018-11-23 11:52:07,816 INFO L273 TraceCheckUtils]: 71: Hoare triple {5250#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5250#false} is VALID [2018-11-23 11:52:07,816 INFO L273 TraceCheckUtils]: 72: Hoare triple {5250#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {5250#false} is VALID [2018-11-23 11:52:07,817 INFO L273 TraceCheckUtils]: 73: Hoare triple {5250#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5250#false} is VALID [2018-11-23 11:52:07,817 INFO L273 TraceCheckUtils]: 74: Hoare triple {5250#false} assume !(~i~0 < 100000); {5250#false} is VALID [2018-11-23 11:52:07,817 INFO L273 TraceCheckUtils]: 75: Hoare triple {5250#false} havoc ~x~0;~x~0 := 0; {5250#false} is VALID [2018-11-23 11:52:07,817 INFO L273 TraceCheckUtils]: 76: Hoare triple {5250#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {5250#false} is VALID [2018-11-23 11:52:07,817 INFO L256 TraceCheckUtils]: 77: Hoare triple {5250#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {5250#false} is VALID [2018-11-23 11:52:07,818 INFO L273 TraceCheckUtils]: 78: Hoare triple {5250#false} ~cond := #in~cond; {5250#false} is VALID [2018-11-23 11:52:07,818 INFO L273 TraceCheckUtils]: 79: Hoare triple {5250#false} assume 0 == ~cond; {5250#false} is VALID [2018-11-23 11:52:07,818 INFO L273 TraceCheckUtils]: 80: Hoare triple {5250#false} assume !false; {5250#false} is VALID [2018-11-23 11:52:07,821 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 24 proven. 16 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-23 11:52:07,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:07,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-11-23 11:52:07,843 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 81 [2018-11-23 11:52:07,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:07,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 11:52:07,915 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:07,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 11:52:07,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 11:52:07,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:52:07,917 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand 21 states. [2018-11-23 11:52:09,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:09,802 INFO L93 Difference]: Finished difference Result 171 states and 194 transitions. [2018-11-23 11:52:09,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 11:52:09,802 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 81 [2018-11-23 11:52:09,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:09,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:52:09,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 159 transitions. [2018-11-23 11:52:09,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:52:09,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 159 transitions. [2018-11-23 11:52:09,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 159 transitions. [2018-11-23 11:52:09,987 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:09,990 INFO L225 Difference]: With dead ends: 171 [2018-11-23 11:52:09,990 INFO L226 Difference]: Without dead ends: 110 [2018-11-23 11:52:09,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=196, Invalid=560, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:52:09,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-23 11:52:10,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-11-23 11:52:10,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:10,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 110 states. [2018-11-23 11:52:10,167 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 110 states. [2018-11-23 11:52:10,167 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 110 states. [2018-11-23 11:52:10,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:10,170 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2018-11-23 11:52:10,171 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 116 transitions. [2018-11-23 11:52:10,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:10,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:10,171 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 110 states. [2018-11-23 11:52:10,171 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 110 states. [2018-11-23 11:52:10,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:10,173 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2018-11-23 11:52:10,174 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 116 transitions. [2018-11-23 11:52:10,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:10,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:10,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:10,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:10,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-23 11:52:10,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 116 transitions. [2018-11-23 11:52:10,177 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 116 transitions. Word has length 81 [2018-11-23 11:52:10,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:10,178 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 116 transitions. [2018-11-23 11:52:10,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 11:52:10,178 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 116 transitions. [2018-11-23 11:52:10,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-23 11:52:10,179 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:10,179 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:10,179 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:10,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:10,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1401691076, now seen corresponding path program 10 times [2018-11-23 11:52:10,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:10,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:10,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:10,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:10,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:11,110 INFO L256 TraceCheckUtils]: 0: Hoare triple {6170#true} call ULTIMATE.init(); {6170#true} is VALID [2018-11-23 11:52:11,110 INFO L273 TraceCheckUtils]: 1: Hoare triple {6170#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6170#true} is VALID [2018-11-23 11:52:11,111 INFO L273 TraceCheckUtils]: 2: Hoare triple {6170#true} assume true; {6170#true} is VALID [2018-11-23 11:52:11,111 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6170#true} {6170#true} #119#return; {6170#true} is VALID [2018-11-23 11:52:11,111 INFO L256 TraceCheckUtils]: 4: Hoare triple {6170#true} call #t~ret16 := main(); {6170#true} is VALID [2018-11-23 11:52:11,112 INFO L273 TraceCheckUtils]: 5: Hoare triple {6170#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6172#(= main_~a~0 0)} is VALID [2018-11-23 11:52:11,112 INFO L273 TraceCheckUtils]: 6: Hoare triple {6172#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6172#(= main_~a~0 0)} is VALID [2018-11-23 11:52:11,113 INFO L273 TraceCheckUtils]: 7: Hoare triple {6172#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6173#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:11,113 INFO L273 TraceCheckUtils]: 8: Hoare triple {6173#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6173#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:11,114 INFO L273 TraceCheckUtils]: 9: Hoare triple {6173#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6174#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:11,115 INFO L273 TraceCheckUtils]: 10: Hoare triple {6174#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6174#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:11,116 INFO L273 TraceCheckUtils]: 11: Hoare triple {6174#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6175#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:11,116 INFO L273 TraceCheckUtils]: 12: Hoare triple {6175#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6175#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:11,117 INFO L273 TraceCheckUtils]: 13: Hoare triple {6175#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6176#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:11,117 INFO L273 TraceCheckUtils]: 14: Hoare triple {6176#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6176#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:11,118 INFO L273 TraceCheckUtils]: 15: Hoare triple {6176#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6177#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:11,119 INFO L273 TraceCheckUtils]: 16: Hoare triple {6177#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6177#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:11,120 INFO L273 TraceCheckUtils]: 17: Hoare triple {6177#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6178#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:11,120 INFO L273 TraceCheckUtils]: 18: Hoare triple {6178#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6178#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:11,121 INFO L273 TraceCheckUtils]: 19: Hoare triple {6178#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6179#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:11,121 INFO L273 TraceCheckUtils]: 20: Hoare triple {6179#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6179#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:11,122 INFO L273 TraceCheckUtils]: 21: Hoare triple {6179#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6180#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:11,123 INFO L273 TraceCheckUtils]: 22: Hoare triple {6180#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6180#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:11,124 INFO L273 TraceCheckUtils]: 23: Hoare triple {6180#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6181#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:11,124 INFO L273 TraceCheckUtils]: 24: Hoare triple {6181#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6181#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:11,131 INFO L273 TraceCheckUtils]: 25: Hoare triple {6181#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6182#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:11,131 INFO L273 TraceCheckUtils]: 26: Hoare triple {6182#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6182#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:11,132 INFO L273 TraceCheckUtils]: 27: Hoare triple {6182#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6183#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:11,132 INFO L273 TraceCheckUtils]: 28: Hoare triple {6183#(<= main_~a~0 11)} assume !(~a~0 < 100000); {6171#false} is VALID [2018-11-23 11:52:11,132 INFO L273 TraceCheckUtils]: 29: Hoare triple {6171#false} havoc ~i~0;~i~0 := 0; {6171#false} is VALID [2018-11-23 11:52:11,132 INFO L273 TraceCheckUtils]: 30: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6171#false} is VALID [2018-11-23 11:52:11,133 INFO L273 TraceCheckUtils]: 31: Hoare triple {6171#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6171#false} is VALID [2018-11-23 11:52:11,133 INFO L273 TraceCheckUtils]: 32: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6171#false} is VALID [2018-11-23 11:52:11,133 INFO L273 TraceCheckUtils]: 33: Hoare triple {6171#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6171#false} is VALID [2018-11-23 11:52:11,133 INFO L273 TraceCheckUtils]: 34: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6171#false} is VALID [2018-11-23 11:52:11,133 INFO L273 TraceCheckUtils]: 35: Hoare triple {6171#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6171#false} is VALID [2018-11-23 11:52:11,133 INFO L273 TraceCheckUtils]: 36: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6171#false} is VALID [2018-11-23 11:52:11,133 INFO L273 TraceCheckUtils]: 37: Hoare triple {6171#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6171#false} is VALID [2018-11-23 11:52:11,133 INFO L273 TraceCheckUtils]: 38: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6171#false} is VALID [2018-11-23 11:52:11,133 INFO L273 TraceCheckUtils]: 39: Hoare triple {6171#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6171#false} is VALID [2018-11-23 11:52:11,134 INFO L273 TraceCheckUtils]: 40: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6171#false} is VALID [2018-11-23 11:52:11,134 INFO L273 TraceCheckUtils]: 41: Hoare triple {6171#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6171#false} is VALID [2018-11-23 11:52:11,134 INFO L273 TraceCheckUtils]: 42: Hoare triple {6171#false} assume !(~i~0 < 100000); {6171#false} is VALID [2018-11-23 11:52:11,134 INFO L273 TraceCheckUtils]: 43: Hoare triple {6171#false} ~i~0 := 0; {6171#false} is VALID [2018-11-23 11:52:11,134 INFO L273 TraceCheckUtils]: 44: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6171#false} is VALID [2018-11-23 11:52:11,134 INFO L273 TraceCheckUtils]: 45: Hoare triple {6171#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6171#false} is VALID [2018-11-23 11:52:11,134 INFO L273 TraceCheckUtils]: 46: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6171#false} is VALID [2018-11-23 11:52:11,134 INFO L273 TraceCheckUtils]: 47: Hoare triple {6171#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6171#false} is VALID [2018-11-23 11:52:11,135 INFO L273 TraceCheckUtils]: 48: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6171#false} is VALID [2018-11-23 11:52:11,135 INFO L273 TraceCheckUtils]: 49: Hoare triple {6171#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6171#false} is VALID [2018-11-23 11:52:11,135 INFO L273 TraceCheckUtils]: 50: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6171#false} is VALID [2018-11-23 11:52:11,135 INFO L273 TraceCheckUtils]: 51: Hoare triple {6171#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6171#false} is VALID [2018-11-23 11:52:11,135 INFO L273 TraceCheckUtils]: 52: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6171#false} is VALID [2018-11-23 11:52:11,135 INFO L273 TraceCheckUtils]: 53: Hoare triple {6171#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6171#false} is VALID [2018-11-23 11:52:11,135 INFO L273 TraceCheckUtils]: 54: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6171#false} is VALID [2018-11-23 11:52:11,135 INFO L273 TraceCheckUtils]: 55: Hoare triple {6171#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6171#false} is VALID [2018-11-23 11:52:11,136 INFO L273 TraceCheckUtils]: 56: Hoare triple {6171#false} assume !(~i~0 < 100000); {6171#false} is VALID [2018-11-23 11:52:11,136 INFO L273 TraceCheckUtils]: 57: Hoare triple {6171#false} ~i~0 := 0; {6171#false} is VALID [2018-11-23 11:52:11,136 INFO L273 TraceCheckUtils]: 58: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6171#false} is VALID [2018-11-23 11:52:11,136 INFO L273 TraceCheckUtils]: 59: Hoare triple {6171#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6171#false} is VALID [2018-11-23 11:52:11,136 INFO L273 TraceCheckUtils]: 60: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6171#false} is VALID [2018-11-23 11:52:11,136 INFO L273 TraceCheckUtils]: 61: Hoare triple {6171#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6171#false} is VALID [2018-11-23 11:52:11,136 INFO L273 TraceCheckUtils]: 62: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6171#false} is VALID [2018-11-23 11:52:11,136 INFO L273 TraceCheckUtils]: 63: Hoare triple {6171#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6171#false} is VALID [2018-11-23 11:52:11,137 INFO L273 TraceCheckUtils]: 64: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6171#false} is VALID [2018-11-23 11:52:11,137 INFO L273 TraceCheckUtils]: 65: Hoare triple {6171#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6171#false} is VALID [2018-11-23 11:52:11,137 INFO L273 TraceCheckUtils]: 66: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6171#false} is VALID [2018-11-23 11:52:11,137 INFO L273 TraceCheckUtils]: 67: Hoare triple {6171#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6171#false} is VALID [2018-11-23 11:52:11,137 INFO L273 TraceCheckUtils]: 68: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6171#false} is VALID [2018-11-23 11:52:11,137 INFO L273 TraceCheckUtils]: 69: Hoare triple {6171#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6171#false} is VALID [2018-11-23 11:52:11,137 INFO L273 TraceCheckUtils]: 70: Hoare triple {6171#false} assume !(~i~0 < 100000); {6171#false} is VALID [2018-11-23 11:52:11,137 INFO L273 TraceCheckUtils]: 71: Hoare triple {6171#false} ~i~0 := 0; {6171#false} is VALID [2018-11-23 11:52:11,137 INFO L273 TraceCheckUtils]: 72: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6171#false} is VALID [2018-11-23 11:52:11,138 INFO L273 TraceCheckUtils]: 73: Hoare triple {6171#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6171#false} is VALID [2018-11-23 11:52:11,138 INFO L273 TraceCheckUtils]: 74: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6171#false} is VALID [2018-11-23 11:52:11,138 INFO L273 TraceCheckUtils]: 75: Hoare triple {6171#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6171#false} is VALID [2018-11-23 11:52:11,138 INFO L273 TraceCheckUtils]: 76: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6171#false} is VALID [2018-11-23 11:52:11,138 INFO L273 TraceCheckUtils]: 77: Hoare triple {6171#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6171#false} is VALID [2018-11-23 11:52:11,138 INFO L273 TraceCheckUtils]: 78: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6171#false} is VALID [2018-11-23 11:52:11,138 INFO L273 TraceCheckUtils]: 79: Hoare triple {6171#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6171#false} is VALID [2018-11-23 11:52:11,138 INFO L273 TraceCheckUtils]: 80: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6171#false} is VALID [2018-11-23 11:52:11,139 INFO L273 TraceCheckUtils]: 81: Hoare triple {6171#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6171#false} is VALID [2018-11-23 11:52:11,139 INFO L273 TraceCheckUtils]: 82: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6171#false} is VALID [2018-11-23 11:52:11,139 INFO L273 TraceCheckUtils]: 83: Hoare triple {6171#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6171#false} is VALID [2018-11-23 11:52:11,139 INFO L273 TraceCheckUtils]: 84: Hoare triple {6171#false} assume !(~i~0 < 100000); {6171#false} is VALID [2018-11-23 11:52:11,139 INFO L273 TraceCheckUtils]: 85: Hoare triple {6171#false} ~i~0 := 0; {6171#false} is VALID [2018-11-23 11:52:11,139 INFO L273 TraceCheckUtils]: 86: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6171#false} is VALID [2018-11-23 11:52:11,139 INFO L273 TraceCheckUtils]: 87: Hoare triple {6171#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6171#false} is VALID [2018-11-23 11:52:11,139 INFO L273 TraceCheckUtils]: 88: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6171#false} is VALID [2018-11-23 11:52:11,140 INFO L273 TraceCheckUtils]: 89: Hoare triple {6171#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6171#false} is VALID [2018-11-23 11:52:11,140 INFO L273 TraceCheckUtils]: 90: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6171#false} is VALID [2018-11-23 11:52:11,140 INFO L273 TraceCheckUtils]: 91: Hoare triple {6171#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6171#false} is VALID [2018-11-23 11:52:11,140 INFO L273 TraceCheckUtils]: 92: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6171#false} is VALID [2018-11-23 11:52:11,140 INFO L273 TraceCheckUtils]: 93: Hoare triple {6171#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6171#false} is VALID [2018-11-23 11:52:11,140 INFO L273 TraceCheckUtils]: 94: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6171#false} is VALID [2018-11-23 11:52:11,140 INFO L273 TraceCheckUtils]: 95: Hoare triple {6171#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6171#false} is VALID [2018-11-23 11:52:11,140 INFO L273 TraceCheckUtils]: 96: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6171#false} is VALID [2018-11-23 11:52:11,140 INFO L273 TraceCheckUtils]: 97: Hoare triple {6171#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6171#false} is VALID [2018-11-23 11:52:11,141 INFO L273 TraceCheckUtils]: 98: Hoare triple {6171#false} assume !(~i~0 < 100000); {6171#false} is VALID [2018-11-23 11:52:11,141 INFO L273 TraceCheckUtils]: 99: Hoare triple {6171#false} havoc ~x~0;~x~0 := 0; {6171#false} is VALID [2018-11-23 11:52:11,141 INFO L273 TraceCheckUtils]: 100: Hoare triple {6171#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {6171#false} is VALID [2018-11-23 11:52:11,141 INFO L256 TraceCheckUtils]: 101: Hoare triple {6171#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {6171#false} is VALID [2018-11-23 11:52:11,141 INFO L273 TraceCheckUtils]: 102: Hoare triple {6171#false} ~cond := #in~cond; {6171#false} is VALID [2018-11-23 11:52:11,141 INFO L273 TraceCheckUtils]: 103: Hoare triple {6171#false} assume 0 == ~cond; {6171#false} is VALID [2018-11-23 11:52:11,141 INFO L273 TraceCheckUtils]: 104: Hoare triple {6171#false} assume !false; {6171#false} is VALID [2018-11-23 11:52:11,146 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-23 11:52:11,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:11,146 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 11:52:11,155 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:52:11,211 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:52:11,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:11,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:11,393 INFO L256 TraceCheckUtils]: 0: Hoare triple {6170#true} call ULTIMATE.init(); {6170#true} is VALID [2018-11-23 11:52:11,394 INFO L273 TraceCheckUtils]: 1: Hoare triple {6170#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6170#true} is VALID [2018-11-23 11:52:11,394 INFO L273 TraceCheckUtils]: 2: Hoare triple {6170#true} assume true; {6170#true} is VALID [2018-11-23 11:52:11,394 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6170#true} {6170#true} #119#return; {6170#true} is VALID [2018-11-23 11:52:11,395 INFO L256 TraceCheckUtils]: 4: Hoare triple {6170#true} call #t~ret16 := main(); {6170#true} is VALID [2018-11-23 11:52:11,396 INFO L273 TraceCheckUtils]: 5: Hoare triple {6170#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6202#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:11,397 INFO L273 TraceCheckUtils]: 6: Hoare triple {6202#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6202#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:11,397 INFO L273 TraceCheckUtils]: 7: Hoare triple {6202#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6173#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:11,398 INFO L273 TraceCheckUtils]: 8: Hoare triple {6173#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6173#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:11,398 INFO L273 TraceCheckUtils]: 9: Hoare triple {6173#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6174#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:11,398 INFO L273 TraceCheckUtils]: 10: Hoare triple {6174#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6174#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:11,399 INFO L273 TraceCheckUtils]: 11: Hoare triple {6174#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6175#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:11,399 INFO L273 TraceCheckUtils]: 12: Hoare triple {6175#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6175#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:11,400 INFO L273 TraceCheckUtils]: 13: Hoare triple {6175#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6176#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:11,401 INFO L273 TraceCheckUtils]: 14: Hoare triple {6176#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6176#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:11,401 INFO L273 TraceCheckUtils]: 15: Hoare triple {6176#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6177#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:11,402 INFO L273 TraceCheckUtils]: 16: Hoare triple {6177#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6177#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:11,403 INFO L273 TraceCheckUtils]: 17: Hoare triple {6177#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6178#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:11,403 INFO L273 TraceCheckUtils]: 18: Hoare triple {6178#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6178#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:11,404 INFO L273 TraceCheckUtils]: 19: Hoare triple {6178#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6179#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:11,405 INFO L273 TraceCheckUtils]: 20: Hoare triple {6179#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6179#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:11,406 INFO L273 TraceCheckUtils]: 21: Hoare triple {6179#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6180#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:11,406 INFO L273 TraceCheckUtils]: 22: Hoare triple {6180#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6180#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:11,407 INFO L273 TraceCheckUtils]: 23: Hoare triple {6180#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6181#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:11,407 INFO L273 TraceCheckUtils]: 24: Hoare triple {6181#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6181#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:11,408 INFO L273 TraceCheckUtils]: 25: Hoare triple {6181#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6182#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:11,409 INFO L273 TraceCheckUtils]: 26: Hoare triple {6182#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6182#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:11,409 INFO L273 TraceCheckUtils]: 27: Hoare triple {6182#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6183#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:11,410 INFO L273 TraceCheckUtils]: 28: Hoare triple {6183#(<= main_~a~0 11)} assume !(~a~0 < 100000); {6171#false} is VALID [2018-11-23 11:52:11,410 INFO L273 TraceCheckUtils]: 29: Hoare triple {6171#false} havoc ~i~0;~i~0 := 0; {6171#false} is VALID [2018-11-23 11:52:11,411 INFO L273 TraceCheckUtils]: 30: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6171#false} is VALID [2018-11-23 11:52:11,411 INFO L273 TraceCheckUtils]: 31: Hoare triple {6171#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6171#false} is VALID [2018-11-23 11:52:11,411 INFO L273 TraceCheckUtils]: 32: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6171#false} is VALID [2018-11-23 11:52:11,411 INFO L273 TraceCheckUtils]: 33: Hoare triple {6171#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6171#false} is VALID [2018-11-23 11:52:11,411 INFO L273 TraceCheckUtils]: 34: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6171#false} is VALID [2018-11-23 11:52:11,412 INFO L273 TraceCheckUtils]: 35: Hoare triple {6171#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6171#false} is VALID [2018-11-23 11:52:11,412 INFO L273 TraceCheckUtils]: 36: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6171#false} is VALID [2018-11-23 11:52:11,412 INFO L273 TraceCheckUtils]: 37: Hoare triple {6171#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6171#false} is VALID [2018-11-23 11:52:11,412 INFO L273 TraceCheckUtils]: 38: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6171#false} is VALID [2018-11-23 11:52:11,413 INFO L273 TraceCheckUtils]: 39: Hoare triple {6171#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6171#false} is VALID [2018-11-23 11:52:11,413 INFO L273 TraceCheckUtils]: 40: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6171#false} is VALID [2018-11-23 11:52:11,413 INFO L273 TraceCheckUtils]: 41: Hoare triple {6171#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6171#false} is VALID [2018-11-23 11:52:11,413 INFO L273 TraceCheckUtils]: 42: Hoare triple {6171#false} assume !(~i~0 < 100000); {6171#false} is VALID [2018-11-23 11:52:11,413 INFO L273 TraceCheckUtils]: 43: Hoare triple {6171#false} ~i~0 := 0; {6171#false} is VALID [2018-11-23 11:52:11,413 INFO L273 TraceCheckUtils]: 44: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6171#false} is VALID [2018-11-23 11:52:11,413 INFO L273 TraceCheckUtils]: 45: Hoare triple {6171#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6171#false} is VALID [2018-11-23 11:52:11,413 INFO L273 TraceCheckUtils]: 46: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6171#false} is VALID [2018-11-23 11:52:11,414 INFO L273 TraceCheckUtils]: 47: Hoare triple {6171#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6171#false} is VALID [2018-11-23 11:52:11,414 INFO L273 TraceCheckUtils]: 48: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6171#false} is VALID [2018-11-23 11:52:11,414 INFO L273 TraceCheckUtils]: 49: Hoare triple {6171#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6171#false} is VALID [2018-11-23 11:52:11,414 INFO L273 TraceCheckUtils]: 50: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6171#false} is VALID [2018-11-23 11:52:11,414 INFO L273 TraceCheckUtils]: 51: Hoare triple {6171#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6171#false} is VALID [2018-11-23 11:52:11,414 INFO L273 TraceCheckUtils]: 52: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6171#false} is VALID [2018-11-23 11:52:11,414 INFO L273 TraceCheckUtils]: 53: Hoare triple {6171#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6171#false} is VALID [2018-11-23 11:52:11,414 INFO L273 TraceCheckUtils]: 54: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6171#false} is VALID [2018-11-23 11:52:11,415 INFO L273 TraceCheckUtils]: 55: Hoare triple {6171#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6171#false} is VALID [2018-11-23 11:52:11,415 INFO L273 TraceCheckUtils]: 56: Hoare triple {6171#false} assume !(~i~0 < 100000); {6171#false} is VALID [2018-11-23 11:52:11,415 INFO L273 TraceCheckUtils]: 57: Hoare triple {6171#false} ~i~0 := 0; {6171#false} is VALID [2018-11-23 11:52:11,415 INFO L273 TraceCheckUtils]: 58: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6171#false} is VALID [2018-11-23 11:52:11,415 INFO L273 TraceCheckUtils]: 59: Hoare triple {6171#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6171#false} is VALID [2018-11-23 11:52:11,415 INFO L273 TraceCheckUtils]: 60: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6171#false} is VALID [2018-11-23 11:52:11,415 INFO L273 TraceCheckUtils]: 61: Hoare triple {6171#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6171#false} is VALID [2018-11-23 11:52:11,415 INFO L273 TraceCheckUtils]: 62: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6171#false} is VALID [2018-11-23 11:52:11,416 INFO L273 TraceCheckUtils]: 63: Hoare triple {6171#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6171#false} is VALID [2018-11-23 11:52:11,416 INFO L273 TraceCheckUtils]: 64: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6171#false} is VALID [2018-11-23 11:52:11,416 INFO L273 TraceCheckUtils]: 65: Hoare triple {6171#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6171#false} is VALID [2018-11-23 11:52:11,416 INFO L273 TraceCheckUtils]: 66: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6171#false} is VALID [2018-11-23 11:52:11,416 INFO L273 TraceCheckUtils]: 67: Hoare triple {6171#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6171#false} is VALID [2018-11-23 11:52:11,416 INFO L273 TraceCheckUtils]: 68: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6171#false} is VALID [2018-11-23 11:52:11,416 INFO L273 TraceCheckUtils]: 69: Hoare triple {6171#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6171#false} is VALID [2018-11-23 11:52:11,416 INFO L273 TraceCheckUtils]: 70: Hoare triple {6171#false} assume !(~i~0 < 100000); {6171#false} is VALID [2018-11-23 11:52:11,416 INFO L273 TraceCheckUtils]: 71: Hoare triple {6171#false} ~i~0 := 0; {6171#false} is VALID [2018-11-23 11:52:11,417 INFO L273 TraceCheckUtils]: 72: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6171#false} is VALID [2018-11-23 11:52:11,417 INFO L273 TraceCheckUtils]: 73: Hoare triple {6171#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6171#false} is VALID [2018-11-23 11:52:11,417 INFO L273 TraceCheckUtils]: 74: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6171#false} is VALID [2018-11-23 11:52:11,417 INFO L273 TraceCheckUtils]: 75: Hoare triple {6171#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6171#false} is VALID [2018-11-23 11:52:11,417 INFO L273 TraceCheckUtils]: 76: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6171#false} is VALID [2018-11-23 11:52:11,417 INFO L273 TraceCheckUtils]: 77: Hoare triple {6171#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6171#false} is VALID [2018-11-23 11:52:11,417 INFO L273 TraceCheckUtils]: 78: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6171#false} is VALID [2018-11-23 11:52:11,417 INFO L273 TraceCheckUtils]: 79: Hoare triple {6171#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6171#false} is VALID [2018-11-23 11:52:11,418 INFO L273 TraceCheckUtils]: 80: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6171#false} is VALID [2018-11-23 11:52:11,418 INFO L273 TraceCheckUtils]: 81: Hoare triple {6171#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6171#false} is VALID [2018-11-23 11:52:11,418 INFO L273 TraceCheckUtils]: 82: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6171#false} is VALID [2018-11-23 11:52:11,418 INFO L273 TraceCheckUtils]: 83: Hoare triple {6171#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6171#false} is VALID [2018-11-23 11:52:11,418 INFO L273 TraceCheckUtils]: 84: Hoare triple {6171#false} assume !(~i~0 < 100000); {6171#false} is VALID [2018-11-23 11:52:11,418 INFO L273 TraceCheckUtils]: 85: Hoare triple {6171#false} ~i~0 := 0; {6171#false} is VALID [2018-11-23 11:52:11,418 INFO L273 TraceCheckUtils]: 86: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6171#false} is VALID [2018-11-23 11:52:11,418 INFO L273 TraceCheckUtils]: 87: Hoare triple {6171#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6171#false} is VALID [2018-11-23 11:52:11,419 INFO L273 TraceCheckUtils]: 88: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6171#false} is VALID [2018-11-23 11:52:11,419 INFO L273 TraceCheckUtils]: 89: Hoare triple {6171#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6171#false} is VALID [2018-11-23 11:52:11,419 INFO L273 TraceCheckUtils]: 90: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6171#false} is VALID [2018-11-23 11:52:11,419 INFO L273 TraceCheckUtils]: 91: Hoare triple {6171#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6171#false} is VALID [2018-11-23 11:52:11,419 INFO L273 TraceCheckUtils]: 92: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6171#false} is VALID [2018-11-23 11:52:11,419 INFO L273 TraceCheckUtils]: 93: Hoare triple {6171#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6171#false} is VALID [2018-11-23 11:52:11,419 INFO L273 TraceCheckUtils]: 94: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6171#false} is VALID [2018-11-23 11:52:11,419 INFO L273 TraceCheckUtils]: 95: Hoare triple {6171#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6171#false} is VALID [2018-11-23 11:52:11,419 INFO L273 TraceCheckUtils]: 96: Hoare triple {6171#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6171#false} is VALID [2018-11-23 11:52:11,420 INFO L273 TraceCheckUtils]: 97: Hoare triple {6171#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6171#false} is VALID [2018-11-23 11:52:11,420 INFO L273 TraceCheckUtils]: 98: Hoare triple {6171#false} assume !(~i~0 < 100000); {6171#false} is VALID [2018-11-23 11:52:11,420 INFO L273 TraceCheckUtils]: 99: Hoare triple {6171#false} havoc ~x~0;~x~0 := 0; {6171#false} is VALID [2018-11-23 11:52:11,420 INFO L273 TraceCheckUtils]: 100: Hoare triple {6171#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {6171#false} is VALID [2018-11-23 11:52:11,420 INFO L256 TraceCheckUtils]: 101: Hoare triple {6171#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {6171#false} is VALID [2018-11-23 11:52:11,420 INFO L273 TraceCheckUtils]: 102: Hoare triple {6171#false} ~cond := #in~cond; {6171#false} is VALID [2018-11-23 11:52:11,420 INFO L273 TraceCheckUtils]: 103: Hoare triple {6171#false} assume 0 == ~cond; {6171#false} is VALID [2018-11-23 11:52:11,420 INFO L273 TraceCheckUtils]: 104: Hoare triple {6171#false} assume !false; {6171#false} is VALID [2018-11-23 11:52:11,425 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-23 11:52:11,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:11,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 11:52:11,445 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 105 [2018-11-23 11:52:11,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:11,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:52:11,503 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 11:52:11,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:52:11,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:52:11,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:52:11,505 INFO L87 Difference]: Start difference. First operand 110 states and 116 transitions. Second operand 15 states. [2018-11-23 11:52:11,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:11,926 INFO L93 Difference]: Finished difference Result 194 states and 206 transitions. [2018-11-23 11:52:11,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:52:11,926 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 105 [2018-11-23 11:52:11,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:11,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:52:11,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 96 transitions. [2018-11-23 11:52:11,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:52:11,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 96 transitions. [2018-11-23 11:52:11,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 96 transitions. [2018-11-23 11:52:12,559 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 11:52:12,563 INFO L225 Difference]: With dead ends: 194 [2018-11-23 11:52:12,563 INFO L226 Difference]: Without dead ends: 113 [2018-11-23 11:52:12,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 105 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 11:52:12,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-23 11:52:12,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2018-11-23 11:52:12,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:12,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand 112 states. [2018-11-23 11:52:12,653 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 112 states. [2018-11-23 11:52:12,654 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 112 states. [2018-11-23 11:52:12,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:12,656 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2018-11-23 11:52:12,657 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-11-23 11:52:12,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:12,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:12,658 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 113 states. [2018-11-23 11:52:12,658 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 113 states. [2018-11-23 11:52:12,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:12,661 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2018-11-23 11:52:12,661 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-11-23 11:52:12,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:12,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:12,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:12,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:12,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-23 11:52:12,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2018-11-23 11:52:12,666 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 105 [2018-11-23 11:52:12,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:12,666 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2018-11-23 11:52:12,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:52:12,666 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2018-11-23 11:52:12,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-23 11:52:12,667 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:12,668 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:12,668 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:12,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:12,669 INFO L82 PathProgramCache]: Analyzing trace with hash -106186142, now seen corresponding path program 11 times [2018-11-23 11:52:12,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:12,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:12,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:12,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:12,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:13,542 INFO L256 TraceCheckUtils]: 0: Hoare triple {7179#true} call ULTIMATE.init(); {7179#true} is VALID [2018-11-23 11:52:13,542 INFO L273 TraceCheckUtils]: 1: Hoare triple {7179#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7179#true} is VALID [2018-11-23 11:52:13,543 INFO L273 TraceCheckUtils]: 2: Hoare triple {7179#true} assume true; {7179#true} is VALID [2018-11-23 11:52:13,543 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7179#true} {7179#true} #119#return; {7179#true} is VALID [2018-11-23 11:52:13,543 INFO L256 TraceCheckUtils]: 4: Hoare triple {7179#true} call #t~ret16 := main(); {7179#true} is VALID [2018-11-23 11:52:13,544 INFO L273 TraceCheckUtils]: 5: Hoare triple {7179#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {7181#(= main_~a~0 0)} is VALID [2018-11-23 11:52:13,544 INFO L273 TraceCheckUtils]: 6: Hoare triple {7181#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7181#(= main_~a~0 0)} is VALID [2018-11-23 11:52:13,545 INFO L273 TraceCheckUtils]: 7: Hoare triple {7181#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7182#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:13,545 INFO L273 TraceCheckUtils]: 8: Hoare triple {7182#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7182#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:13,546 INFO L273 TraceCheckUtils]: 9: Hoare triple {7182#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7183#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:13,547 INFO L273 TraceCheckUtils]: 10: Hoare triple {7183#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7183#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:13,548 INFO L273 TraceCheckUtils]: 11: Hoare triple {7183#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7184#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:13,548 INFO L273 TraceCheckUtils]: 12: Hoare triple {7184#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7184#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:13,549 INFO L273 TraceCheckUtils]: 13: Hoare triple {7184#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7185#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:13,549 INFO L273 TraceCheckUtils]: 14: Hoare triple {7185#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7185#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:13,550 INFO L273 TraceCheckUtils]: 15: Hoare triple {7185#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7186#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:13,551 INFO L273 TraceCheckUtils]: 16: Hoare triple {7186#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7186#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:13,552 INFO L273 TraceCheckUtils]: 17: Hoare triple {7186#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7187#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:13,552 INFO L273 TraceCheckUtils]: 18: Hoare triple {7187#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7187#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:13,553 INFO L273 TraceCheckUtils]: 19: Hoare triple {7187#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7188#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:13,553 INFO L273 TraceCheckUtils]: 20: Hoare triple {7188#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7188#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:13,554 INFO L273 TraceCheckUtils]: 21: Hoare triple {7188#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7189#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:13,555 INFO L273 TraceCheckUtils]: 22: Hoare triple {7189#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7189#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:13,556 INFO L273 TraceCheckUtils]: 23: Hoare triple {7189#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7190#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:13,556 INFO L273 TraceCheckUtils]: 24: Hoare triple {7190#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7190#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:13,557 INFO L273 TraceCheckUtils]: 25: Hoare triple {7190#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7191#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:13,557 INFO L273 TraceCheckUtils]: 26: Hoare triple {7191#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7191#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:13,575 INFO L273 TraceCheckUtils]: 27: Hoare triple {7191#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7192#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:13,579 INFO L273 TraceCheckUtils]: 28: Hoare triple {7192#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7192#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:13,580 INFO L273 TraceCheckUtils]: 29: Hoare triple {7192#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7193#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:13,580 INFO L273 TraceCheckUtils]: 30: Hoare triple {7193#(<= main_~a~0 12)} assume !(~a~0 < 100000); {7180#false} is VALID [2018-11-23 11:52:13,580 INFO L273 TraceCheckUtils]: 31: Hoare triple {7180#false} havoc ~i~0;~i~0 := 0; {7180#false} is VALID [2018-11-23 11:52:13,580 INFO L273 TraceCheckUtils]: 32: Hoare triple {7180#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7180#false} is VALID [2018-11-23 11:52:13,580 INFO L273 TraceCheckUtils]: 33: Hoare triple {7180#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7180#false} is VALID [2018-11-23 11:52:13,581 INFO L273 TraceCheckUtils]: 34: Hoare triple {7180#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7180#false} is VALID [2018-11-23 11:52:13,581 INFO L273 TraceCheckUtils]: 35: Hoare triple {7180#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7180#false} is VALID [2018-11-23 11:52:13,581 INFO L273 TraceCheckUtils]: 36: Hoare triple {7180#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7180#false} is VALID [2018-11-23 11:52:13,581 INFO L273 TraceCheckUtils]: 37: Hoare triple {7180#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7180#false} is VALID [2018-11-23 11:52:13,581 INFO L273 TraceCheckUtils]: 38: Hoare triple {7180#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7180#false} is VALID [2018-11-23 11:52:13,581 INFO L273 TraceCheckUtils]: 39: Hoare triple {7180#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7180#false} is VALID [2018-11-23 11:52:13,581 INFO L273 TraceCheckUtils]: 40: Hoare triple {7180#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7180#false} is VALID [2018-11-23 11:52:13,581 INFO L273 TraceCheckUtils]: 41: Hoare triple {7180#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7180#false} is VALID [2018-11-23 11:52:13,581 INFO L273 TraceCheckUtils]: 42: Hoare triple {7180#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7180#false} is VALID [2018-11-23 11:52:13,582 INFO L273 TraceCheckUtils]: 43: Hoare triple {7180#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7180#false} is VALID [2018-11-23 11:52:13,582 INFO L273 TraceCheckUtils]: 44: Hoare triple {7180#false} assume !(~i~0 < 100000); {7180#false} is VALID [2018-11-23 11:52:13,582 INFO L273 TraceCheckUtils]: 45: Hoare triple {7180#false} ~i~0 := 0; {7180#false} is VALID [2018-11-23 11:52:13,582 INFO L273 TraceCheckUtils]: 46: Hoare triple {7180#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7180#false} is VALID [2018-11-23 11:52:13,582 INFO L273 TraceCheckUtils]: 47: Hoare triple {7180#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7180#false} is VALID [2018-11-23 11:52:13,582 INFO L273 TraceCheckUtils]: 48: Hoare triple {7180#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7180#false} is VALID [2018-11-23 11:52:13,582 INFO L273 TraceCheckUtils]: 49: Hoare triple {7180#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7180#false} is VALID [2018-11-23 11:52:13,582 INFO L273 TraceCheckUtils]: 50: Hoare triple {7180#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7180#false} is VALID [2018-11-23 11:52:13,583 INFO L273 TraceCheckUtils]: 51: Hoare triple {7180#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7180#false} is VALID [2018-11-23 11:52:13,583 INFO L273 TraceCheckUtils]: 52: Hoare triple {7180#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7180#false} is VALID [2018-11-23 11:52:13,583 INFO L273 TraceCheckUtils]: 53: Hoare triple {7180#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7180#false} is VALID [2018-11-23 11:52:13,583 INFO L273 TraceCheckUtils]: 54: Hoare triple {7180#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7180#false} is VALID [2018-11-23 11:52:13,583 INFO L273 TraceCheckUtils]: 55: Hoare triple {7180#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7180#false} is VALID [2018-11-23 11:52:13,583 INFO L273 TraceCheckUtils]: 56: Hoare triple {7180#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7180#false} is VALID [2018-11-23 11:52:13,583 INFO L273 TraceCheckUtils]: 57: Hoare triple {7180#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7180#false} is VALID [2018-11-23 11:52:13,583 INFO L273 TraceCheckUtils]: 58: Hoare triple {7180#false} assume !(~i~0 < 100000); {7180#false} is VALID [2018-11-23 11:52:13,584 INFO L273 TraceCheckUtils]: 59: Hoare triple {7180#false} ~i~0 := 0; {7180#false} is VALID [2018-11-23 11:52:13,584 INFO L273 TraceCheckUtils]: 60: Hoare triple {7180#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7180#false} is VALID [2018-11-23 11:52:13,584 INFO L273 TraceCheckUtils]: 61: Hoare triple {7180#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7180#false} is VALID [2018-11-23 11:52:13,584 INFO L273 TraceCheckUtils]: 62: Hoare triple {7180#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7180#false} is VALID [2018-11-23 11:52:13,584 INFO L273 TraceCheckUtils]: 63: Hoare triple {7180#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7180#false} is VALID [2018-11-23 11:52:13,584 INFO L273 TraceCheckUtils]: 64: Hoare triple {7180#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7180#false} is VALID [2018-11-23 11:52:13,584 INFO L273 TraceCheckUtils]: 65: Hoare triple {7180#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7180#false} is VALID [2018-11-23 11:52:13,585 INFO L273 TraceCheckUtils]: 66: Hoare triple {7180#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7180#false} is VALID [2018-11-23 11:52:13,585 INFO L273 TraceCheckUtils]: 67: Hoare triple {7180#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7180#false} is VALID [2018-11-23 11:52:13,585 INFO L273 TraceCheckUtils]: 68: Hoare triple {7180#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7180#false} is VALID [2018-11-23 11:52:13,585 INFO L273 TraceCheckUtils]: 69: Hoare triple {7180#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7180#false} is VALID [2018-11-23 11:52:13,585 INFO L273 TraceCheckUtils]: 70: Hoare triple {7180#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7180#false} is VALID [2018-11-23 11:52:13,586 INFO L273 TraceCheckUtils]: 71: Hoare triple {7180#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7180#false} is VALID [2018-11-23 11:52:13,586 INFO L273 TraceCheckUtils]: 72: Hoare triple {7180#false} assume !(~i~0 < 100000); {7180#false} is VALID [2018-11-23 11:52:13,586 INFO L273 TraceCheckUtils]: 73: Hoare triple {7180#false} ~i~0 := 0; {7180#false} is VALID [2018-11-23 11:52:13,586 INFO L273 TraceCheckUtils]: 74: Hoare triple {7180#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7180#false} is VALID [2018-11-23 11:52:13,586 INFO L273 TraceCheckUtils]: 75: Hoare triple {7180#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7180#false} is VALID [2018-11-23 11:52:13,586 INFO L273 TraceCheckUtils]: 76: Hoare triple {7180#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7180#false} is VALID [2018-11-23 11:52:13,587 INFO L273 TraceCheckUtils]: 77: Hoare triple {7180#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7180#false} is VALID [2018-11-23 11:52:13,587 INFO L273 TraceCheckUtils]: 78: Hoare triple {7180#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7180#false} is VALID [2018-11-23 11:52:13,587 INFO L273 TraceCheckUtils]: 79: Hoare triple {7180#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7180#false} is VALID [2018-11-23 11:52:13,587 INFO L273 TraceCheckUtils]: 80: Hoare triple {7180#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7180#false} is VALID [2018-11-23 11:52:13,587 INFO L273 TraceCheckUtils]: 81: Hoare triple {7180#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7180#false} is VALID [2018-11-23 11:52:13,588 INFO L273 TraceCheckUtils]: 82: Hoare triple {7180#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7180#false} is VALID [2018-11-23 11:52:13,588 INFO L273 TraceCheckUtils]: 83: Hoare triple {7180#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7180#false} is VALID [2018-11-23 11:52:13,588 INFO L273 TraceCheckUtils]: 84: Hoare triple {7180#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7180#false} is VALID [2018-11-23 11:52:13,588 INFO L273 TraceCheckUtils]: 85: Hoare triple {7180#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7180#false} is VALID [2018-11-23 11:52:13,588 INFO L273 TraceCheckUtils]: 86: Hoare triple {7180#false} assume !(~i~0 < 100000); {7180#false} is VALID [2018-11-23 11:52:13,588 INFO L273 TraceCheckUtils]: 87: Hoare triple {7180#false} ~i~0 := 0; {7180#false} is VALID [2018-11-23 11:52:13,589 INFO L273 TraceCheckUtils]: 88: Hoare triple {7180#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {7180#false} is VALID [2018-11-23 11:52:13,589 INFO L273 TraceCheckUtils]: 89: Hoare triple {7180#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7180#false} is VALID [2018-11-23 11:52:13,589 INFO L273 TraceCheckUtils]: 90: Hoare triple {7180#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {7180#false} is VALID [2018-11-23 11:52:13,589 INFO L273 TraceCheckUtils]: 91: Hoare triple {7180#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7180#false} is VALID [2018-11-23 11:52:13,589 INFO L273 TraceCheckUtils]: 92: Hoare triple {7180#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {7180#false} is VALID [2018-11-23 11:52:13,589 INFO L273 TraceCheckUtils]: 93: Hoare triple {7180#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7180#false} is VALID [2018-11-23 11:52:13,590 INFO L273 TraceCheckUtils]: 94: Hoare triple {7180#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {7180#false} is VALID [2018-11-23 11:52:13,590 INFO L273 TraceCheckUtils]: 95: Hoare triple {7180#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7180#false} is VALID [2018-11-23 11:52:13,590 INFO L273 TraceCheckUtils]: 96: Hoare triple {7180#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {7180#false} is VALID [2018-11-23 11:52:13,590 INFO L273 TraceCheckUtils]: 97: Hoare triple {7180#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7180#false} is VALID [2018-11-23 11:52:13,590 INFO L273 TraceCheckUtils]: 98: Hoare triple {7180#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {7180#false} is VALID [2018-11-23 11:52:13,590 INFO L273 TraceCheckUtils]: 99: Hoare triple {7180#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7180#false} is VALID [2018-11-23 11:52:13,591 INFO L273 TraceCheckUtils]: 100: Hoare triple {7180#false} assume !(~i~0 < 100000); {7180#false} is VALID [2018-11-23 11:52:13,591 INFO L273 TraceCheckUtils]: 101: Hoare triple {7180#false} havoc ~x~0;~x~0 := 0; {7180#false} is VALID [2018-11-23 11:52:13,591 INFO L273 TraceCheckUtils]: 102: Hoare triple {7180#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {7180#false} is VALID [2018-11-23 11:52:13,591 INFO L256 TraceCheckUtils]: 103: Hoare triple {7180#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {7180#false} is VALID [2018-11-23 11:52:13,591 INFO L273 TraceCheckUtils]: 104: Hoare triple {7180#false} ~cond := #in~cond; {7180#false} is VALID [2018-11-23 11:52:13,591 INFO L273 TraceCheckUtils]: 105: Hoare triple {7180#false} assume 0 == ~cond; {7180#false} is VALID [2018-11-23 11:52:13,592 INFO L273 TraceCheckUtils]: 106: Hoare triple {7180#false} assume !false; {7180#false} is VALID [2018-11-23 11:52:13,598 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-23 11:52:13,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:13,599 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 11:52:13,613 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:53:16,263 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-11-23 11:53:16,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:16,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:16,591 INFO L256 TraceCheckUtils]: 0: Hoare triple {7179#true} call ULTIMATE.init(); {7179#true} is VALID [2018-11-23 11:53:16,592 INFO L273 TraceCheckUtils]: 1: Hoare triple {7179#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7179#true} is VALID [2018-11-23 11:53:16,592 INFO L273 TraceCheckUtils]: 2: Hoare triple {7179#true} assume true; {7179#true} is VALID [2018-11-23 11:53:16,592 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7179#true} {7179#true} #119#return; {7179#true} is VALID [2018-11-23 11:53:16,592 INFO L256 TraceCheckUtils]: 4: Hoare triple {7179#true} call #t~ret16 := main(); {7179#true} is VALID [2018-11-23 11:53:16,592 INFO L273 TraceCheckUtils]: 5: Hoare triple {7179#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {7179#true} is VALID [2018-11-23 11:53:16,593 INFO L273 TraceCheckUtils]: 6: Hoare triple {7179#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7179#true} is VALID [2018-11-23 11:53:16,593 INFO L273 TraceCheckUtils]: 7: Hoare triple {7179#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7179#true} is VALID [2018-11-23 11:53:16,593 INFO L273 TraceCheckUtils]: 8: Hoare triple {7179#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7179#true} is VALID [2018-11-23 11:53:16,593 INFO L273 TraceCheckUtils]: 9: Hoare triple {7179#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7179#true} is VALID [2018-11-23 11:53:16,593 INFO L273 TraceCheckUtils]: 10: Hoare triple {7179#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7179#true} is VALID [2018-11-23 11:53:16,593 INFO L273 TraceCheckUtils]: 11: Hoare triple {7179#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7179#true} is VALID [2018-11-23 11:53:16,594 INFO L273 TraceCheckUtils]: 12: Hoare triple {7179#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7179#true} is VALID [2018-11-23 11:53:16,594 INFO L273 TraceCheckUtils]: 13: Hoare triple {7179#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7179#true} is VALID [2018-11-23 11:53:16,594 INFO L273 TraceCheckUtils]: 14: Hoare triple {7179#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7179#true} is VALID [2018-11-23 11:53:16,594 INFO L273 TraceCheckUtils]: 15: Hoare triple {7179#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7179#true} is VALID [2018-11-23 11:53:16,594 INFO L273 TraceCheckUtils]: 16: Hoare triple {7179#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7179#true} is VALID [2018-11-23 11:53:16,594 INFO L273 TraceCheckUtils]: 17: Hoare triple {7179#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7179#true} is VALID [2018-11-23 11:53:16,594 INFO L273 TraceCheckUtils]: 18: Hoare triple {7179#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7179#true} is VALID [2018-11-23 11:53:16,595 INFO L273 TraceCheckUtils]: 19: Hoare triple {7179#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7179#true} is VALID [2018-11-23 11:53:16,595 INFO L273 TraceCheckUtils]: 20: Hoare triple {7179#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7179#true} is VALID [2018-11-23 11:53:16,595 INFO L273 TraceCheckUtils]: 21: Hoare triple {7179#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7179#true} is VALID [2018-11-23 11:53:16,595 INFO L273 TraceCheckUtils]: 22: Hoare triple {7179#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7179#true} is VALID [2018-11-23 11:53:16,595 INFO L273 TraceCheckUtils]: 23: Hoare triple {7179#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7179#true} is VALID [2018-11-23 11:53:16,595 INFO L273 TraceCheckUtils]: 24: Hoare triple {7179#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7179#true} is VALID [2018-11-23 11:53:16,596 INFO L273 TraceCheckUtils]: 25: Hoare triple {7179#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7179#true} is VALID [2018-11-23 11:53:16,596 INFO L273 TraceCheckUtils]: 26: Hoare triple {7179#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7179#true} is VALID [2018-11-23 11:53:16,596 INFO L273 TraceCheckUtils]: 27: Hoare triple {7179#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7179#true} is VALID [2018-11-23 11:53:16,596 INFO L273 TraceCheckUtils]: 28: Hoare triple {7179#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7179#true} is VALID [2018-11-23 11:53:16,596 INFO L273 TraceCheckUtils]: 29: Hoare triple {7179#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7179#true} is VALID [2018-11-23 11:53:16,596 INFO L273 TraceCheckUtils]: 30: Hoare triple {7179#true} assume !(~a~0 < 100000); {7179#true} is VALID [2018-11-23 11:53:16,596 INFO L273 TraceCheckUtils]: 31: Hoare triple {7179#true} havoc ~i~0;~i~0 := 0; {7179#true} is VALID [2018-11-23 11:53:16,597 INFO L273 TraceCheckUtils]: 32: Hoare triple {7179#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7179#true} is VALID [2018-11-23 11:53:16,597 INFO L273 TraceCheckUtils]: 33: Hoare triple {7179#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7179#true} is VALID [2018-11-23 11:53:16,597 INFO L273 TraceCheckUtils]: 34: Hoare triple {7179#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7179#true} is VALID [2018-11-23 11:53:16,597 INFO L273 TraceCheckUtils]: 35: Hoare triple {7179#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7179#true} is VALID [2018-11-23 11:53:16,597 INFO L273 TraceCheckUtils]: 36: Hoare triple {7179#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7179#true} is VALID [2018-11-23 11:53:16,597 INFO L273 TraceCheckUtils]: 37: Hoare triple {7179#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7179#true} is VALID [2018-11-23 11:53:16,598 INFO L273 TraceCheckUtils]: 38: Hoare triple {7179#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7179#true} is VALID [2018-11-23 11:53:16,598 INFO L273 TraceCheckUtils]: 39: Hoare triple {7179#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7179#true} is VALID [2018-11-23 11:53:16,598 INFO L273 TraceCheckUtils]: 40: Hoare triple {7179#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7179#true} is VALID [2018-11-23 11:53:16,598 INFO L273 TraceCheckUtils]: 41: Hoare triple {7179#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7179#true} is VALID [2018-11-23 11:53:16,598 INFO L273 TraceCheckUtils]: 42: Hoare triple {7179#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7179#true} is VALID [2018-11-23 11:53:16,598 INFO L273 TraceCheckUtils]: 43: Hoare triple {7179#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7179#true} is VALID [2018-11-23 11:53:16,598 INFO L273 TraceCheckUtils]: 44: Hoare triple {7179#true} assume !(~i~0 < 100000); {7179#true} is VALID [2018-11-23 11:53:16,599 INFO L273 TraceCheckUtils]: 45: Hoare triple {7179#true} ~i~0 := 0; {7179#true} is VALID [2018-11-23 11:53:16,599 INFO L273 TraceCheckUtils]: 46: Hoare triple {7179#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7179#true} is VALID [2018-11-23 11:53:16,599 INFO L273 TraceCheckUtils]: 47: Hoare triple {7179#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7179#true} is VALID [2018-11-23 11:53:16,599 INFO L273 TraceCheckUtils]: 48: Hoare triple {7179#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7179#true} is VALID [2018-11-23 11:53:16,599 INFO L273 TraceCheckUtils]: 49: Hoare triple {7179#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7179#true} is VALID [2018-11-23 11:53:16,599 INFO L273 TraceCheckUtils]: 50: Hoare triple {7179#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7179#true} is VALID [2018-11-23 11:53:16,600 INFO L273 TraceCheckUtils]: 51: Hoare triple {7179#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7179#true} is VALID [2018-11-23 11:53:16,600 INFO L273 TraceCheckUtils]: 52: Hoare triple {7179#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7179#true} is VALID [2018-11-23 11:53:16,600 INFO L273 TraceCheckUtils]: 53: Hoare triple {7179#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7179#true} is VALID [2018-11-23 11:53:16,600 INFO L273 TraceCheckUtils]: 54: Hoare triple {7179#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7179#true} is VALID [2018-11-23 11:53:16,600 INFO L273 TraceCheckUtils]: 55: Hoare triple {7179#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7179#true} is VALID [2018-11-23 11:53:16,600 INFO L273 TraceCheckUtils]: 56: Hoare triple {7179#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7179#true} is VALID [2018-11-23 11:53:16,600 INFO L273 TraceCheckUtils]: 57: Hoare triple {7179#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7179#true} is VALID [2018-11-23 11:53:16,601 INFO L273 TraceCheckUtils]: 58: Hoare triple {7179#true} assume !(~i~0 < 100000); {7179#true} is VALID [2018-11-23 11:53:16,601 INFO L273 TraceCheckUtils]: 59: Hoare triple {7179#true} ~i~0 := 0; {7179#true} is VALID [2018-11-23 11:53:16,601 INFO L273 TraceCheckUtils]: 60: Hoare triple {7179#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7179#true} is VALID [2018-11-23 11:53:16,601 INFO L273 TraceCheckUtils]: 61: Hoare triple {7179#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7179#true} is VALID [2018-11-23 11:53:16,601 INFO L273 TraceCheckUtils]: 62: Hoare triple {7179#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7179#true} is VALID [2018-11-23 11:53:16,601 INFO L273 TraceCheckUtils]: 63: Hoare triple {7179#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7179#true} is VALID [2018-11-23 11:53:16,602 INFO L273 TraceCheckUtils]: 64: Hoare triple {7179#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7179#true} is VALID [2018-11-23 11:53:16,602 INFO L273 TraceCheckUtils]: 65: Hoare triple {7179#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7179#true} is VALID [2018-11-23 11:53:16,602 INFO L273 TraceCheckUtils]: 66: Hoare triple {7179#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7179#true} is VALID [2018-11-23 11:53:16,602 INFO L273 TraceCheckUtils]: 67: Hoare triple {7179#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7179#true} is VALID [2018-11-23 11:53:16,602 INFO L273 TraceCheckUtils]: 68: Hoare triple {7179#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7179#true} is VALID [2018-11-23 11:53:16,602 INFO L273 TraceCheckUtils]: 69: Hoare triple {7179#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7179#true} is VALID [2018-11-23 11:53:16,602 INFO L273 TraceCheckUtils]: 70: Hoare triple {7179#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7179#true} is VALID [2018-11-23 11:53:16,603 INFO L273 TraceCheckUtils]: 71: Hoare triple {7179#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7179#true} is VALID [2018-11-23 11:53:16,603 INFO L273 TraceCheckUtils]: 72: Hoare triple {7179#true} assume !(~i~0 < 100000); {7179#true} is VALID [2018-11-23 11:53:16,603 INFO L273 TraceCheckUtils]: 73: Hoare triple {7179#true} ~i~0 := 0; {7179#true} is VALID [2018-11-23 11:53:16,603 INFO L273 TraceCheckUtils]: 74: Hoare triple {7179#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7179#true} is VALID [2018-11-23 11:53:16,603 INFO L273 TraceCheckUtils]: 75: Hoare triple {7179#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7179#true} is VALID [2018-11-23 11:53:16,603 INFO L273 TraceCheckUtils]: 76: Hoare triple {7179#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7179#true} is VALID [2018-11-23 11:53:16,604 INFO L273 TraceCheckUtils]: 77: Hoare triple {7179#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7179#true} is VALID [2018-11-23 11:53:16,604 INFO L273 TraceCheckUtils]: 78: Hoare triple {7179#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7179#true} is VALID [2018-11-23 11:53:16,604 INFO L273 TraceCheckUtils]: 79: Hoare triple {7179#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7179#true} is VALID [2018-11-23 11:53:16,604 INFO L273 TraceCheckUtils]: 80: Hoare triple {7179#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7179#true} is VALID [2018-11-23 11:53:16,604 INFO L273 TraceCheckUtils]: 81: Hoare triple {7179#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7179#true} is VALID [2018-11-23 11:53:16,604 INFO L273 TraceCheckUtils]: 82: Hoare triple {7179#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7179#true} is VALID [2018-11-23 11:53:16,604 INFO L273 TraceCheckUtils]: 83: Hoare triple {7179#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7179#true} is VALID [2018-11-23 11:53:16,605 INFO L273 TraceCheckUtils]: 84: Hoare triple {7179#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7179#true} is VALID [2018-11-23 11:53:16,605 INFO L273 TraceCheckUtils]: 85: Hoare triple {7179#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7179#true} is VALID [2018-11-23 11:53:16,605 INFO L273 TraceCheckUtils]: 86: Hoare triple {7179#true} assume !(~i~0 < 100000); {7179#true} is VALID [2018-11-23 11:53:16,606 INFO L273 TraceCheckUtils]: 87: Hoare triple {7179#true} ~i~0 := 0; {7458#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:16,606 INFO L273 TraceCheckUtils]: 88: Hoare triple {7458#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {7458#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:16,607 INFO L273 TraceCheckUtils]: 89: Hoare triple {7458#(<= main_~i~0 0)} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7465#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:16,607 INFO L273 TraceCheckUtils]: 90: Hoare triple {7465#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {7465#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:16,607 INFO L273 TraceCheckUtils]: 91: Hoare triple {7465#(<= main_~i~0 1)} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7472#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:16,608 INFO L273 TraceCheckUtils]: 92: Hoare triple {7472#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {7472#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:16,608 INFO L273 TraceCheckUtils]: 93: Hoare triple {7472#(<= main_~i~0 2)} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7479#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:16,609 INFO L273 TraceCheckUtils]: 94: Hoare triple {7479#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {7479#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:16,609 INFO L273 TraceCheckUtils]: 95: Hoare triple {7479#(<= main_~i~0 3)} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7486#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:16,610 INFO L273 TraceCheckUtils]: 96: Hoare triple {7486#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {7486#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:16,611 INFO L273 TraceCheckUtils]: 97: Hoare triple {7486#(<= main_~i~0 4)} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7493#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:16,612 INFO L273 TraceCheckUtils]: 98: Hoare triple {7493#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {7493#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:16,613 INFO L273 TraceCheckUtils]: 99: Hoare triple {7493#(<= main_~i~0 5)} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7500#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:16,613 INFO L273 TraceCheckUtils]: 100: Hoare triple {7500#(<= main_~i~0 6)} assume !(~i~0 < 100000); {7180#false} is VALID [2018-11-23 11:53:16,614 INFO L273 TraceCheckUtils]: 101: Hoare triple {7180#false} havoc ~x~0;~x~0 := 0; {7180#false} is VALID [2018-11-23 11:53:16,614 INFO L273 TraceCheckUtils]: 102: Hoare triple {7180#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {7180#false} is VALID [2018-11-23 11:53:16,614 INFO L256 TraceCheckUtils]: 103: Hoare triple {7180#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {7180#false} is VALID [2018-11-23 11:53:16,615 INFO L273 TraceCheckUtils]: 104: Hoare triple {7180#false} ~cond := #in~cond; {7180#false} is VALID [2018-11-23 11:53:16,615 INFO L273 TraceCheckUtils]: 105: Hoare triple {7180#false} assume 0 == ~cond; {7180#false} is VALID [2018-11-23 11:53:16,615 INFO L273 TraceCheckUtils]: 106: Hoare triple {7180#false} assume !false; {7180#false} is VALID [2018-11-23 11:53:16,626 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-11-23 11:53:16,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:16,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 22 [2018-11-23 11:53:16,656 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 107 [2018-11-23 11:53:16,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:16,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 11:53:16,783 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:16,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:53:16,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:53:16,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:53:16,784 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand 22 states. [2018-11-23 11:53:18,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:18,397 INFO L93 Difference]: Finished difference Result 211 states and 228 transitions. [2018-11-23 11:53:18,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 11:53:18,398 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 107 [2018-11-23 11:53:18,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:18,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:53:18,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 173 transitions. [2018-11-23 11:53:18,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:53:18,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 173 transitions. [2018-11-23 11:53:18,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 173 transitions. [2018-11-23 11:53:19,025 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:19,028 INFO L225 Difference]: With dead ends: 211 [2018-11-23 11:53:19,029 INFO L226 Difference]: Without dead ends: 130 [2018-11-23 11:53:19,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:53:19,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-23 11:53:19,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 124. [2018-11-23 11:53:19,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:19,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand 124 states. [2018-11-23 11:53:19,706 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 124 states. [2018-11-23 11:53:19,706 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 124 states. [2018-11-23 11:53:19,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:19,713 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2018-11-23 11:53:19,713 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2018-11-23 11:53:19,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:19,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:19,714 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 130 states. [2018-11-23 11:53:19,714 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 130 states. [2018-11-23 11:53:19,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:19,718 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2018-11-23 11:53:19,718 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2018-11-23 11:53:19,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:19,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:19,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:19,719 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:19,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-23 11:53:19,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2018-11-23 11:53:19,722 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 107 [2018-11-23 11:53:19,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:19,723 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2018-11-23 11:53:19,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:53:19,723 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2018-11-23 11:53:19,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-23 11:53:19,724 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:19,724 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:19,725 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:19,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:19,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1369540394, now seen corresponding path program 12 times [2018-11-23 11:53:19,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:19,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:19,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:19,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:19,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:20,751 INFO L256 TraceCheckUtils]: 0: Hoare triple {8276#true} call ULTIMATE.init(); {8276#true} is VALID [2018-11-23 11:53:20,751 INFO L273 TraceCheckUtils]: 1: Hoare triple {8276#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8276#true} is VALID [2018-11-23 11:53:20,751 INFO L273 TraceCheckUtils]: 2: Hoare triple {8276#true} assume true; {8276#true} is VALID [2018-11-23 11:53:20,751 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8276#true} {8276#true} #119#return; {8276#true} is VALID [2018-11-23 11:53:20,752 INFO L256 TraceCheckUtils]: 4: Hoare triple {8276#true} call #t~ret16 := main(); {8276#true} is VALID [2018-11-23 11:53:20,752 INFO L273 TraceCheckUtils]: 5: Hoare triple {8276#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {8278#(= main_~a~0 0)} is VALID [2018-11-23 11:53:20,753 INFO L273 TraceCheckUtils]: 6: Hoare triple {8278#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8278#(= main_~a~0 0)} is VALID [2018-11-23 11:53:20,753 INFO L273 TraceCheckUtils]: 7: Hoare triple {8278#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8279#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:20,754 INFO L273 TraceCheckUtils]: 8: Hoare triple {8279#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8279#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:20,754 INFO L273 TraceCheckUtils]: 9: Hoare triple {8279#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8280#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:20,754 INFO L273 TraceCheckUtils]: 10: Hoare triple {8280#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8280#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:20,755 INFO L273 TraceCheckUtils]: 11: Hoare triple {8280#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8281#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:20,756 INFO L273 TraceCheckUtils]: 12: Hoare triple {8281#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8281#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:20,756 INFO L273 TraceCheckUtils]: 13: Hoare triple {8281#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8282#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:20,757 INFO L273 TraceCheckUtils]: 14: Hoare triple {8282#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8282#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:20,758 INFO L273 TraceCheckUtils]: 15: Hoare triple {8282#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8283#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:20,758 INFO L273 TraceCheckUtils]: 16: Hoare triple {8283#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8283#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:20,759 INFO L273 TraceCheckUtils]: 17: Hoare triple {8283#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8284#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:20,759 INFO L273 TraceCheckUtils]: 18: Hoare triple {8284#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8284#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:20,760 INFO L273 TraceCheckUtils]: 19: Hoare triple {8284#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8285#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:20,761 INFO L273 TraceCheckUtils]: 20: Hoare triple {8285#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8285#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:20,761 INFO L273 TraceCheckUtils]: 21: Hoare triple {8285#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8286#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:20,762 INFO L273 TraceCheckUtils]: 22: Hoare triple {8286#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8286#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:20,763 INFO L273 TraceCheckUtils]: 23: Hoare triple {8286#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8287#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:20,763 INFO L273 TraceCheckUtils]: 24: Hoare triple {8287#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8287#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:20,764 INFO L273 TraceCheckUtils]: 25: Hoare triple {8287#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8288#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:20,765 INFO L273 TraceCheckUtils]: 26: Hoare triple {8288#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8288#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:20,765 INFO L273 TraceCheckUtils]: 27: Hoare triple {8288#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8289#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:20,766 INFO L273 TraceCheckUtils]: 28: Hoare triple {8289#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8289#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:20,767 INFO L273 TraceCheckUtils]: 29: Hoare triple {8289#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8290#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:20,767 INFO L273 TraceCheckUtils]: 30: Hoare triple {8290#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8290#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:20,768 INFO L273 TraceCheckUtils]: 31: Hoare triple {8290#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8291#(<= main_~a~0 13)} is VALID [2018-11-23 11:53:20,769 INFO L273 TraceCheckUtils]: 32: Hoare triple {8291#(<= main_~a~0 13)} assume !(~a~0 < 100000); {8277#false} is VALID [2018-11-23 11:53:20,769 INFO L273 TraceCheckUtils]: 33: Hoare triple {8277#false} havoc ~i~0;~i~0 := 0; {8277#false} is VALID [2018-11-23 11:53:20,769 INFO L273 TraceCheckUtils]: 34: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8277#false} is VALID [2018-11-23 11:53:20,770 INFO L273 TraceCheckUtils]: 35: Hoare triple {8277#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8277#false} is VALID [2018-11-23 11:53:20,770 INFO L273 TraceCheckUtils]: 36: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8277#false} is VALID [2018-11-23 11:53:20,770 INFO L273 TraceCheckUtils]: 37: Hoare triple {8277#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8277#false} is VALID [2018-11-23 11:53:20,770 INFO L273 TraceCheckUtils]: 38: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8277#false} is VALID [2018-11-23 11:53:20,771 INFO L273 TraceCheckUtils]: 39: Hoare triple {8277#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8277#false} is VALID [2018-11-23 11:53:20,771 INFO L273 TraceCheckUtils]: 40: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8277#false} is VALID [2018-11-23 11:53:20,771 INFO L273 TraceCheckUtils]: 41: Hoare triple {8277#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8277#false} is VALID [2018-11-23 11:53:20,771 INFO L273 TraceCheckUtils]: 42: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8277#false} is VALID [2018-11-23 11:53:20,772 INFO L273 TraceCheckUtils]: 43: Hoare triple {8277#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8277#false} is VALID [2018-11-23 11:53:20,772 INFO L273 TraceCheckUtils]: 44: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8277#false} is VALID [2018-11-23 11:53:20,772 INFO L273 TraceCheckUtils]: 45: Hoare triple {8277#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8277#false} is VALID [2018-11-23 11:53:20,772 INFO L273 TraceCheckUtils]: 46: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8277#false} is VALID [2018-11-23 11:53:20,773 INFO L273 TraceCheckUtils]: 47: Hoare triple {8277#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8277#false} is VALID [2018-11-23 11:53:20,773 INFO L273 TraceCheckUtils]: 48: Hoare triple {8277#false} assume !(~i~0 < 100000); {8277#false} is VALID [2018-11-23 11:53:20,773 INFO L273 TraceCheckUtils]: 49: Hoare triple {8277#false} ~i~0 := 0; {8277#false} is VALID [2018-11-23 11:53:20,773 INFO L273 TraceCheckUtils]: 50: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8277#false} is VALID [2018-11-23 11:53:20,773 INFO L273 TraceCheckUtils]: 51: Hoare triple {8277#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8277#false} is VALID [2018-11-23 11:53:20,773 INFO L273 TraceCheckUtils]: 52: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8277#false} is VALID [2018-11-23 11:53:20,773 INFO L273 TraceCheckUtils]: 53: Hoare triple {8277#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8277#false} is VALID [2018-11-23 11:53:20,774 INFO L273 TraceCheckUtils]: 54: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8277#false} is VALID [2018-11-23 11:53:20,774 INFO L273 TraceCheckUtils]: 55: Hoare triple {8277#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8277#false} is VALID [2018-11-23 11:53:20,774 INFO L273 TraceCheckUtils]: 56: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8277#false} is VALID [2018-11-23 11:53:20,774 INFO L273 TraceCheckUtils]: 57: Hoare triple {8277#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8277#false} is VALID [2018-11-23 11:53:20,774 INFO L273 TraceCheckUtils]: 58: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8277#false} is VALID [2018-11-23 11:53:20,774 INFO L273 TraceCheckUtils]: 59: Hoare triple {8277#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8277#false} is VALID [2018-11-23 11:53:20,774 INFO L273 TraceCheckUtils]: 60: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8277#false} is VALID [2018-11-23 11:53:20,774 INFO L273 TraceCheckUtils]: 61: Hoare triple {8277#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8277#false} is VALID [2018-11-23 11:53:20,774 INFO L273 TraceCheckUtils]: 62: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8277#false} is VALID [2018-11-23 11:53:20,775 INFO L273 TraceCheckUtils]: 63: Hoare triple {8277#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8277#false} is VALID [2018-11-23 11:53:20,775 INFO L273 TraceCheckUtils]: 64: Hoare triple {8277#false} assume !(~i~0 < 100000); {8277#false} is VALID [2018-11-23 11:53:20,775 INFO L273 TraceCheckUtils]: 65: Hoare triple {8277#false} ~i~0 := 0; {8277#false} is VALID [2018-11-23 11:53:20,775 INFO L273 TraceCheckUtils]: 66: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8277#false} is VALID [2018-11-23 11:53:20,775 INFO L273 TraceCheckUtils]: 67: Hoare triple {8277#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8277#false} is VALID [2018-11-23 11:53:20,775 INFO L273 TraceCheckUtils]: 68: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8277#false} is VALID [2018-11-23 11:53:20,775 INFO L273 TraceCheckUtils]: 69: Hoare triple {8277#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8277#false} is VALID [2018-11-23 11:53:20,775 INFO L273 TraceCheckUtils]: 70: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8277#false} is VALID [2018-11-23 11:53:20,776 INFO L273 TraceCheckUtils]: 71: Hoare triple {8277#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8277#false} is VALID [2018-11-23 11:53:20,776 INFO L273 TraceCheckUtils]: 72: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8277#false} is VALID [2018-11-23 11:53:20,776 INFO L273 TraceCheckUtils]: 73: Hoare triple {8277#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8277#false} is VALID [2018-11-23 11:53:20,776 INFO L273 TraceCheckUtils]: 74: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8277#false} is VALID [2018-11-23 11:53:20,776 INFO L273 TraceCheckUtils]: 75: Hoare triple {8277#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8277#false} is VALID [2018-11-23 11:53:20,776 INFO L273 TraceCheckUtils]: 76: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8277#false} is VALID [2018-11-23 11:53:20,776 INFO L273 TraceCheckUtils]: 77: Hoare triple {8277#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8277#false} is VALID [2018-11-23 11:53:20,776 INFO L273 TraceCheckUtils]: 78: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8277#false} is VALID [2018-11-23 11:53:20,776 INFO L273 TraceCheckUtils]: 79: Hoare triple {8277#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8277#false} is VALID [2018-11-23 11:53:20,777 INFO L273 TraceCheckUtils]: 80: Hoare triple {8277#false} assume !(~i~0 < 100000); {8277#false} is VALID [2018-11-23 11:53:20,777 INFO L273 TraceCheckUtils]: 81: Hoare triple {8277#false} ~i~0 := 0; {8277#false} is VALID [2018-11-23 11:53:20,777 INFO L273 TraceCheckUtils]: 82: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8277#false} is VALID [2018-11-23 11:53:20,777 INFO L273 TraceCheckUtils]: 83: Hoare triple {8277#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8277#false} is VALID [2018-11-23 11:53:20,777 INFO L273 TraceCheckUtils]: 84: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8277#false} is VALID [2018-11-23 11:53:20,777 INFO L273 TraceCheckUtils]: 85: Hoare triple {8277#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8277#false} is VALID [2018-11-23 11:53:20,777 INFO L273 TraceCheckUtils]: 86: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8277#false} is VALID [2018-11-23 11:53:20,777 INFO L273 TraceCheckUtils]: 87: Hoare triple {8277#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8277#false} is VALID [2018-11-23 11:53:20,778 INFO L273 TraceCheckUtils]: 88: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8277#false} is VALID [2018-11-23 11:53:20,778 INFO L273 TraceCheckUtils]: 89: Hoare triple {8277#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8277#false} is VALID [2018-11-23 11:53:20,778 INFO L273 TraceCheckUtils]: 90: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8277#false} is VALID [2018-11-23 11:53:20,778 INFO L273 TraceCheckUtils]: 91: Hoare triple {8277#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8277#false} is VALID [2018-11-23 11:53:20,778 INFO L273 TraceCheckUtils]: 92: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8277#false} is VALID [2018-11-23 11:53:20,778 INFO L273 TraceCheckUtils]: 93: Hoare triple {8277#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8277#false} is VALID [2018-11-23 11:53:20,778 INFO L273 TraceCheckUtils]: 94: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8277#false} is VALID [2018-11-23 11:53:20,778 INFO L273 TraceCheckUtils]: 95: Hoare triple {8277#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8277#false} is VALID [2018-11-23 11:53:20,778 INFO L273 TraceCheckUtils]: 96: Hoare triple {8277#false} assume !(~i~0 < 100000); {8277#false} is VALID [2018-11-23 11:53:20,779 INFO L273 TraceCheckUtils]: 97: Hoare triple {8277#false} ~i~0 := 0; {8277#false} is VALID [2018-11-23 11:53:20,779 INFO L273 TraceCheckUtils]: 98: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8277#false} is VALID [2018-11-23 11:53:20,779 INFO L273 TraceCheckUtils]: 99: Hoare triple {8277#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8277#false} is VALID [2018-11-23 11:53:20,779 INFO L273 TraceCheckUtils]: 100: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8277#false} is VALID [2018-11-23 11:53:20,779 INFO L273 TraceCheckUtils]: 101: Hoare triple {8277#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8277#false} is VALID [2018-11-23 11:53:20,779 INFO L273 TraceCheckUtils]: 102: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8277#false} is VALID [2018-11-23 11:53:20,779 INFO L273 TraceCheckUtils]: 103: Hoare triple {8277#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8277#false} is VALID [2018-11-23 11:53:20,779 INFO L273 TraceCheckUtils]: 104: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8277#false} is VALID [2018-11-23 11:53:20,780 INFO L273 TraceCheckUtils]: 105: Hoare triple {8277#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8277#false} is VALID [2018-11-23 11:53:20,780 INFO L273 TraceCheckUtils]: 106: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8277#false} is VALID [2018-11-23 11:53:20,780 INFO L273 TraceCheckUtils]: 107: Hoare triple {8277#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8277#false} is VALID [2018-11-23 11:53:20,780 INFO L273 TraceCheckUtils]: 108: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8277#false} is VALID [2018-11-23 11:53:20,780 INFO L273 TraceCheckUtils]: 109: Hoare triple {8277#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8277#false} is VALID [2018-11-23 11:53:20,780 INFO L273 TraceCheckUtils]: 110: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8277#false} is VALID [2018-11-23 11:53:20,780 INFO L273 TraceCheckUtils]: 111: Hoare triple {8277#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8277#false} is VALID [2018-11-23 11:53:20,780 INFO L273 TraceCheckUtils]: 112: Hoare triple {8277#false} assume !(~i~0 < 100000); {8277#false} is VALID [2018-11-23 11:53:20,780 INFO L273 TraceCheckUtils]: 113: Hoare triple {8277#false} havoc ~x~0;~x~0 := 0; {8277#false} is VALID [2018-11-23 11:53:20,781 INFO L273 TraceCheckUtils]: 114: Hoare triple {8277#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {8277#false} is VALID [2018-11-23 11:53:20,781 INFO L256 TraceCheckUtils]: 115: Hoare triple {8277#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {8277#false} is VALID [2018-11-23 11:53:20,781 INFO L273 TraceCheckUtils]: 116: Hoare triple {8277#false} ~cond := #in~cond; {8277#false} is VALID [2018-11-23 11:53:20,781 INFO L273 TraceCheckUtils]: 117: Hoare triple {8277#false} assume 0 == ~cond; {8277#false} is VALID [2018-11-23 11:53:20,781 INFO L273 TraceCheckUtils]: 118: Hoare triple {8277#false} assume !false; {8277#false} is VALID [2018-11-23 11:53:20,787 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-11-23 11:53:20,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:20,787 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 11:53:20,797 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:54:08,800 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-11-23 11:54:08,800 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:08,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:09,004 INFO L256 TraceCheckUtils]: 0: Hoare triple {8276#true} call ULTIMATE.init(); {8276#true} is VALID [2018-11-23 11:54:09,005 INFO L273 TraceCheckUtils]: 1: Hoare triple {8276#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8276#true} is VALID [2018-11-23 11:54:09,005 INFO L273 TraceCheckUtils]: 2: Hoare triple {8276#true} assume true; {8276#true} is VALID [2018-11-23 11:54:09,005 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8276#true} {8276#true} #119#return; {8276#true} is VALID [2018-11-23 11:54:09,005 INFO L256 TraceCheckUtils]: 4: Hoare triple {8276#true} call #t~ret16 := main(); {8276#true} is VALID [2018-11-23 11:54:09,007 INFO L273 TraceCheckUtils]: 5: Hoare triple {8276#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {8310#(<= main_~a~0 0)} is VALID [2018-11-23 11:54:09,007 INFO L273 TraceCheckUtils]: 6: Hoare triple {8310#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8310#(<= main_~a~0 0)} is VALID [2018-11-23 11:54:09,008 INFO L273 TraceCheckUtils]: 7: Hoare triple {8310#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8279#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:09,008 INFO L273 TraceCheckUtils]: 8: Hoare triple {8279#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8279#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:09,009 INFO L273 TraceCheckUtils]: 9: Hoare triple {8279#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8280#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:09,009 INFO L273 TraceCheckUtils]: 10: Hoare triple {8280#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8280#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:09,009 INFO L273 TraceCheckUtils]: 11: Hoare triple {8280#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8281#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:09,010 INFO L273 TraceCheckUtils]: 12: Hoare triple {8281#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8281#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:09,011 INFO L273 TraceCheckUtils]: 13: Hoare triple {8281#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8282#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:09,011 INFO L273 TraceCheckUtils]: 14: Hoare triple {8282#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8282#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:09,012 INFO L273 TraceCheckUtils]: 15: Hoare triple {8282#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8283#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:09,013 INFO L273 TraceCheckUtils]: 16: Hoare triple {8283#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8283#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:09,013 INFO L273 TraceCheckUtils]: 17: Hoare triple {8283#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8284#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:09,014 INFO L273 TraceCheckUtils]: 18: Hoare triple {8284#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8284#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:09,015 INFO L273 TraceCheckUtils]: 19: Hoare triple {8284#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8285#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:09,015 INFO L273 TraceCheckUtils]: 20: Hoare triple {8285#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8285#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:09,016 INFO L273 TraceCheckUtils]: 21: Hoare triple {8285#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8286#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:09,017 INFO L273 TraceCheckUtils]: 22: Hoare triple {8286#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8286#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:09,017 INFO L273 TraceCheckUtils]: 23: Hoare triple {8286#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8287#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:09,018 INFO L273 TraceCheckUtils]: 24: Hoare triple {8287#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8287#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:09,019 INFO L273 TraceCheckUtils]: 25: Hoare triple {8287#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8288#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:09,019 INFO L273 TraceCheckUtils]: 26: Hoare triple {8288#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8288#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:09,020 INFO L273 TraceCheckUtils]: 27: Hoare triple {8288#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8289#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:09,021 INFO L273 TraceCheckUtils]: 28: Hoare triple {8289#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8289#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:09,021 INFO L273 TraceCheckUtils]: 29: Hoare triple {8289#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8290#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:09,022 INFO L273 TraceCheckUtils]: 30: Hoare triple {8290#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8290#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:09,023 INFO L273 TraceCheckUtils]: 31: Hoare triple {8290#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8291#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:09,023 INFO L273 TraceCheckUtils]: 32: Hoare triple {8291#(<= main_~a~0 13)} assume !(~a~0 < 100000); {8277#false} is VALID [2018-11-23 11:54:09,024 INFO L273 TraceCheckUtils]: 33: Hoare triple {8277#false} havoc ~i~0;~i~0 := 0; {8277#false} is VALID [2018-11-23 11:54:09,024 INFO L273 TraceCheckUtils]: 34: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8277#false} is VALID [2018-11-23 11:54:09,024 INFO L273 TraceCheckUtils]: 35: Hoare triple {8277#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8277#false} is VALID [2018-11-23 11:54:09,024 INFO L273 TraceCheckUtils]: 36: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8277#false} is VALID [2018-11-23 11:54:09,024 INFO L273 TraceCheckUtils]: 37: Hoare triple {8277#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8277#false} is VALID [2018-11-23 11:54:09,025 INFO L273 TraceCheckUtils]: 38: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8277#false} is VALID [2018-11-23 11:54:09,025 INFO L273 TraceCheckUtils]: 39: Hoare triple {8277#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8277#false} is VALID [2018-11-23 11:54:09,025 INFO L273 TraceCheckUtils]: 40: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8277#false} is VALID [2018-11-23 11:54:09,025 INFO L273 TraceCheckUtils]: 41: Hoare triple {8277#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8277#false} is VALID [2018-11-23 11:54:09,025 INFO L273 TraceCheckUtils]: 42: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8277#false} is VALID [2018-11-23 11:54:09,025 INFO L273 TraceCheckUtils]: 43: Hoare triple {8277#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8277#false} is VALID [2018-11-23 11:54:09,026 INFO L273 TraceCheckUtils]: 44: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8277#false} is VALID [2018-11-23 11:54:09,026 INFO L273 TraceCheckUtils]: 45: Hoare triple {8277#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8277#false} is VALID [2018-11-23 11:54:09,026 INFO L273 TraceCheckUtils]: 46: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8277#false} is VALID [2018-11-23 11:54:09,026 INFO L273 TraceCheckUtils]: 47: Hoare triple {8277#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8277#false} is VALID [2018-11-23 11:54:09,026 INFO L273 TraceCheckUtils]: 48: Hoare triple {8277#false} assume !(~i~0 < 100000); {8277#false} is VALID [2018-11-23 11:54:09,026 INFO L273 TraceCheckUtils]: 49: Hoare triple {8277#false} ~i~0 := 0; {8277#false} is VALID [2018-11-23 11:54:09,026 INFO L273 TraceCheckUtils]: 50: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8277#false} is VALID [2018-11-23 11:54:09,026 INFO L273 TraceCheckUtils]: 51: Hoare triple {8277#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8277#false} is VALID [2018-11-23 11:54:09,027 INFO L273 TraceCheckUtils]: 52: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8277#false} is VALID [2018-11-23 11:54:09,027 INFO L273 TraceCheckUtils]: 53: Hoare triple {8277#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8277#false} is VALID [2018-11-23 11:54:09,027 INFO L273 TraceCheckUtils]: 54: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8277#false} is VALID [2018-11-23 11:54:09,027 INFO L273 TraceCheckUtils]: 55: Hoare triple {8277#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8277#false} is VALID [2018-11-23 11:54:09,027 INFO L273 TraceCheckUtils]: 56: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8277#false} is VALID [2018-11-23 11:54:09,027 INFO L273 TraceCheckUtils]: 57: Hoare triple {8277#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8277#false} is VALID [2018-11-23 11:54:09,028 INFO L273 TraceCheckUtils]: 58: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8277#false} is VALID [2018-11-23 11:54:09,028 INFO L273 TraceCheckUtils]: 59: Hoare triple {8277#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8277#false} is VALID [2018-11-23 11:54:09,028 INFO L273 TraceCheckUtils]: 60: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8277#false} is VALID [2018-11-23 11:54:09,028 INFO L273 TraceCheckUtils]: 61: Hoare triple {8277#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8277#false} is VALID [2018-11-23 11:54:09,028 INFO L273 TraceCheckUtils]: 62: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8277#false} is VALID [2018-11-23 11:54:09,029 INFO L273 TraceCheckUtils]: 63: Hoare triple {8277#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8277#false} is VALID [2018-11-23 11:54:09,029 INFO L273 TraceCheckUtils]: 64: Hoare triple {8277#false} assume !(~i~0 < 100000); {8277#false} is VALID [2018-11-23 11:54:09,029 INFO L273 TraceCheckUtils]: 65: Hoare triple {8277#false} ~i~0 := 0; {8277#false} is VALID [2018-11-23 11:54:09,029 INFO L273 TraceCheckUtils]: 66: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8277#false} is VALID [2018-11-23 11:54:09,029 INFO L273 TraceCheckUtils]: 67: Hoare triple {8277#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8277#false} is VALID [2018-11-23 11:54:09,029 INFO L273 TraceCheckUtils]: 68: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8277#false} is VALID [2018-11-23 11:54:09,030 INFO L273 TraceCheckUtils]: 69: Hoare triple {8277#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8277#false} is VALID [2018-11-23 11:54:09,030 INFO L273 TraceCheckUtils]: 70: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8277#false} is VALID [2018-11-23 11:54:09,030 INFO L273 TraceCheckUtils]: 71: Hoare triple {8277#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8277#false} is VALID [2018-11-23 11:54:09,030 INFO L273 TraceCheckUtils]: 72: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8277#false} is VALID [2018-11-23 11:54:09,030 INFO L273 TraceCheckUtils]: 73: Hoare triple {8277#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8277#false} is VALID [2018-11-23 11:54:09,030 INFO L273 TraceCheckUtils]: 74: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8277#false} is VALID [2018-11-23 11:54:09,031 INFO L273 TraceCheckUtils]: 75: Hoare triple {8277#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8277#false} is VALID [2018-11-23 11:54:09,031 INFO L273 TraceCheckUtils]: 76: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8277#false} is VALID [2018-11-23 11:54:09,031 INFO L273 TraceCheckUtils]: 77: Hoare triple {8277#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8277#false} is VALID [2018-11-23 11:54:09,031 INFO L273 TraceCheckUtils]: 78: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8277#false} is VALID [2018-11-23 11:54:09,031 INFO L273 TraceCheckUtils]: 79: Hoare triple {8277#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8277#false} is VALID [2018-11-23 11:54:09,031 INFO L273 TraceCheckUtils]: 80: Hoare triple {8277#false} assume !(~i~0 < 100000); {8277#false} is VALID [2018-11-23 11:54:09,032 INFO L273 TraceCheckUtils]: 81: Hoare triple {8277#false} ~i~0 := 0; {8277#false} is VALID [2018-11-23 11:54:09,032 INFO L273 TraceCheckUtils]: 82: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8277#false} is VALID [2018-11-23 11:54:09,032 INFO L273 TraceCheckUtils]: 83: Hoare triple {8277#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8277#false} is VALID [2018-11-23 11:54:09,032 INFO L273 TraceCheckUtils]: 84: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8277#false} is VALID [2018-11-23 11:54:09,032 INFO L273 TraceCheckUtils]: 85: Hoare triple {8277#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8277#false} is VALID [2018-11-23 11:54:09,032 INFO L273 TraceCheckUtils]: 86: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8277#false} is VALID [2018-11-23 11:54:09,032 INFO L273 TraceCheckUtils]: 87: Hoare triple {8277#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8277#false} is VALID [2018-11-23 11:54:09,033 INFO L273 TraceCheckUtils]: 88: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8277#false} is VALID [2018-11-23 11:54:09,033 INFO L273 TraceCheckUtils]: 89: Hoare triple {8277#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8277#false} is VALID [2018-11-23 11:54:09,033 INFO L273 TraceCheckUtils]: 90: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8277#false} is VALID [2018-11-23 11:54:09,033 INFO L273 TraceCheckUtils]: 91: Hoare triple {8277#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8277#false} is VALID [2018-11-23 11:54:09,033 INFO L273 TraceCheckUtils]: 92: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8277#false} is VALID [2018-11-23 11:54:09,033 INFO L273 TraceCheckUtils]: 93: Hoare triple {8277#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8277#false} is VALID [2018-11-23 11:54:09,034 INFO L273 TraceCheckUtils]: 94: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8277#false} is VALID [2018-11-23 11:54:09,034 INFO L273 TraceCheckUtils]: 95: Hoare triple {8277#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8277#false} is VALID [2018-11-23 11:54:09,034 INFO L273 TraceCheckUtils]: 96: Hoare triple {8277#false} assume !(~i~0 < 100000); {8277#false} is VALID [2018-11-23 11:54:09,034 INFO L273 TraceCheckUtils]: 97: Hoare triple {8277#false} ~i~0 := 0; {8277#false} is VALID [2018-11-23 11:54:09,034 INFO L273 TraceCheckUtils]: 98: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8277#false} is VALID [2018-11-23 11:54:09,034 INFO L273 TraceCheckUtils]: 99: Hoare triple {8277#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8277#false} is VALID [2018-11-23 11:54:09,035 INFO L273 TraceCheckUtils]: 100: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8277#false} is VALID [2018-11-23 11:54:09,035 INFO L273 TraceCheckUtils]: 101: Hoare triple {8277#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8277#false} is VALID [2018-11-23 11:54:09,035 INFO L273 TraceCheckUtils]: 102: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8277#false} is VALID [2018-11-23 11:54:09,035 INFO L273 TraceCheckUtils]: 103: Hoare triple {8277#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8277#false} is VALID [2018-11-23 11:54:09,035 INFO L273 TraceCheckUtils]: 104: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8277#false} is VALID [2018-11-23 11:54:09,035 INFO L273 TraceCheckUtils]: 105: Hoare triple {8277#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8277#false} is VALID [2018-11-23 11:54:09,036 INFO L273 TraceCheckUtils]: 106: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8277#false} is VALID [2018-11-23 11:54:09,036 INFO L273 TraceCheckUtils]: 107: Hoare triple {8277#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8277#false} is VALID [2018-11-23 11:54:09,036 INFO L273 TraceCheckUtils]: 108: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8277#false} is VALID [2018-11-23 11:54:09,036 INFO L273 TraceCheckUtils]: 109: Hoare triple {8277#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8277#false} is VALID [2018-11-23 11:54:09,036 INFO L273 TraceCheckUtils]: 110: Hoare triple {8277#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8277#false} is VALID [2018-11-23 11:54:09,036 INFO L273 TraceCheckUtils]: 111: Hoare triple {8277#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8277#false} is VALID [2018-11-23 11:54:09,037 INFO L273 TraceCheckUtils]: 112: Hoare triple {8277#false} assume !(~i~0 < 100000); {8277#false} is VALID [2018-11-23 11:54:09,037 INFO L273 TraceCheckUtils]: 113: Hoare triple {8277#false} havoc ~x~0;~x~0 := 0; {8277#false} is VALID [2018-11-23 11:54:09,037 INFO L273 TraceCheckUtils]: 114: Hoare triple {8277#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {8277#false} is VALID [2018-11-23 11:54:09,037 INFO L256 TraceCheckUtils]: 115: Hoare triple {8277#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {8277#false} is VALID [2018-11-23 11:54:09,037 INFO L273 TraceCheckUtils]: 116: Hoare triple {8277#false} ~cond := #in~cond; {8277#false} is VALID [2018-11-23 11:54:09,037 INFO L273 TraceCheckUtils]: 117: Hoare triple {8277#false} assume 0 == ~cond; {8277#false} is VALID [2018-11-23 11:54:09,038 INFO L273 TraceCheckUtils]: 118: Hoare triple {8277#false} assume !false; {8277#false} is VALID [2018-11-23 11:54:09,044 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-11-23 11:54:09,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:09,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 11:54:09,073 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 119 [2018-11-23 11:54:09,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:09,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:54:09,139 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:09,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:54:09,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:54:09,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:54:09,140 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand 17 states. [2018-11-23 11:54:09,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:09,533 INFO L93 Difference]: Finished difference Result 218 states and 230 transitions. [2018-11-23 11:54:09,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:54:09,533 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 119 [2018-11-23 11:54:09,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:09,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:54:09,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 100 transitions. [2018-11-23 11:54:09,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:54:09,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 100 transitions. [2018-11-23 11:54:09,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 100 transitions. [2018-11-23 11:54:09,635 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:09,638 INFO L225 Difference]: With dead ends: 218 [2018-11-23 11:54:09,638 INFO L226 Difference]: Without dead ends: 127 [2018-11-23 11:54:09,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:54:09,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-23 11:54:09,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2018-11-23 11:54:09,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:09,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand 126 states. [2018-11-23 11:54:09,740 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 126 states. [2018-11-23 11:54:09,740 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 126 states. [2018-11-23 11:54:09,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:09,743 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2018-11-23 11:54:09,743 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 133 transitions. [2018-11-23 11:54:09,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:09,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:09,744 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 127 states. [2018-11-23 11:54:09,744 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 127 states. [2018-11-23 11:54:09,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:09,747 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2018-11-23 11:54:09,747 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 133 transitions. [2018-11-23 11:54:09,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:09,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:09,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:09,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:09,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-23 11:54:09,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2018-11-23 11:54:09,751 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 119 [2018-11-23 11:54:09,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:09,751 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2018-11-23 11:54:09,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:54:09,751 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2018-11-23 11:54:09,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-23 11:54:09,752 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:09,753 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:09,753 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:09,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:09,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1824707852, now seen corresponding path program 13 times [2018-11-23 11:54:09,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:09,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:09,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:09,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:09,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:10,225 INFO L256 TraceCheckUtils]: 0: Hoare triple {9414#true} call ULTIMATE.init(); {9414#true} is VALID [2018-11-23 11:54:10,225 INFO L273 TraceCheckUtils]: 1: Hoare triple {9414#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9414#true} is VALID [2018-11-23 11:54:10,226 INFO L273 TraceCheckUtils]: 2: Hoare triple {9414#true} assume true; {9414#true} is VALID [2018-11-23 11:54:10,226 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9414#true} {9414#true} #119#return; {9414#true} is VALID [2018-11-23 11:54:10,226 INFO L256 TraceCheckUtils]: 4: Hoare triple {9414#true} call #t~ret16 := main(); {9414#true} is VALID [2018-11-23 11:54:10,227 INFO L273 TraceCheckUtils]: 5: Hoare triple {9414#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {9416#(= main_~a~0 0)} is VALID [2018-11-23 11:54:10,227 INFO L273 TraceCheckUtils]: 6: Hoare triple {9416#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9416#(= main_~a~0 0)} is VALID [2018-11-23 11:54:10,228 INFO L273 TraceCheckUtils]: 7: Hoare triple {9416#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9417#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:10,228 INFO L273 TraceCheckUtils]: 8: Hoare triple {9417#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9417#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:10,229 INFO L273 TraceCheckUtils]: 9: Hoare triple {9417#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9418#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:10,229 INFO L273 TraceCheckUtils]: 10: Hoare triple {9418#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9418#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:10,229 INFO L273 TraceCheckUtils]: 11: Hoare triple {9418#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9419#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:10,230 INFO L273 TraceCheckUtils]: 12: Hoare triple {9419#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9419#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:10,230 INFO L273 TraceCheckUtils]: 13: Hoare triple {9419#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9420#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:10,231 INFO L273 TraceCheckUtils]: 14: Hoare triple {9420#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9420#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:10,231 INFO L273 TraceCheckUtils]: 15: Hoare triple {9420#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9421#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:10,232 INFO L273 TraceCheckUtils]: 16: Hoare triple {9421#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9421#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:10,233 INFO L273 TraceCheckUtils]: 17: Hoare triple {9421#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9422#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:10,233 INFO L273 TraceCheckUtils]: 18: Hoare triple {9422#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9422#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:10,234 INFO L273 TraceCheckUtils]: 19: Hoare triple {9422#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9423#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:10,234 INFO L273 TraceCheckUtils]: 20: Hoare triple {9423#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9423#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:10,235 INFO L273 TraceCheckUtils]: 21: Hoare triple {9423#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9424#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:10,236 INFO L273 TraceCheckUtils]: 22: Hoare triple {9424#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9424#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:10,237 INFO L273 TraceCheckUtils]: 23: Hoare triple {9424#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9425#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:10,237 INFO L273 TraceCheckUtils]: 24: Hoare triple {9425#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9425#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:10,238 INFO L273 TraceCheckUtils]: 25: Hoare triple {9425#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9426#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:10,238 INFO L273 TraceCheckUtils]: 26: Hoare triple {9426#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9426#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:10,239 INFO L273 TraceCheckUtils]: 27: Hoare triple {9426#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9427#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:10,240 INFO L273 TraceCheckUtils]: 28: Hoare triple {9427#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9427#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:10,240 INFO L273 TraceCheckUtils]: 29: Hoare triple {9427#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9428#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:10,241 INFO L273 TraceCheckUtils]: 30: Hoare triple {9428#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9428#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:10,242 INFO L273 TraceCheckUtils]: 31: Hoare triple {9428#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9429#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:10,242 INFO L273 TraceCheckUtils]: 32: Hoare triple {9429#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9429#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:10,243 INFO L273 TraceCheckUtils]: 33: Hoare triple {9429#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9430#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:10,244 INFO L273 TraceCheckUtils]: 34: Hoare triple {9430#(<= main_~a~0 14)} assume !(~a~0 < 100000); {9415#false} is VALID [2018-11-23 11:54:10,244 INFO L273 TraceCheckUtils]: 35: Hoare triple {9415#false} havoc ~i~0;~i~0 := 0; {9415#false} is VALID [2018-11-23 11:54:10,244 INFO L273 TraceCheckUtils]: 36: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9415#false} is VALID [2018-11-23 11:54:10,245 INFO L273 TraceCheckUtils]: 37: Hoare triple {9415#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9415#false} is VALID [2018-11-23 11:54:10,245 INFO L273 TraceCheckUtils]: 38: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9415#false} is VALID [2018-11-23 11:54:10,245 INFO L273 TraceCheckUtils]: 39: Hoare triple {9415#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9415#false} is VALID [2018-11-23 11:54:10,245 INFO L273 TraceCheckUtils]: 40: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9415#false} is VALID [2018-11-23 11:54:10,245 INFO L273 TraceCheckUtils]: 41: Hoare triple {9415#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9415#false} is VALID [2018-11-23 11:54:10,246 INFO L273 TraceCheckUtils]: 42: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9415#false} is VALID [2018-11-23 11:54:10,246 INFO L273 TraceCheckUtils]: 43: Hoare triple {9415#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9415#false} is VALID [2018-11-23 11:54:10,246 INFO L273 TraceCheckUtils]: 44: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9415#false} is VALID [2018-11-23 11:54:10,246 INFO L273 TraceCheckUtils]: 45: Hoare triple {9415#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9415#false} is VALID [2018-11-23 11:54:10,246 INFO L273 TraceCheckUtils]: 46: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9415#false} is VALID [2018-11-23 11:54:10,247 INFO L273 TraceCheckUtils]: 47: Hoare triple {9415#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9415#false} is VALID [2018-11-23 11:54:10,247 INFO L273 TraceCheckUtils]: 48: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9415#false} is VALID [2018-11-23 11:54:10,247 INFO L273 TraceCheckUtils]: 49: Hoare triple {9415#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9415#false} is VALID [2018-11-23 11:54:10,247 INFO L273 TraceCheckUtils]: 50: Hoare triple {9415#false} assume !(~i~0 < 100000); {9415#false} is VALID [2018-11-23 11:54:10,247 INFO L273 TraceCheckUtils]: 51: Hoare triple {9415#false} ~i~0 := 0; {9415#false} is VALID [2018-11-23 11:54:10,248 INFO L273 TraceCheckUtils]: 52: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9415#false} is VALID [2018-11-23 11:54:10,248 INFO L273 TraceCheckUtils]: 53: Hoare triple {9415#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9415#false} is VALID [2018-11-23 11:54:10,248 INFO L273 TraceCheckUtils]: 54: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9415#false} is VALID [2018-11-23 11:54:10,248 INFO L273 TraceCheckUtils]: 55: Hoare triple {9415#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9415#false} is VALID [2018-11-23 11:54:10,248 INFO L273 TraceCheckUtils]: 56: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9415#false} is VALID [2018-11-23 11:54:10,249 INFO L273 TraceCheckUtils]: 57: Hoare triple {9415#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9415#false} is VALID [2018-11-23 11:54:10,249 INFO L273 TraceCheckUtils]: 58: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9415#false} is VALID [2018-11-23 11:54:10,249 INFO L273 TraceCheckUtils]: 59: Hoare triple {9415#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9415#false} is VALID [2018-11-23 11:54:10,249 INFO L273 TraceCheckUtils]: 60: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9415#false} is VALID [2018-11-23 11:54:10,249 INFO L273 TraceCheckUtils]: 61: Hoare triple {9415#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9415#false} is VALID [2018-11-23 11:54:10,249 INFO L273 TraceCheckUtils]: 62: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9415#false} is VALID [2018-11-23 11:54:10,249 INFO L273 TraceCheckUtils]: 63: Hoare triple {9415#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9415#false} is VALID [2018-11-23 11:54:10,249 INFO L273 TraceCheckUtils]: 64: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9415#false} is VALID [2018-11-23 11:54:10,249 INFO L273 TraceCheckUtils]: 65: Hoare triple {9415#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9415#false} is VALID [2018-11-23 11:54:10,250 INFO L273 TraceCheckUtils]: 66: Hoare triple {9415#false} assume !(~i~0 < 100000); {9415#false} is VALID [2018-11-23 11:54:10,250 INFO L273 TraceCheckUtils]: 67: Hoare triple {9415#false} ~i~0 := 0; {9415#false} is VALID [2018-11-23 11:54:10,250 INFO L273 TraceCheckUtils]: 68: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9415#false} is VALID [2018-11-23 11:54:10,250 INFO L273 TraceCheckUtils]: 69: Hoare triple {9415#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9415#false} is VALID [2018-11-23 11:54:10,250 INFO L273 TraceCheckUtils]: 70: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9415#false} is VALID [2018-11-23 11:54:10,250 INFO L273 TraceCheckUtils]: 71: Hoare triple {9415#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9415#false} is VALID [2018-11-23 11:54:10,250 INFO L273 TraceCheckUtils]: 72: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9415#false} is VALID [2018-11-23 11:54:10,250 INFO L273 TraceCheckUtils]: 73: Hoare triple {9415#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9415#false} is VALID [2018-11-23 11:54:10,251 INFO L273 TraceCheckUtils]: 74: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9415#false} is VALID [2018-11-23 11:54:10,251 INFO L273 TraceCheckUtils]: 75: Hoare triple {9415#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9415#false} is VALID [2018-11-23 11:54:10,251 INFO L273 TraceCheckUtils]: 76: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9415#false} is VALID [2018-11-23 11:54:10,251 INFO L273 TraceCheckUtils]: 77: Hoare triple {9415#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9415#false} is VALID [2018-11-23 11:54:10,251 INFO L273 TraceCheckUtils]: 78: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9415#false} is VALID [2018-11-23 11:54:10,251 INFO L273 TraceCheckUtils]: 79: Hoare triple {9415#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9415#false} is VALID [2018-11-23 11:54:10,251 INFO L273 TraceCheckUtils]: 80: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9415#false} is VALID [2018-11-23 11:54:10,251 INFO L273 TraceCheckUtils]: 81: Hoare triple {9415#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9415#false} is VALID [2018-11-23 11:54:10,251 INFO L273 TraceCheckUtils]: 82: Hoare triple {9415#false} assume !(~i~0 < 100000); {9415#false} is VALID [2018-11-23 11:54:10,252 INFO L273 TraceCheckUtils]: 83: Hoare triple {9415#false} ~i~0 := 0; {9415#false} is VALID [2018-11-23 11:54:10,252 INFO L273 TraceCheckUtils]: 84: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9415#false} is VALID [2018-11-23 11:54:10,252 INFO L273 TraceCheckUtils]: 85: Hoare triple {9415#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9415#false} is VALID [2018-11-23 11:54:10,252 INFO L273 TraceCheckUtils]: 86: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9415#false} is VALID [2018-11-23 11:54:10,252 INFO L273 TraceCheckUtils]: 87: Hoare triple {9415#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9415#false} is VALID [2018-11-23 11:54:10,252 INFO L273 TraceCheckUtils]: 88: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9415#false} is VALID [2018-11-23 11:54:10,252 INFO L273 TraceCheckUtils]: 89: Hoare triple {9415#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9415#false} is VALID [2018-11-23 11:54:10,252 INFO L273 TraceCheckUtils]: 90: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9415#false} is VALID [2018-11-23 11:54:10,253 INFO L273 TraceCheckUtils]: 91: Hoare triple {9415#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9415#false} is VALID [2018-11-23 11:54:10,253 INFO L273 TraceCheckUtils]: 92: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9415#false} is VALID [2018-11-23 11:54:10,253 INFO L273 TraceCheckUtils]: 93: Hoare triple {9415#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9415#false} is VALID [2018-11-23 11:54:10,253 INFO L273 TraceCheckUtils]: 94: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9415#false} is VALID [2018-11-23 11:54:10,253 INFO L273 TraceCheckUtils]: 95: Hoare triple {9415#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9415#false} is VALID [2018-11-23 11:54:10,253 INFO L273 TraceCheckUtils]: 96: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9415#false} is VALID [2018-11-23 11:54:10,253 INFO L273 TraceCheckUtils]: 97: Hoare triple {9415#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9415#false} is VALID [2018-11-23 11:54:10,253 INFO L273 TraceCheckUtils]: 98: Hoare triple {9415#false} assume !(~i~0 < 100000); {9415#false} is VALID [2018-11-23 11:54:10,253 INFO L273 TraceCheckUtils]: 99: Hoare triple {9415#false} ~i~0 := 0; {9415#false} is VALID [2018-11-23 11:54:10,254 INFO L273 TraceCheckUtils]: 100: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9415#false} is VALID [2018-11-23 11:54:10,254 INFO L273 TraceCheckUtils]: 101: Hoare triple {9415#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9415#false} is VALID [2018-11-23 11:54:10,254 INFO L273 TraceCheckUtils]: 102: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9415#false} is VALID [2018-11-23 11:54:10,254 INFO L273 TraceCheckUtils]: 103: Hoare triple {9415#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9415#false} is VALID [2018-11-23 11:54:10,254 INFO L273 TraceCheckUtils]: 104: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9415#false} is VALID [2018-11-23 11:54:10,254 INFO L273 TraceCheckUtils]: 105: Hoare triple {9415#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9415#false} is VALID [2018-11-23 11:54:10,254 INFO L273 TraceCheckUtils]: 106: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9415#false} is VALID [2018-11-23 11:54:10,254 INFO L273 TraceCheckUtils]: 107: Hoare triple {9415#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9415#false} is VALID [2018-11-23 11:54:10,255 INFO L273 TraceCheckUtils]: 108: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9415#false} is VALID [2018-11-23 11:54:10,255 INFO L273 TraceCheckUtils]: 109: Hoare triple {9415#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9415#false} is VALID [2018-11-23 11:54:10,255 INFO L273 TraceCheckUtils]: 110: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9415#false} is VALID [2018-11-23 11:54:10,255 INFO L273 TraceCheckUtils]: 111: Hoare triple {9415#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9415#false} is VALID [2018-11-23 11:54:10,255 INFO L273 TraceCheckUtils]: 112: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9415#false} is VALID [2018-11-23 11:54:10,255 INFO L273 TraceCheckUtils]: 113: Hoare triple {9415#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9415#false} is VALID [2018-11-23 11:54:10,255 INFO L273 TraceCheckUtils]: 114: Hoare triple {9415#false} assume !(~i~0 < 100000); {9415#false} is VALID [2018-11-23 11:54:10,255 INFO L273 TraceCheckUtils]: 115: Hoare triple {9415#false} havoc ~x~0;~x~0 := 0; {9415#false} is VALID [2018-11-23 11:54:10,255 INFO L273 TraceCheckUtils]: 116: Hoare triple {9415#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {9415#false} is VALID [2018-11-23 11:54:10,256 INFO L256 TraceCheckUtils]: 117: Hoare triple {9415#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {9415#false} is VALID [2018-11-23 11:54:10,256 INFO L273 TraceCheckUtils]: 118: Hoare triple {9415#false} ~cond := #in~cond; {9415#false} is VALID [2018-11-23 11:54:10,256 INFO L273 TraceCheckUtils]: 119: Hoare triple {9415#false} assume 0 == ~cond; {9415#false} is VALID [2018-11-23 11:54:10,256 INFO L273 TraceCheckUtils]: 120: Hoare triple {9415#false} assume !false; {9415#false} is VALID [2018-11-23 11:54:10,262 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-11-23 11:54:10,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:10,263 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 11:54:10,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:10,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:10,669 INFO L256 TraceCheckUtils]: 0: Hoare triple {9414#true} call ULTIMATE.init(); {9414#true} is VALID [2018-11-23 11:54:10,670 INFO L273 TraceCheckUtils]: 1: Hoare triple {9414#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9414#true} is VALID [2018-11-23 11:54:10,670 INFO L273 TraceCheckUtils]: 2: Hoare triple {9414#true} assume true; {9414#true} is VALID [2018-11-23 11:54:10,670 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9414#true} {9414#true} #119#return; {9414#true} is VALID [2018-11-23 11:54:10,670 INFO L256 TraceCheckUtils]: 4: Hoare triple {9414#true} call #t~ret16 := main(); {9414#true} is VALID [2018-11-23 11:54:10,672 INFO L273 TraceCheckUtils]: 5: Hoare triple {9414#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {9449#(<= main_~a~0 0)} is VALID [2018-11-23 11:54:10,672 INFO L273 TraceCheckUtils]: 6: Hoare triple {9449#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9449#(<= main_~a~0 0)} is VALID [2018-11-23 11:54:10,673 INFO L273 TraceCheckUtils]: 7: Hoare triple {9449#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9417#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:10,673 INFO L273 TraceCheckUtils]: 8: Hoare triple {9417#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9417#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:10,674 INFO L273 TraceCheckUtils]: 9: Hoare triple {9417#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9418#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:10,674 INFO L273 TraceCheckUtils]: 10: Hoare triple {9418#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9418#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:10,675 INFO L273 TraceCheckUtils]: 11: Hoare triple {9418#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9419#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:10,675 INFO L273 TraceCheckUtils]: 12: Hoare triple {9419#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9419#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:10,676 INFO L273 TraceCheckUtils]: 13: Hoare triple {9419#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9420#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:10,677 INFO L273 TraceCheckUtils]: 14: Hoare triple {9420#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9420#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:10,677 INFO L273 TraceCheckUtils]: 15: Hoare triple {9420#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9421#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:10,678 INFO L273 TraceCheckUtils]: 16: Hoare triple {9421#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9421#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:10,679 INFO L273 TraceCheckUtils]: 17: Hoare triple {9421#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9422#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:10,679 INFO L273 TraceCheckUtils]: 18: Hoare triple {9422#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9422#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:10,680 INFO L273 TraceCheckUtils]: 19: Hoare triple {9422#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9423#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:10,681 INFO L273 TraceCheckUtils]: 20: Hoare triple {9423#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9423#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:10,681 INFO L273 TraceCheckUtils]: 21: Hoare triple {9423#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9424#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:10,682 INFO L273 TraceCheckUtils]: 22: Hoare triple {9424#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9424#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:10,683 INFO L273 TraceCheckUtils]: 23: Hoare triple {9424#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9425#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:10,683 INFO L273 TraceCheckUtils]: 24: Hoare triple {9425#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9425#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:10,684 INFO L273 TraceCheckUtils]: 25: Hoare triple {9425#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9426#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:10,685 INFO L273 TraceCheckUtils]: 26: Hoare triple {9426#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9426#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:10,685 INFO L273 TraceCheckUtils]: 27: Hoare triple {9426#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9427#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:10,686 INFO L273 TraceCheckUtils]: 28: Hoare triple {9427#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9427#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:10,687 INFO L273 TraceCheckUtils]: 29: Hoare triple {9427#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9428#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:10,687 INFO L273 TraceCheckUtils]: 30: Hoare triple {9428#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9428#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:10,688 INFO L273 TraceCheckUtils]: 31: Hoare triple {9428#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9429#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:10,688 INFO L273 TraceCheckUtils]: 32: Hoare triple {9429#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9429#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:10,689 INFO L273 TraceCheckUtils]: 33: Hoare triple {9429#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9430#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:10,690 INFO L273 TraceCheckUtils]: 34: Hoare triple {9430#(<= main_~a~0 14)} assume !(~a~0 < 100000); {9415#false} is VALID [2018-11-23 11:54:10,690 INFO L273 TraceCheckUtils]: 35: Hoare triple {9415#false} havoc ~i~0;~i~0 := 0; {9415#false} is VALID [2018-11-23 11:54:10,690 INFO L273 TraceCheckUtils]: 36: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9415#false} is VALID [2018-11-23 11:54:10,691 INFO L273 TraceCheckUtils]: 37: Hoare triple {9415#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9415#false} is VALID [2018-11-23 11:54:10,691 INFO L273 TraceCheckUtils]: 38: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9415#false} is VALID [2018-11-23 11:54:10,691 INFO L273 TraceCheckUtils]: 39: Hoare triple {9415#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9415#false} is VALID [2018-11-23 11:54:10,691 INFO L273 TraceCheckUtils]: 40: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9415#false} is VALID [2018-11-23 11:54:10,691 INFO L273 TraceCheckUtils]: 41: Hoare triple {9415#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9415#false} is VALID [2018-11-23 11:54:10,692 INFO L273 TraceCheckUtils]: 42: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9415#false} is VALID [2018-11-23 11:54:10,692 INFO L273 TraceCheckUtils]: 43: Hoare triple {9415#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9415#false} is VALID [2018-11-23 11:54:10,692 INFO L273 TraceCheckUtils]: 44: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9415#false} is VALID [2018-11-23 11:54:10,692 INFO L273 TraceCheckUtils]: 45: Hoare triple {9415#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9415#false} is VALID [2018-11-23 11:54:10,692 INFO L273 TraceCheckUtils]: 46: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9415#false} is VALID [2018-11-23 11:54:10,692 INFO L273 TraceCheckUtils]: 47: Hoare triple {9415#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9415#false} is VALID [2018-11-23 11:54:10,693 INFO L273 TraceCheckUtils]: 48: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9415#false} is VALID [2018-11-23 11:54:10,693 INFO L273 TraceCheckUtils]: 49: Hoare triple {9415#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9415#false} is VALID [2018-11-23 11:54:10,693 INFO L273 TraceCheckUtils]: 50: Hoare triple {9415#false} assume !(~i~0 < 100000); {9415#false} is VALID [2018-11-23 11:54:10,693 INFO L273 TraceCheckUtils]: 51: Hoare triple {9415#false} ~i~0 := 0; {9415#false} is VALID [2018-11-23 11:54:10,693 INFO L273 TraceCheckUtils]: 52: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9415#false} is VALID [2018-11-23 11:54:10,693 INFO L273 TraceCheckUtils]: 53: Hoare triple {9415#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9415#false} is VALID [2018-11-23 11:54:10,693 INFO L273 TraceCheckUtils]: 54: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9415#false} is VALID [2018-11-23 11:54:10,693 INFO L273 TraceCheckUtils]: 55: Hoare triple {9415#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9415#false} is VALID [2018-11-23 11:54:10,694 INFO L273 TraceCheckUtils]: 56: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9415#false} is VALID [2018-11-23 11:54:10,694 INFO L273 TraceCheckUtils]: 57: Hoare triple {9415#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9415#false} is VALID [2018-11-23 11:54:10,694 INFO L273 TraceCheckUtils]: 58: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9415#false} is VALID [2018-11-23 11:54:10,694 INFO L273 TraceCheckUtils]: 59: Hoare triple {9415#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9415#false} is VALID [2018-11-23 11:54:10,694 INFO L273 TraceCheckUtils]: 60: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9415#false} is VALID [2018-11-23 11:54:10,694 INFO L273 TraceCheckUtils]: 61: Hoare triple {9415#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9415#false} is VALID [2018-11-23 11:54:10,694 INFO L273 TraceCheckUtils]: 62: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9415#false} is VALID [2018-11-23 11:54:10,694 INFO L273 TraceCheckUtils]: 63: Hoare triple {9415#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9415#false} is VALID [2018-11-23 11:54:10,694 INFO L273 TraceCheckUtils]: 64: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9415#false} is VALID [2018-11-23 11:54:10,695 INFO L273 TraceCheckUtils]: 65: Hoare triple {9415#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9415#false} is VALID [2018-11-23 11:54:10,695 INFO L273 TraceCheckUtils]: 66: Hoare triple {9415#false} assume !(~i~0 < 100000); {9415#false} is VALID [2018-11-23 11:54:10,695 INFO L273 TraceCheckUtils]: 67: Hoare triple {9415#false} ~i~0 := 0; {9415#false} is VALID [2018-11-23 11:54:10,695 INFO L273 TraceCheckUtils]: 68: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9415#false} is VALID [2018-11-23 11:54:10,695 INFO L273 TraceCheckUtils]: 69: Hoare triple {9415#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9415#false} is VALID [2018-11-23 11:54:10,696 INFO L273 TraceCheckUtils]: 70: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9415#false} is VALID [2018-11-23 11:54:10,696 INFO L273 TraceCheckUtils]: 71: Hoare triple {9415#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9415#false} is VALID [2018-11-23 11:54:10,696 INFO L273 TraceCheckUtils]: 72: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9415#false} is VALID [2018-11-23 11:54:10,696 INFO L273 TraceCheckUtils]: 73: Hoare triple {9415#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9415#false} is VALID [2018-11-23 11:54:10,696 INFO L273 TraceCheckUtils]: 74: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9415#false} is VALID [2018-11-23 11:54:10,696 INFO L273 TraceCheckUtils]: 75: Hoare triple {9415#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9415#false} is VALID [2018-11-23 11:54:10,697 INFO L273 TraceCheckUtils]: 76: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9415#false} is VALID [2018-11-23 11:54:10,697 INFO L273 TraceCheckUtils]: 77: Hoare triple {9415#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9415#false} is VALID [2018-11-23 11:54:10,697 INFO L273 TraceCheckUtils]: 78: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9415#false} is VALID [2018-11-23 11:54:10,697 INFO L273 TraceCheckUtils]: 79: Hoare triple {9415#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9415#false} is VALID [2018-11-23 11:54:10,697 INFO L273 TraceCheckUtils]: 80: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9415#false} is VALID [2018-11-23 11:54:10,698 INFO L273 TraceCheckUtils]: 81: Hoare triple {9415#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9415#false} is VALID [2018-11-23 11:54:10,698 INFO L273 TraceCheckUtils]: 82: Hoare triple {9415#false} assume !(~i~0 < 100000); {9415#false} is VALID [2018-11-23 11:54:10,698 INFO L273 TraceCheckUtils]: 83: Hoare triple {9415#false} ~i~0 := 0; {9415#false} is VALID [2018-11-23 11:54:10,698 INFO L273 TraceCheckUtils]: 84: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9415#false} is VALID [2018-11-23 11:54:10,698 INFO L273 TraceCheckUtils]: 85: Hoare triple {9415#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9415#false} is VALID [2018-11-23 11:54:10,698 INFO L273 TraceCheckUtils]: 86: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9415#false} is VALID [2018-11-23 11:54:10,699 INFO L273 TraceCheckUtils]: 87: Hoare triple {9415#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9415#false} is VALID [2018-11-23 11:54:10,699 INFO L273 TraceCheckUtils]: 88: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9415#false} is VALID [2018-11-23 11:54:10,699 INFO L273 TraceCheckUtils]: 89: Hoare triple {9415#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9415#false} is VALID [2018-11-23 11:54:10,699 INFO L273 TraceCheckUtils]: 90: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9415#false} is VALID [2018-11-23 11:54:10,699 INFO L273 TraceCheckUtils]: 91: Hoare triple {9415#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9415#false} is VALID [2018-11-23 11:54:10,700 INFO L273 TraceCheckUtils]: 92: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9415#false} is VALID [2018-11-23 11:54:10,700 INFO L273 TraceCheckUtils]: 93: Hoare triple {9415#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9415#false} is VALID [2018-11-23 11:54:10,700 INFO L273 TraceCheckUtils]: 94: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9415#false} is VALID [2018-11-23 11:54:10,700 INFO L273 TraceCheckUtils]: 95: Hoare triple {9415#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9415#false} is VALID [2018-11-23 11:54:10,700 INFO L273 TraceCheckUtils]: 96: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9415#false} is VALID [2018-11-23 11:54:10,701 INFO L273 TraceCheckUtils]: 97: Hoare triple {9415#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9415#false} is VALID [2018-11-23 11:54:10,701 INFO L273 TraceCheckUtils]: 98: Hoare triple {9415#false} assume !(~i~0 < 100000); {9415#false} is VALID [2018-11-23 11:54:10,701 INFO L273 TraceCheckUtils]: 99: Hoare triple {9415#false} ~i~0 := 0; {9415#false} is VALID [2018-11-23 11:54:10,701 INFO L273 TraceCheckUtils]: 100: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9415#false} is VALID [2018-11-23 11:54:10,701 INFO L273 TraceCheckUtils]: 101: Hoare triple {9415#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9415#false} is VALID [2018-11-23 11:54:10,701 INFO L273 TraceCheckUtils]: 102: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9415#false} is VALID [2018-11-23 11:54:10,702 INFO L273 TraceCheckUtils]: 103: Hoare triple {9415#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9415#false} is VALID [2018-11-23 11:54:10,702 INFO L273 TraceCheckUtils]: 104: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9415#false} is VALID [2018-11-23 11:54:10,702 INFO L273 TraceCheckUtils]: 105: Hoare triple {9415#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9415#false} is VALID [2018-11-23 11:54:10,702 INFO L273 TraceCheckUtils]: 106: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9415#false} is VALID [2018-11-23 11:54:10,702 INFO L273 TraceCheckUtils]: 107: Hoare triple {9415#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9415#false} is VALID [2018-11-23 11:54:10,702 INFO L273 TraceCheckUtils]: 108: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9415#false} is VALID [2018-11-23 11:54:10,703 INFO L273 TraceCheckUtils]: 109: Hoare triple {9415#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9415#false} is VALID [2018-11-23 11:54:10,703 INFO L273 TraceCheckUtils]: 110: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9415#false} is VALID [2018-11-23 11:54:10,703 INFO L273 TraceCheckUtils]: 111: Hoare triple {9415#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9415#false} is VALID [2018-11-23 11:54:10,703 INFO L273 TraceCheckUtils]: 112: Hoare triple {9415#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9415#false} is VALID [2018-11-23 11:54:10,703 INFO L273 TraceCheckUtils]: 113: Hoare triple {9415#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9415#false} is VALID [2018-11-23 11:54:10,703 INFO L273 TraceCheckUtils]: 114: Hoare triple {9415#false} assume !(~i~0 < 100000); {9415#false} is VALID [2018-11-23 11:54:10,704 INFO L273 TraceCheckUtils]: 115: Hoare triple {9415#false} havoc ~x~0;~x~0 := 0; {9415#false} is VALID [2018-11-23 11:54:10,704 INFO L273 TraceCheckUtils]: 116: Hoare triple {9415#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {9415#false} is VALID [2018-11-23 11:54:10,704 INFO L256 TraceCheckUtils]: 117: Hoare triple {9415#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {9415#false} is VALID [2018-11-23 11:54:10,704 INFO L273 TraceCheckUtils]: 118: Hoare triple {9415#false} ~cond := #in~cond; {9415#false} is VALID [2018-11-23 11:54:10,704 INFO L273 TraceCheckUtils]: 119: Hoare triple {9415#false} assume 0 == ~cond; {9415#false} is VALID [2018-11-23 11:54:10,704 INFO L273 TraceCheckUtils]: 120: Hoare triple {9415#false} assume !false; {9415#false} is VALID [2018-11-23 11:54:10,713 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-11-23 11:54:10,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:10,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 11:54:10,744 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 121 [2018-11-23 11:54:10,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:10,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:54:10,835 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 11:54:10,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:54:10,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:54:10,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:54:10,836 INFO L87 Difference]: Start difference. First operand 126 states and 132 transitions. Second operand 18 states. [2018-11-23 11:54:11,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:11,702 INFO L93 Difference]: Finished difference Result 220 states and 232 transitions. [2018-11-23 11:54:11,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:54:11,702 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 121 [2018-11-23 11:54:11,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:11,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:54:11,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 102 transitions. [2018-11-23 11:54:11,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:54:11,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 102 transitions. [2018-11-23 11:54:11,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 102 transitions. [2018-11-23 11:54:11,809 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 11:54:11,811 INFO L225 Difference]: With dead ends: 220 [2018-11-23 11:54:11,811 INFO L226 Difference]: Without dead ends: 129 [2018-11-23 11:54:11,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:54:11,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-23 11:54:11,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2018-11-23 11:54:11,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:11,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand 128 states. [2018-11-23 11:54:11,915 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 128 states. [2018-11-23 11:54:11,915 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 128 states. [2018-11-23 11:54:11,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:11,917 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2018-11-23 11:54:11,918 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2018-11-23 11:54:11,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:11,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:11,918 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 129 states. [2018-11-23 11:54:11,919 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 129 states. [2018-11-23 11:54:11,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:11,921 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2018-11-23 11:54:11,921 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2018-11-23 11:54:11,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:11,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:11,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:11,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:11,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-23 11:54:11,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 134 transitions. [2018-11-23 11:54:11,924 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 134 transitions. Word has length 121 [2018-11-23 11:54:11,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:11,925 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 134 transitions. [2018-11-23 11:54:11,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:54:11,925 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2018-11-23 11:54:11,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-23 11:54:11,926 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:11,926 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:11,926 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:11,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:11,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1153970798, now seen corresponding path program 14 times [2018-11-23 11:54:11,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:11,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:11,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:11,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:11,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:13,012 INFO L256 TraceCheckUtils]: 0: Hoare triple {10569#true} call ULTIMATE.init(); {10569#true} is VALID [2018-11-23 11:54:13,012 INFO L273 TraceCheckUtils]: 1: Hoare triple {10569#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10569#true} is VALID [2018-11-23 11:54:13,012 INFO L273 TraceCheckUtils]: 2: Hoare triple {10569#true} assume true; {10569#true} is VALID [2018-11-23 11:54:13,012 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10569#true} {10569#true} #119#return; {10569#true} is VALID [2018-11-23 11:54:13,012 INFO L256 TraceCheckUtils]: 4: Hoare triple {10569#true} call #t~ret16 := main(); {10569#true} is VALID [2018-11-23 11:54:13,013 INFO L273 TraceCheckUtils]: 5: Hoare triple {10569#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {10571#(= main_~a~0 0)} is VALID [2018-11-23 11:54:13,013 INFO L273 TraceCheckUtils]: 6: Hoare triple {10571#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10571#(= main_~a~0 0)} is VALID [2018-11-23 11:54:13,014 INFO L273 TraceCheckUtils]: 7: Hoare triple {10571#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10572#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:13,014 INFO L273 TraceCheckUtils]: 8: Hoare triple {10572#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10572#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:13,014 INFO L273 TraceCheckUtils]: 9: Hoare triple {10572#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10573#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:13,015 INFO L273 TraceCheckUtils]: 10: Hoare triple {10573#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10573#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:13,015 INFO L273 TraceCheckUtils]: 11: Hoare triple {10573#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10574#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:13,016 INFO L273 TraceCheckUtils]: 12: Hoare triple {10574#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10574#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:13,017 INFO L273 TraceCheckUtils]: 13: Hoare triple {10574#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10575#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:13,017 INFO L273 TraceCheckUtils]: 14: Hoare triple {10575#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10575#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:13,018 INFO L273 TraceCheckUtils]: 15: Hoare triple {10575#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10576#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:13,019 INFO L273 TraceCheckUtils]: 16: Hoare triple {10576#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10576#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:13,020 INFO L273 TraceCheckUtils]: 17: Hoare triple {10576#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10577#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:13,020 INFO L273 TraceCheckUtils]: 18: Hoare triple {10577#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10577#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:13,021 INFO L273 TraceCheckUtils]: 19: Hoare triple {10577#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10578#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:13,021 INFO L273 TraceCheckUtils]: 20: Hoare triple {10578#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10578#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:13,022 INFO L273 TraceCheckUtils]: 21: Hoare triple {10578#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10579#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:13,023 INFO L273 TraceCheckUtils]: 22: Hoare triple {10579#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10579#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:13,024 INFO L273 TraceCheckUtils]: 23: Hoare triple {10579#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10580#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:13,024 INFO L273 TraceCheckUtils]: 24: Hoare triple {10580#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10580#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:13,025 INFO L273 TraceCheckUtils]: 25: Hoare triple {10580#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10581#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:13,025 INFO L273 TraceCheckUtils]: 26: Hoare triple {10581#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10581#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:13,026 INFO L273 TraceCheckUtils]: 27: Hoare triple {10581#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10582#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:13,027 INFO L273 TraceCheckUtils]: 28: Hoare triple {10582#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10582#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:13,027 INFO L273 TraceCheckUtils]: 29: Hoare triple {10582#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10583#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:13,028 INFO L273 TraceCheckUtils]: 30: Hoare triple {10583#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10583#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:13,029 INFO L273 TraceCheckUtils]: 31: Hoare triple {10583#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10584#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:13,029 INFO L273 TraceCheckUtils]: 32: Hoare triple {10584#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10584#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:13,030 INFO L273 TraceCheckUtils]: 33: Hoare triple {10584#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10585#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:13,031 INFO L273 TraceCheckUtils]: 34: Hoare triple {10585#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10585#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:13,031 INFO L273 TraceCheckUtils]: 35: Hoare triple {10585#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10586#(<= main_~a~0 15)} is VALID [2018-11-23 11:54:13,032 INFO L273 TraceCheckUtils]: 36: Hoare triple {10586#(<= main_~a~0 15)} assume !(~a~0 < 100000); {10570#false} is VALID [2018-11-23 11:54:13,032 INFO L273 TraceCheckUtils]: 37: Hoare triple {10570#false} havoc ~i~0;~i~0 := 0; {10570#false} is VALID [2018-11-23 11:54:13,032 INFO L273 TraceCheckUtils]: 38: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10570#false} is VALID [2018-11-23 11:54:13,033 INFO L273 TraceCheckUtils]: 39: Hoare triple {10570#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10570#false} is VALID [2018-11-23 11:54:13,033 INFO L273 TraceCheckUtils]: 40: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10570#false} is VALID [2018-11-23 11:54:13,033 INFO L273 TraceCheckUtils]: 41: Hoare triple {10570#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10570#false} is VALID [2018-11-23 11:54:13,033 INFO L273 TraceCheckUtils]: 42: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10570#false} is VALID [2018-11-23 11:54:13,034 INFO L273 TraceCheckUtils]: 43: Hoare triple {10570#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10570#false} is VALID [2018-11-23 11:54:13,034 INFO L273 TraceCheckUtils]: 44: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10570#false} is VALID [2018-11-23 11:54:13,034 INFO L273 TraceCheckUtils]: 45: Hoare triple {10570#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10570#false} is VALID [2018-11-23 11:54:13,034 INFO L273 TraceCheckUtils]: 46: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10570#false} is VALID [2018-11-23 11:54:13,034 INFO L273 TraceCheckUtils]: 47: Hoare triple {10570#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10570#false} is VALID [2018-11-23 11:54:13,034 INFO L273 TraceCheckUtils]: 48: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10570#false} is VALID [2018-11-23 11:54:13,035 INFO L273 TraceCheckUtils]: 49: Hoare triple {10570#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10570#false} is VALID [2018-11-23 11:54:13,035 INFO L273 TraceCheckUtils]: 50: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10570#false} is VALID [2018-11-23 11:54:13,035 INFO L273 TraceCheckUtils]: 51: Hoare triple {10570#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10570#false} is VALID [2018-11-23 11:54:13,035 INFO L273 TraceCheckUtils]: 52: Hoare triple {10570#false} assume !(~i~0 < 100000); {10570#false} is VALID [2018-11-23 11:54:13,035 INFO L273 TraceCheckUtils]: 53: Hoare triple {10570#false} ~i~0 := 0; {10570#false} is VALID [2018-11-23 11:54:13,036 INFO L273 TraceCheckUtils]: 54: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10570#false} is VALID [2018-11-23 11:54:13,036 INFO L273 TraceCheckUtils]: 55: Hoare triple {10570#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10570#false} is VALID [2018-11-23 11:54:13,036 INFO L273 TraceCheckUtils]: 56: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10570#false} is VALID [2018-11-23 11:54:13,036 INFO L273 TraceCheckUtils]: 57: Hoare triple {10570#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10570#false} is VALID [2018-11-23 11:54:13,036 INFO L273 TraceCheckUtils]: 58: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10570#false} is VALID [2018-11-23 11:54:13,037 INFO L273 TraceCheckUtils]: 59: Hoare triple {10570#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10570#false} is VALID [2018-11-23 11:54:13,037 INFO L273 TraceCheckUtils]: 60: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10570#false} is VALID [2018-11-23 11:54:13,037 INFO L273 TraceCheckUtils]: 61: Hoare triple {10570#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10570#false} is VALID [2018-11-23 11:54:13,037 INFO L273 TraceCheckUtils]: 62: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10570#false} is VALID [2018-11-23 11:54:13,037 INFO L273 TraceCheckUtils]: 63: Hoare triple {10570#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10570#false} is VALID [2018-11-23 11:54:13,037 INFO L273 TraceCheckUtils]: 64: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10570#false} is VALID [2018-11-23 11:54:13,037 INFO L273 TraceCheckUtils]: 65: Hoare triple {10570#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10570#false} is VALID [2018-11-23 11:54:13,037 INFO L273 TraceCheckUtils]: 66: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10570#false} is VALID [2018-11-23 11:54:13,038 INFO L273 TraceCheckUtils]: 67: Hoare triple {10570#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10570#false} is VALID [2018-11-23 11:54:13,038 INFO L273 TraceCheckUtils]: 68: Hoare triple {10570#false} assume !(~i~0 < 100000); {10570#false} is VALID [2018-11-23 11:54:13,038 INFO L273 TraceCheckUtils]: 69: Hoare triple {10570#false} ~i~0 := 0; {10570#false} is VALID [2018-11-23 11:54:13,038 INFO L273 TraceCheckUtils]: 70: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10570#false} is VALID [2018-11-23 11:54:13,038 INFO L273 TraceCheckUtils]: 71: Hoare triple {10570#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10570#false} is VALID [2018-11-23 11:54:13,038 INFO L273 TraceCheckUtils]: 72: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10570#false} is VALID [2018-11-23 11:54:13,038 INFO L273 TraceCheckUtils]: 73: Hoare triple {10570#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10570#false} is VALID [2018-11-23 11:54:13,038 INFO L273 TraceCheckUtils]: 74: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10570#false} is VALID [2018-11-23 11:54:13,039 INFO L273 TraceCheckUtils]: 75: Hoare triple {10570#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10570#false} is VALID [2018-11-23 11:54:13,039 INFO L273 TraceCheckUtils]: 76: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10570#false} is VALID [2018-11-23 11:54:13,039 INFO L273 TraceCheckUtils]: 77: Hoare triple {10570#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10570#false} is VALID [2018-11-23 11:54:13,039 INFO L273 TraceCheckUtils]: 78: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10570#false} is VALID [2018-11-23 11:54:13,039 INFO L273 TraceCheckUtils]: 79: Hoare triple {10570#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10570#false} is VALID [2018-11-23 11:54:13,039 INFO L273 TraceCheckUtils]: 80: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10570#false} is VALID [2018-11-23 11:54:13,039 INFO L273 TraceCheckUtils]: 81: Hoare triple {10570#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10570#false} is VALID [2018-11-23 11:54:13,039 INFO L273 TraceCheckUtils]: 82: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10570#false} is VALID [2018-11-23 11:54:13,039 INFO L273 TraceCheckUtils]: 83: Hoare triple {10570#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10570#false} is VALID [2018-11-23 11:54:13,040 INFO L273 TraceCheckUtils]: 84: Hoare triple {10570#false} assume !(~i~0 < 100000); {10570#false} is VALID [2018-11-23 11:54:13,040 INFO L273 TraceCheckUtils]: 85: Hoare triple {10570#false} ~i~0 := 0; {10570#false} is VALID [2018-11-23 11:54:13,040 INFO L273 TraceCheckUtils]: 86: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10570#false} is VALID [2018-11-23 11:54:13,040 INFO L273 TraceCheckUtils]: 87: Hoare triple {10570#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10570#false} is VALID [2018-11-23 11:54:13,040 INFO L273 TraceCheckUtils]: 88: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10570#false} is VALID [2018-11-23 11:54:13,040 INFO L273 TraceCheckUtils]: 89: Hoare triple {10570#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10570#false} is VALID [2018-11-23 11:54:13,040 INFO L273 TraceCheckUtils]: 90: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10570#false} is VALID [2018-11-23 11:54:13,040 INFO L273 TraceCheckUtils]: 91: Hoare triple {10570#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10570#false} is VALID [2018-11-23 11:54:13,040 INFO L273 TraceCheckUtils]: 92: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10570#false} is VALID [2018-11-23 11:54:13,041 INFO L273 TraceCheckUtils]: 93: Hoare triple {10570#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10570#false} is VALID [2018-11-23 11:54:13,041 INFO L273 TraceCheckUtils]: 94: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10570#false} is VALID [2018-11-23 11:54:13,041 INFO L273 TraceCheckUtils]: 95: Hoare triple {10570#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10570#false} is VALID [2018-11-23 11:54:13,041 INFO L273 TraceCheckUtils]: 96: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10570#false} is VALID [2018-11-23 11:54:13,041 INFO L273 TraceCheckUtils]: 97: Hoare triple {10570#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10570#false} is VALID [2018-11-23 11:54:13,041 INFO L273 TraceCheckUtils]: 98: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10570#false} is VALID [2018-11-23 11:54:13,041 INFO L273 TraceCheckUtils]: 99: Hoare triple {10570#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10570#false} is VALID [2018-11-23 11:54:13,041 INFO L273 TraceCheckUtils]: 100: Hoare triple {10570#false} assume !(~i~0 < 100000); {10570#false} is VALID [2018-11-23 11:54:13,042 INFO L273 TraceCheckUtils]: 101: Hoare triple {10570#false} ~i~0 := 0; {10570#false} is VALID [2018-11-23 11:54:13,042 INFO L273 TraceCheckUtils]: 102: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10570#false} is VALID [2018-11-23 11:54:13,042 INFO L273 TraceCheckUtils]: 103: Hoare triple {10570#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10570#false} is VALID [2018-11-23 11:54:13,042 INFO L273 TraceCheckUtils]: 104: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10570#false} is VALID [2018-11-23 11:54:13,042 INFO L273 TraceCheckUtils]: 105: Hoare triple {10570#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10570#false} is VALID [2018-11-23 11:54:13,042 INFO L273 TraceCheckUtils]: 106: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10570#false} is VALID [2018-11-23 11:54:13,042 INFO L273 TraceCheckUtils]: 107: Hoare triple {10570#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10570#false} is VALID [2018-11-23 11:54:13,042 INFO L273 TraceCheckUtils]: 108: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10570#false} is VALID [2018-11-23 11:54:13,042 INFO L273 TraceCheckUtils]: 109: Hoare triple {10570#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10570#false} is VALID [2018-11-23 11:54:13,043 INFO L273 TraceCheckUtils]: 110: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10570#false} is VALID [2018-11-23 11:54:13,043 INFO L273 TraceCheckUtils]: 111: Hoare triple {10570#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10570#false} is VALID [2018-11-23 11:54:13,043 INFO L273 TraceCheckUtils]: 112: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10570#false} is VALID [2018-11-23 11:54:13,043 INFO L273 TraceCheckUtils]: 113: Hoare triple {10570#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10570#false} is VALID [2018-11-23 11:54:13,043 INFO L273 TraceCheckUtils]: 114: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10570#false} is VALID [2018-11-23 11:54:13,043 INFO L273 TraceCheckUtils]: 115: Hoare triple {10570#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10570#false} is VALID [2018-11-23 11:54:13,043 INFO L273 TraceCheckUtils]: 116: Hoare triple {10570#false} assume !(~i~0 < 100000); {10570#false} is VALID [2018-11-23 11:54:13,043 INFO L273 TraceCheckUtils]: 117: Hoare triple {10570#false} havoc ~x~0;~x~0 := 0; {10570#false} is VALID [2018-11-23 11:54:13,043 INFO L273 TraceCheckUtils]: 118: Hoare triple {10570#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {10570#false} is VALID [2018-11-23 11:54:13,044 INFO L256 TraceCheckUtils]: 119: Hoare triple {10570#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {10570#false} is VALID [2018-11-23 11:54:13,044 INFO L273 TraceCheckUtils]: 120: Hoare triple {10570#false} ~cond := #in~cond; {10570#false} is VALID [2018-11-23 11:54:13,044 INFO L273 TraceCheckUtils]: 121: Hoare triple {10570#false} assume 0 == ~cond; {10570#false} is VALID [2018-11-23 11:54:13,044 INFO L273 TraceCheckUtils]: 122: Hoare triple {10570#false} assume !false; {10570#false} is VALID [2018-11-23 11:54:13,050 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-11-23 11:54:13,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:13,051 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 11:54:13,060 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:54:13,121 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:54:13,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:13,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:13,400 INFO L256 TraceCheckUtils]: 0: Hoare triple {10569#true} call ULTIMATE.init(); {10569#true} is VALID [2018-11-23 11:54:13,401 INFO L273 TraceCheckUtils]: 1: Hoare triple {10569#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10569#true} is VALID [2018-11-23 11:54:13,401 INFO L273 TraceCheckUtils]: 2: Hoare triple {10569#true} assume true; {10569#true} is VALID [2018-11-23 11:54:13,401 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10569#true} {10569#true} #119#return; {10569#true} is VALID [2018-11-23 11:54:13,401 INFO L256 TraceCheckUtils]: 4: Hoare triple {10569#true} call #t~ret16 := main(); {10569#true} is VALID [2018-11-23 11:54:13,403 INFO L273 TraceCheckUtils]: 5: Hoare triple {10569#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {10605#(<= main_~a~0 0)} is VALID [2018-11-23 11:54:13,403 INFO L273 TraceCheckUtils]: 6: Hoare triple {10605#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10605#(<= main_~a~0 0)} is VALID [2018-11-23 11:54:13,404 INFO L273 TraceCheckUtils]: 7: Hoare triple {10605#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10572#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:13,404 INFO L273 TraceCheckUtils]: 8: Hoare triple {10572#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10572#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:13,405 INFO L273 TraceCheckUtils]: 9: Hoare triple {10572#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10573#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:13,405 INFO L273 TraceCheckUtils]: 10: Hoare triple {10573#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10573#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:13,406 INFO L273 TraceCheckUtils]: 11: Hoare triple {10573#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10574#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:13,406 INFO L273 TraceCheckUtils]: 12: Hoare triple {10574#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10574#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:13,407 INFO L273 TraceCheckUtils]: 13: Hoare triple {10574#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10575#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:13,408 INFO L273 TraceCheckUtils]: 14: Hoare triple {10575#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10575#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:13,409 INFO L273 TraceCheckUtils]: 15: Hoare triple {10575#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10576#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:13,409 INFO L273 TraceCheckUtils]: 16: Hoare triple {10576#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10576#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:13,410 INFO L273 TraceCheckUtils]: 17: Hoare triple {10576#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10577#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:13,411 INFO L273 TraceCheckUtils]: 18: Hoare triple {10577#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10577#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:13,411 INFO L273 TraceCheckUtils]: 19: Hoare triple {10577#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10578#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:13,412 INFO L273 TraceCheckUtils]: 20: Hoare triple {10578#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10578#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:13,413 INFO L273 TraceCheckUtils]: 21: Hoare triple {10578#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10579#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:13,413 INFO L273 TraceCheckUtils]: 22: Hoare triple {10579#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10579#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:13,414 INFO L273 TraceCheckUtils]: 23: Hoare triple {10579#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10580#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:13,414 INFO L273 TraceCheckUtils]: 24: Hoare triple {10580#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10580#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:13,415 INFO L273 TraceCheckUtils]: 25: Hoare triple {10580#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10581#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:13,416 INFO L273 TraceCheckUtils]: 26: Hoare triple {10581#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10581#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:13,417 INFO L273 TraceCheckUtils]: 27: Hoare triple {10581#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10582#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:13,417 INFO L273 TraceCheckUtils]: 28: Hoare triple {10582#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10582#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:13,418 INFO L273 TraceCheckUtils]: 29: Hoare triple {10582#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10583#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:13,418 INFO L273 TraceCheckUtils]: 30: Hoare triple {10583#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10583#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:13,419 INFO L273 TraceCheckUtils]: 31: Hoare triple {10583#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10584#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:13,420 INFO L273 TraceCheckUtils]: 32: Hoare triple {10584#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10584#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:13,420 INFO L273 TraceCheckUtils]: 33: Hoare triple {10584#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10585#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:13,421 INFO L273 TraceCheckUtils]: 34: Hoare triple {10585#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10585#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:13,422 INFO L273 TraceCheckUtils]: 35: Hoare triple {10585#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10586#(<= main_~a~0 15)} is VALID [2018-11-23 11:54:13,422 INFO L273 TraceCheckUtils]: 36: Hoare triple {10586#(<= main_~a~0 15)} assume !(~a~0 < 100000); {10570#false} is VALID [2018-11-23 11:54:13,423 INFO L273 TraceCheckUtils]: 37: Hoare triple {10570#false} havoc ~i~0;~i~0 := 0; {10570#false} is VALID [2018-11-23 11:54:13,423 INFO L273 TraceCheckUtils]: 38: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10570#false} is VALID [2018-11-23 11:54:13,423 INFO L273 TraceCheckUtils]: 39: Hoare triple {10570#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10570#false} is VALID [2018-11-23 11:54:13,423 INFO L273 TraceCheckUtils]: 40: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10570#false} is VALID [2018-11-23 11:54:13,423 INFO L273 TraceCheckUtils]: 41: Hoare triple {10570#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10570#false} is VALID [2018-11-23 11:54:13,424 INFO L273 TraceCheckUtils]: 42: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10570#false} is VALID [2018-11-23 11:54:13,424 INFO L273 TraceCheckUtils]: 43: Hoare triple {10570#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10570#false} is VALID [2018-11-23 11:54:13,424 INFO L273 TraceCheckUtils]: 44: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10570#false} is VALID [2018-11-23 11:54:13,424 INFO L273 TraceCheckUtils]: 45: Hoare triple {10570#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10570#false} is VALID [2018-11-23 11:54:13,424 INFO L273 TraceCheckUtils]: 46: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10570#false} is VALID [2018-11-23 11:54:13,425 INFO L273 TraceCheckUtils]: 47: Hoare triple {10570#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10570#false} is VALID [2018-11-23 11:54:13,425 INFO L273 TraceCheckUtils]: 48: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10570#false} is VALID [2018-11-23 11:54:13,425 INFO L273 TraceCheckUtils]: 49: Hoare triple {10570#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10570#false} is VALID [2018-11-23 11:54:13,425 INFO L273 TraceCheckUtils]: 50: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10570#false} is VALID [2018-11-23 11:54:13,426 INFO L273 TraceCheckUtils]: 51: Hoare triple {10570#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10570#false} is VALID [2018-11-23 11:54:13,426 INFO L273 TraceCheckUtils]: 52: Hoare triple {10570#false} assume !(~i~0 < 100000); {10570#false} is VALID [2018-11-23 11:54:13,426 INFO L273 TraceCheckUtils]: 53: Hoare triple {10570#false} ~i~0 := 0; {10570#false} is VALID [2018-11-23 11:54:13,426 INFO L273 TraceCheckUtils]: 54: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10570#false} is VALID [2018-11-23 11:54:13,426 INFO L273 TraceCheckUtils]: 55: Hoare triple {10570#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10570#false} is VALID [2018-11-23 11:54:13,427 INFO L273 TraceCheckUtils]: 56: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10570#false} is VALID [2018-11-23 11:54:13,427 INFO L273 TraceCheckUtils]: 57: Hoare triple {10570#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10570#false} is VALID [2018-11-23 11:54:13,427 INFO L273 TraceCheckUtils]: 58: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10570#false} is VALID [2018-11-23 11:54:13,427 INFO L273 TraceCheckUtils]: 59: Hoare triple {10570#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10570#false} is VALID [2018-11-23 11:54:13,427 INFO L273 TraceCheckUtils]: 60: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10570#false} is VALID [2018-11-23 11:54:13,427 INFO L273 TraceCheckUtils]: 61: Hoare triple {10570#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10570#false} is VALID [2018-11-23 11:54:13,427 INFO L273 TraceCheckUtils]: 62: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10570#false} is VALID [2018-11-23 11:54:13,427 INFO L273 TraceCheckUtils]: 63: Hoare triple {10570#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10570#false} is VALID [2018-11-23 11:54:13,427 INFO L273 TraceCheckUtils]: 64: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10570#false} is VALID [2018-11-23 11:54:13,428 INFO L273 TraceCheckUtils]: 65: Hoare triple {10570#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10570#false} is VALID [2018-11-23 11:54:13,428 INFO L273 TraceCheckUtils]: 66: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10570#false} is VALID [2018-11-23 11:54:13,428 INFO L273 TraceCheckUtils]: 67: Hoare triple {10570#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10570#false} is VALID [2018-11-23 11:54:13,428 INFO L273 TraceCheckUtils]: 68: Hoare triple {10570#false} assume !(~i~0 < 100000); {10570#false} is VALID [2018-11-23 11:54:13,428 INFO L273 TraceCheckUtils]: 69: Hoare triple {10570#false} ~i~0 := 0; {10570#false} is VALID [2018-11-23 11:54:13,428 INFO L273 TraceCheckUtils]: 70: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10570#false} is VALID [2018-11-23 11:54:13,428 INFO L273 TraceCheckUtils]: 71: Hoare triple {10570#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10570#false} is VALID [2018-11-23 11:54:13,429 INFO L273 TraceCheckUtils]: 72: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10570#false} is VALID [2018-11-23 11:54:13,429 INFO L273 TraceCheckUtils]: 73: Hoare triple {10570#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10570#false} is VALID [2018-11-23 11:54:13,429 INFO L273 TraceCheckUtils]: 74: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10570#false} is VALID [2018-11-23 11:54:13,429 INFO L273 TraceCheckUtils]: 75: Hoare triple {10570#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10570#false} is VALID [2018-11-23 11:54:13,429 INFO L273 TraceCheckUtils]: 76: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10570#false} is VALID [2018-11-23 11:54:13,429 INFO L273 TraceCheckUtils]: 77: Hoare triple {10570#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10570#false} is VALID [2018-11-23 11:54:13,429 INFO L273 TraceCheckUtils]: 78: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10570#false} is VALID [2018-11-23 11:54:13,429 INFO L273 TraceCheckUtils]: 79: Hoare triple {10570#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10570#false} is VALID [2018-11-23 11:54:13,430 INFO L273 TraceCheckUtils]: 80: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10570#false} is VALID [2018-11-23 11:54:13,430 INFO L273 TraceCheckUtils]: 81: Hoare triple {10570#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10570#false} is VALID [2018-11-23 11:54:13,430 INFO L273 TraceCheckUtils]: 82: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10570#false} is VALID [2018-11-23 11:54:13,430 INFO L273 TraceCheckUtils]: 83: Hoare triple {10570#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10570#false} is VALID [2018-11-23 11:54:13,430 INFO L273 TraceCheckUtils]: 84: Hoare triple {10570#false} assume !(~i~0 < 100000); {10570#false} is VALID [2018-11-23 11:54:13,430 INFO L273 TraceCheckUtils]: 85: Hoare triple {10570#false} ~i~0 := 0; {10570#false} is VALID [2018-11-23 11:54:13,430 INFO L273 TraceCheckUtils]: 86: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10570#false} is VALID [2018-11-23 11:54:13,430 INFO L273 TraceCheckUtils]: 87: Hoare triple {10570#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10570#false} is VALID [2018-11-23 11:54:13,430 INFO L273 TraceCheckUtils]: 88: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10570#false} is VALID [2018-11-23 11:54:13,431 INFO L273 TraceCheckUtils]: 89: Hoare triple {10570#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10570#false} is VALID [2018-11-23 11:54:13,431 INFO L273 TraceCheckUtils]: 90: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10570#false} is VALID [2018-11-23 11:54:13,431 INFO L273 TraceCheckUtils]: 91: Hoare triple {10570#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10570#false} is VALID [2018-11-23 11:54:13,431 INFO L273 TraceCheckUtils]: 92: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10570#false} is VALID [2018-11-23 11:54:13,431 INFO L273 TraceCheckUtils]: 93: Hoare triple {10570#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10570#false} is VALID [2018-11-23 11:54:13,431 INFO L273 TraceCheckUtils]: 94: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10570#false} is VALID [2018-11-23 11:54:13,431 INFO L273 TraceCheckUtils]: 95: Hoare triple {10570#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10570#false} is VALID [2018-11-23 11:54:13,431 INFO L273 TraceCheckUtils]: 96: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10570#false} is VALID [2018-11-23 11:54:13,431 INFO L273 TraceCheckUtils]: 97: Hoare triple {10570#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10570#false} is VALID [2018-11-23 11:54:13,432 INFO L273 TraceCheckUtils]: 98: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10570#false} is VALID [2018-11-23 11:54:13,432 INFO L273 TraceCheckUtils]: 99: Hoare triple {10570#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10570#false} is VALID [2018-11-23 11:54:13,432 INFO L273 TraceCheckUtils]: 100: Hoare triple {10570#false} assume !(~i~0 < 100000); {10570#false} is VALID [2018-11-23 11:54:13,432 INFO L273 TraceCheckUtils]: 101: Hoare triple {10570#false} ~i~0 := 0; {10570#false} is VALID [2018-11-23 11:54:13,432 INFO L273 TraceCheckUtils]: 102: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10570#false} is VALID [2018-11-23 11:54:13,432 INFO L273 TraceCheckUtils]: 103: Hoare triple {10570#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10570#false} is VALID [2018-11-23 11:54:13,432 INFO L273 TraceCheckUtils]: 104: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10570#false} is VALID [2018-11-23 11:54:13,432 INFO L273 TraceCheckUtils]: 105: Hoare triple {10570#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10570#false} is VALID [2018-11-23 11:54:13,433 INFO L273 TraceCheckUtils]: 106: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10570#false} is VALID [2018-11-23 11:54:13,433 INFO L273 TraceCheckUtils]: 107: Hoare triple {10570#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10570#false} is VALID [2018-11-23 11:54:13,433 INFO L273 TraceCheckUtils]: 108: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10570#false} is VALID [2018-11-23 11:54:13,433 INFO L273 TraceCheckUtils]: 109: Hoare triple {10570#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10570#false} is VALID [2018-11-23 11:54:13,433 INFO L273 TraceCheckUtils]: 110: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10570#false} is VALID [2018-11-23 11:54:13,433 INFO L273 TraceCheckUtils]: 111: Hoare triple {10570#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10570#false} is VALID [2018-11-23 11:54:13,433 INFO L273 TraceCheckUtils]: 112: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10570#false} is VALID [2018-11-23 11:54:13,433 INFO L273 TraceCheckUtils]: 113: Hoare triple {10570#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10570#false} is VALID [2018-11-23 11:54:13,433 INFO L273 TraceCheckUtils]: 114: Hoare triple {10570#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10570#false} is VALID [2018-11-23 11:54:13,434 INFO L273 TraceCheckUtils]: 115: Hoare triple {10570#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10570#false} is VALID [2018-11-23 11:54:13,434 INFO L273 TraceCheckUtils]: 116: Hoare triple {10570#false} assume !(~i~0 < 100000); {10570#false} is VALID [2018-11-23 11:54:13,434 INFO L273 TraceCheckUtils]: 117: Hoare triple {10570#false} havoc ~x~0;~x~0 := 0; {10570#false} is VALID [2018-11-23 11:54:13,434 INFO L273 TraceCheckUtils]: 118: Hoare triple {10570#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {10570#false} is VALID [2018-11-23 11:54:13,434 INFO L256 TraceCheckUtils]: 119: Hoare triple {10570#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {10570#false} is VALID [2018-11-23 11:54:13,434 INFO L273 TraceCheckUtils]: 120: Hoare triple {10570#false} ~cond := #in~cond; {10570#false} is VALID [2018-11-23 11:54:13,434 INFO L273 TraceCheckUtils]: 121: Hoare triple {10570#false} assume 0 == ~cond; {10570#false} is VALID [2018-11-23 11:54:13,434 INFO L273 TraceCheckUtils]: 122: Hoare triple {10570#false} assume !false; {10570#false} is VALID [2018-11-23 11:54:13,441 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-11-23 11:54:13,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:13,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 11:54:13,461 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 123 [2018-11-23 11:54:13,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:13,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 11:54:13,557 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 11:54:13,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 11:54:13,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 11:54:13,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:54:13,559 INFO L87 Difference]: Start difference. First operand 128 states and 134 transitions. Second operand 19 states. [2018-11-23 11:54:14,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:14,211 INFO L93 Difference]: Finished difference Result 222 states and 234 transitions. [2018-11-23 11:54:14,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:54:14,211 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 123 [2018-11-23 11:54:14,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:14,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:54:14,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 104 transitions. [2018-11-23 11:54:14,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:54:14,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 104 transitions. [2018-11-23 11:54:14,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 104 transitions. [2018-11-23 11:54:14,313 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 11:54:14,316 INFO L225 Difference]: With dead ends: 222 [2018-11-23 11:54:14,316 INFO L226 Difference]: Without dead ends: 131 [2018-11-23 11:54:14,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:54:14,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-23 11:54:14,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2018-11-23 11:54:14,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:14,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand 130 states. [2018-11-23 11:54:14,407 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 130 states. [2018-11-23 11:54:14,407 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 130 states. [2018-11-23 11:54:14,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:14,409 INFO L93 Difference]: Finished difference Result 131 states and 137 transitions. [2018-11-23 11:54:14,410 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 137 transitions. [2018-11-23 11:54:14,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:14,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:14,410 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 131 states. [2018-11-23 11:54:14,410 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 131 states. [2018-11-23 11:54:14,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:14,413 INFO L93 Difference]: Finished difference Result 131 states and 137 transitions. [2018-11-23 11:54:14,413 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 137 transitions. [2018-11-23 11:54:14,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:14,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:14,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:14,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:14,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-23 11:54:14,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2018-11-23 11:54:14,417 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 136 transitions. Word has length 123 [2018-11-23 11:54:14,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:14,417 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 136 transitions. [2018-11-23 11:54:14,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 11:54:14,417 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2018-11-23 11:54:14,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-23 11:54:14,419 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:14,419 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:14,419 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:14,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:14,420 INFO L82 PathProgramCache]: Analyzing trace with hash -820756304, now seen corresponding path program 15 times [2018-11-23 11:54:14,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:14,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:14,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:14,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:14,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:15,014 INFO L256 TraceCheckUtils]: 0: Hoare triple {11741#true} call ULTIMATE.init(); {11741#true} is VALID [2018-11-23 11:54:15,014 INFO L273 TraceCheckUtils]: 1: Hoare triple {11741#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11741#true} is VALID [2018-11-23 11:54:15,015 INFO L273 TraceCheckUtils]: 2: Hoare triple {11741#true} assume true; {11741#true} is VALID [2018-11-23 11:54:15,015 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11741#true} {11741#true} #119#return; {11741#true} is VALID [2018-11-23 11:54:15,015 INFO L256 TraceCheckUtils]: 4: Hoare triple {11741#true} call #t~ret16 := main(); {11741#true} is VALID [2018-11-23 11:54:15,016 INFO L273 TraceCheckUtils]: 5: Hoare triple {11741#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {11743#(= main_~a~0 0)} is VALID [2018-11-23 11:54:15,016 INFO L273 TraceCheckUtils]: 6: Hoare triple {11743#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11743#(= main_~a~0 0)} is VALID [2018-11-23 11:54:15,017 INFO L273 TraceCheckUtils]: 7: Hoare triple {11743#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11744#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:15,017 INFO L273 TraceCheckUtils]: 8: Hoare triple {11744#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11744#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:15,018 INFO L273 TraceCheckUtils]: 9: Hoare triple {11744#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11745#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:15,019 INFO L273 TraceCheckUtils]: 10: Hoare triple {11745#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11745#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:15,020 INFO L273 TraceCheckUtils]: 11: Hoare triple {11745#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11746#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:15,020 INFO L273 TraceCheckUtils]: 12: Hoare triple {11746#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11746#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:15,021 INFO L273 TraceCheckUtils]: 13: Hoare triple {11746#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11747#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:15,021 INFO L273 TraceCheckUtils]: 14: Hoare triple {11747#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11747#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:15,022 INFO L273 TraceCheckUtils]: 15: Hoare triple {11747#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11748#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:15,023 INFO L273 TraceCheckUtils]: 16: Hoare triple {11748#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11748#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:15,024 INFO L273 TraceCheckUtils]: 17: Hoare triple {11748#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11749#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:15,024 INFO L273 TraceCheckUtils]: 18: Hoare triple {11749#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11749#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:15,025 INFO L273 TraceCheckUtils]: 19: Hoare triple {11749#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11750#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:15,025 INFO L273 TraceCheckUtils]: 20: Hoare triple {11750#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11750#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:15,026 INFO L273 TraceCheckUtils]: 21: Hoare triple {11750#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11751#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:15,027 INFO L273 TraceCheckUtils]: 22: Hoare triple {11751#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11751#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:15,028 INFO L273 TraceCheckUtils]: 23: Hoare triple {11751#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11752#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:15,028 INFO L273 TraceCheckUtils]: 24: Hoare triple {11752#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11752#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:15,029 INFO L273 TraceCheckUtils]: 25: Hoare triple {11752#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11753#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:15,029 INFO L273 TraceCheckUtils]: 26: Hoare triple {11753#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11753#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:15,030 INFO L273 TraceCheckUtils]: 27: Hoare triple {11753#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11754#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:15,031 INFO L273 TraceCheckUtils]: 28: Hoare triple {11754#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11754#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:15,032 INFO L273 TraceCheckUtils]: 29: Hoare triple {11754#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11755#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:15,032 INFO L273 TraceCheckUtils]: 30: Hoare triple {11755#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11755#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:15,033 INFO L273 TraceCheckUtils]: 31: Hoare triple {11755#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11756#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:15,033 INFO L273 TraceCheckUtils]: 32: Hoare triple {11756#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11756#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:15,034 INFO L273 TraceCheckUtils]: 33: Hoare triple {11756#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11757#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:15,035 INFO L273 TraceCheckUtils]: 34: Hoare triple {11757#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11757#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:15,035 INFO L273 TraceCheckUtils]: 35: Hoare triple {11757#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11758#(<= main_~a~0 15)} is VALID [2018-11-23 11:54:15,036 INFO L273 TraceCheckUtils]: 36: Hoare triple {11758#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11758#(<= main_~a~0 15)} is VALID [2018-11-23 11:54:15,037 INFO L273 TraceCheckUtils]: 37: Hoare triple {11758#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11759#(<= main_~a~0 16)} is VALID [2018-11-23 11:54:15,038 INFO L273 TraceCheckUtils]: 38: Hoare triple {11759#(<= main_~a~0 16)} assume !(~a~0 < 100000); {11742#false} is VALID [2018-11-23 11:54:15,038 INFO L273 TraceCheckUtils]: 39: Hoare triple {11742#false} havoc ~i~0;~i~0 := 0; {11742#false} is VALID [2018-11-23 11:54:15,038 INFO L273 TraceCheckUtils]: 40: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11742#false} is VALID [2018-11-23 11:54:15,038 INFO L273 TraceCheckUtils]: 41: Hoare triple {11742#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11742#false} is VALID [2018-11-23 11:54:15,038 INFO L273 TraceCheckUtils]: 42: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11742#false} is VALID [2018-11-23 11:54:15,039 INFO L273 TraceCheckUtils]: 43: Hoare triple {11742#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11742#false} is VALID [2018-11-23 11:54:15,039 INFO L273 TraceCheckUtils]: 44: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11742#false} is VALID [2018-11-23 11:54:15,039 INFO L273 TraceCheckUtils]: 45: Hoare triple {11742#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11742#false} is VALID [2018-11-23 11:54:15,039 INFO L273 TraceCheckUtils]: 46: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11742#false} is VALID [2018-11-23 11:54:15,039 INFO L273 TraceCheckUtils]: 47: Hoare triple {11742#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11742#false} is VALID [2018-11-23 11:54:15,040 INFO L273 TraceCheckUtils]: 48: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11742#false} is VALID [2018-11-23 11:54:15,040 INFO L273 TraceCheckUtils]: 49: Hoare triple {11742#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11742#false} is VALID [2018-11-23 11:54:15,040 INFO L273 TraceCheckUtils]: 50: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11742#false} is VALID [2018-11-23 11:54:15,040 INFO L273 TraceCheckUtils]: 51: Hoare triple {11742#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11742#false} is VALID [2018-11-23 11:54:15,040 INFO L273 TraceCheckUtils]: 52: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11742#false} is VALID [2018-11-23 11:54:15,041 INFO L273 TraceCheckUtils]: 53: Hoare triple {11742#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11742#false} is VALID [2018-11-23 11:54:15,041 INFO L273 TraceCheckUtils]: 54: Hoare triple {11742#false} assume !(~i~0 < 100000); {11742#false} is VALID [2018-11-23 11:54:15,041 INFO L273 TraceCheckUtils]: 55: Hoare triple {11742#false} ~i~0 := 0; {11742#false} is VALID [2018-11-23 11:54:15,041 INFO L273 TraceCheckUtils]: 56: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11742#false} is VALID [2018-11-23 11:54:15,041 INFO L273 TraceCheckUtils]: 57: Hoare triple {11742#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11742#false} is VALID [2018-11-23 11:54:15,042 INFO L273 TraceCheckUtils]: 58: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11742#false} is VALID [2018-11-23 11:54:15,042 INFO L273 TraceCheckUtils]: 59: Hoare triple {11742#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11742#false} is VALID [2018-11-23 11:54:15,042 INFO L273 TraceCheckUtils]: 60: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11742#false} is VALID [2018-11-23 11:54:15,042 INFO L273 TraceCheckUtils]: 61: Hoare triple {11742#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11742#false} is VALID [2018-11-23 11:54:15,042 INFO L273 TraceCheckUtils]: 62: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11742#false} is VALID [2018-11-23 11:54:15,042 INFO L273 TraceCheckUtils]: 63: Hoare triple {11742#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11742#false} is VALID [2018-11-23 11:54:15,042 INFO L273 TraceCheckUtils]: 64: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11742#false} is VALID [2018-11-23 11:54:15,042 INFO L273 TraceCheckUtils]: 65: Hoare triple {11742#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11742#false} is VALID [2018-11-23 11:54:15,042 INFO L273 TraceCheckUtils]: 66: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11742#false} is VALID [2018-11-23 11:54:15,043 INFO L273 TraceCheckUtils]: 67: Hoare triple {11742#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11742#false} is VALID [2018-11-23 11:54:15,043 INFO L273 TraceCheckUtils]: 68: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11742#false} is VALID [2018-11-23 11:54:15,043 INFO L273 TraceCheckUtils]: 69: Hoare triple {11742#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11742#false} is VALID [2018-11-23 11:54:15,043 INFO L273 TraceCheckUtils]: 70: Hoare triple {11742#false} assume !(~i~0 < 100000); {11742#false} is VALID [2018-11-23 11:54:15,043 INFO L273 TraceCheckUtils]: 71: Hoare triple {11742#false} ~i~0 := 0; {11742#false} is VALID [2018-11-23 11:54:15,043 INFO L273 TraceCheckUtils]: 72: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11742#false} is VALID [2018-11-23 11:54:15,043 INFO L273 TraceCheckUtils]: 73: Hoare triple {11742#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11742#false} is VALID [2018-11-23 11:54:15,043 INFO L273 TraceCheckUtils]: 74: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11742#false} is VALID [2018-11-23 11:54:15,044 INFO L273 TraceCheckUtils]: 75: Hoare triple {11742#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11742#false} is VALID [2018-11-23 11:54:15,044 INFO L273 TraceCheckUtils]: 76: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11742#false} is VALID [2018-11-23 11:54:15,044 INFO L273 TraceCheckUtils]: 77: Hoare triple {11742#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11742#false} is VALID [2018-11-23 11:54:15,044 INFO L273 TraceCheckUtils]: 78: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11742#false} is VALID [2018-11-23 11:54:15,044 INFO L273 TraceCheckUtils]: 79: Hoare triple {11742#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11742#false} is VALID [2018-11-23 11:54:15,044 INFO L273 TraceCheckUtils]: 80: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11742#false} is VALID [2018-11-23 11:54:15,044 INFO L273 TraceCheckUtils]: 81: Hoare triple {11742#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11742#false} is VALID [2018-11-23 11:54:15,044 INFO L273 TraceCheckUtils]: 82: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11742#false} is VALID [2018-11-23 11:54:15,044 INFO L273 TraceCheckUtils]: 83: Hoare triple {11742#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11742#false} is VALID [2018-11-23 11:54:15,045 INFO L273 TraceCheckUtils]: 84: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11742#false} is VALID [2018-11-23 11:54:15,045 INFO L273 TraceCheckUtils]: 85: Hoare triple {11742#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11742#false} is VALID [2018-11-23 11:54:15,045 INFO L273 TraceCheckUtils]: 86: Hoare triple {11742#false} assume !(~i~0 < 100000); {11742#false} is VALID [2018-11-23 11:54:15,045 INFO L273 TraceCheckUtils]: 87: Hoare triple {11742#false} ~i~0 := 0; {11742#false} is VALID [2018-11-23 11:54:15,045 INFO L273 TraceCheckUtils]: 88: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11742#false} is VALID [2018-11-23 11:54:15,045 INFO L273 TraceCheckUtils]: 89: Hoare triple {11742#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11742#false} is VALID [2018-11-23 11:54:15,045 INFO L273 TraceCheckUtils]: 90: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11742#false} is VALID [2018-11-23 11:54:15,045 INFO L273 TraceCheckUtils]: 91: Hoare triple {11742#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11742#false} is VALID [2018-11-23 11:54:15,046 INFO L273 TraceCheckUtils]: 92: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11742#false} is VALID [2018-11-23 11:54:15,046 INFO L273 TraceCheckUtils]: 93: Hoare triple {11742#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11742#false} is VALID [2018-11-23 11:54:15,046 INFO L273 TraceCheckUtils]: 94: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11742#false} is VALID [2018-11-23 11:54:15,046 INFO L273 TraceCheckUtils]: 95: Hoare triple {11742#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11742#false} is VALID [2018-11-23 11:54:15,046 INFO L273 TraceCheckUtils]: 96: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11742#false} is VALID [2018-11-23 11:54:15,046 INFO L273 TraceCheckUtils]: 97: Hoare triple {11742#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11742#false} is VALID [2018-11-23 11:54:15,046 INFO L273 TraceCheckUtils]: 98: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11742#false} is VALID [2018-11-23 11:54:15,046 INFO L273 TraceCheckUtils]: 99: Hoare triple {11742#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11742#false} is VALID [2018-11-23 11:54:15,046 INFO L273 TraceCheckUtils]: 100: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11742#false} is VALID [2018-11-23 11:54:15,047 INFO L273 TraceCheckUtils]: 101: Hoare triple {11742#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11742#false} is VALID [2018-11-23 11:54:15,047 INFO L273 TraceCheckUtils]: 102: Hoare triple {11742#false} assume !(~i~0 < 100000); {11742#false} is VALID [2018-11-23 11:54:15,047 INFO L273 TraceCheckUtils]: 103: Hoare triple {11742#false} ~i~0 := 0; {11742#false} is VALID [2018-11-23 11:54:15,047 INFO L273 TraceCheckUtils]: 104: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11742#false} is VALID [2018-11-23 11:54:15,047 INFO L273 TraceCheckUtils]: 105: Hoare triple {11742#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11742#false} is VALID [2018-11-23 11:54:15,047 INFO L273 TraceCheckUtils]: 106: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11742#false} is VALID [2018-11-23 11:54:15,047 INFO L273 TraceCheckUtils]: 107: Hoare triple {11742#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11742#false} is VALID [2018-11-23 11:54:15,047 INFO L273 TraceCheckUtils]: 108: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11742#false} is VALID [2018-11-23 11:54:15,047 INFO L273 TraceCheckUtils]: 109: Hoare triple {11742#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11742#false} is VALID [2018-11-23 11:54:15,048 INFO L273 TraceCheckUtils]: 110: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11742#false} is VALID [2018-11-23 11:54:15,048 INFO L273 TraceCheckUtils]: 111: Hoare triple {11742#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11742#false} is VALID [2018-11-23 11:54:15,048 INFO L273 TraceCheckUtils]: 112: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11742#false} is VALID [2018-11-23 11:54:15,048 INFO L273 TraceCheckUtils]: 113: Hoare triple {11742#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11742#false} is VALID [2018-11-23 11:54:15,048 INFO L273 TraceCheckUtils]: 114: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11742#false} is VALID [2018-11-23 11:54:15,048 INFO L273 TraceCheckUtils]: 115: Hoare triple {11742#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11742#false} is VALID [2018-11-23 11:54:15,048 INFO L273 TraceCheckUtils]: 116: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11742#false} is VALID [2018-11-23 11:54:15,048 INFO L273 TraceCheckUtils]: 117: Hoare triple {11742#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11742#false} is VALID [2018-11-23 11:54:15,048 INFO L273 TraceCheckUtils]: 118: Hoare triple {11742#false} assume !(~i~0 < 100000); {11742#false} is VALID [2018-11-23 11:54:15,049 INFO L273 TraceCheckUtils]: 119: Hoare triple {11742#false} havoc ~x~0;~x~0 := 0; {11742#false} is VALID [2018-11-23 11:54:15,049 INFO L273 TraceCheckUtils]: 120: Hoare triple {11742#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {11742#false} is VALID [2018-11-23 11:54:15,049 INFO L256 TraceCheckUtils]: 121: Hoare triple {11742#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {11742#false} is VALID [2018-11-23 11:54:15,049 INFO L273 TraceCheckUtils]: 122: Hoare triple {11742#false} ~cond := #in~cond; {11742#false} is VALID [2018-11-23 11:54:15,049 INFO L273 TraceCheckUtils]: 123: Hoare triple {11742#false} assume 0 == ~cond; {11742#false} is VALID [2018-11-23 11:54:15,049 INFO L273 TraceCheckUtils]: 124: Hoare triple {11742#false} assume !false; {11742#false} is VALID [2018-11-23 11:54:15,056 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-11-23 11:54:15,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:15,056 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 11:54:15,065 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:54:23,570 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-23 11:54:23,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:23,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:24,089 INFO L256 TraceCheckUtils]: 0: Hoare triple {11741#true} call ULTIMATE.init(); {11741#true} is VALID [2018-11-23 11:54:24,089 INFO L273 TraceCheckUtils]: 1: Hoare triple {11741#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11741#true} is VALID [2018-11-23 11:54:24,089 INFO L273 TraceCheckUtils]: 2: Hoare triple {11741#true} assume true; {11741#true} is VALID [2018-11-23 11:54:24,089 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11741#true} {11741#true} #119#return; {11741#true} is VALID [2018-11-23 11:54:24,090 INFO L256 TraceCheckUtils]: 4: Hoare triple {11741#true} call #t~ret16 := main(); {11741#true} is VALID [2018-11-23 11:54:24,090 INFO L273 TraceCheckUtils]: 5: Hoare triple {11741#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {11741#true} is VALID [2018-11-23 11:54:24,090 INFO L273 TraceCheckUtils]: 6: Hoare triple {11741#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11741#true} is VALID [2018-11-23 11:54:24,090 INFO L273 TraceCheckUtils]: 7: Hoare triple {11741#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11741#true} is VALID [2018-11-23 11:54:24,090 INFO L273 TraceCheckUtils]: 8: Hoare triple {11741#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11741#true} is VALID [2018-11-23 11:54:24,091 INFO L273 TraceCheckUtils]: 9: Hoare triple {11741#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11741#true} is VALID [2018-11-23 11:54:24,091 INFO L273 TraceCheckUtils]: 10: Hoare triple {11741#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11741#true} is VALID [2018-11-23 11:54:24,091 INFO L273 TraceCheckUtils]: 11: Hoare triple {11741#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11741#true} is VALID [2018-11-23 11:54:24,091 INFO L273 TraceCheckUtils]: 12: Hoare triple {11741#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11741#true} is VALID [2018-11-23 11:54:24,091 INFO L273 TraceCheckUtils]: 13: Hoare triple {11741#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11741#true} is VALID [2018-11-23 11:54:24,092 INFO L273 TraceCheckUtils]: 14: Hoare triple {11741#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11741#true} is VALID [2018-11-23 11:54:24,092 INFO L273 TraceCheckUtils]: 15: Hoare triple {11741#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11741#true} is VALID [2018-11-23 11:54:24,092 INFO L273 TraceCheckUtils]: 16: Hoare triple {11741#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11741#true} is VALID [2018-11-23 11:54:24,092 INFO L273 TraceCheckUtils]: 17: Hoare triple {11741#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11741#true} is VALID [2018-11-23 11:54:24,092 INFO L273 TraceCheckUtils]: 18: Hoare triple {11741#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11741#true} is VALID [2018-11-23 11:54:24,092 INFO L273 TraceCheckUtils]: 19: Hoare triple {11741#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11741#true} is VALID [2018-11-23 11:54:24,092 INFO L273 TraceCheckUtils]: 20: Hoare triple {11741#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11741#true} is VALID [2018-11-23 11:54:24,092 INFO L273 TraceCheckUtils]: 21: Hoare triple {11741#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11741#true} is VALID [2018-11-23 11:54:24,093 INFO L273 TraceCheckUtils]: 22: Hoare triple {11741#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11741#true} is VALID [2018-11-23 11:54:24,093 INFO L273 TraceCheckUtils]: 23: Hoare triple {11741#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11741#true} is VALID [2018-11-23 11:54:24,093 INFO L273 TraceCheckUtils]: 24: Hoare triple {11741#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11741#true} is VALID [2018-11-23 11:54:24,093 INFO L273 TraceCheckUtils]: 25: Hoare triple {11741#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11741#true} is VALID [2018-11-23 11:54:24,093 INFO L273 TraceCheckUtils]: 26: Hoare triple {11741#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11741#true} is VALID [2018-11-23 11:54:24,093 INFO L273 TraceCheckUtils]: 27: Hoare triple {11741#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11741#true} is VALID [2018-11-23 11:54:24,093 INFO L273 TraceCheckUtils]: 28: Hoare triple {11741#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11741#true} is VALID [2018-11-23 11:54:24,093 INFO L273 TraceCheckUtils]: 29: Hoare triple {11741#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11741#true} is VALID [2018-11-23 11:54:24,094 INFO L273 TraceCheckUtils]: 30: Hoare triple {11741#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11741#true} is VALID [2018-11-23 11:54:24,094 INFO L273 TraceCheckUtils]: 31: Hoare triple {11741#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11741#true} is VALID [2018-11-23 11:54:24,094 INFO L273 TraceCheckUtils]: 32: Hoare triple {11741#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11741#true} is VALID [2018-11-23 11:54:24,094 INFO L273 TraceCheckUtils]: 33: Hoare triple {11741#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11741#true} is VALID [2018-11-23 11:54:24,094 INFO L273 TraceCheckUtils]: 34: Hoare triple {11741#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11741#true} is VALID [2018-11-23 11:54:24,094 INFO L273 TraceCheckUtils]: 35: Hoare triple {11741#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11741#true} is VALID [2018-11-23 11:54:24,095 INFO L273 TraceCheckUtils]: 36: Hoare triple {11741#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11871#(< main_~a~0 100000)} is VALID [2018-11-23 11:54:24,095 INFO L273 TraceCheckUtils]: 37: Hoare triple {11871#(< main_~a~0 100000)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11875#(<= main_~a~0 100000)} is VALID [2018-11-23 11:54:24,095 INFO L273 TraceCheckUtils]: 38: Hoare triple {11875#(<= main_~a~0 100000)} assume !(~a~0 < 100000); {11741#true} is VALID [2018-11-23 11:54:24,096 INFO L273 TraceCheckUtils]: 39: Hoare triple {11741#true} havoc ~i~0;~i~0 := 0; {11882#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:24,096 INFO L273 TraceCheckUtils]: 40: Hoare triple {11882#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11882#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:24,097 INFO L273 TraceCheckUtils]: 41: Hoare triple {11882#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11889#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:24,097 INFO L273 TraceCheckUtils]: 42: Hoare triple {11889#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11889#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:24,097 INFO L273 TraceCheckUtils]: 43: Hoare triple {11889#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11896#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:24,098 INFO L273 TraceCheckUtils]: 44: Hoare triple {11896#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11896#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:24,098 INFO L273 TraceCheckUtils]: 45: Hoare triple {11896#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11903#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:24,098 INFO L273 TraceCheckUtils]: 46: Hoare triple {11903#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11903#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:24,099 INFO L273 TraceCheckUtils]: 47: Hoare triple {11903#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11910#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:24,099 INFO L273 TraceCheckUtils]: 48: Hoare triple {11910#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11910#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:24,100 INFO L273 TraceCheckUtils]: 49: Hoare triple {11910#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11917#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:24,100 INFO L273 TraceCheckUtils]: 50: Hoare triple {11917#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11917#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:24,101 INFO L273 TraceCheckUtils]: 51: Hoare triple {11917#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11924#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:24,102 INFO L273 TraceCheckUtils]: 52: Hoare triple {11924#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11924#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:24,102 INFO L273 TraceCheckUtils]: 53: Hoare triple {11924#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11931#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:24,103 INFO L273 TraceCheckUtils]: 54: Hoare triple {11931#(<= main_~i~0 7)} assume !(~i~0 < 100000); {11742#false} is VALID [2018-11-23 11:54:24,103 INFO L273 TraceCheckUtils]: 55: Hoare triple {11742#false} ~i~0 := 0; {11742#false} is VALID [2018-11-23 11:54:24,104 INFO L273 TraceCheckUtils]: 56: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11742#false} is VALID [2018-11-23 11:54:24,104 INFO L273 TraceCheckUtils]: 57: Hoare triple {11742#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11742#false} is VALID [2018-11-23 11:54:24,104 INFO L273 TraceCheckUtils]: 58: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11742#false} is VALID [2018-11-23 11:54:24,104 INFO L273 TraceCheckUtils]: 59: Hoare triple {11742#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11742#false} is VALID [2018-11-23 11:54:24,104 INFO L273 TraceCheckUtils]: 60: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11742#false} is VALID [2018-11-23 11:54:24,105 INFO L273 TraceCheckUtils]: 61: Hoare triple {11742#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11742#false} is VALID [2018-11-23 11:54:24,105 INFO L273 TraceCheckUtils]: 62: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11742#false} is VALID [2018-11-23 11:54:24,105 INFO L273 TraceCheckUtils]: 63: Hoare triple {11742#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11742#false} is VALID [2018-11-23 11:54:24,105 INFO L273 TraceCheckUtils]: 64: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11742#false} is VALID [2018-11-23 11:54:24,105 INFO L273 TraceCheckUtils]: 65: Hoare triple {11742#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11742#false} is VALID [2018-11-23 11:54:24,106 INFO L273 TraceCheckUtils]: 66: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11742#false} is VALID [2018-11-23 11:54:24,106 INFO L273 TraceCheckUtils]: 67: Hoare triple {11742#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11742#false} is VALID [2018-11-23 11:54:24,106 INFO L273 TraceCheckUtils]: 68: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11742#false} is VALID [2018-11-23 11:54:24,106 INFO L273 TraceCheckUtils]: 69: Hoare triple {11742#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11742#false} is VALID [2018-11-23 11:54:24,106 INFO L273 TraceCheckUtils]: 70: Hoare triple {11742#false} assume !(~i~0 < 100000); {11742#false} is VALID [2018-11-23 11:54:24,106 INFO L273 TraceCheckUtils]: 71: Hoare triple {11742#false} ~i~0 := 0; {11742#false} is VALID [2018-11-23 11:54:24,106 INFO L273 TraceCheckUtils]: 72: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11742#false} is VALID [2018-11-23 11:54:24,106 INFO L273 TraceCheckUtils]: 73: Hoare triple {11742#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11742#false} is VALID [2018-11-23 11:54:24,107 INFO L273 TraceCheckUtils]: 74: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11742#false} is VALID [2018-11-23 11:54:24,107 INFO L273 TraceCheckUtils]: 75: Hoare triple {11742#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11742#false} is VALID [2018-11-23 11:54:24,107 INFO L273 TraceCheckUtils]: 76: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11742#false} is VALID [2018-11-23 11:54:24,107 INFO L273 TraceCheckUtils]: 77: Hoare triple {11742#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11742#false} is VALID [2018-11-23 11:54:24,107 INFO L273 TraceCheckUtils]: 78: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11742#false} is VALID [2018-11-23 11:54:24,107 INFO L273 TraceCheckUtils]: 79: Hoare triple {11742#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11742#false} is VALID [2018-11-23 11:54:24,107 INFO L273 TraceCheckUtils]: 80: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11742#false} is VALID [2018-11-23 11:54:24,107 INFO L273 TraceCheckUtils]: 81: Hoare triple {11742#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11742#false} is VALID [2018-11-23 11:54:24,107 INFO L273 TraceCheckUtils]: 82: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11742#false} is VALID [2018-11-23 11:54:24,108 INFO L273 TraceCheckUtils]: 83: Hoare triple {11742#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11742#false} is VALID [2018-11-23 11:54:24,108 INFO L273 TraceCheckUtils]: 84: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11742#false} is VALID [2018-11-23 11:54:24,108 INFO L273 TraceCheckUtils]: 85: Hoare triple {11742#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11742#false} is VALID [2018-11-23 11:54:24,108 INFO L273 TraceCheckUtils]: 86: Hoare triple {11742#false} assume !(~i~0 < 100000); {11742#false} is VALID [2018-11-23 11:54:24,108 INFO L273 TraceCheckUtils]: 87: Hoare triple {11742#false} ~i~0 := 0; {11742#false} is VALID [2018-11-23 11:54:24,108 INFO L273 TraceCheckUtils]: 88: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11742#false} is VALID [2018-11-23 11:54:24,108 INFO L273 TraceCheckUtils]: 89: Hoare triple {11742#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11742#false} is VALID [2018-11-23 11:54:24,108 INFO L273 TraceCheckUtils]: 90: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11742#false} is VALID [2018-11-23 11:54:24,108 INFO L273 TraceCheckUtils]: 91: Hoare triple {11742#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11742#false} is VALID [2018-11-23 11:54:24,109 INFO L273 TraceCheckUtils]: 92: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11742#false} is VALID [2018-11-23 11:54:24,109 INFO L273 TraceCheckUtils]: 93: Hoare triple {11742#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11742#false} is VALID [2018-11-23 11:54:24,109 INFO L273 TraceCheckUtils]: 94: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11742#false} is VALID [2018-11-23 11:54:24,109 INFO L273 TraceCheckUtils]: 95: Hoare triple {11742#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11742#false} is VALID [2018-11-23 11:54:24,109 INFO L273 TraceCheckUtils]: 96: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11742#false} is VALID [2018-11-23 11:54:24,109 INFO L273 TraceCheckUtils]: 97: Hoare triple {11742#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11742#false} is VALID [2018-11-23 11:54:24,109 INFO L273 TraceCheckUtils]: 98: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11742#false} is VALID [2018-11-23 11:54:24,109 INFO L273 TraceCheckUtils]: 99: Hoare triple {11742#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11742#false} is VALID [2018-11-23 11:54:24,110 INFO L273 TraceCheckUtils]: 100: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11742#false} is VALID [2018-11-23 11:54:24,110 INFO L273 TraceCheckUtils]: 101: Hoare triple {11742#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11742#false} is VALID [2018-11-23 11:54:24,110 INFO L273 TraceCheckUtils]: 102: Hoare triple {11742#false} assume !(~i~0 < 100000); {11742#false} is VALID [2018-11-23 11:54:24,110 INFO L273 TraceCheckUtils]: 103: Hoare triple {11742#false} ~i~0 := 0; {11742#false} is VALID [2018-11-23 11:54:24,110 INFO L273 TraceCheckUtils]: 104: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11742#false} is VALID [2018-11-23 11:54:24,110 INFO L273 TraceCheckUtils]: 105: Hoare triple {11742#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11742#false} is VALID [2018-11-23 11:54:24,110 INFO L273 TraceCheckUtils]: 106: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11742#false} is VALID [2018-11-23 11:54:24,110 INFO L273 TraceCheckUtils]: 107: Hoare triple {11742#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11742#false} is VALID [2018-11-23 11:54:24,110 INFO L273 TraceCheckUtils]: 108: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11742#false} is VALID [2018-11-23 11:54:24,111 INFO L273 TraceCheckUtils]: 109: Hoare triple {11742#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11742#false} is VALID [2018-11-23 11:54:24,111 INFO L273 TraceCheckUtils]: 110: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11742#false} is VALID [2018-11-23 11:54:24,111 INFO L273 TraceCheckUtils]: 111: Hoare triple {11742#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11742#false} is VALID [2018-11-23 11:54:24,111 INFO L273 TraceCheckUtils]: 112: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11742#false} is VALID [2018-11-23 11:54:24,111 INFO L273 TraceCheckUtils]: 113: Hoare triple {11742#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11742#false} is VALID [2018-11-23 11:54:24,111 INFO L273 TraceCheckUtils]: 114: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11742#false} is VALID [2018-11-23 11:54:24,111 INFO L273 TraceCheckUtils]: 115: Hoare triple {11742#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11742#false} is VALID [2018-11-23 11:54:24,111 INFO L273 TraceCheckUtils]: 116: Hoare triple {11742#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11742#false} is VALID [2018-11-23 11:54:24,111 INFO L273 TraceCheckUtils]: 117: Hoare triple {11742#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11742#false} is VALID [2018-11-23 11:54:24,112 INFO L273 TraceCheckUtils]: 118: Hoare triple {11742#false} assume !(~i~0 < 100000); {11742#false} is VALID [2018-11-23 11:54:24,112 INFO L273 TraceCheckUtils]: 119: Hoare triple {11742#false} havoc ~x~0;~x~0 := 0; {11742#false} is VALID [2018-11-23 11:54:24,112 INFO L273 TraceCheckUtils]: 120: Hoare triple {11742#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {11742#false} is VALID [2018-11-23 11:54:24,112 INFO L256 TraceCheckUtils]: 121: Hoare triple {11742#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {11742#false} is VALID [2018-11-23 11:54:24,112 INFO L273 TraceCheckUtils]: 122: Hoare triple {11742#false} ~cond := #in~cond; {11742#false} is VALID [2018-11-23 11:54:24,112 INFO L273 TraceCheckUtils]: 123: Hoare triple {11742#false} assume 0 == ~cond; {11742#false} is VALID [2018-11-23 11:54:24,112 INFO L273 TraceCheckUtils]: 124: Hoare triple {11742#false} assume !false; {11742#false} is VALID [2018-11-23 11:54:24,119 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 31 proven. 49 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2018-11-23 11:54:24,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:24,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 29 [2018-11-23 11:54:24,144 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 125 [2018-11-23 11:54:24,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:24,144 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 11:54:24,233 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:24,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 11:54:24,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 11:54:24,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=558, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:54:24,234 INFO L87 Difference]: Start difference. First operand 130 states and 136 transitions. Second operand 29 states. [2018-11-23 11:54:25,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:25,590 INFO L93 Difference]: Finished difference Result 240 states and 258 transitions. [2018-11-23 11:54:25,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 11:54:25,590 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 125 [2018-11-23 11:54:25,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:25,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:54:25,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 193 transitions. [2018-11-23 11:54:25,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:54:25,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 193 transitions. [2018-11-23 11:54:25,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 193 transitions. [2018-11-23 11:54:25,842 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:25,845 INFO L225 Difference]: With dead ends: 240 [2018-11-23 11:54:25,845 INFO L226 Difference]: Without dead ends: 149 [2018-11-23 11:54:25,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=342, Invalid=990, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 11:54:25,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-23 11:54:25,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 144. [2018-11-23 11:54:25,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:25,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand 144 states. [2018-11-23 11:54:25,952 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 144 states. [2018-11-23 11:54:25,953 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 144 states. [2018-11-23 11:54:25,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:25,956 INFO L93 Difference]: Finished difference Result 149 states and 155 transitions. [2018-11-23 11:54:25,956 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 155 transitions. [2018-11-23 11:54:25,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:25,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:25,957 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 149 states. [2018-11-23 11:54:25,957 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 149 states. [2018-11-23 11:54:25,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:25,959 INFO L93 Difference]: Finished difference Result 149 states and 155 transitions. [2018-11-23 11:54:25,959 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 155 transitions. [2018-11-23 11:54:25,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:25,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:25,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:25,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:25,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-23 11:54:25,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 150 transitions. [2018-11-23 11:54:25,963 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 150 transitions. Word has length 125 [2018-11-23 11:54:25,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:25,963 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 150 transitions. [2018-11-23 11:54:25,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 11:54:25,963 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 150 transitions. [2018-11-23 11:54:25,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-23 11:54:25,964 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:25,964 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:25,965 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:25,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:25,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1019244738, now seen corresponding path program 16 times [2018-11-23 11:54:25,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:25,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:25,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:25,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:25,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:26,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:26,742 INFO L256 TraceCheckUtils]: 0: Hoare triple {13027#true} call ULTIMATE.init(); {13027#true} is VALID [2018-11-23 11:54:26,743 INFO L273 TraceCheckUtils]: 1: Hoare triple {13027#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13027#true} is VALID [2018-11-23 11:54:26,743 INFO L273 TraceCheckUtils]: 2: Hoare triple {13027#true} assume true; {13027#true} is VALID [2018-11-23 11:54:26,743 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13027#true} {13027#true} #119#return; {13027#true} is VALID [2018-11-23 11:54:26,743 INFO L256 TraceCheckUtils]: 4: Hoare triple {13027#true} call #t~ret16 := main(); {13027#true} is VALID [2018-11-23 11:54:26,743 INFO L273 TraceCheckUtils]: 5: Hoare triple {13027#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {13029#(= main_~a~0 0)} is VALID [2018-11-23 11:54:26,744 INFO L273 TraceCheckUtils]: 6: Hoare triple {13029#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13029#(= main_~a~0 0)} is VALID [2018-11-23 11:54:26,744 INFO L273 TraceCheckUtils]: 7: Hoare triple {13029#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13030#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:26,744 INFO L273 TraceCheckUtils]: 8: Hoare triple {13030#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13030#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:26,745 INFO L273 TraceCheckUtils]: 9: Hoare triple {13030#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13031#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:26,746 INFO L273 TraceCheckUtils]: 10: Hoare triple {13031#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13031#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:26,747 INFO L273 TraceCheckUtils]: 11: Hoare triple {13031#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13032#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:26,747 INFO L273 TraceCheckUtils]: 12: Hoare triple {13032#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13032#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:26,748 INFO L273 TraceCheckUtils]: 13: Hoare triple {13032#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13033#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:26,748 INFO L273 TraceCheckUtils]: 14: Hoare triple {13033#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13033#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:26,749 INFO L273 TraceCheckUtils]: 15: Hoare triple {13033#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13034#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:26,750 INFO L273 TraceCheckUtils]: 16: Hoare triple {13034#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13034#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:26,750 INFO L273 TraceCheckUtils]: 17: Hoare triple {13034#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13035#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:26,751 INFO L273 TraceCheckUtils]: 18: Hoare triple {13035#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13035#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:26,752 INFO L273 TraceCheckUtils]: 19: Hoare triple {13035#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13036#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:26,752 INFO L273 TraceCheckUtils]: 20: Hoare triple {13036#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13036#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:26,753 INFO L273 TraceCheckUtils]: 21: Hoare triple {13036#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13037#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:26,754 INFO L273 TraceCheckUtils]: 22: Hoare triple {13037#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13037#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:26,754 INFO L273 TraceCheckUtils]: 23: Hoare triple {13037#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13038#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:26,755 INFO L273 TraceCheckUtils]: 24: Hoare triple {13038#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13038#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:26,756 INFO L273 TraceCheckUtils]: 25: Hoare triple {13038#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13039#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:26,756 INFO L273 TraceCheckUtils]: 26: Hoare triple {13039#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13039#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:26,757 INFO L273 TraceCheckUtils]: 27: Hoare triple {13039#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13040#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:26,757 INFO L273 TraceCheckUtils]: 28: Hoare triple {13040#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13040#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:26,758 INFO L273 TraceCheckUtils]: 29: Hoare triple {13040#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13041#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:26,759 INFO L273 TraceCheckUtils]: 30: Hoare triple {13041#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13041#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:26,760 INFO L273 TraceCheckUtils]: 31: Hoare triple {13041#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13042#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:26,760 INFO L273 TraceCheckUtils]: 32: Hoare triple {13042#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13042#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:26,761 INFO L273 TraceCheckUtils]: 33: Hoare triple {13042#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13043#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:26,761 INFO L273 TraceCheckUtils]: 34: Hoare triple {13043#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13043#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:26,762 INFO L273 TraceCheckUtils]: 35: Hoare triple {13043#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13044#(<= main_~a~0 15)} is VALID [2018-11-23 11:54:26,763 INFO L273 TraceCheckUtils]: 36: Hoare triple {13044#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13044#(<= main_~a~0 15)} is VALID [2018-11-23 11:54:26,763 INFO L273 TraceCheckUtils]: 37: Hoare triple {13044#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13045#(<= main_~a~0 16)} is VALID [2018-11-23 11:54:26,764 INFO L273 TraceCheckUtils]: 38: Hoare triple {13045#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13045#(<= main_~a~0 16)} is VALID [2018-11-23 11:54:26,765 INFO L273 TraceCheckUtils]: 39: Hoare triple {13045#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13046#(<= main_~a~0 17)} is VALID [2018-11-23 11:54:26,765 INFO L273 TraceCheckUtils]: 40: Hoare triple {13046#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13046#(<= main_~a~0 17)} is VALID [2018-11-23 11:54:26,766 INFO L273 TraceCheckUtils]: 41: Hoare triple {13046#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13047#(<= main_~a~0 18)} is VALID [2018-11-23 11:54:26,767 INFO L273 TraceCheckUtils]: 42: Hoare triple {13047#(<= main_~a~0 18)} assume !(~a~0 < 100000); {13028#false} is VALID [2018-11-23 11:54:26,767 INFO L273 TraceCheckUtils]: 43: Hoare triple {13028#false} havoc ~i~0;~i~0 := 0; {13028#false} is VALID [2018-11-23 11:54:26,767 INFO L273 TraceCheckUtils]: 44: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13028#false} is VALID [2018-11-23 11:54:26,767 INFO L273 TraceCheckUtils]: 45: Hoare triple {13028#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13028#false} is VALID [2018-11-23 11:54:26,768 INFO L273 TraceCheckUtils]: 46: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13028#false} is VALID [2018-11-23 11:54:26,768 INFO L273 TraceCheckUtils]: 47: Hoare triple {13028#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13028#false} is VALID [2018-11-23 11:54:26,768 INFO L273 TraceCheckUtils]: 48: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13028#false} is VALID [2018-11-23 11:54:26,768 INFO L273 TraceCheckUtils]: 49: Hoare triple {13028#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13028#false} is VALID [2018-11-23 11:54:26,768 INFO L273 TraceCheckUtils]: 50: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13028#false} is VALID [2018-11-23 11:54:26,769 INFO L273 TraceCheckUtils]: 51: Hoare triple {13028#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13028#false} is VALID [2018-11-23 11:54:26,769 INFO L273 TraceCheckUtils]: 52: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13028#false} is VALID [2018-11-23 11:54:26,769 INFO L273 TraceCheckUtils]: 53: Hoare triple {13028#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13028#false} is VALID [2018-11-23 11:54:26,769 INFO L273 TraceCheckUtils]: 54: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13028#false} is VALID [2018-11-23 11:54:26,769 INFO L273 TraceCheckUtils]: 55: Hoare triple {13028#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13028#false} is VALID [2018-11-23 11:54:26,770 INFO L273 TraceCheckUtils]: 56: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13028#false} is VALID [2018-11-23 11:54:26,770 INFO L273 TraceCheckUtils]: 57: Hoare triple {13028#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13028#false} is VALID [2018-11-23 11:54:26,770 INFO L273 TraceCheckUtils]: 58: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13028#false} is VALID [2018-11-23 11:54:26,770 INFO L273 TraceCheckUtils]: 59: Hoare triple {13028#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13028#false} is VALID [2018-11-23 11:54:26,770 INFO L273 TraceCheckUtils]: 60: Hoare triple {13028#false} assume !(~i~0 < 100000); {13028#false} is VALID [2018-11-23 11:54:26,771 INFO L273 TraceCheckUtils]: 61: Hoare triple {13028#false} ~i~0 := 0; {13028#false} is VALID [2018-11-23 11:54:26,771 INFO L273 TraceCheckUtils]: 62: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13028#false} is VALID [2018-11-23 11:54:26,771 INFO L273 TraceCheckUtils]: 63: Hoare triple {13028#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13028#false} is VALID [2018-11-23 11:54:26,771 INFO L273 TraceCheckUtils]: 64: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13028#false} is VALID [2018-11-23 11:54:26,771 INFO L273 TraceCheckUtils]: 65: Hoare triple {13028#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13028#false} is VALID [2018-11-23 11:54:26,772 INFO L273 TraceCheckUtils]: 66: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13028#false} is VALID [2018-11-23 11:54:26,772 INFO L273 TraceCheckUtils]: 67: Hoare triple {13028#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13028#false} is VALID [2018-11-23 11:54:26,772 INFO L273 TraceCheckUtils]: 68: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13028#false} is VALID [2018-11-23 11:54:26,772 INFO L273 TraceCheckUtils]: 69: Hoare triple {13028#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13028#false} is VALID [2018-11-23 11:54:26,772 INFO L273 TraceCheckUtils]: 70: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13028#false} is VALID [2018-11-23 11:54:26,772 INFO L273 TraceCheckUtils]: 71: Hoare triple {13028#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13028#false} is VALID [2018-11-23 11:54:26,772 INFO L273 TraceCheckUtils]: 72: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13028#false} is VALID [2018-11-23 11:54:26,772 INFO L273 TraceCheckUtils]: 73: Hoare triple {13028#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13028#false} is VALID [2018-11-23 11:54:26,773 INFO L273 TraceCheckUtils]: 74: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13028#false} is VALID [2018-11-23 11:54:26,773 INFO L273 TraceCheckUtils]: 75: Hoare triple {13028#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13028#false} is VALID [2018-11-23 11:54:26,773 INFO L273 TraceCheckUtils]: 76: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13028#false} is VALID [2018-11-23 11:54:26,773 INFO L273 TraceCheckUtils]: 77: Hoare triple {13028#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13028#false} is VALID [2018-11-23 11:54:26,773 INFO L273 TraceCheckUtils]: 78: Hoare triple {13028#false} assume !(~i~0 < 100000); {13028#false} is VALID [2018-11-23 11:54:26,773 INFO L273 TraceCheckUtils]: 79: Hoare triple {13028#false} ~i~0 := 0; {13028#false} is VALID [2018-11-23 11:54:26,773 INFO L273 TraceCheckUtils]: 80: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13028#false} is VALID [2018-11-23 11:54:26,773 INFO L273 TraceCheckUtils]: 81: Hoare triple {13028#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13028#false} is VALID [2018-11-23 11:54:26,773 INFO L273 TraceCheckUtils]: 82: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13028#false} is VALID [2018-11-23 11:54:26,774 INFO L273 TraceCheckUtils]: 83: Hoare triple {13028#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13028#false} is VALID [2018-11-23 11:54:26,774 INFO L273 TraceCheckUtils]: 84: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13028#false} is VALID [2018-11-23 11:54:26,774 INFO L273 TraceCheckUtils]: 85: Hoare triple {13028#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13028#false} is VALID [2018-11-23 11:54:26,774 INFO L273 TraceCheckUtils]: 86: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13028#false} is VALID [2018-11-23 11:54:26,774 INFO L273 TraceCheckUtils]: 87: Hoare triple {13028#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13028#false} is VALID [2018-11-23 11:54:26,774 INFO L273 TraceCheckUtils]: 88: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13028#false} is VALID [2018-11-23 11:54:26,774 INFO L273 TraceCheckUtils]: 89: Hoare triple {13028#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13028#false} is VALID [2018-11-23 11:54:26,774 INFO L273 TraceCheckUtils]: 90: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13028#false} is VALID [2018-11-23 11:54:26,775 INFO L273 TraceCheckUtils]: 91: Hoare triple {13028#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13028#false} is VALID [2018-11-23 11:54:26,775 INFO L273 TraceCheckUtils]: 92: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13028#false} is VALID [2018-11-23 11:54:26,775 INFO L273 TraceCheckUtils]: 93: Hoare triple {13028#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13028#false} is VALID [2018-11-23 11:54:26,775 INFO L273 TraceCheckUtils]: 94: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13028#false} is VALID [2018-11-23 11:54:26,775 INFO L273 TraceCheckUtils]: 95: Hoare triple {13028#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13028#false} is VALID [2018-11-23 11:54:26,775 INFO L273 TraceCheckUtils]: 96: Hoare triple {13028#false} assume !(~i~0 < 100000); {13028#false} is VALID [2018-11-23 11:54:26,775 INFO L273 TraceCheckUtils]: 97: Hoare triple {13028#false} ~i~0 := 0; {13028#false} is VALID [2018-11-23 11:54:26,775 INFO L273 TraceCheckUtils]: 98: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13028#false} is VALID [2018-11-23 11:54:26,775 INFO L273 TraceCheckUtils]: 99: Hoare triple {13028#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13028#false} is VALID [2018-11-23 11:54:26,776 INFO L273 TraceCheckUtils]: 100: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13028#false} is VALID [2018-11-23 11:54:26,776 INFO L273 TraceCheckUtils]: 101: Hoare triple {13028#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13028#false} is VALID [2018-11-23 11:54:26,776 INFO L273 TraceCheckUtils]: 102: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13028#false} is VALID [2018-11-23 11:54:26,776 INFO L273 TraceCheckUtils]: 103: Hoare triple {13028#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13028#false} is VALID [2018-11-23 11:54:26,776 INFO L273 TraceCheckUtils]: 104: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13028#false} is VALID [2018-11-23 11:54:26,776 INFO L273 TraceCheckUtils]: 105: Hoare triple {13028#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13028#false} is VALID [2018-11-23 11:54:26,776 INFO L273 TraceCheckUtils]: 106: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13028#false} is VALID [2018-11-23 11:54:26,776 INFO L273 TraceCheckUtils]: 107: Hoare triple {13028#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13028#false} is VALID [2018-11-23 11:54:26,776 INFO L273 TraceCheckUtils]: 108: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13028#false} is VALID [2018-11-23 11:54:26,777 INFO L273 TraceCheckUtils]: 109: Hoare triple {13028#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13028#false} is VALID [2018-11-23 11:54:26,777 INFO L273 TraceCheckUtils]: 110: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13028#false} is VALID [2018-11-23 11:54:26,777 INFO L273 TraceCheckUtils]: 111: Hoare triple {13028#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13028#false} is VALID [2018-11-23 11:54:26,777 INFO L273 TraceCheckUtils]: 112: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13028#false} is VALID [2018-11-23 11:54:26,777 INFO L273 TraceCheckUtils]: 113: Hoare triple {13028#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13028#false} is VALID [2018-11-23 11:54:26,777 INFO L273 TraceCheckUtils]: 114: Hoare triple {13028#false} assume !(~i~0 < 100000); {13028#false} is VALID [2018-11-23 11:54:26,777 INFO L273 TraceCheckUtils]: 115: Hoare triple {13028#false} ~i~0 := 0; {13028#false} is VALID [2018-11-23 11:54:26,777 INFO L273 TraceCheckUtils]: 116: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13028#false} is VALID [2018-11-23 11:54:26,778 INFO L273 TraceCheckUtils]: 117: Hoare triple {13028#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13028#false} is VALID [2018-11-23 11:54:26,778 INFO L273 TraceCheckUtils]: 118: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13028#false} is VALID [2018-11-23 11:54:26,778 INFO L273 TraceCheckUtils]: 119: Hoare triple {13028#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13028#false} is VALID [2018-11-23 11:54:26,778 INFO L273 TraceCheckUtils]: 120: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13028#false} is VALID [2018-11-23 11:54:26,778 INFO L273 TraceCheckUtils]: 121: Hoare triple {13028#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13028#false} is VALID [2018-11-23 11:54:26,778 INFO L273 TraceCheckUtils]: 122: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13028#false} is VALID [2018-11-23 11:54:26,778 INFO L273 TraceCheckUtils]: 123: Hoare triple {13028#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13028#false} is VALID [2018-11-23 11:54:26,778 INFO L273 TraceCheckUtils]: 124: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13028#false} is VALID [2018-11-23 11:54:26,778 INFO L273 TraceCheckUtils]: 125: Hoare triple {13028#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13028#false} is VALID [2018-11-23 11:54:26,779 INFO L273 TraceCheckUtils]: 126: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13028#false} is VALID [2018-11-23 11:54:26,779 INFO L273 TraceCheckUtils]: 127: Hoare triple {13028#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13028#false} is VALID [2018-11-23 11:54:26,779 INFO L273 TraceCheckUtils]: 128: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13028#false} is VALID [2018-11-23 11:54:26,779 INFO L273 TraceCheckUtils]: 129: Hoare triple {13028#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13028#false} is VALID [2018-11-23 11:54:26,779 INFO L273 TraceCheckUtils]: 130: Hoare triple {13028#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13028#false} is VALID [2018-11-23 11:54:26,779 INFO L273 TraceCheckUtils]: 131: Hoare triple {13028#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13028#false} is VALID [2018-11-23 11:54:26,779 INFO L273 TraceCheckUtils]: 132: Hoare triple {13028#false} assume !(~i~0 < 100000); {13028#false} is VALID [2018-11-23 11:54:26,779 INFO L273 TraceCheckUtils]: 133: Hoare triple {13028#false} havoc ~x~0;~x~0 := 0; {13028#false} is VALID [2018-11-23 11:54:26,779 INFO L273 TraceCheckUtils]: 134: Hoare triple {13028#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {13028#false} is VALID [2018-11-23 11:54:26,780 INFO L256 TraceCheckUtils]: 135: Hoare triple {13028#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {13028#false} is VALID [2018-11-23 11:54:26,780 INFO L273 TraceCheckUtils]: 136: Hoare triple {13028#false} ~cond := #in~cond; {13028#false} is VALID [2018-11-23 11:54:26,780 INFO L273 TraceCheckUtils]: 137: Hoare triple {13028#false} assume 0 == ~cond; {13028#false} is VALID [2018-11-23 11:54:26,780 INFO L273 TraceCheckUtils]: 138: Hoare triple {13028#false} assume !false; {13028#false} is VALID [2018-11-23 11:54:26,788 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-11-23 11:54:26,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:26,789 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 11:54:26,805 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:54:26,879 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:54:26,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:26,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:27,212 INFO L256 TraceCheckUtils]: 0: Hoare triple {13027#true} call ULTIMATE.init(); {13027#true} is VALID [2018-11-23 11:54:27,212 INFO L273 TraceCheckUtils]: 1: Hoare triple {13027#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13027#true} is VALID [2018-11-23 11:54:27,212 INFO L273 TraceCheckUtils]: 2: Hoare triple {13027#true} assume true; {13027#true} is VALID [2018-11-23 11:54:27,213 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13027#true} {13027#true} #119#return; {13027#true} is VALID [2018-11-23 11:54:27,213 INFO L256 TraceCheckUtils]: 4: Hoare triple {13027#true} call #t~ret16 := main(); {13027#true} is VALID [2018-11-23 11:54:27,213 INFO L273 TraceCheckUtils]: 5: Hoare triple {13027#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {13027#true} is VALID [2018-11-23 11:54:27,213 INFO L273 TraceCheckUtils]: 6: Hoare triple {13027#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13027#true} is VALID [2018-11-23 11:54:27,213 INFO L273 TraceCheckUtils]: 7: Hoare triple {13027#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13027#true} is VALID [2018-11-23 11:54:27,213 INFO L273 TraceCheckUtils]: 8: Hoare triple {13027#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13027#true} is VALID [2018-11-23 11:54:27,213 INFO L273 TraceCheckUtils]: 9: Hoare triple {13027#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13027#true} is VALID [2018-11-23 11:54:27,213 INFO L273 TraceCheckUtils]: 10: Hoare triple {13027#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13027#true} is VALID [2018-11-23 11:54:27,214 INFO L273 TraceCheckUtils]: 11: Hoare triple {13027#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13027#true} is VALID [2018-11-23 11:54:27,214 INFO L273 TraceCheckUtils]: 12: Hoare triple {13027#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13027#true} is VALID [2018-11-23 11:54:27,214 INFO L273 TraceCheckUtils]: 13: Hoare triple {13027#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13027#true} is VALID [2018-11-23 11:54:27,214 INFO L273 TraceCheckUtils]: 14: Hoare triple {13027#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13027#true} is VALID [2018-11-23 11:54:27,214 INFO L273 TraceCheckUtils]: 15: Hoare triple {13027#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13027#true} is VALID [2018-11-23 11:54:27,214 INFO L273 TraceCheckUtils]: 16: Hoare triple {13027#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13027#true} is VALID [2018-11-23 11:54:27,214 INFO L273 TraceCheckUtils]: 17: Hoare triple {13027#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13027#true} is VALID [2018-11-23 11:54:27,214 INFO L273 TraceCheckUtils]: 18: Hoare triple {13027#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13027#true} is VALID [2018-11-23 11:54:27,214 INFO L273 TraceCheckUtils]: 19: Hoare triple {13027#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13027#true} is VALID [2018-11-23 11:54:27,215 INFO L273 TraceCheckUtils]: 20: Hoare triple {13027#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13027#true} is VALID [2018-11-23 11:54:27,215 INFO L273 TraceCheckUtils]: 21: Hoare triple {13027#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13027#true} is VALID [2018-11-23 11:54:27,215 INFO L273 TraceCheckUtils]: 22: Hoare triple {13027#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13027#true} is VALID [2018-11-23 11:54:27,215 INFO L273 TraceCheckUtils]: 23: Hoare triple {13027#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13027#true} is VALID [2018-11-23 11:54:27,215 INFO L273 TraceCheckUtils]: 24: Hoare triple {13027#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13027#true} is VALID [2018-11-23 11:54:27,215 INFO L273 TraceCheckUtils]: 25: Hoare triple {13027#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13027#true} is VALID [2018-11-23 11:54:27,215 INFO L273 TraceCheckUtils]: 26: Hoare triple {13027#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13027#true} is VALID [2018-11-23 11:54:27,215 INFO L273 TraceCheckUtils]: 27: Hoare triple {13027#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13027#true} is VALID [2018-11-23 11:54:27,216 INFO L273 TraceCheckUtils]: 28: Hoare triple {13027#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13027#true} is VALID [2018-11-23 11:54:27,216 INFO L273 TraceCheckUtils]: 29: Hoare triple {13027#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13027#true} is VALID [2018-11-23 11:54:27,216 INFO L273 TraceCheckUtils]: 30: Hoare triple {13027#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13027#true} is VALID [2018-11-23 11:54:27,216 INFO L273 TraceCheckUtils]: 31: Hoare triple {13027#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13027#true} is VALID [2018-11-23 11:54:27,216 INFO L273 TraceCheckUtils]: 32: Hoare triple {13027#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13027#true} is VALID [2018-11-23 11:54:27,216 INFO L273 TraceCheckUtils]: 33: Hoare triple {13027#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13027#true} is VALID [2018-11-23 11:54:27,216 INFO L273 TraceCheckUtils]: 34: Hoare triple {13027#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13027#true} is VALID [2018-11-23 11:54:27,216 INFO L273 TraceCheckUtils]: 35: Hoare triple {13027#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13027#true} is VALID [2018-11-23 11:54:27,216 INFO L273 TraceCheckUtils]: 36: Hoare triple {13027#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13027#true} is VALID [2018-11-23 11:54:27,217 INFO L273 TraceCheckUtils]: 37: Hoare triple {13027#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13027#true} is VALID [2018-11-23 11:54:27,217 INFO L273 TraceCheckUtils]: 38: Hoare triple {13027#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13027#true} is VALID [2018-11-23 11:54:27,217 INFO L273 TraceCheckUtils]: 39: Hoare triple {13027#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13027#true} is VALID [2018-11-23 11:54:27,217 INFO L273 TraceCheckUtils]: 40: Hoare triple {13027#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13027#true} is VALID [2018-11-23 11:54:27,217 INFO L273 TraceCheckUtils]: 41: Hoare triple {13027#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13027#true} is VALID [2018-11-23 11:54:27,217 INFO L273 TraceCheckUtils]: 42: Hoare triple {13027#true} assume !(~a~0 < 100000); {13027#true} is VALID [2018-11-23 11:54:27,217 INFO L273 TraceCheckUtils]: 43: Hoare triple {13027#true} havoc ~i~0;~i~0 := 0; {13027#true} is VALID [2018-11-23 11:54:27,218 INFO L273 TraceCheckUtils]: 44: Hoare triple {13027#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13027#true} is VALID [2018-11-23 11:54:27,218 INFO L273 TraceCheckUtils]: 45: Hoare triple {13027#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13027#true} is VALID [2018-11-23 11:54:27,218 INFO L273 TraceCheckUtils]: 46: Hoare triple {13027#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13027#true} is VALID [2018-11-23 11:54:27,218 INFO L273 TraceCheckUtils]: 47: Hoare triple {13027#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13027#true} is VALID [2018-11-23 11:54:27,218 INFO L273 TraceCheckUtils]: 48: Hoare triple {13027#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13027#true} is VALID [2018-11-23 11:54:27,218 INFO L273 TraceCheckUtils]: 49: Hoare triple {13027#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13027#true} is VALID [2018-11-23 11:54:27,219 INFO L273 TraceCheckUtils]: 50: Hoare triple {13027#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13027#true} is VALID [2018-11-23 11:54:27,219 INFO L273 TraceCheckUtils]: 51: Hoare triple {13027#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13027#true} is VALID [2018-11-23 11:54:27,219 INFO L273 TraceCheckUtils]: 52: Hoare triple {13027#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13027#true} is VALID [2018-11-23 11:54:27,219 INFO L273 TraceCheckUtils]: 53: Hoare triple {13027#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13027#true} is VALID [2018-11-23 11:54:27,219 INFO L273 TraceCheckUtils]: 54: Hoare triple {13027#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13027#true} is VALID [2018-11-23 11:54:27,219 INFO L273 TraceCheckUtils]: 55: Hoare triple {13027#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13027#true} is VALID [2018-11-23 11:54:27,220 INFO L273 TraceCheckUtils]: 56: Hoare triple {13027#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13027#true} is VALID [2018-11-23 11:54:27,220 INFO L273 TraceCheckUtils]: 57: Hoare triple {13027#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13027#true} is VALID [2018-11-23 11:54:27,220 INFO L273 TraceCheckUtils]: 58: Hoare triple {13027#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13027#true} is VALID [2018-11-23 11:54:27,220 INFO L273 TraceCheckUtils]: 59: Hoare triple {13027#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13027#true} is VALID [2018-11-23 11:54:27,220 INFO L273 TraceCheckUtils]: 60: Hoare triple {13027#true} assume !(~i~0 < 100000); {13027#true} is VALID [2018-11-23 11:54:27,220 INFO L273 TraceCheckUtils]: 61: Hoare triple {13027#true} ~i~0 := 0; {13027#true} is VALID [2018-11-23 11:54:27,221 INFO L273 TraceCheckUtils]: 62: Hoare triple {13027#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13027#true} is VALID [2018-11-23 11:54:27,221 INFO L273 TraceCheckUtils]: 63: Hoare triple {13027#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13027#true} is VALID [2018-11-23 11:54:27,221 INFO L273 TraceCheckUtils]: 64: Hoare triple {13027#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13027#true} is VALID [2018-11-23 11:54:27,221 INFO L273 TraceCheckUtils]: 65: Hoare triple {13027#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13027#true} is VALID [2018-11-23 11:54:27,221 INFO L273 TraceCheckUtils]: 66: Hoare triple {13027#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13027#true} is VALID [2018-11-23 11:54:27,222 INFO L273 TraceCheckUtils]: 67: Hoare triple {13027#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13027#true} is VALID [2018-11-23 11:54:27,222 INFO L273 TraceCheckUtils]: 68: Hoare triple {13027#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13027#true} is VALID [2018-11-23 11:54:27,222 INFO L273 TraceCheckUtils]: 69: Hoare triple {13027#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13027#true} is VALID [2018-11-23 11:54:27,222 INFO L273 TraceCheckUtils]: 70: Hoare triple {13027#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13027#true} is VALID [2018-11-23 11:54:27,222 INFO L273 TraceCheckUtils]: 71: Hoare triple {13027#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13027#true} is VALID [2018-11-23 11:54:27,222 INFO L273 TraceCheckUtils]: 72: Hoare triple {13027#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13027#true} is VALID [2018-11-23 11:54:27,223 INFO L273 TraceCheckUtils]: 73: Hoare triple {13027#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13027#true} is VALID [2018-11-23 11:54:27,223 INFO L273 TraceCheckUtils]: 74: Hoare triple {13027#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13027#true} is VALID [2018-11-23 11:54:27,223 INFO L273 TraceCheckUtils]: 75: Hoare triple {13027#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13027#true} is VALID [2018-11-23 11:54:27,223 INFO L273 TraceCheckUtils]: 76: Hoare triple {13027#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13027#true} is VALID [2018-11-23 11:54:27,223 INFO L273 TraceCheckUtils]: 77: Hoare triple {13027#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13027#true} is VALID [2018-11-23 11:54:27,223 INFO L273 TraceCheckUtils]: 78: Hoare triple {13027#true} assume !(~i~0 < 100000); {13027#true} is VALID [2018-11-23 11:54:27,224 INFO L273 TraceCheckUtils]: 79: Hoare triple {13027#true} ~i~0 := 0; {13027#true} is VALID [2018-11-23 11:54:27,224 INFO L273 TraceCheckUtils]: 80: Hoare triple {13027#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13027#true} is VALID [2018-11-23 11:54:27,224 INFO L273 TraceCheckUtils]: 81: Hoare triple {13027#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13027#true} is VALID [2018-11-23 11:54:27,224 INFO L273 TraceCheckUtils]: 82: Hoare triple {13027#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13027#true} is VALID [2018-11-23 11:54:27,224 INFO L273 TraceCheckUtils]: 83: Hoare triple {13027#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13027#true} is VALID [2018-11-23 11:54:27,224 INFO L273 TraceCheckUtils]: 84: Hoare triple {13027#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13027#true} is VALID [2018-11-23 11:54:27,225 INFO L273 TraceCheckUtils]: 85: Hoare triple {13027#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13027#true} is VALID [2018-11-23 11:54:27,225 INFO L273 TraceCheckUtils]: 86: Hoare triple {13027#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13027#true} is VALID [2018-11-23 11:54:27,225 INFO L273 TraceCheckUtils]: 87: Hoare triple {13027#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13027#true} is VALID [2018-11-23 11:54:27,225 INFO L273 TraceCheckUtils]: 88: Hoare triple {13027#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13027#true} is VALID [2018-11-23 11:54:27,225 INFO L273 TraceCheckUtils]: 89: Hoare triple {13027#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13027#true} is VALID [2018-11-23 11:54:27,225 INFO L273 TraceCheckUtils]: 90: Hoare triple {13027#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13027#true} is VALID [2018-11-23 11:54:27,226 INFO L273 TraceCheckUtils]: 91: Hoare triple {13027#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13027#true} is VALID [2018-11-23 11:54:27,226 INFO L273 TraceCheckUtils]: 92: Hoare triple {13027#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13027#true} is VALID [2018-11-23 11:54:27,226 INFO L273 TraceCheckUtils]: 93: Hoare triple {13027#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13027#true} is VALID [2018-11-23 11:54:27,226 INFO L273 TraceCheckUtils]: 94: Hoare triple {13027#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13027#true} is VALID [2018-11-23 11:54:27,226 INFO L273 TraceCheckUtils]: 95: Hoare triple {13027#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13027#true} is VALID [2018-11-23 11:54:27,226 INFO L273 TraceCheckUtils]: 96: Hoare triple {13027#true} assume !(~i~0 < 100000); {13027#true} is VALID [2018-11-23 11:54:27,227 INFO L273 TraceCheckUtils]: 97: Hoare triple {13027#true} ~i~0 := 0; {13027#true} is VALID [2018-11-23 11:54:27,227 INFO L273 TraceCheckUtils]: 98: Hoare triple {13027#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13027#true} is VALID [2018-11-23 11:54:27,227 INFO L273 TraceCheckUtils]: 99: Hoare triple {13027#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13027#true} is VALID [2018-11-23 11:54:27,227 INFO L273 TraceCheckUtils]: 100: Hoare triple {13027#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13027#true} is VALID [2018-11-23 11:54:27,227 INFO L273 TraceCheckUtils]: 101: Hoare triple {13027#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13027#true} is VALID [2018-11-23 11:54:27,227 INFO L273 TraceCheckUtils]: 102: Hoare triple {13027#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13027#true} is VALID [2018-11-23 11:54:27,228 INFO L273 TraceCheckUtils]: 103: Hoare triple {13027#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13027#true} is VALID [2018-11-23 11:54:27,228 INFO L273 TraceCheckUtils]: 104: Hoare triple {13027#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13027#true} is VALID [2018-11-23 11:54:27,228 INFO L273 TraceCheckUtils]: 105: Hoare triple {13027#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13027#true} is VALID [2018-11-23 11:54:27,228 INFO L273 TraceCheckUtils]: 106: Hoare triple {13027#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13027#true} is VALID [2018-11-23 11:54:27,228 INFO L273 TraceCheckUtils]: 107: Hoare triple {13027#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13027#true} is VALID [2018-11-23 11:54:27,228 INFO L273 TraceCheckUtils]: 108: Hoare triple {13027#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13027#true} is VALID [2018-11-23 11:54:27,229 INFO L273 TraceCheckUtils]: 109: Hoare triple {13027#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13027#true} is VALID [2018-11-23 11:54:27,229 INFO L273 TraceCheckUtils]: 110: Hoare triple {13027#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13027#true} is VALID [2018-11-23 11:54:27,229 INFO L273 TraceCheckUtils]: 111: Hoare triple {13027#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13027#true} is VALID [2018-11-23 11:54:27,229 INFO L273 TraceCheckUtils]: 112: Hoare triple {13027#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13027#true} is VALID [2018-11-23 11:54:27,229 INFO L273 TraceCheckUtils]: 113: Hoare triple {13027#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13027#true} is VALID [2018-11-23 11:54:27,229 INFO L273 TraceCheckUtils]: 114: Hoare triple {13027#true} assume !(~i~0 < 100000); {13027#true} is VALID [2018-11-23 11:54:27,249 INFO L273 TraceCheckUtils]: 115: Hoare triple {13027#true} ~i~0 := 0; {13396#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:27,264 INFO L273 TraceCheckUtils]: 116: Hoare triple {13396#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13396#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:27,273 INFO L273 TraceCheckUtils]: 117: Hoare triple {13396#(<= main_~i~0 0)} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13403#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:27,277 INFO L273 TraceCheckUtils]: 118: Hoare triple {13403#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13403#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:27,279 INFO L273 TraceCheckUtils]: 119: Hoare triple {13403#(<= main_~i~0 1)} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13410#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:27,281 INFO L273 TraceCheckUtils]: 120: Hoare triple {13410#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13410#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:27,281 INFO L273 TraceCheckUtils]: 121: Hoare triple {13410#(<= main_~i~0 2)} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13417#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:27,283 INFO L273 TraceCheckUtils]: 122: Hoare triple {13417#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13417#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:27,285 INFO L273 TraceCheckUtils]: 123: Hoare triple {13417#(<= main_~i~0 3)} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13424#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:27,285 INFO L273 TraceCheckUtils]: 124: Hoare triple {13424#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13424#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:27,288 INFO L273 TraceCheckUtils]: 125: Hoare triple {13424#(<= main_~i~0 4)} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13431#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:27,288 INFO L273 TraceCheckUtils]: 126: Hoare triple {13431#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13431#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:27,291 INFO L273 TraceCheckUtils]: 127: Hoare triple {13431#(<= main_~i~0 5)} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13438#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:27,291 INFO L273 TraceCheckUtils]: 128: Hoare triple {13438#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13438#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:27,292 INFO L273 TraceCheckUtils]: 129: Hoare triple {13438#(<= main_~i~0 6)} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13445#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:27,292 INFO L273 TraceCheckUtils]: 130: Hoare triple {13445#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13445#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:27,292 INFO L273 TraceCheckUtils]: 131: Hoare triple {13445#(<= main_~i~0 7)} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13452#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:27,293 INFO L273 TraceCheckUtils]: 132: Hoare triple {13452#(<= main_~i~0 8)} assume !(~i~0 < 100000); {13028#false} is VALID [2018-11-23 11:54:27,293 INFO L273 TraceCheckUtils]: 133: Hoare triple {13028#false} havoc ~x~0;~x~0 := 0; {13028#false} is VALID [2018-11-23 11:54:27,293 INFO L273 TraceCheckUtils]: 134: Hoare triple {13028#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {13028#false} is VALID [2018-11-23 11:54:27,293 INFO L256 TraceCheckUtils]: 135: Hoare triple {13028#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {13028#false} is VALID [2018-11-23 11:54:27,293 INFO L273 TraceCheckUtils]: 136: Hoare triple {13028#false} ~cond := #in~cond; {13028#false} is VALID [2018-11-23 11:54:27,293 INFO L273 TraceCheckUtils]: 137: Hoare triple {13028#false} assume 0 == ~cond; {13028#false} is VALID [2018-11-23 11:54:27,294 INFO L273 TraceCheckUtils]: 138: Hoare triple {13028#false} assume !false; {13028#false} is VALID [2018-11-23 11:54:27,302 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-11-23 11:54:27,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:27,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11] total 30 [2018-11-23 11:54:27,322 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 139 [2018-11-23 11:54:27,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:27,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 11:54:27,447 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:27,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 11:54:27,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 11:54:27,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=606, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:54:27,448 INFO L87 Difference]: Start difference. First operand 144 states and 150 transitions. Second operand 30 states. [2018-11-23 11:54:29,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:29,015 INFO L93 Difference]: Finished difference Result 263 states and 280 transitions. [2018-11-23 11:54:29,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 11:54:29,016 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 139 [2018-11-23 11:54:29,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:29,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:54:29,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 205 transitions. [2018-11-23 11:54:29,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:54:29,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 205 transitions. [2018-11-23 11:54:29,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 205 transitions. [2018-11-23 11:54:29,480 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:29,483 INFO L225 Difference]: With dead ends: 263 [2018-11-23 11:54:29,483 INFO L226 Difference]: Without dead ends: 162 [2018-11-23 11:54:29,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=264, Invalid=606, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:54:29,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-23 11:54:29,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 156. [2018-11-23 11:54:29,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:29,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand 156 states. [2018-11-23 11:54:29,595 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 156 states. [2018-11-23 11:54:29,595 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 156 states. [2018-11-23 11:54:29,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:29,598 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2018-11-23 11:54:29,598 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 168 transitions. [2018-11-23 11:54:29,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:29,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:29,598 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 162 states. [2018-11-23 11:54:29,599 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 162 states. [2018-11-23 11:54:29,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:29,601 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2018-11-23 11:54:29,601 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 168 transitions. [2018-11-23 11:54:29,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:29,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:29,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:29,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:29,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-23 11:54:29,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 162 transitions. [2018-11-23 11:54:29,604 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 162 transitions. Word has length 139 [2018-11-23 11:54:29,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:29,604 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 162 transitions. [2018-11-23 11:54:29,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 11:54:29,604 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 162 transitions. [2018-11-23 11:54:29,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-23 11:54:29,605 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:29,605 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:29,605 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:29,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:29,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1911931082, now seen corresponding path program 17 times [2018-11-23 11:54:29,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:29,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:29,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:29,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:29,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:30,004 INFO L256 TraceCheckUtils]: 0: Hoare triple {14418#true} call ULTIMATE.init(); {14418#true} is VALID [2018-11-23 11:54:30,005 INFO L273 TraceCheckUtils]: 1: Hoare triple {14418#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14418#true} is VALID [2018-11-23 11:54:30,005 INFO L273 TraceCheckUtils]: 2: Hoare triple {14418#true} assume true; {14418#true} is VALID [2018-11-23 11:54:30,005 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14418#true} {14418#true} #119#return; {14418#true} is VALID [2018-11-23 11:54:30,005 INFO L256 TraceCheckUtils]: 4: Hoare triple {14418#true} call #t~ret16 := main(); {14418#true} is VALID [2018-11-23 11:54:30,006 INFO L273 TraceCheckUtils]: 5: Hoare triple {14418#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {14420#(= main_~a~0 0)} is VALID [2018-11-23 11:54:30,007 INFO L273 TraceCheckUtils]: 6: Hoare triple {14420#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14420#(= main_~a~0 0)} is VALID [2018-11-23 11:54:30,007 INFO L273 TraceCheckUtils]: 7: Hoare triple {14420#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14421#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:30,007 INFO L273 TraceCheckUtils]: 8: Hoare triple {14421#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14421#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:30,008 INFO L273 TraceCheckUtils]: 9: Hoare triple {14421#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14422#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:30,008 INFO L273 TraceCheckUtils]: 10: Hoare triple {14422#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14422#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:30,009 INFO L273 TraceCheckUtils]: 11: Hoare triple {14422#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14423#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:30,009 INFO L273 TraceCheckUtils]: 12: Hoare triple {14423#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14423#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:30,009 INFO L273 TraceCheckUtils]: 13: Hoare triple {14423#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14424#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:30,010 INFO L273 TraceCheckUtils]: 14: Hoare triple {14424#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14424#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:30,011 INFO L273 TraceCheckUtils]: 15: Hoare triple {14424#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14425#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:30,011 INFO L273 TraceCheckUtils]: 16: Hoare triple {14425#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14425#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:30,012 INFO L273 TraceCheckUtils]: 17: Hoare triple {14425#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14426#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:30,012 INFO L273 TraceCheckUtils]: 18: Hoare triple {14426#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14426#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:30,013 INFO L273 TraceCheckUtils]: 19: Hoare triple {14426#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14427#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:30,014 INFO L273 TraceCheckUtils]: 20: Hoare triple {14427#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14427#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:30,015 INFO L273 TraceCheckUtils]: 21: Hoare triple {14427#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14428#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:30,015 INFO L273 TraceCheckUtils]: 22: Hoare triple {14428#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14428#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:30,016 INFO L273 TraceCheckUtils]: 23: Hoare triple {14428#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14429#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:30,016 INFO L273 TraceCheckUtils]: 24: Hoare triple {14429#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14429#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:30,017 INFO L273 TraceCheckUtils]: 25: Hoare triple {14429#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14430#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:30,018 INFO L273 TraceCheckUtils]: 26: Hoare triple {14430#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14430#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:30,018 INFO L273 TraceCheckUtils]: 27: Hoare triple {14430#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14431#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:30,019 INFO L273 TraceCheckUtils]: 28: Hoare triple {14431#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14431#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:30,020 INFO L273 TraceCheckUtils]: 29: Hoare triple {14431#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14432#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:30,020 INFO L273 TraceCheckUtils]: 30: Hoare triple {14432#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14432#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:30,021 INFO L273 TraceCheckUtils]: 31: Hoare triple {14432#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14433#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:30,022 INFO L273 TraceCheckUtils]: 32: Hoare triple {14433#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14433#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:30,022 INFO L273 TraceCheckUtils]: 33: Hoare triple {14433#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14434#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:30,023 INFO L273 TraceCheckUtils]: 34: Hoare triple {14434#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14434#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:30,024 INFO L273 TraceCheckUtils]: 35: Hoare triple {14434#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14435#(<= main_~a~0 15)} is VALID [2018-11-23 11:54:30,024 INFO L273 TraceCheckUtils]: 36: Hoare triple {14435#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14435#(<= main_~a~0 15)} is VALID [2018-11-23 11:54:30,025 INFO L273 TraceCheckUtils]: 37: Hoare triple {14435#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14436#(<= main_~a~0 16)} is VALID [2018-11-23 11:54:30,026 INFO L273 TraceCheckUtils]: 38: Hoare triple {14436#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14436#(<= main_~a~0 16)} is VALID [2018-11-23 11:54:30,026 INFO L273 TraceCheckUtils]: 39: Hoare triple {14436#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14437#(<= main_~a~0 17)} is VALID [2018-11-23 11:54:30,027 INFO L273 TraceCheckUtils]: 40: Hoare triple {14437#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14437#(<= main_~a~0 17)} is VALID [2018-11-23 11:54:30,028 INFO L273 TraceCheckUtils]: 41: Hoare triple {14437#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14438#(<= main_~a~0 18)} is VALID [2018-11-23 11:54:30,028 INFO L273 TraceCheckUtils]: 42: Hoare triple {14438#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14438#(<= main_~a~0 18)} is VALID [2018-11-23 11:54:30,029 INFO L273 TraceCheckUtils]: 43: Hoare triple {14438#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14439#(<= main_~a~0 19)} is VALID [2018-11-23 11:54:30,030 INFO L273 TraceCheckUtils]: 44: Hoare triple {14439#(<= main_~a~0 19)} assume !(~a~0 < 100000); {14419#false} is VALID [2018-11-23 11:54:30,030 INFO L273 TraceCheckUtils]: 45: Hoare triple {14419#false} havoc ~i~0;~i~0 := 0; {14419#false} is VALID [2018-11-23 11:54:30,030 INFO L273 TraceCheckUtils]: 46: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14419#false} is VALID [2018-11-23 11:54:30,030 INFO L273 TraceCheckUtils]: 47: Hoare triple {14419#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14419#false} is VALID [2018-11-23 11:54:30,031 INFO L273 TraceCheckUtils]: 48: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14419#false} is VALID [2018-11-23 11:54:30,031 INFO L273 TraceCheckUtils]: 49: Hoare triple {14419#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14419#false} is VALID [2018-11-23 11:54:30,031 INFO L273 TraceCheckUtils]: 50: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14419#false} is VALID [2018-11-23 11:54:30,031 INFO L273 TraceCheckUtils]: 51: Hoare triple {14419#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14419#false} is VALID [2018-11-23 11:54:30,031 INFO L273 TraceCheckUtils]: 52: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14419#false} is VALID [2018-11-23 11:54:30,032 INFO L273 TraceCheckUtils]: 53: Hoare triple {14419#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14419#false} is VALID [2018-11-23 11:54:30,032 INFO L273 TraceCheckUtils]: 54: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14419#false} is VALID [2018-11-23 11:54:30,032 INFO L273 TraceCheckUtils]: 55: Hoare triple {14419#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14419#false} is VALID [2018-11-23 11:54:30,032 INFO L273 TraceCheckUtils]: 56: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14419#false} is VALID [2018-11-23 11:54:30,032 INFO L273 TraceCheckUtils]: 57: Hoare triple {14419#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14419#false} is VALID [2018-11-23 11:54:30,032 INFO L273 TraceCheckUtils]: 58: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14419#false} is VALID [2018-11-23 11:54:30,033 INFO L273 TraceCheckUtils]: 59: Hoare triple {14419#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14419#false} is VALID [2018-11-23 11:54:30,033 INFO L273 TraceCheckUtils]: 60: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14419#false} is VALID [2018-11-23 11:54:30,033 INFO L273 TraceCheckUtils]: 61: Hoare triple {14419#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14419#false} is VALID [2018-11-23 11:54:30,033 INFO L273 TraceCheckUtils]: 62: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14419#false} is VALID [2018-11-23 11:54:30,033 INFO L273 TraceCheckUtils]: 63: Hoare triple {14419#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14419#false} is VALID [2018-11-23 11:54:30,034 INFO L273 TraceCheckUtils]: 64: Hoare triple {14419#false} assume !(~i~0 < 100000); {14419#false} is VALID [2018-11-23 11:54:30,034 INFO L273 TraceCheckUtils]: 65: Hoare triple {14419#false} ~i~0 := 0; {14419#false} is VALID [2018-11-23 11:54:30,034 INFO L273 TraceCheckUtils]: 66: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14419#false} is VALID [2018-11-23 11:54:30,034 INFO L273 TraceCheckUtils]: 67: Hoare triple {14419#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14419#false} is VALID [2018-11-23 11:54:30,034 INFO L273 TraceCheckUtils]: 68: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14419#false} is VALID [2018-11-23 11:54:30,035 INFO L273 TraceCheckUtils]: 69: Hoare triple {14419#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14419#false} is VALID [2018-11-23 11:54:30,035 INFO L273 TraceCheckUtils]: 70: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14419#false} is VALID [2018-11-23 11:54:30,035 INFO L273 TraceCheckUtils]: 71: Hoare triple {14419#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14419#false} is VALID [2018-11-23 11:54:30,035 INFO L273 TraceCheckUtils]: 72: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14419#false} is VALID [2018-11-23 11:54:30,035 INFO L273 TraceCheckUtils]: 73: Hoare triple {14419#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14419#false} is VALID [2018-11-23 11:54:30,035 INFO L273 TraceCheckUtils]: 74: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14419#false} is VALID [2018-11-23 11:54:30,035 INFO L273 TraceCheckUtils]: 75: Hoare triple {14419#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14419#false} is VALID [2018-11-23 11:54:30,036 INFO L273 TraceCheckUtils]: 76: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14419#false} is VALID [2018-11-23 11:54:30,036 INFO L273 TraceCheckUtils]: 77: Hoare triple {14419#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14419#false} is VALID [2018-11-23 11:54:30,036 INFO L273 TraceCheckUtils]: 78: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14419#false} is VALID [2018-11-23 11:54:30,036 INFO L273 TraceCheckUtils]: 79: Hoare triple {14419#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14419#false} is VALID [2018-11-23 11:54:30,036 INFO L273 TraceCheckUtils]: 80: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14419#false} is VALID [2018-11-23 11:54:30,036 INFO L273 TraceCheckUtils]: 81: Hoare triple {14419#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14419#false} is VALID [2018-11-23 11:54:30,036 INFO L273 TraceCheckUtils]: 82: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14419#false} is VALID [2018-11-23 11:54:30,036 INFO L273 TraceCheckUtils]: 83: Hoare triple {14419#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14419#false} is VALID [2018-11-23 11:54:30,036 INFO L273 TraceCheckUtils]: 84: Hoare triple {14419#false} assume !(~i~0 < 100000); {14419#false} is VALID [2018-11-23 11:54:30,037 INFO L273 TraceCheckUtils]: 85: Hoare triple {14419#false} ~i~0 := 0; {14419#false} is VALID [2018-11-23 11:54:30,037 INFO L273 TraceCheckUtils]: 86: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14419#false} is VALID [2018-11-23 11:54:30,037 INFO L273 TraceCheckUtils]: 87: Hoare triple {14419#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14419#false} is VALID [2018-11-23 11:54:30,037 INFO L273 TraceCheckUtils]: 88: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14419#false} is VALID [2018-11-23 11:54:30,037 INFO L273 TraceCheckUtils]: 89: Hoare triple {14419#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14419#false} is VALID [2018-11-23 11:54:30,037 INFO L273 TraceCheckUtils]: 90: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14419#false} is VALID [2018-11-23 11:54:30,037 INFO L273 TraceCheckUtils]: 91: Hoare triple {14419#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14419#false} is VALID [2018-11-23 11:54:30,037 INFO L273 TraceCheckUtils]: 92: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14419#false} is VALID [2018-11-23 11:54:30,038 INFO L273 TraceCheckUtils]: 93: Hoare triple {14419#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14419#false} is VALID [2018-11-23 11:54:30,038 INFO L273 TraceCheckUtils]: 94: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14419#false} is VALID [2018-11-23 11:54:30,038 INFO L273 TraceCheckUtils]: 95: Hoare triple {14419#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14419#false} is VALID [2018-11-23 11:54:30,038 INFO L273 TraceCheckUtils]: 96: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14419#false} is VALID [2018-11-23 11:54:30,038 INFO L273 TraceCheckUtils]: 97: Hoare triple {14419#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14419#false} is VALID [2018-11-23 11:54:30,038 INFO L273 TraceCheckUtils]: 98: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14419#false} is VALID [2018-11-23 11:54:30,038 INFO L273 TraceCheckUtils]: 99: Hoare triple {14419#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14419#false} is VALID [2018-11-23 11:54:30,038 INFO L273 TraceCheckUtils]: 100: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14419#false} is VALID [2018-11-23 11:54:30,038 INFO L273 TraceCheckUtils]: 101: Hoare triple {14419#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14419#false} is VALID [2018-11-23 11:54:30,039 INFO L273 TraceCheckUtils]: 102: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14419#false} is VALID [2018-11-23 11:54:30,039 INFO L273 TraceCheckUtils]: 103: Hoare triple {14419#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14419#false} is VALID [2018-11-23 11:54:30,039 INFO L273 TraceCheckUtils]: 104: Hoare triple {14419#false} assume !(~i~0 < 100000); {14419#false} is VALID [2018-11-23 11:54:30,039 INFO L273 TraceCheckUtils]: 105: Hoare triple {14419#false} ~i~0 := 0; {14419#false} is VALID [2018-11-23 11:54:30,039 INFO L273 TraceCheckUtils]: 106: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {14419#false} is VALID [2018-11-23 11:54:30,039 INFO L273 TraceCheckUtils]: 107: Hoare triple {14419#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {14419#false} is VALID [2018-11-23 11:54:30,039 INFO L273 TraceCheckUtils]: 108: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {14419#false} is VALID [2018-11-23 11:54:30,039 INFO L273 TraceCheckUtils]: 109: Hoare triple {14419#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {14419#false} is VALID [2018-11-23 11:54:30,039 INFO L273 TraceCheckUtils]: 110: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {14419#false} is VALID [2018-11-23 11:54:30,040 INFO L273 TraceCheckUtils]: 111: Hoare triple {14419#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {14419#false} is VALID [2018-11-23 11:54:30,040 INFO L273 TraceCheckUtils]: 112: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {14419#false} is VALID [2018-11-23 11:54:30,040 INFO L273 TraceCheckUtils]: 113: Hoare triple {14419#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {14419#false} is VALID [2018-11-23 11:54:30,040 INFO L273 TraceCheckUtils]: 114: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {14419#false} is VALID [2018-11-23 11:54:30,040 INFO L273 TraceCheckUtils]: 115: Hoare triple {14419#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {14419#false} is VALID [2018-11-23 11:54:30,040 INFO L273 TraceCheckUtils]: 116: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {14419#false} is VALID [2018-11-23 11:54:30,040 INFO L273 TraceCheckUtils]: 117: Hoare triple {14419#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {14419#false} is VALID [2018-11-23 11:54:30,040 INFO L273 TraceCheckUtils]: 118: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {14419#false} is VALID [2018-11-23 11:54:30,041 INFO L273 TraceCheckUtils]: 119: Hoare triple {14419#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {14419#false} is VALID [2018-11-23 11:54:30,041 INFO L273 TraceCheckUtils]: 120: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {14419#false} is VALID [2018-11-23 11:54:30,041 INFO L273 TraceCheckUtils]: 121: Hoare triple {14419#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {14419#false} is VALID [2018-11-23 11:54:30,041 INFO L273 TraceCheckUtils]: 122: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {14419#false} is VALID [2018-11-23 11:54:30,041 INFO L273 TraceCheckUtils]: 123: Hoare triple {14419#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {14419#false} is VALID [2018-11-23 11:54:30,041 INFO L273 TraceCheckUtils]: 124: Hoare triple {14419#false} assume !(~i~0 < 100000); {14419#false} is VALID [2018-11-23 11:54:30,041 INFO L273 TraceCheckUtils]: 125: Hoare triple {14419#false} ~i~0 := 0; {14419#false} is VALID [2018-11-23 11:54:30,041 INFO L273 TraceCheckUtils]: 126: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {14419#false} is VALID [2018-11-23 11:54:30,041 INFO L273 TraceCheckUtils]: 127: Hoare triple {14419#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {14419#false} is VALID [2018-11-23 11:54:30,042 INFO L273 TraceCheckUtils]: 128: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {14419#false} is VALID [2018-11-23 11:54:30,042 INFO L273 TraceCheckUtils]: 129: Hoare triple {14419#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {14419#false} is VALID [2018-11-23 11:54:30,042 INFO L273 TraceCheckUtils]: 130: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {14419#false} is VALID [2018-11-23 11:54:30,042 INFO L273 TraceCheckUtils]: 131: Hoare triple {14419#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {14419#false} is VALID [2018-11-23 11:54:30,042 INFO L273 TraceCheckUtils]: 132: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {14419#false} is VALID [2018-11-23 11:54:30,042 INFO L273 TraceCheckUtils]: 133: Hoare triple {14419#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {14419#false} is VALID [2018-11-23 11:54:30,042 INFO L273 TraceCheckUtils]: 134: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {14419#false} is VALID [2018-11-23 11:54:30,042 INFO L273 TraceCheckUtils]: 135: Hoare triple {14419#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {14419#false} is VALID [2018-11-23 11:54:30,042 INFO L273 TraceCheckUtils]: 136: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {14419#false} is VALID [2018-11-23 11:54:30,043 INFO L273 TraceCheckUtils]: 137: Hoare triple {14419#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {14419#false} is VALID [2018-11-23 11:54:30,043 INFO L273 TraceCheckUtils]: 138: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {14419#false} is VALID [2018-11-23 11:54:30,043 INFO L273 TraceCheckUtils]: 139: Hoare triple {14419#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {14419#false} is VALID [2018-11-23 11:54:30,043 INFO L273 TraceCheckUtils]: 140: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {14419#false} is VALID [2018-11-23 11:54:30,043 INFO L273 TraceCheckUtils]: 141: Hoare triple {14419#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {14419#false} is VALID [2018-11-23 11:54:30,043 INFO L273 TraceCheckUtils]: 142: Hoare triple {14419#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {14419#false} is VALID [2018-11-23 11:54:30,043 INFO L273 TraceCheckUtils]: 143: Hoare triple {14419#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {14419#false} is VALID [2018-11-23 11:54:30,043 INFO L273 TraceCheckUtils]: 144: Hoare triple {14419#false} assume !(~i~0 < 100000); {14419#false} is VALID [2018-11-23 11:54:30,043 INFO L273 TraceCheckUtils]: 145: Hoare triple {14419#false} havoc ~x~0;~x~0 := 0; {14419#false} is VALID [2018-11-23 11:54:30,044 INFO L273 TraceCheckUtils]: 146: Hoare triple {14419#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {14419#false} is VALID [2018-11-23 11:54:30,044 INFO L256 TraceCheckUtils]: 147: Hoare triple {14419#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {14419#false} is VALID [2018-11-23 11:54:30,044 INFO L273 TraceCheckUtils]: 148: Hoare triple {14419#false} ~cond := #in~cond; {14419#false} is VALID [2018-11-23 11:54:30,044 INFO L273 TraceCheckUtils]: 149: Hoare triple {14419#false} assume 0 == ~cond; {14419#false} is VALID [2018-11-23 11:54:30,044 INFO L273 TraceCheckUtils]: 150: Hoare triple {14419#false} assume !false; {14419#false} is VALID [2018-11-23 11:54:30,054 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2018-11-23 11:54:30,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:30,054 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 11:54:30,064 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1