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_copy4_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:58:58,112 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:58:58,114 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:58:58,125 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:58:58,126 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:58:58,127 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:58:58,128 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:58:58,130 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:58:58,132 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:58:58,133 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:58:58,136 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:58:58,136 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:58:58,137 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:58:58,138 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:58:58,143 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:58:58,144 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:58:58,145 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:58:58,147 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:58:58,155 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:58:58,157 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:58:58,159 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:58:58,160 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:58:58,162 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:58:58,164 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:58:58,164 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:58:58,165 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:58:58,166 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:58:58,167 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:58:58,168 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:58:58,169 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:58:58,169 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:58:58,170 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:58:58,170 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:58:58,170 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:58:58,171 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:58:58,172 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:58:58,172 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:58:58,195 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:58:58,197 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:58:58,198 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:58:58,198 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:58:58,198 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:58:58,199 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:58:58,200 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:58:58,200 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:58:58,200 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:58:58,200 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:58:58,200 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:58:58,201 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:58:58,201 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:58:58,201 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:58:58,201 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:58:58,201 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:58:58,202 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:58:58,202 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:58:58,202 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:58:58,203 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:58:58,203 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:58:58,203 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:58:58,203 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:58:58,203 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:58:58,204 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:58:58,204 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:58:58,204 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:58:58,204 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:58:58,204 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:58:58,204 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:58:58,205 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:58:58,269 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:58:58,284 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:58:58,288 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:58:58,289 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:58:58,290 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:58:58,291 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy4_true-unreach-call_ground.i [2018-11-23 11:58:58,359 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18b1b1e6a/8dc4e2d0c96948cc876d3c95822d5ab3/FLAGa7536cc36 [2018-11-23 11:58:58,805 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:58:58,805 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy4_true-unreach-call_ground.i [2018-11-23 11:58:58,811 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18b1b1e6a/8dc4e2d0c96948cc876d3c95822d5ab3/FLAGa7536cc36 [2018-11-23 11:58:59,156 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18b1b1e6a/8dc4e2d0c96948cc876d3c95822d5ab3 [2018-11-23 11:58:59,166 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:58:59,168 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:58:59,169 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:58:59,169 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:58:59,174 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:58:59,176 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:58:59" (1/1) ... [2018-11-23 11:58:59,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72cdac6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:59, skipping insertion in model container [2018-11-23 11:58:59,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:58:59" (1/1) ... [2018-11-23 11:58:59,192 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:58:59,218 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:58:59,483 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:58:59,488 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:58:59,521 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:58:59,544 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:58:59,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:59 WrapperNode [2018-11-23 11:58:59,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:58:59,546 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:58:59,546 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:58:59,546 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:58:59,554 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:58:59" (1/1) ... [2018-11-23 11:58:59,563 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:58:59" (1/1) ... [2018-11-23 11:58:59,572 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:58:59,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:58:59,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:58:59,573 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:58:59,583 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:59" (1/1) ... [2018-11-23 11:58:59,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:59" (1/1) ... [2018-11-23 11:58:59,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:59" (1/1) ... [2018-11-23 11:58:59,587 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:59" (1/1) ... [2018-11-23 11:58:59,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:59" (1/1) ... [2018-11-23 11:58:59,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:59" (1/1) ... [2018-11-23 11:58:59,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:59" (1/1) ... [2018-11-23 11:58:59,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:58:59,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:58:59,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:58:59,615 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:58:59,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:59" (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:58:59,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:58:59,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:58:59,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:58:59,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:58:59,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:58:59,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:58:59,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:58:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:58:59,741 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:58:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:58:59,741 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:58:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:59:00,588 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:59:00,589 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 11:59:00,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:59:00 BoogieIcfgContainer [2018-11-23 11:59:00,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:59:00,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:59:00,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:59:00,597 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:59:00,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:58:59" (1/3) ... [2018-11-23 11:59:00,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a11adc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:59:00, skipping insertion in model container [2018-11-23 11:59:00,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:59" (2/3) ... [2018-11-23 11:59:00,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a11adc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:59:00, skipping insertion in model container [2018-11-23 11:59:00,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:59:00" (3/3) ... [2018-11-23 11:59:00,603 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy4_true-unreach-call_ground.i [2018-11-23 11:59:00,614 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:59:00,626 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:59:00,647 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:59:00,700 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:59:00,701 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:59:00,702 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:59:00,702 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:59:00,702 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:59:00,702 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:59:00,703 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:59:00,703 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:59:00,703 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:59:00,728 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-23 11:59:00,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:59:00,735 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:00,737 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] [2018-11-23 11:59:00,739 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:00,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:00,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1010407240, now seen corresponding path program 1 times [2018-11-23 11:59:00,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:00,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:00,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:00,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:00,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:00,934 INFO L256 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2018-11-23 11:59:00,938 INFO L273 TraceCheckUtils]: 1: Hoare triple {39#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39#true} is VALID [2018-11-23 11:59:00,939 INFO L273 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-23 11:59:00,939 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #105#return; {39#true} is VALID [2018-11-23 11:59:00,940 INFO L256 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret13 := main(); {39#true} is VALID [2018-11-23 11:59:00,940 INFO L273 TraceCheckUtils]: 5: Hoare triple {39#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);havoc ~a~0;~a~0 := 0; {39#true} is VALID [2018-11-23 11:59:00,941 INFO L273 TraceCheckUtils]: 6: Hoare triple {39#true} assume !true; {40#false} is VALID [2018-11-23 11:59:00,941 INFO L273 TraceCheckUtils]: 7: Hoare triple {40#false} havoc ~i~0;~i~0 := 0; {40#false} is VALID [2018-11-23 11:59:00,941 INFO L273 TraceCheckUtils]: 8: Hoare triple {40#false} assume !(~i~0 < 100000); {40#false} is VALID [2018-11-23 11:59:00,942 INFO L273 TraceCheckUtils]: 9: Hoare triple {40#false} ~i~0 := 0; {40#false} is VALID [2018-11-23 11:59:00,942 INFO L273 TraceCheckUtils]: 10: Hoare triple {40#false} assume !(~i~0 < 100000); {40#false} is VALID [2018-11-23 11:59:00,942 INFO L273 TraceCheckUtils]: 11: Hoare triple {40#false} ~i~0 := 0; {40#false} is VALID [2018-11-23 11:59:00,943 INFO L273 TraceCheckUtils]: 12: Hoare triple {40#false} assume !(~i~0 < 100000); {40#false} is VALID [2018-11-23 11:59:00,943 INFO L273 TraceCheckUtils]: 13: Hoare triple {40#false} ~i~0 := 0; {40#false} is VALID [2018-11-23 11:59:00,943 INFO L273 TraceCheckUtils]: 14: Hoare triple {40#false} assume !(~i~0 < 100000); {40#false} is VALID [2018-11-23 11:59:00,944 INFO L273 TraceCheckUtils]: 15: Hoare triple {40#false} havoc ~x~0;~x~0 := 0; {40#false} is VALID [2018-11-23 11:59:00,944 INFO L273 TraceCheckUtils]: 16: Hoare triple {40#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {40#false} is VALID [2018-11-23 11:59:00,944 INFO L256 TraceCheckUtils]: 17: Hoare triple {40#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {40#false} is VALID [2018-11-23 11:59:00,945 INFO L273 TraceCheckUtils]: 18: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2018-11-23 11:59:00,945 INFO L273 TraceCheckUtils]: 19: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2018-11-23 11:59:00,945 INFO L273 TraceCheckUtils]: 20: Hoare triple {40#false} assume !false; {40#false} is VALID [2018-11-23 11:59:00,950 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:59:00,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:59:00,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:59:00,958 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-23 11:59:00,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:00,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:59:01,060 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:01,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:59:01,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:59:01,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:59:01,071 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-11-23 11:59:01,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:01,197 INFO L93 Difference]: Finished difference Result 64 states and 87 transitions. [2018-11-23 11:59:01,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:59:01,197 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-23 11:59:01,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:01,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:59:01,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2018-11-23 11:59:01,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:59:01,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2018-11-23 11:59:01,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 87 transitions. [2018-11-23 11:59:01,496 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:59:01,507 INFO L225 Difference]: With dead ends: 64 [2018-11-23 11:59:01,508 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 11:59:01,511 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:59:01,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 11:59:01,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-23 11:59:01,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:01,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-23 11:59:01,692 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 11:59:01,692 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 11:59:01,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:01,697 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 11:59:01,697 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 11:59:01,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:01,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:01,699 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 11:59:01,699 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 11:59:01,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:01,704 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 11:59:01,704 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 11:59:01,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:01,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:01,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:01,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:01,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:59:01,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-11-23 11:59:01,711 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 21 [2018-11-23 11:59:01,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:01,711 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-23 11:59:01,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:59:01,712 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 11:59:01,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:59:01,713 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:01,713 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] [2018-11-23 11:59:01,713 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:01,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:01,714 INFO L82 PathProgramCache]: Analyzing trace with hash 555030978, now seen corresponding path program 1 times [2018-11-23 11:59:01,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:01,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:01,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:01,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:01,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:01,866 INFO L256 TraceCheckUtils]: 0: Hoare triple {231#true} call ULTIMATE.init(); {231#true} is VALID [2018-11-23 11:59:01,867 INFO L273 TraceCheckUtils]: 1: Hoare triple {231#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {231#true} is VALID [2018-11-23 11:59:01,867 INFO L273 TraceCheckUtils]: 2: Hoare triple {231#true} assume true; {231#true} is VALID [2018-11-23 11:59:01,867 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} #105#return; {231#true} is VALID [2018-11-23 11:59:01,868 INFO L256 TraceCheckUtils]: 4: Hoare triple {231#true} call #t~ret13 := main(); {231#true} is VALID [2018-11-23 11:59:01,869 INFO L273 TraceCheckUtils]: 5: Hoare triple {231#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);havoc ~a~0;~a~0 := 0; {233#(= main_~a~0 0)} is VALID [2018-11-23 11:59:01,872 INFO L273 TraceCheckUtils]: 6: Hoare triple {233#(= main_~a~0 0)} assume !(~a~0 < 100000); {232#false} is VALID [2018-11-23 11:59:01,872 INFO L273 TraceCheckUtils]: 7: Hoare triple {232#false} havoc ~i~0;~i~0 := 0; {232#false} is VALID [2018-11-23 11:59:01,872 INFO L273 TraceCheckUtils]: 8: Hoare triple {232#false} assume !(~i~0 < 100000); {232#false} is VALID [2018-11-23 11:59:01,873 INFO L273 TraceCheckUtils]: 9: Hoare triple {232#false} ~i~0 := 0; {232#false} is VALID [2018-11-23 11:59:01,873 INFO L273 TraceCheckUtils]: 10: Hoare triple {232#false} assume !(~i~0 < 100000); {232#false} is VALID [2018-11-23 11:59:01,873 INFO L273 TraceCheckUtils]: 11: Hoare triple {232#false} ~i~0 := 0; {232#false} is VALID [2018-11-23 11:59:01,874 INFO L273 TraceCheckUtils]: 12: Hoare triple {232#false} assume !(~i~0 < 100000); {232#false} is VALID [2018-11-23 11:59:01,874 INFO L273 TraceCheckUtils]: 13: Hoare triple {232#false} ~i~0 := 0; {232#false} is VALID [2018-11-23 11:59:01,874 INFO L273 TraceCheckUtils]: 14: Hoare triple {232#false} assume !(~i~0 < 100000); {232#false} is VALID [2018-11-23 11:59:01,874 INFO L273 TraceCheckUtils]: 15: Hoare triple {232#false} havoc ~x~0;~x~0 := 0; {232#false} is VALID [2018-11-23 11:59:01,875 INFO L273 TraceCheckUtils]: 16: Hoare triple {232#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {232#false} is VALID [2018-11-23 11:59:01,875 INFO L256 TraceCheckUtils]: 17: Hoare triple {232#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {232#false} is VALID [2018-11-23 11:59:01,875 INFO L273 TraceCheckUtils]: 18: Hoare triple {232#false} ~cond := #in~cond; {232#false} is VALID [2018-11-23 11:59:01,875 INFO L273 TraceCheckUtils]: 19: Hoare triple {232#false} assume 0 == ~cond; {232#false} is VALID [2018-11-23 11:59:01,876 INFO L273 TraceCheckUtils]: 20: Hoare triple {232#false} assume !false; {232#false} is VALID [2018-11-23 11:59:01,878 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:59:01,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:59:01,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:59:01,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 11:59:01,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:01,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:59:02,106 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:02,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:59:02,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:59:02,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:59:02,108 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 3 states. [2018-11-23 11:59:02,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:02,494 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-23 11:59:02,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:59:02,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 11:59:02,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:02,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:59:02,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-23 11:59:02,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:59:02,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-23 11:59:02,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2018-11-23 11:59:02,727 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:59:02,730 INFO L225 Difference]: With dead ends: 56 [2018-11-23 11:59:02,730 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 11:59:02,732 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:59:02,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 11:59:02,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-23 11:59:02,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:02,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 32 states. [2018-11-23 11:59:02,772 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 32 states. [2018-11-23 11:59:02,773 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 32 states. [2018-11-23 11:59:02,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:02,775 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-23 11:59:02,776 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-23 11:59:02,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:02,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:02,777 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states. [2018-11-23 11:59:02,777 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states. [2018-11-23 11:59:02,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:02,780 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-23 11:59:02,780 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-23 11:59:02,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:02,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:02,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:02,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:02,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:59:02,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-11-23 11:59:02,784 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 21 [2018-11-23 11:59:02,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:02,784 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-23 11:59:02,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:59:02,785 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-23 11:59:02,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:59:02,786 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:02,786 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:59:02,786 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:02,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:02,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1099948320, now seen corresponding path program 1 times [2018-11-23 11:59:02,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:02,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:02,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:02,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:02,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:02,915 INFO L256 TraceCheckUtils]: 0: Hoare triple {423#true} call ULTIMATE.init(); {423#true} is VALID [2018-11-23 11:59:02,915 INFO L273 TraceCheckUtils]: 1: Hoare triple {423#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {423#true} is VALID [2018-11-23 11:59:02,916 INFO L273 TraceCheckUtils]: 2: Hoare triple {423#true} assume true; {423#true} is VALID [2018-11-23 11:59:02,916 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {423#true} {423#true} #105#return; {423#true} is VALID [2018-11-23 11:59:02,916 INFO L256 TraceCheckUtils]: 4: Hoare triple {423#true} call #t~ret13 := main(); {423#true} is VALID [2018-11-23 11:59:02,917 INFO L273 TraceCheckUtils]: 5: Hoare triple {423#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);havoc ~a~0;~a~0 := 0; {423#true} is VALID [2018-11-23 11:59:02,917 INFO L273 TraceCheckUtils]: 6: Hoare triple {423#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; {423#true} is VALID [2018-11-23 11:59:02,918 INFO L273 TraceCheckUtils]: 7: Hoare triple {423#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {423#true} is VALID [2018-11-23 11:59:02,918 INFO L273 TraceCheckUtils]: 8: Hoare triple {423#true} assume !(~a~0 < 100000); {423#true} is VALID [2018-11-23 11:59:02,924 INFO L273 TraceCheckUtils]: 9: Hoare triple {423#true} havoc ~i~0;~i~0 := 0; {425#(= main_~i~0 0)} is VALID [2018-11-23 11:59:02,925 INFO L273 TraceCheckUtils]: 10: Hoare triple {425#(= main_~i~0 0)} assume !(~i~0 < 100000); {424#false} is VALID [2018-11-23 11:59:02,925 INFO L273 TraceCheckUtils]: 11: Hoare triple {424#false} ~i~0 := 0; {424#false} is VALID [2018-11-23 11:59:02,925 INFO L273 TraceCheckUtils]: 12: Hoare triple {424#false} assume !(~i~0 < 100000); {424#false} is VALID [2018-11-23 11:59:02,925 INFO L273 TraceCheckUtils]: 13: Hoare triple {424#false} ~i~0 := 0; {424#false} is VALID [2018-11-23 11:59:02,926 INFO L273 TraceCheckUtils]: 14: Hoare triple {424#false} assume !(~i~0 < 100000); {424#false} is VALID [2018-11-23 11:59:02,926 INFO L273 TraceCheckUtils]: 15: Hoare triple {424#false} ~i~0 := 0; {424#false} is VALID [2018-11-23 11:59:02,926 INFO L273 TraceCheckUtils]: 16: Hoare triple {424#false} assume !(~i~0 < 100000); {424#false} is VALID [2018-11-23 11:59:02,926 INFO L273 TraceCheckUtils]: 17: Hoare triple {424#false} havoc ~x~0;~x~0 := 0; {424#false} is VALID [2018-11-23 11:59:02,927 INFO L273 TraceCheckUtils]: 18: Hoare triple {424#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {424#false} is VALID [2018-11-23 11:59:02,927 INFO L256 TraceCheckUtils]: 19: Hoare triple {424#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {424#false} is VALID [2018-11-23 11:59:02,927 INFO L273 TraceCheckUtils]: 20: Hoare triple {424#false} ~cond := #in~cond; {424#false} is VALID [2018-11-23 11:59:02,928 INFO L273 TraceCheckUtils]: 21: Hoare triple {424#false} assume 0 == ~cond; {424#false} is VALID [2018-11-23 11:59:02,928 INFO L273 TraceCheckUtils]: 22: Hoare triple {424#false} assume !false; {424#false} is VALID [2018-11-23 11:59:02,929 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:59:02,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:59:02,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:59:02,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 11:59:02,931 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:02,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:59:02,971 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:59:02,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:59:02,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:59:02,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:59:02,972 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 3 states. [2018-11-23 11:59:03,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:03,218 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2018-11-23 11:59:03,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:59:03,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 11:59:03,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:03,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:59:03,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2018-11-23 11:59:03,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:59:03,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2018-11-23 11:59:03,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 71 transitions. [2018-11-23 11:59:03,416 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:03,422 INFO L225 Difference]: With dead ends: 60 [2018-11-23 11:59:03,422 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 11:59:03,423 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:59:03,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 11:59:03,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-11-23 11:59:03,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:03,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 36 states. [2018-11-23 11:59:03,451 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 36 states. [2018-11-23 11:59:03,451 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 36 states. [2018-11-23 11:59:03,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:03,454 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-11-23 11:59:03,454 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-23 11:59:03,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:03,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:03,456 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 40 states. [2018-11-23 11:59:03,456 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 40 states. [2018-11-23 11:59:03,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:03,459 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-11-23 11:59:03,459 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-23 11:59:03,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:03,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:03,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:03,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:03,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:59:03,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-11-23 11:59:03,463 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 23 [2018-11-23 11:59:03,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:03,463 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-23 11:59:03,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:59:03,463 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-11-23 11:59:03,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 11:59:03,464 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:03,465 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] [2018-11-23 11:59:03,465 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:03,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:03,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1986876888, now seen corresponding path program 1 times [2018-11-23 11:59:03,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:03,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:03,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:03,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:03,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:03,583 INFO L256 TraceCheckUtils]: 0: Hoare triple {644#true} call ULTIMATE.init(); {644#true} is VALID [2018-11-23 11:59:03,583 INFO L273 TraceCheckUtils]: 1: Hoare triple {644#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {644#true} is VALID [2018-11-23 11:59:03,584 INFO L273 TraceCheckUtils]: 2: Hoare triple {644#true} assume true; {644#true} is VALID [2018-11-23 11:59:03,584 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {644#true} {644#true} #105#return; {644#true} is VALID [2018-11-23 11:59:03,585 INFO L256 TraceCheckUtils]: 4: Hoare triple {644#true} call #t~ret13 := main(); {644#true} is VALID [2018-11-23 11:59:03,585 INFO L273 TraceCheckUtils]: 5: Hoare triple {644#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);havoc ~a~0;~a~0 := 0; {646#(= main_~a~0 0)} is VALID [2018-11-23 11:59:03,589 INFO L273 TraceCheckUtils]: 6: Hoare triple {646#(= 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; {646#(= main_~a~0 0)} is VALID [2018-11-23 11:59:03,589 INFO L273 TraceCheckUtils]: 7: Hoare triple {646#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {647#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:03,590 INFO L273 TraceCheckUtils]: 8: Hoare triple {647#(<= main_~a~0 1)} assume !(~a~0 < 100000); {645#false} is VALID [2018-11-23 11:59:03,590 INFO L273 TraceCheckUtils]: 9: Hoare triple {645#false} havoc ~i~0;~i~0 := 0; {645#false} is VALID [2018-11-23 11:59:03,590 INFO L273 TraceCheckUtils]: 10: Hoare triple {645#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {645#false} is VALID [2018-11-23 11:59:03,591 INFO L273 TraceCheckUtils]: 11: Hoare triple {645#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {645#false} is VALID [2018-11-23 11:59:03,591 INFO L273 TraceCheckUtils]: 12: Hoare triple {645#false} assume !(~i~0 < 100000); {645#false} is VALID [2018-11-23 11:59:03,591 INFO L273 TraceCheckUtils]: 13: Hoare triple {645#false} ~i~0 := 0; {645#false} is VALID [2018-11-23 11:59:03,591 INFO L273 TraceCheckUtils]: 14: Hoare triple {645#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {645#false} is VALID [2018-11-23 11:59:03,592 INFO L273 TraceCheckUtils]: 15: Hoare triple {645#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {645#false} is VALID [2018-11-23 11:59:03,592 INFO L273 TraceCheckUtils]: 16: Hoare triple {645#false} assume !(~i~0 < 100000); {645#false} is VALID [2018-11-23 11:59:03,592 INFO L273 TraceCheckUtils]: 17: Hoare triple {645#false} ~i~0 := 0; {645#false} is VALID [2018-11-23 11:59:03,592 INFO L273 TraceCheckUtils]: 18: Hoare triple {645#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {645#false} is VALID [2018-11-23 11:59:03,593 INFO L273 TraceCheckUtils]: 19: Hoare triple {645#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {645#false} is VALID [2018-11-23 11:59:03,593 INFO L273 TraceCheckUtils]: 20: Hoare triple {645#false} assume !(~i~0 < 100000); {645#false} is VALID [2018-11-23 11:59:03,593 INFO L273 TraceCheckUtils]: 21: Hoare triple {645#false} ~i~0 := 0; {645#false} is VALID [2018-11-23 11:59:03,593 INFO L273 TraceCheckUtils]: 22: Hoare triple {645#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {645#false} is VALID [2018-11-23 11:59:03,594 INFO L273 TraceCheckUtils]: 23: Hoare triple {645#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {645#false} is VALID [2018-11-23 11:59:03,594 INFO L273 TraceCheckUtils]: 24: Hoare triple {645#false} assume !(~i~0 < 100000); {645#false} is VALID [2018-11-23 11:59:03,595 INFO L273 TraceCheckUtils]: 25: Hoare triple {645#false} havoc ~x~0;~x~0 := 0; {645#false} is VALID [2018-11-23 11:59:03,595 INFO L273 TraceCheckUtils]: 26: Hoare triple {645#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {645#false} is VALID [2018-11-23 11:59:03,595 INFO L256 TraceCheckUtils]: 27: Hoare triple {645#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {645#false} is VALID [2018-11-23 11:59:03,595 INFO L273 TraceCheckUtils]: 28: Hoare triple {645#false} ~cond := #in~cond; {645#false} is VALID [2018-11-23 11:59:03,596 INFO L273 TraceCheckUtils]: 29: Hoare triple {645#false} assume 0 == ~cond; {645#false} is VALID [2018-11-23 11:59:03,596 INFO L273 TraceCheckUtils]: 30: Hoare triple {645#false} assume !false; {645#false} is VALID [2018-11-23 11:59:03,598 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:59:03,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:03,598 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:59:03,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:03,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:03,962 INFO L256 TraceCheckUtils]: 0: Hoare triple {644#true} call ULTIMATE.init(); {644#true} is VALID [2018-11-23 11:59:03,963 INFO L273 TraceCheckUtils]: 1: Hoare triple {644#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {644#true} is VALID [2018-11-23 11:59:03,963 INFO L273 TraceCheckUtils]: 2: Hoare triple {644#true} assume true; {644#true} is VALID [2018-11-23 11:59:03,963 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {644#true} {644#true} #105#return; {644#true} is VALID [2018-11-23 11:59:03,964 INFO L256 TraceCheckUtils]: 4: Hoare triple {644#true} call #t~ret13 := main(); {644#true} is VALID [2018-11-23 11:59:03,965 INFO L273 TraceCheckUtils]: 5: Hoare triple {644#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);havoc ~a~0;~a~0 := 0; {666#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:03,965 INFO L273 TraceCheckUtils]: 6: Hoare triple {666#(<= 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; {666#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:03,966 INFO L273 TraceCheckUtils]: 7: Hoare triple {666#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {647#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:03,967 INFO L273 TraceCheckUtils]: 8: Hoare triple {647#(<= main_~a~0 1)} assume !(~a~0 < 100000); {645#false} is VALID [2018-11-23 11:59:03,967 INFO L273 TraceCheckUtils]: 9: Hoare triple {645#false} havoc ~i~0;~i~0 := 0; {645#false} is VALID [2018-11-23 11:59:03,967 INFO L273 TraceCheckUtils]: 10: Hoare triple {645#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {645#false} is VALID [2018-11-23 11:59:03,968 INFO L273 TraceCheckUtils]: 11: Hoare triple {645#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {645#false} is VALID [2018-11-23 11:59:03,968 INFO L273 TraceCheckUtils]: 12: Hoare triple {645#false} assume !(~i~0 < 100000); {645#false} is VALID [2018-11-23 11:59:03,969 INFO L273 TraceCheckUtils]: 13: Hoare triple {645#false} ~i~0 := 0; {645#false} is VALID [2018-11-23 11:59:03,969 INFO L273 TraceCheckUtils]: 14: Hoare triple {645#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {645#false} is VALID [2018-11-23 11:59:03,970 INFO L273 TraceCheckUtils]: 15: Hoare triple {645#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {645#false} is VALID [2018-11-23 11:59:03,970 INFO L273 TraceCheckUtils]: 16: Hoare triple {645#false} assume !(~i~0 < 100000); {645#false} is VALID [2018-11-23 11:59:03,970 INFO L273 TraceCheckUtils]: 17: Hoare triple {645#false} ~i~0 := 0; {645#false} is VALID [2018-11-23 11:59:03,970 INFO L273 TraceCheckUtils]: 18: Hoare triple {645#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {645#false} is VALID [2018-11-23 11:59:03,971 INFO L273 TraceCheckUtils]: 19: Hoare triple {645#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {645#false} is VALID [2018-11-23 11:59:03,971 INFO L273 TraceCheckUtils]: 20: Hoare triple {645#false} assume !(~i~0 < 100000); {645#false} is VALID [2018-11-23 11:59:03,971 INFO L273 TraceCheckUtils]: 21: Hoare triple {645#false} ~i~0 := 0; {645#false} is VALID [2018-11-23 11:59:03,972 INFO L273 TraceCheckUtils]: 22: Hoare triple {645#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {645#false} is VALID [2018-11-23 11:59:03,972 INFO L273 TraceCheckUtils]: 23: Hoare triple {645#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {645#false} is VALID [2018-11-23 11:59:03,972 INFO L273 TraceCheckUtils]: 24: Hoare triple {645#false} assume !(~i~0 < 100000); {645#false} is VALID [2018-11-23 11:59:03,972 INFO L273 TraceCheckUtils]: 25: Hoare triple {645#false} havoc ~x~0;~x~0 := 0; {645#false} is VALID [2018-11-23 11:59:03,973 INFO L273 TraceCheckUtils]: 26: Hoare triple {645#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {645#false} is VALID [2018-11-23 11:59:03,973 INFO L256 TraceCheckUtils]: 27: Hoare triple {645#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {645#false} is VALID [2018-11-23 11:59:03,973 INFO L273 TraceCheckUtils]: 28: Hoare triple {645#false} ~cond := #in~cond; {645#false} is VALID [2018-11-23 11:59:03,974 INFO L273 TraceCheckUtils]: 29: Hoare triple {645#false} assume 0 == ~cond; {645#false} is VALID [2018-11-23 11:59:03,974 INFO L273 TraceCheckUtils]: 30: Hoare triple {645#false} assume !false; {645#false} is VALID [2018-11-23 11:59:03,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:59:03,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:03,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 11:59:03,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-23 11:59:03,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:03,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:59:04,106 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:04,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:59:04,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:59:04,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:59:04,108 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 5 states. [2018-11-23 11:59:04,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:04,278 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2018-11-23 11:59:04,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:59:04,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-23 11:59:04,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:04,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:59:04,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2018-11-23 11:59:04,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:59:04,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2018-11-23 11:59:04,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 68 transitions. [2018-11-23 11:59:04,487 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:04,489 INFO L225 Difference]: With dead ends: 66 [2018-11-23 11:59:04,489 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 11:59:04,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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:59:04,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 11:59:04,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-23 11:59:04,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:04,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 38 states. [2018-11-23 11:59:04,530 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 38 states. [2018-11-23 11:59:04,530 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 38 states. [2018-11-23 11:59:04,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:04,534 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-23 11:59:04,534 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-23 11:59:04,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:04,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:04,535 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 39 states. [2018-11-23 11:59:04,535 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 39 states. [2018-11-23 11:59:04,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:04,537 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-23 11:59:04,538 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-23 11:59:04,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:04,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:04,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:04,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:04,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:59:04,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-11-23 11:59:04,541 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 31 [2018-11-23 11:59:04,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:04,541 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-23 11:59:04,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:59:04,542 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-23 11:59:04,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 11:59:04,543 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:04,543 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] [2018-11-23 11:59:04,543 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:04,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:04,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1213402486, now seen corresponding path program 2 times [2018-11-23 11:59:04,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:04,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:04,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:04,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:04,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:04,650 INFO L256 TraceCheckUtils]: 0: Hoare triple {970#true} call ULTIMATE.init(); {970#true} is VALID [2018-11-23 11:59:04,651 INFO L273 TraceCheckUtils]: 1: Hoare triple {970#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {970#true} is VALID [2018-11-23 11:59:04,652 INFO L273 TraceCheckUtils]: 2: Hoare triple {970#true} assume true; {970#true} is VALID [2018-11-23 11:59:04,652 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {970#true} {970#true} #105#return; {970#true} is VALID [2018-11-23 11:59:04,653 INFO L256 TraceCheckUtils]: 4: Hoare triple {970#true} call #t~ret13 := main(); {970#true} is VALID [2018-11-23 11:59:04,660 INFO L273 TraceCheckUtils]: 5: Hoare triple {970#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);havoc ~a~0;~a~0 := 0; {972#(= main_~a~0 0)} is VALID [2018-11-23 11:59:04,660 INFO L273 TraceCheckUtils]: 6: Hoare triple {972#(= 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; {972#(= main_~a~0 0)} is VALID [2018-11-23 11:59:04,661 INFO L273 TraceCheckUtils]: 7: Hoare triple {972#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {973#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:04,661 INFO L273 TraceCheckUtils]: 8: Hoare triple {973#(<= 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; {973#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:04,662 INFO L273 TraceCheckUtils]: 9: Hoare triple {973#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {974#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:04,663 INFO L273 TraceCheckUtils]: 10: Hoare triple {974#(<= main_~a~0 2)} assume !(~a~0 < 100000); {971#false} is VALID [2018-11-23 11:59:04,663 INFO L273 TraceCheckUtils]: 11: Hoare triple {971#false} havoc ~i~0;~i~0 := 0; {971#false} is VALID [2018-11-23 11:59:04,663 INFO L273 TraceCheckUtils]: 12: Hoare triple {971#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {971#false} is VALID [2018-11-23 11:59:04,663 INFO L273 TraceCheckUtils]: 13: Hoare triple {971#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {971#false} is VALID [2018-11-23 11:59:04,663 INFO L273 TraceCheckUtils]: 14: Hoare triple {971#false} assume !(~i~0 < 100000); {971#false} is VALID [2018-11-23 11:59:04,664 INFO L273 TraceCheckUtils]: 15: Hoare triple {971#false} ~i~0 := 0; {971#false} is VALID [2018-11-23 11:59:04,664 INFO L273 TraceCheckUtils]: 16: Hoare triple {971#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {971#false} is VALID [2018-11-23 11:59:04,664 INFO L273 TraceCheckUtils]: 17: Hoare triple {971#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {971#false} is VALID [2018-11-23 11:59:04,664 INFO L273 TraceCheckUtils]: 18: Hoare triple {971#false} assume !(~i~0 < 100000); {971#false} is VALID [2018-11-23 11:59:04,665 INFO L273 TraceCheckUtils]: 19: Hoare triple {971#false} ~i~0 := 0; {971#false} is VALID [2018-11-23 11:59:04,665 INFO L273 TraceCheckUtils]: 20: Hoare triple {971#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {971#false} is VALID [2018-11-23 11:59:04,665 INFO L273 TraceCheckUtils]: 21: Hoare triple {971#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {971#false} is VALID [2018-11-23 11:59:04,666 INFO L273 TraceCheckUtils]: 22: Hoare triple {971#false} assume !(~i~0 < 100000); {971#false} is VALID [2018-11-23 11:59:04,666 INFO L273 TraceCheckUtils]: 23: Hoare triple {971#false} ~i~0 := 0; {971#false} is VALID [2018-11-23 11:59:04,667 INFO L273 TraceCheckUtils]: 24: Hoare triple {971#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {971#false} is VALID [2018-11-23 11:59:04,667 INFO L273 TraceCheckUtils]: 25: Hoare triple {971#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {971#false} is VALID [2018-11-23 11:59:04,668 INFO L273 TraceCheckUtils]: 26: Hoare triple {971#false} assume !(~i~0 < 100000); {971#false} is VALID [2018-11-23 11:59:04,668 INFO L273 TraceCheckUtils]: 27: Hoare triple {971#false} havoc ~x~0;~x~0 := 0; {971#false} is VALID [2018-11-23 11:59:04,668 INFO L273 TraceCheckUtils]: 28: Hoare triple {971#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {971#false} is VALID [2018-11-23 11:59:04,668 INFO L256 TraceCheckUtils]: 29: Hoare triple {971#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {971#false} is VALID [2018-11-23 11:59:04,669 INFO L273 TraceCheckUtils]: 30: Hoare triple {971#false} ~cond := #in~cond; {971#false} is VALID [2018-11-23 11:59:04,669 INFO L273 TraceCheckUtils]: 31: Hoare triple {971#false} assume 0 == ~cond; {971#false} is VALID [2018-11-23 11:59:04,669 INFO L273 TraceCheckUtils]: 32: Hoare triple {971#false} assume !false; {971#false} is VALID [2018-11-23 11:59:04,671 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:59:04,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:04,671 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:59:04,683 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:59:04,712 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:59:04,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:04,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:04,868 INFO L256 TraceCheckUtils]: 0: Hoare triple {970#true} call ULTIMATE.init(); {970#true} is VALID [2018-11-23 11:59:04,868 INFO L273 TraceCheckUtils]: 1: Hoare triple {970#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {970#true} is VALID [2018-11-23 11:59:04,869 INFO L273 TraceCheckUtils]: 2: Hoare triple {970#true} assume true; {970#true} is VALID [2018-11-23 11:59:04,869 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {970#true} {970#true} #105#return; {970#true} is VALID [2018-11-23 11:59:04,870 INFO L256 TraceCheckUtils]: 4: Hoare triple {970#true} call #t~ret13 := main(); {970#true} is VALID [2018-11-23 11:59:04,870 INFO L273 TraceCheckUtils]: 5: Hoare triple {970#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);havoc ~a~0;~a~0 := 0; {970#true} is VALID [2018-11-23 11:59:04,870 INFO L273 TraceCheckUtils]: 6: Hoare triple {970#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; {970#true} is VALID [2018-11-23 11:59:04,871 INFO L273 TraceCheckUtils]: 7: Hoare triple {970#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {970#true} is VALID [2018-11-23 11:59:04,871 INFO L273 TraceCheckUtils]: 8: Hoare triple {970#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; {970#true} is VALID [2018-11-23 11:59:04,871 INFO L273 TraceCheckUtils]: 9: Hoare triple {970#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {970#true} is VALID [2018-11-23 11:59:04,872 INFO L273 TraceCheckUtils]: 10: Hoare triple {970#true} assume !(~a~0 < 100000); {970#true} is VALID [2018-11-23 11:59:04,872 INFO L273 TraceCheckUtils]: 11: Hoare triple {970#true} havoc ~i~0;~i~0 := 0; {970#true} is VALID [2018-11-23 11:59:04,872 INFO L273 TraceCheckUtils]: 12: Hoare triple {970#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {970#true} is VALID [2018-11-23 11:59:04,873 INFO L273 TraceCheckUtils]: 13: Hoare triple {970#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {970#true} is VALID [2018-11-23 11:59:04,873 INFO L273 TraceCheckUtils]: 14: Hoare triple {970#true} assume !(~i~0 < 100000); {970#true} is VALID [2018-11-23 11:59:04,885 INFO L273 TraceCheckUtils]: 15: Hoare triple {970#true} ~i~0 := 0; {1023#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:04,886 INFO L273 TraceCheckUtils]: 16: Hoare triple {1023#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1023#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:04,887 INFO L273 TraceCheckUtils]: 17: Hoare triple {1023#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1030#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:04,889 INFO L273 TraceCheckUtils]: 18: Hoare triple {1030#(<= main_~i~0 1)} assume !(~i~0 < 100000); {971#false} is VALID [2018-11-23 11:59:04,889 INFO L273 TraceCheckUtils]: 19: Hoare triple {971#false} ~i~0 := 0; {971#false} is VALID [2018-11-23 11:59:04,889 INFO L273 TraceCheckUtils]: 20: Hoare triple {971#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {971#false} is VALID [2018-11-23 11:59:04,889 INFO L273 TraceCheckUtils]: 21: Hoare triple {971#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {971#false} is VALID [2018-11-23 11:59:04,890 INFO L273 TraceCheckUtils]: 22: Hoare triple {971#false} assume !(~i~0 < 100000); {971#false} is VALID [2018-11-23 11:59:04,890 INFO L273 TraceCheckUtils]: 23: Hoare triple {971#false} ~i~0 := 0; {971#false} is VALID [2018-11-23 11:59:04,890 INFO L273 TraceCheckUtils]: 24: Hoare triple {971#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {971#false} is VALID [2018-11-23 11:59:04,890 INFO L273 TraceCheckUtils]: 25: Hoare triple {971#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {971#false} is VALID [2018-11-23 11:59:04,891 INFO L273 TraceCheckUtils]: 26: Hoare triple {971#false} assume !(~i~0 < 100000); {971#false} is VALID [2018-11-23 11:59:04,891 INFO L273 TraceCheckUtils]: 27: Hoare triple {971#false} havoc ~x~0;~x~0 := 0; {971#false} is VALID [2018-11-23 11:59:04,891 INFO L273 TraceCheckUtils]: 28: Hoare triple {971#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {971#false} is VALID [2018-11-23 11:59:04,892 INFO L256 TraceCheckUtils]: 29: Hoare triple {971#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {971#false} is VALID [2018-11-23 11:59:04,892 INFO L273 TraceCheckUtils]: 30: Hoare triple {971#false} ~cond := #in~cond; {971#false} is VALID [2018-11-23 11:59:04,892 INFO L273 TraceCheckUtils]: 31: Hoare triple {971#false} assume 0 == ~cond; {971#false} is VALID [2018-11-23 11:59:04,893 INFO L273 TraceCheckUtils]: 32: Hoare triple {971#false} assume !false; {971#false} is VALID [2018-11-23 11:59:04,895 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 11:59:04,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:04,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-11-23 11:59:04,914 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-11-23 11:59:04,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:04,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:59:04,968 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:04,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:59:04,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:59:04,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:59:04,969 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 7 states. [2018-11-23 11:59:05,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:05,391 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2018-11-23 11:59:05,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:59:05,391 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-11-23 11:59:05,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:05,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:59:05,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2018-11-23 11:59:05,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:59:05,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2018-11-23 11:59:05,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 90 transitions. [2018-11-23 11:59:05,589 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:59:05,591 INFO L225 Difference]: With dead ends: 80 [2018-11-23 11:59:05,592 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 11:59:05,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:59:05,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 11:59:05,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2018-11-23 11:59:05,639 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:05,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 48 states. [2018-11-23 11:59:05,639 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 48 states. [2018-11-23 11:59:05,640 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 48 states. [2018-11-23 11:59:05,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:05,642 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-11-23 11:59:05,642 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-11-23 11:59:05,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:05,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:05,644 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 53 states. [2018-11-23 11:59:05,644 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 53 states. [2018-11-23 11:59:05,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:05,646 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-11-23 11:59:05,647 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-11-23 11:59:05,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:05,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:05,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:05,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:05,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:59:05,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-11-23 11:59:05,650 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 33 [2018-11-23 11:59:05,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:05,651 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-11-23 11:59:05,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:59:05,651 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-11-23 11:59:05,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 11:59:05,652 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:05,652 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-11-23 11:59:05,653 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:05,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:05,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1157629812, now seen corresponding path program 3 times [2018-11-23 11:59:05,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:05,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:05,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:05,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:05,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:05,797 INFO L256 TraceCheckUtils]: 0: Hoare triple {1366#true} call ULTIMATE.init(); {1366#true} is VALID [2018-11-23 11:59:05,798 INFO L273 TraceCheckUtils]: 1: Hoare triple {1366#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1366#true} is VALID [2018-11-23 11:59:05,798 INFO L273 TraceCheckUtils]: 2: Hoare triple {1366#true} assume true; {1366#true} is VALID [2018-11-23 11:59:05,798 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1366#true} {1366#true} #105#return; {1366#true} is VALID [2018-11-23 11:59:05,798 INFO L256 TraceCheckUtils]: 4: Hoare triple {1366#true} call #t~ret13 := main(); {1366#true} is VALID [2018-11-23 11:59:05,799 INFO L273 TraceCheckUtils]: 5: Hoare triple {1366#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);havoc ~a~0;~a~0 := 0; {1368#(= main_~a~0 0)} is VALID [2018-11-23 11:59:05,799 INFO L273 TraceCheckUtils]: 6: Hoare triple {1368#(= 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; {1368#(= main_~a~0 0)} is VALID [2018-11-23 11:59:05,800 INFO L273 TraceCheckUtils]: 7: Hoare triple {1368#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1369#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:05,800 INFO L273 TraceCheckUtils]: 8: Hoare triple {1369#(<= 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; {1369#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:05,801 INFO L273 TraceCheckUtils]: 9: Hoare triple {1369#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1370#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:05,801 INFO L273 TraceCheckUtils]: 10: Hoare triple {1370#(<= 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; {1370#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:05,808 INFO L273 TraceCheckUtils]: 11: Hoare triple {1370#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1371#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:05,808 INFO L273 TraceCheckUtils]: 12: Hoare triple {1371#(<= main_~a~0 3)} assume !(~a~0 < 100000); {1367#false} is VALID [2018-11-23 11:59:05,809 INFO L273 TraceCheckUtils]: 13: Hoare triple {1367#false} havoc ~i~0;~i~0 := 0; {1367#false} is VALID [2018-11-23 11:59:05,809 INFO L273 TraceCheckUtils]: 14: Hoare triple {1367#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1367#false} is VALID [2018-11-23 11:59:05,809 INFO L273 TraceCheckUtils]: 15: Hoare triple {1367#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1367#false} is VALID [2018-11-23 11:59:05,809 INFO L273 TraceCheckUtils]: 16: Hoare triple {1367#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1367#false} is VALID [2018-11-23 11:59:05,810 INFO L273 TraceCheckUtils]: 17: Hoare triple {1367#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1367#false} is VALID [2018-11-23 11:59:05,810 INFO L273 TraceCheckUtils]: 18: Hoare triple {1367#false} assume !(~i~0 < 100000); {1367#false} is VALID [2018-11-23 11:59:05,810 INFO L273 TraceCheckUtils]: 19: Hoare triple {1367#false} ~i~0 := 0; {1367#false} is VALID [2018-11-23 11:59:05,810 INFO L273 TraceCheckUtils]: 20: Hoare triple {1367#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1367#false} is VALID [2018-11-23 11:59:05,811 INFO L273 TraceCheckUtils]: 21: Hoare triple {1367#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1367#false} is VALID [2018-11-23 11:59:05,811 INFO L273 TraceCheckUtils]: 22: Hoare triple {1367#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1367#false} is VALID [2018-11-23 11:59:05,811 INFO L273 TraceCheckUtils]: 23: Hoare triple {1367#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1367#false} is VALID [2018-11-23 11:59:05,812 INFO L273 TraceCheckUtils]: 24: Hoare triple {1367#false} assume !(~i~0 < 100000); {1367#false} is VALID [2018-11-23 11:59:05,812 INFO L273 TraceCheckUtils]: 25: Hoare triple {1367#false} ~i~0 := 0; {1367#false} is VALID [2018-11-23 11:59:05,812 INFO L273 TraceCheckUtils]: 26: Hoare triple {1367#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {1367#false} is VALID [2018-11-23 11:59:05,812 INFO L273 TraceCheckUtils]: 27: Hoare triple {1367#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1367#false} is VALID [2018-11-23 11:59:05,813 INFO L273 TraceCheckUtils]: 28: Hoare triple {1367#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {1367#false} is VALID [2018-11-23 11:59:05,813 INFO L273 TraceCheckUtils]: 29: Hoare triple {1367#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1367#false} is VALID [2018-11-23 11:59:05,813 INFO L273 TraceCheckUtils]: 30: Hoare triple {1367#false} assume !(~i~0 < 100000); {1367#false} is VALID [2018-11-23 11:59:05,814 INFO L273 TraceCheckUtils]: 31: Hoare triple {1367#false} ~i~0 := 0; {1367#false} is VALID [2018-11-23 11:59:05,814 INFO L273 TraceCheckUtils]: 32: Hoare triple {1367#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {1367#false} is VALID [2018-11-23 11:59:05,814 INFO L273 TraceCheckUtils]: 33: Hoare triple {1367#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1367#false} is VALID [2018-11-23 11:59:05,814 INFO L273 TraceCheckUtils]: 34: Hoare triple {1367#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {1367#false} is VALID [2018-11-23 11:59:05,815 INFO L273 TraceCheckUtils]: 35: Hoare triple {1367#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1367#false} is VALID [2018-11-23 11:59:05,815 INFO L273 TraceCheckUtils]: 36: Hoare triple {1367#false} assume !(~i~0 < 100000); {1367#false} is VALID [2018-11-23 11:59:05,815 INFO L273 TraceCheckUtils]: 37: Hoare triple {1367#false} havoc ~x~0;~x~0 := 0; {1367#false} is VALID [2018-11-23 11:59:05,815 INFO L273 TraceCheckUtils]: 38: Hoare triple {1367#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {1367#false} is VALID [2018-11-23 11:59:05,816 INFO L256 TraceCheckUtils]: 39: Hoare triple {1367#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {1367#false} is VALID [2018-11-23 11:59:05,816 INFO L273 TraceCheckUtils]: 40: Hoare triple {1367#false} ~cond := #in~cond; {1367#false} is VALID [2018-11-23 11:59:05,816 INFO L273 TraceCheckUtils]: 41: Hoare triple {1367#false} assume 0 == ~cond; {1367#false} is VALID [2018-11-23 11:59:05,817 INFO L273 TraceCheckUtils]: 42: Hoare triple {1367#false} assume !false; {1367#false} is VALID [2018-11-23 11:59:05,819 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 11:59:05,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:05,820 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:59:05,837 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:59:05,883 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:59:05,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:05,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:06,036 INFO L256 TraceCheckUtils]: 0: Hoare triple {1366#true} call ULTIMATE.init(); {1366#true} is VALID [2018-11-23 11:59:06,036 INFO L273 TraceCheckUtils]: 1: Hoare triple {1366#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1366#true} is VALID [2018-11-23 11:59:06,036 INFO L273 TraceCheckUtils]: 2: Hoare triple {1366#true} assume true; {1366#true} is VALID [2018-11-23 11:59:06,037 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1366#true} {1366#true} #105#return; {1366#true} is VALID [2018-11-23 11:59:06,037 INFO L256 TraceCheckUtils]: 4: Hoare triple {1366#true} call #t~ret13 := main(); {1366#true} is VALID [2018-11-23 11:59:06,037 INFO L273 TraceCheckUtils]: 5: Hoare triple {1366#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);havoc ~a~0;~a~0 := 0; {1366#true} is VALID [2018-11-23 11:59:06,037 INFO L273 TraceCheckUtils]: 6: Hoare triple {1366#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; {1366#true} is VALID [2018-11-23 11:59:06,038 INFO L273 TraceCheckUtils]: 7: Hoare triple {1366#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1366#true} is VALID [2018-11-23 11:59:06,038 INFO L273 TraceCheckUtils]: 8: Hoare triple {1366#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; {1366#true} is VALID [2018-11-23 11:59:06,038 INFO L273 TraceCheckUtils]: 9: Hoare triple {1366#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1366#true} is VALID [2018-11-23 11:59:06,038 INFO L273 TraceCheckUtils]: 10: Hoare triple {1366#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; {1366#true} is VALID [2018-11-23 11:59:06,038 INFO L273 TraceCheckUtils]: 11: Hoare triple {1366#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1366#true} is VALID [2018-11-23 11:59:06,039 INFO L273 TraceCheckUtils]: 12: Hoare triple {1366#true} assume !(~a~0 < 100000); {1366#true} is VALID [2018-11-23 11:59:06,039 INFO L273 TraceCheckUtils]: 13: Hoare triple {1366#true} havoc ~i~0;~i~0 := 0; {1366#true} is VALID [2018-11-23 11:59:06,039 INFO L273 TraceCheckUtils]: 14: Hoare triple {1366#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1366#true} is VALID [2018-11-23 11:59:06,039 INFO L273 TraceCheckUtils]: 15: Hoare triple {1366#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1366#true} is VALID [2018-11-23 11:59:06,039 INFO L273 TraceCheckUtils]: 16: Hoare triple {1366#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1366#true} is VALID [2018-11-23 11:59:06,040 INFO L273 TraceCheckUtils]: 17: Hoare triple {1366#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1366#true} is VALID [2018-11-23 11:59:06,040 INFO L273 TraceCheckUtils]: 18: Hoare triple {1366#true} assume !(~i~0 < 100000); {1366#true} is VALID [2018-11-23 11:59:06,040 INFO L273 TraceCheckUtils]: 19: Hoare triple {1366#true} ~i~0 := 0; {1366#true} is VALID [2018-11-23 11:59:06,040 INFO L273 TraceCheckUtils]: 20: Hoare triple {1366#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1366#true} is VALID [2018-11-23 11:59:06,041 INFO L273 TraceCheckUtils]: 21: Hoare triple {1366#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1366#true} is VALID [2018-11-23 11:59:06,041 INFO L273 TraceCheckUtils]: 22: Hoare triple {1366#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1366#true} is VALID [2018-11-23 11:59:06,041 INFO L273 TraceCheckUtils]: 23: Hoare triple {1366#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1366#true} is VALID [2018-11-23 11:59:06,042 INFO L273 TraceCheckUtils]: 24: Hoare triple {1366#true} assume !(~i~0 < 100000); {1366#true} is VALID [2018-11-23 11:59:06,042 INFO L273 TraceCheckUtils]: 25: Hoare triple {1366#true} ~i~0 := 0; {1366#true} is VALID [2018-11-23 11:59:06,042 INFO L273 TraceCheckUtils]: 26: Hoare triple {1366#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {1366#true} is VALID [2018-11-23 11:59:06,042 INFO L273 TraceCheckUtils]: 27: Hoare triple {1366#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1366#true} is VALID [2018-11-23 11:59:06,042 INFO L273 TraceCheckUtils]: 28: Hoare triple {1366#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {1366#true} is VALID [2018-11-23 11:59:06,043 INFO L273 TraceCheckUtils]: 29: Hoare triple {1366#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1366#true} is VALID [2018-11-23 11:59:06,043 INFO L273 TraceCheckUtils]: 30: Hoare triple {1366#true} assume !(~i~0 < 100000); {1366#true} is VALID [2018-11-23 11:59:06,046 INFO L273 TraceCheckUtils]: 31: Hoare triple {1366#true} ~i~0 := 0; {1468#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:06,046 INFO L273 TraceCheckUtils]: 32: Hoare triple {1468#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {1468#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:06,048 INFO L273 TraceCheckUtils]: 33: Hoare triple {1468#(<= main_~i~0 0)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1475#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:06,048 INFO L273 TraceCheckUtils]: 34: Hoare triple {1475#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {1475#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:06,049 INFO L273 TraceCheckUtils]: 35: Hoare triple {1475#(<= main_~i~0 1)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1482#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:06,050 INFO L273 TraceCheckUtils]: 36: Hoare triple {1482#(<= main_~i~0 2)} assume !(~i~0 < 100000); {1367#false} is VALID [2018-11-23 11:59:06,050 INFO L273 TraceCheckUtils]: 37: Hoare triple {1367#false} havoc ~x~0;~x~0 := 0; {1367#false} is VALID [2018-11-23 11:59:06,050 INFO L273 TraceCheckUtils]: 38: Hoare triple {1367#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {1367#false} is VALID [2018-11-23 11:59:06,051 INFO L256 TraceCheckUtils]: 39: Hoare triple {1367#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {1367#false} is VALID [2018-11-23 11:59:06,051 INFO L273 TraceCheckUtils]: 40: Hoare triple {1367#false} ~cond := #in~cond; {1367#false} is VALID [2018-11-23 11:59:06,051 INFO L273 TraceCheckUtils]: 41: Hoare triple {1367#false} assume 0 == ~cond; {1367#false} is VALID [2018-11-23 11:59:06,052 INFO L273 TraceCheckUtils]: 42: Hoare triple {1367#false} assume !false; {1367#false} is VALID [2018-11-23 11:59:06,055 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 11:59:06,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:06,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-11-23 11:59:06,084 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-11-23 11:59:06,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:06,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:59:06,152 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:59:06,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:59:06,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:59:06,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:59:06,154 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 9 states. [2018-11-23 11:59:06,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:06,788 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2018-11-23 11:59:06,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:59:06,789 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-11-23 11:59:06,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:06,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:59:06,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2018-11-23 11:59:06,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:59:06,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2018-11-23 11:59:06,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 100 transitions. [2018-11-23 11:59:07,076 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:59:07,079 INFO L225 Difference]: With dead ends: 98 [2018-11-23 11:59:07,079 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 11:59:07,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:59:07,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 11:59:07,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 58. [2018-11-23 11:59:07,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:07,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 58 states. [2018-11-23 11:59:07,121 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 58 states. [2018-11-23 11:59:07,121 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 58 states. [2018-11-23 11:59:07,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:07,123 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-11-23 11:59:07,123 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-11-23 11:59:07,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:07,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:07,123 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 63 states. [2018-11-23 11:59:07,124 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 63 states. [2018-11-23 11:59:07,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:07,126 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-11-23 11:59:07,126 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-11-23 11:59:07,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:07,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:07,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:07,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:07,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 11:59:07,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2018-11-23 11:59:07,129 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 43 [2018-11-23 11:59:07,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:07,129 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2018-11-23 11:59:07,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:59:07,130 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2018-11-23 11:59:07,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 11:59:07,131 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:07,131 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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] [2018-11-23 11:59:07,131 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:07,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:07,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1571995614, now seen corresponding path program 4 times [2018-11-23 11:59:07,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:07,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:07,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:07,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:07,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:07,276 INFO L256 TraceCheckUtils]: 0: Hoare triple {1856#true} call ULTIMATE.init(); {1856#true} is VALID [2018-11-23 11:59:07,276 INFO L273 TraceCheckUtils]: 1: Hoare triple {1856#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1856#true} is VALID [2018-11-23 11:59:07,276 INFO L273 TraceCheckUtils]: 2: Hoare triple {1856#true} assume true; {1856#true} is VALID [2018-11-23 11:59:07,276 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1856#true} {1856#true} #105#return; {1856#true} is VALID [2018-11-23 11:59:07,277 INFO L256 TraceCheckUtils]: 4: Hoare triple {1856#true} call #t~ret13 := main(); {1856#true} is VALID [2018-11-23 11:59:07,277 INFO L273 TraceCheckUtils]: 5: Hoare triple {1856#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);havoc ~a~0;~a~0 := 0; {1858#(= main_~a~0 0)} is VALID [2018-11-23 11:59:07,277 INFO L273 TraceCheckUtils]: 6: Hoare triple {1858#(= 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; {1858#(= main_~a~0 0)} is VALID [2018-11-23 11:59:07,278 INFO L273 TraceCheckUtils]: 7: Hoare triple {1858#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1859#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:07,278 INFO L273 TraceCheckUtils]: 8: Hoare triple {1859#(<= 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; {1859#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:07,279 INFO L273 TraceCheckUtils]: 9: Hoare triple {1859#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1860#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:07,279 INFO L273 TraceCheckUtils]: 10: Hoare triple {1860#(<= 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; {1860#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:07,280 INFO L273 TraceCheckUtils]: 11: Hoare triple {1860#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1861#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:07,280 INFO L273 TraceCheckUtils]: 12: Hoare triple {1861#(<= 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; {1861#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:07,281 INFO L273 TraceCheckUtils]: 13: Hoare triple {1861#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1862#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:07,282 INFO L273 TraceCheckUtils]: 14: Hoare triple {1862#(<= main_~a~0 4)} assume !(~a~0 < 100000); {1857#false} is VALID [2018-11-23 11:59:07,282 INFO L273 TraceCheckUtils]: 15: Hoare triple {1857#false} havoc ~i~0;~i~0 := 0; {1857#false} is VALID [2018-11-23 11:59:07,283 INFO L273 TraceCheckUtils]: 16: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1857#false} is VALID [2018-11-23 11:59:07,283 INFO L273 TraceCheckUtils]: 17: Hoare triple {1857#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1857#false} is VALID [2018-11-23 11:59:07,284 INFO L273 TraceCheckUtils]: 18: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1857#false} is VALID [2018-11-23 11:59:07,284 INFO L273 TraceCheckUtils]: 19: Hoare triple {1857#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1857#false} is VALID [2018-11-23 11:59:07,285 INFO L273 TraceCheckUtils]: 20: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1857#false} is VALID [2018-11-23 11:59:07,285 INFO L273 TraceCheckUtils]: 21: Hoare triple {1857#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1857#false} is VALID [2018-11-23 11:59:07,286 INFO L273 TraceCheckUtils]: 22: Hoare triple {1857#false} assume !(~i~0 < 100000); {1857#false} is VALID [2018-11-23 11:59:07,286 INFO L273 TraceCheckUtils]: 23: Hoare triple {1857#false} ~i~0 := 0; {1857#false} is VALID [2018-11-23 11:59:07,286 INFO L273 TraceCheckUtils]: 24: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1857#false} is VALID [2018-11-23 11:59:07,286 INFO L273 TraceCheckUtils]: 25: Hoare triple {1857#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1857#false} is VALID [2018-11-23 11:59:07,287 INFO L273 TraceCheckUtils]: 26: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1857#false} is VALID [2018-11-23 11:59:07,287 INFO L273 TraceCheckUtils]: 27: Hoare triple {1857#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1857#false} is VALID [2018-11-23 11:59:07,287 INFO L273 TraceCheckUtils]: 28: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1857#false} is VALID [2018-11-23 11:59:07,287 INFO L273 TraceCheckUtils]: 29: Hoare triple {1857#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1857#false} is VALID [2018-11-23 11:59:07,288 INFO L273 TraceCheckUtils]: 30: Hoare triple {1857#false} assume !(~i~0 < 100000); {1857#false} is VALID [2018-11-23 11:59:07,288 INFO L273 TraceCheckUtils]: 31: Hoare triple {1857#false} ~i~0 := 0; {1857#false} is VALID [2018-11-23 11:59:07,288 INFO L273 TraceCheckUtils]: 32: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {1857#false} is VALID [2018-11-23 11:59:07,288 INFO L273 TraceCheckUtils]: 33: Hoare triple {1857#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1857#false} is VALID [2018-11-23 11:59:07,289 INFO L273 TraceCheckUtils]: 34: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {1857#false} is VALID [2018-11-23 11:59:07,289 INFO L273 TraceCheckUtils]: 35: Hoare triple {1857#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1857#false} is VALID [2018-11-23 11:59:07,289 INFO L273 TraceCheckUtils]: 36: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {1857#false} is VALID [2018-11-23 11:59:07,289 INFO L273 TraceCheckUtils]: 37: Hoare triple {1857#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1857#false} is VALID [2018-11-23 11:59:07,289 INFO L273 TraceCheckUtils]: 38: Hoare triple {1857#false} assume !(~i~0 < 100000); {1857#false} is VALID [2018-11-23 11:59:07,290 INFO L273 TraceCheckUtils]: 39: Hoare triple {1857#false} ~i~0 := 0; {1857#false} is VALID [2018-11-23 11:59:07,290 INFO L273 TraceCheckUtils]: 40: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {1857#false} is VALID [2018-11-23 11:59:07,290 INFO L273 TraceCheckUtils]: 41: Hoare triple {1857#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1857#false} is VALID [2018-11-23 11:59:07,290 INFO L273 TraceCheckUtils]: 42: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {1857#false} is VALID [2018-11-23 11:59:07,290 INFO L273 TraceCheckUtils]: 43: Hoare triple {1857#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1857#false} is VALID [2018-11-23 11:59:07,290 INFO L273 TraceCheckUtils]: 44: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {1857#false} is VALID [2018-11-23 11:59:07,291 INFO L273 TraceCheckUtils]: 45: Hoare triple {1857#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1857#false} is VALID [2018-11-23 11:59:07,291 INFO L273 TraceCheckUtils]: 46: Hoare triple {1857#false} assume !(~i~0 < 100000); {1857#false} is VALID [2018-11-23 11:59:07,291 INFO L273 TraceCheckUtils]: 47: Hoare triple {1857#false} havoc ~x~0;~x~0 := 0; {1857#false} is VALID [2018-11-23 11:59:07,291 INFO L273 TraceCheckUtils]: 48: Hoare triple {1857#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {1857#false} is VALID [2018-11-23 11:59:07,291 INFO L256 TraceCheckUtils]: 49: Hoare triple {1857#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {1857#false} is VALID [2018-11-23 11:59:07,292 INFO L273 TraceCheckUtils]: 50: Hoare triple {1857#false} ~cond := #in~cond; {1857#false} is VALID [2018-11-23 11:59:07,292 INFO L273 TraceCheckUtils]: 51: Hoare triple {1857#false} assume 0 == ~cond; {1857#false} is VALID [2018-11-23 11:59:07,292 INFO L273 TraceCheckUtils]: 52: Hoare triple {1857#false} assume !false; {1857#false} is VALID [2018-11-23 11:59:07,295 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 11:59:07,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:07,296 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:59:07,307 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:59:07,368 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:59:07,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:07,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:07,920 INFO L256 TraceCheckUtils]: 0: Hoare triple {1856#true} call ULTIMATE.init(); {1856#true} is VALID [2018-11-23 11:59:07,920 INFO L273 TraceCheckUtils]: 1: Hoare triple {1856#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1856#true} is VALID [2018-11-23 11:59:07,921 INFO L273 TraceCheckUtils]: 2: Hoare triple {1856#true} assume true; {1856#true} is VALID [2018-11-23 11:59:07,921 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1856#true} {1856#true} #105#return; {1856#true} is VALID [2018-11-23 11:59:07,921 INFO L256 TraceCheckUtils]: 4: Hoare triple {1856#true} call #t~ret13 := main(); {1856#true} is VALID [2018-11-23 11:59:07,923 INFO L273 TraceCheckUtils]: 5: Hoare triple {1856#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);havoc ~a~0;~a~0 := 0; {1881#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:07,923 INFO L273 TraceCheckUtils]: 6: Hoare triple {1881#(<= 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; {1881#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:07,925 INFO L273 TraceCheckUtils]: 7: Hoare triple {1881#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1859#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:07,926 INFO L273 TraceCheckUtils]: 8: Hoare triple {1859#(<= 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; {1859#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:07,927 INFO L273 TraceCheckUtils]: 9: Hoare triple {1859#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1860#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:07,927 INFO L273 TraceCheckUtils]: 10: Hoare triple {1860#(<= 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; {1860#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:07,928 INFO L273 TraceCheckUtils]: 11: Hoare triple {1860#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1861#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:07,933 INFO L273 TraceCheckUtils]: 12: Hoare triple {1861#(<= 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; {1861#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:07,935 INFO L273 TraceCheckUtils]: 13: Hoare triple {1861#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1862#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:07,935 INFO L273 TraceCheckUtils]: 14: Hoare triple {1862#(<= main_~a~0 4)} assume !(~a~0 < 100000); {1857#false} is VALID [2018-11-23 11:59:07,935 INFO L273 TraceCheckUtils]: 15: Hoare triple {1857#false} havoc ~i~0;~i~0 := 0; {1857#false} is VALID [2018-11-23 11:59:07,936 INFO L273 TraceCheckUtils]: 16: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1857#false} is VALID [2018-11-23 11:59:07,936 INFO L273 TraceCheckUtils]: 17: Hoare triple {1857#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1857#false} is VALID [2018-11-23 11:59:07,936 INFO L273 TraceCheckUtils]: 18: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1857#false} is VALID [2018-11-23 11:59:07,936 INFO L273 TraceCheckUtils]: 19: Hoare triple {1857#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1857#false} is VALID [2018-11-23 11:59:07,937 INFO L273 TraceCheckUtils]: 20: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1857#false} is VALID [2018-11-23 11:59:07,937 INFO L273 TraceCheckUtils]: 21: Hoare triple {1857#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1857#false} is VALID [2018-11-23 11:59:07,937 INFO L273 TraceCheckUtils]: 22: Hoare triple {1857#false} assume !(~i~0 < 100000); {1857#false} is VALID [2018-11-23 11:59:07,938 INFO L273 TraceCheckUtils]: 23: Hoare triple {1857#false} ~i~0 := 0; {1857#false} is VALID [2018-11-23 11:59:07,938 INFO L273 TraceCheckUtils]: 24: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1857#false} is VALID [2018-11-23 11:59:07,939 INFO L273 TraceCheckUtils]: 25: Hoare triple {1857#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1857#false} is VALID [2018-11-23 11:59:07,939 INFO L273 TraceCheckUtils]: 26: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1857#false} is VALID [2018-11-23 11:59:07,939 INFO L273 TraceCheckUtils]: 27: Hoare triple {1857#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1857#false} is VALID [2018-11-23 11:59:07,939 INFO L273 TraceCheckUtils]: 28: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1857#false} is VALID [2018-11-23 11:59:07,940 INFO L273 TraceCheckUtils]: 29: Hoare triple {1857#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1857#false} is VALID [2018-11-23 11:59:07,940 INFO L273 TraceCheckUtils]: 30: Hoare triple {1857#false} assume !(~i~0 < 100000); {1857#false} is VALID [2018-11-23 11:59:07,940 INFO L273 TraceCheckUtils]: 31: Hoare triple {1857#false} ~i~0 := 0; {1857#false} is VALID [2018-11-23 11:59:07,940 INFO L273 TraceCheckUtils]: 32: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {1857#false} is VALID [2018-11-23 11:59:07,941 INFO L273 TraceCheckUtils]: 33: Hoare triple {1857#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1857#false} is VALID [2018-11-23 11:59:07,941 INFO L273 TraceCheckUtils]: 34: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {1857#false} is VALID [2018-11-23 11:59:07,941 INFO L273 TraceCheckUtils]: 35: Hoare triple {1857#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1857#false} is VALID [2018-11-23 11:59:07,941 INFO L273 TraceCheckUtils]: 36: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {1857#false} is VALID [2018-11-23 11:59:07,942 INFO L273 TraceCheckUtils]: 37: Hoare triple {1857#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1857#false} is VALID [2018-11-23 11:59:07,942 INFO L273 TraceCheckUtils]: 38: Hoare triple {1857#false} assume !(~i~0 < 100000); {1857#false} is VALID [2018-11-23 11:59:07,942 INFO L273 TraceCheckUtils]: 39: Hoare triple {1857#false} ~i~0 := 0; {1857#false} is VALID [2018-11-23 11:59:07,942 INFO L273 TraceCheckUtils]: 40: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {1857#false} is VALID [2018-11-23 11:59:07,943 INFO L273 TraceCheckUtils]: 41: Hoare triple {1857#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1857#false} is VALID [2018-11-23 11:59:07,943 INFO L273 TraceCheckUtils]: 42: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {1857#false} is VALID [2018-11-23 11:59:07,943 INFO L273 TraceCheckUtils]: 43: Hoare triple {1857#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1857#false} is VALID [2018-11-23 11:59:07,943 INFO L273 TraceCheckUtils]: 44: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {1857#false} is VALID [2018-11-23 11:59:07,944 INFO L273 TraceCheckUtils]: 45: Hoare triple {1857#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1857#false} is VALID [2018-11-23 11:59:07,944 INFO L273 TraceCheckUtils]: 46: Hoare triple {1857#false} assume !(~i~0 < 100000); {1857#false} is VALID [2018-11-23 11:59:07,944 INFO L273 TraceCheckUtils]: 47: Hoare triple {1857#false} havoc ~x~0;~x~0 := 0; {1857#false} is VALID [2018-11-23 11:59:07,944 INFO L273 TraceCheckUtils]: 48: Hoare triple {1857#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {1857#false} is VALID [2018-11-23 11:59:07,945 INFO L256 TraceCheckUtils]: 49: Hoare triple {1857#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {1857#false} is VALID [2018-11-23 11:59:07,945 INFO L273 TraceCheckUtils]: 50: Hoare triple {1857#false} ~cond := #in~cond; {1857#false} is VALID [2018-11-23 11:59:07,945 INFO L273 TraceCheckUtils]: 51: Hoare triple {1857#false} assume 0 == ~cond; {1857#false} is VALID [2018-11-23 11:59:07,945 INFO L273 TraceCheckUtils]: 52: Hoare triple {1857#false} assume !false; {1857#false} is VALID [2018-11-23 11:59:07,949 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 11:59:07,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:07,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 11:59:07,968 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-11-23 11:59:07,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:07,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:59:08,057 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:59:08,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:59:08,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:59:08,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:59:08,059 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 8 states. [2018-11-23 11:59:08,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:08,577 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2018-11-23 11:59:08,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:59:08,577 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-11-23 11:59:08,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:08,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:59:08,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2018-11-23 11:59:08,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:59:08,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2018-11-23 11:59:08,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 74 transitions. [2018-11-23 11:59:08,718 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:59:08,720 INFO L225 Difference]: With dead ends: 104 [2018-11-23 11:59:08,720 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 11:59:08,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:59:08,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 11:59:08,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-11-23 11:59:08,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:08,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 60 states. [2018-11-23 11:59:08,776 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 60 states. [2018-11-23 11:59:08,777 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 60 states. [2018-11-23 11:59:08,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:08,779 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2018-11-23 11:59:08,779 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-11-23 11:59:08,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:08,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:08,780 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 61 states. [2018-11-23 11:59:08,780 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 61 states. [2018-11-23 11:59:08,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:08,782 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2018-11-23 11:59:08,782 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-11-23 11:59:08,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:08,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:08,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:08,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:08,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 11:59:08,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-11-23 11:59:08,785 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 53 [2018-11-23 11:59:08,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:08,785 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-11-23 11:59:08,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:59:08,786 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-11-23 11:59:08,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 11:59:08,786 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:08,786 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 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] [2018-11-23 11:59:08,787 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:08,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:08,787 INFO L82 PathProgramCache]: Analyzing trace with hash 161238336, now seen corresponding path program 5 times [2018-11-23 11:59:08,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:08,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:08,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:08,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:08,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:09,322 INFO L256 TraceCheckUtils]: 0: Hoare triple {2385#true} call ULTIMATE.init(); {2385#true} is VALID [2018-11-23 11:59:09,322 INFO L273 TraceCheckUtils]: 1: Hoare triple {2385#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2385#true} is VALID [2018-11-23 11:59:09,323 INFO L273 TraceCheckUtils]: 2: Hoare triple {2385#true} assume true; {2385#true} is VALID [2018-11-23 11:59:09,323 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2385#true} {2385#true} #105#return; {2385#true} is VALID [2018-11-23 11:59:09,323 INFO L256 TraceCheckUtils]: 4: Hoare triple {2385#true} call #t~ret13 := main(); {2385#true} is VALID [2018-11-23 11:59:09,324 INFO L273 TraceCheckUtils]: 5: Hoare triple {2385#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);havoc ~a~0;~a~0 := 0; {2387#(= main_~a~0 0)} is VALID [2018-11-23 11:59:09,324 INFO L273 TraceCheckUtils]: 6: Hoare triple {2387#(= 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; {2387#(= main_~a~0 0)} is VALID [2018-11-23 11:59:09,324 INFO L273 TraceCheckUtils]: 7: Hoare triple {2387#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2388#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:09,325 INFO L273 TraceCheckUtils]: 8: Hoare triple {2388#(<= 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; {2388#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:09,325 INFO L273 TraceCheckUtils]: 9: Hoare triple {2388#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2389#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:09,326 INFO L273 TraceCheckUtils]: 10: Hoare triple {2389#(<= 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; {2389#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:09,326 INFO L273 TraceCheckUtils]: 11: Hoare triple {2389#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2390#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:09,326 INFO L273 TraceCheckUtils]: 12: Hoare triple {2390#(<= 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; {2390#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:09,327 INFO L273 TraceCheckUtils]: 13: Hoare triple {2390#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2391#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:09,327 INFO L273 TraceCheckUtils]: 14: Hoare triple {2391#(<= 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; {2391#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:09,328 INFO L273 TraceCheckUtils]: 15: Hoare triple {2391#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2392#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:09,329 INFO L273 TraceCheckUtils]: 16: Hoare triple {2392#(<= main_~a~0 5)} assume !(~a~0 < 100000); {2386#false} is VALID [2018-11-23 11:59:09,329 INFO L273 TraceCheckUtils]: 17: Hoare triple {2386#false} havoc ~i~0;~i~0 := 0; {2386#false} is VALID [2018-11-23 11:59:09,329 INFO L273 TraceCheckUtils]: 18: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2386#false} is VALID [2018-11-23 11:59:09,330 INFO L273 TraceCheckUtils]: 19: Hoare triple {2386#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2386#false} is VALID [2018-11-23 11:59:09,330 INFO L273 TraceCheckUtils]: 20: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2386#false} is VALID [2018-11-23 11:59:09,330 INFO L273 TraceCheckUtils]: 21: Hoare triple {2386#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2386#false} is VALID [2018-11-23 11:59:09,330 INFO L273 TraceCheckUtils]: 22: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2386#false} is VALID [2018-11-23 11:59:09,330 INFO L273 TraceCheckUtils]: 23: Hoare triple {2386#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2386#false} is VALID [2018-11-23 11:59:09,331 INFO L273 TraceCheckUtils]: 24: Hoare triple {2386#false} assume !(~i~0 < 100000); {2386#false} is VALID [2018-11-23 11:59:09,331 INFO L273 TraceCheckUtils]: 25: Hoare triple {2386#false} ~i~0 := 0; {2386#false} is VALID [2018-11-23 11:59:09,331 INFO L273 TraceCheckUtils]: 26: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2386#false} is VALID [2018-11-23 11:59:09,331 INFO L273 TraceCheckUtils]: 27: Hoare triple {2386#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2386#false} is VALID [2018-11-23 11:59:09,332 INFO L273 TraceCheckUtils]: 28: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2386#false} is VALID [2018-11-23 11:59:09,332 INFO L273 TraceCheckUtils]: 29: Hoare triple {2386#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2386#false} is VALID [2018-11-23 11:59:09,332 INFO L273 TraceCheckUtils]: 30: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2386#false} is VALID [2018-11-23 11:59:09,332 INFO L273 TraceCheckUtils]: 31: Hoare triple {2386#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2386#false} is VALID [2018-11-23 11:59:09,333 INFO L273 TraceCheckUtils]: 32: Hoare triple {2386#false} assume !(~i~0 < 100000); {2386#false} is VALID [2018-11-23 11:59:09,333 INFO L273 TraceCheckUtils]: 33: Hoare triple {2386#false} ~i~0 := 0; {2386#false} is VALID [2018-11-23 11:59:09,333 INFO L273 TraceCheckUtils]: 34: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {2386#false} is VALID [2018-11-23 11:59:09,333 INFO L273 TraceCheckUtils]: 35: Hoare triple {2386#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2386#false} is VALID [2018-11-23 11:59:09,334 INFO L273 TraceCheckUtils]: 36: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {2386#false} is VALID [2018-11-23 11:59:09,334 INFO L273 TraceCheckUtils]: 37: Hoare triple {2386#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2386#false} is VALID [2018-11-23 11:59:09,334 INFO L273 TraceCheckUtils]: 38: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {2386#false} is VALID [2018-11-23 11:59:09,334 INFO L273 TraceCheckUtils]: 39: Hoare triple {2386#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2386#false} is VALID [2018-11-23 11:59:09,334 INFO L273 TraceCheckUtils]: 40: Hoare triple {2386#false} assume !(~i~0 < 100000); {2386#false} is VALID [2018-11-23 11:59:09,335 INFO L273 TraceCheckUtils]: 41: Hoare triple {2386#false} ~i~0 := 0; {2386#false} is VALID [2018-11-23 11:59:09,335 INFO L273 TraceCheckUtils]: 42: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {2386#false} is VALID [2018-11-23 11:59:09,335 INFO L273 TraceCheckUtils]: 43: Hoare triple {2386#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2386#false} is VALID [2018-11-23 11:59:09,335 INFO L273 TraceCheckUtils]: 44: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {2386#false} is VALID [2018-11-23 11:59:09,335 INFO L273 TraceCheckUtils]: 45: Hoare triple {2386#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2386#false} is VALID [2018-11-23 11:59:09,335 INFO L273 TraceCheckUtils]: 46: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {2386#false} is VALID [2018-11-23 11:59:09,336 INFO L273 TraceCheckUtils]: 47: Hoare triple {2386#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2386#false} is VALID [2018-11-23 11:59:09,336 INFO L273 TraceCheckUtils]: 48: Hoare triple {2386#false} assume !(~i~0 < 100000); {2386#false} is VALID [2018-11-23 11:59:09,336 INFO L273 TraceCheckUtils]: 49: Hoare triple {2386#false} havoc ~x~0;~x~0 := 0; {2386#false} is VALID [2018-11-23 11:59:09,336 INFO L273 TraceCheckUtils]: 50: Hoare triple {2386#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {2386#false} is VALID [2018-11-23 11:59:09,336 INFO L256 TraceCheckUtils]: 51: Hoare triple {2386#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {2386#false} is VALID [2018-11-23 11:59:09,336 INFO L273 TraceCheckUtils]: 52: Hoare triple {2386#false} ~cond := #in~cond; {2386#false} is VALID [2018-11-23 11:59:09,337 INFO L273 TraceCheckUtils]: 53: Hoare triple {2386#false} assume 0 == ~cond; {2386#false} is VALID [2018-11-23 11:59:09,337 INFO L273 TraceCheckUtils]: 54: Hoare triple {2386#false} assume !false; {2386#false} is VALID [2018-11-23 11:59:09,338 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 11:59:09,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:09,338 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:59:09,347 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:59:11,150 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 11:59:11,150 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:11,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:11,306 INFO L256 TraceCheckUtils]: 0: Hoare triple {2385#true} call ULTIMATE.init(); {2385#true} is VALID [2018-11-23 11:59:11,306 INFO L273 TraceCheckUtils]: 1: Hoare triple {2385#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2385#true} is VALID [2018-11-23 11:59:11,307 INFO L273 TraceCheckUtils]: 2: Hoare triple {2385#true} assume true; {2385#true} is VALID [2018-11-23 11:59:11,307 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2385#true} {2385#true} #105#return; {2385#true} is VALID [2018-11-23 11:59:11,307 INFO L256 TraceCheckUtils]: 4: Hoare triple {2385#true} call #t~ret13 := main(); {2385#true} is VALID [2018-11-23 11:59:11,307 INFO L273 TraceCheckUtils]: 5: Hoare triple {2385#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);havoc ~a~0;~a~0 := 0; {2385#true} is VALID [2018-11-23 11:59:11,308 INFO L273 TraceCheckUtils]: 6: Hoare triple {2385#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; {2385#true} is VALID [2018-11-23 11:59:11,308 INFO L273 TraceCheckUtils]: 7: Hoare triple {2385#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2385#true} is VALID [2018-11-23 11:59:11,308 INFO L273 TraceCheckUtils]: 8: Hoare triple {2385#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; {2385#true} is VALID [2018-11-23 11:59:11,309 INFO L273 TraceCheckUtils]: 9: Hoare triple {2385#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2385#true} is VALID [2018-11-23 11:59:11,309 INFO L273 TraceCheckUtils]: 10: Hoare triple {2385#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; {2385#true} is VALID [2018-11-23 11:59:11,309 INFO L273 TraceCheckUtils]: 11: Hoare triple {2385#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2385#true} is VALID [2018-11-23 11:59:11,309 INFO L273 TraceCheckUtils]: 12: Hoare triple {2385#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; {2385#true} is VALID [2018-11-23 11:59:11,309 INFO L273 TraceCheckUtils]: 13: Hoare triple {2385#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2385#true} is VALID [2018-11-23 11:59:11,309 INFO L273 TraceCheckUtils]: 14: Hoare triple {2385#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; {2385#true} is VALID [2018-11-23 11:59:11,310 INFO L273 TraceCheckUtils]: 15: Hoare triple {2385#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2385#true} is VALID [2018-11-23 11:59:11,310 INFO L273 TraceCheckUtils]: 16: Hoare triple {2385#true} assume !(~a~0 < 100000); {2385#true} is VALID [2018-11-23 11:59:11,326 INFO L273 TraceCheckUtils]: 17: Hoare triple {2385#true} havoc ~i~0;~i~0 := 0; {2447#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:11,335 INFO L273 TraceCheckUtils]: 18: Hoare triple {2447#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2447#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:11,351 INFO L273 TraceCheckUtils]: 19: Hoare triple {2447#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2454#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:11,360 INFO L273 TraceCheckUtils]: 20: Hoare triple {2454#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2454#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:11,373 INFO L273 TraceCheckUtils]: 21: Hoare triple {2454#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2461#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:11,374 INFO L273 TraceCheckUtils]: 22: Hoare triple {2461#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2461#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:11,374 INFO L273 TraceCheckUtils]: 23: Hoare triple {2461#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2468#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:11,375 INFO L273 TraceCheckUtils]: 24: Hoare triple {2468#(<= main_~i~0 3)} assume !(~i~0 < 100000); {2386#false} is VALID [2018-11-23 11:59:11,375 INFO L273 TraceCheckUtils]: 25: Hoare triple {2386#false} ~i~0 := 0; {2386#false} is VALID [2018-11-23 11:59:11,375 INFO L273 TraceCheckUtils]: 26: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2386#false} is VALID [2018-11-23 11:59:11,375 INFO L273 TraceCheckUtils]: 27: Hoare triple {2386#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2386#false} is VALID [2018-11-23 11:59:11,375 INFO L273 TraceCheckUtils]: 28: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2386#false} is VALID [2018-11-23 11:59:11,375 INFO L273 TraceCheckUtils]: 29: Hoare triple {2386#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2386#false} is VALID [2018-11-23 11:59:11,375 INFO L273 TraceCheckUtils]: 30: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2386#false} is VALID [2018-11-23 11:59:11,376 INFO L273 TraceCheckUtils]: 31: Hoare triple {2386#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2386#false} is VALID [2018-11-23 11:59:11,376 INFO L273 TraceCheckUtils]: 32: Hoare triple {2386#false} assume !(~i~0 < 100000); {2386#false} is VALID [2018-11-23 11:59:11,376 INFO L273 TraceCheckUtils]: 33: Hoare triple {2386#false} ~i~0 := 0; {2386#false} is VALID [2018-11-23 11:59:11,376 INFO L273 TraceCheckUtils]: 34: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {2386#false} is VALID [2018-11-23 11:59:11,376 INFO L273 TraceCheckUtils]: 35: Hoare triple {2386#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2386#false} is VALID [2018-11-23 11:59:11,376 INFO L273 TraceCheckUtils]: 36: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {2386#false} is VALID [2018-11-23 11:59:11,376 INFO L273 TraceCheckUtils]: 37: Hoare triple {2386#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2386#false} is VALID [2018-11-23 11:59:11,377 INFO L273 TraceCheckUtils]: 38: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {2386#false} is VALID [2018-11-23 11:59:11,377 INFO L273 TraceCheckUtils]: 39: Hoare triple {2386#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2386#false} is VALID [2018-11-23 11:59:11,377 INFO L273 TraceCheckUtils]: 40: Hoare triple {2386#false} assume !(~i~0 < 100000); {2386#false} is VALID [2018-11-23 11:59:11,377 INFO L273 TraceCheckUtils]: 41: Hoare triple {2386#false} ~i~0 := 0; {2386#false} is VALID [2018-11-23 11:59:11,377 INFO L273 TraceCheckUtils]: 42: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {2386#false} is VALID [2018-11-23 11:59:11,377 INFO L273 TraceCheckUtils]: 43: Hoare triple {2386#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2386#false} is VALID [2018-11-23 11:59:11,377 INFO L273 TraceCheckUtils]: 44: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {2386#false} is VALID [2018-11-23 11:59:11,378 INFO L273 TraceCheckUtils]: 45: Hoare triple {2386#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2386#false} is VALID [2018-11-23 11:59:11,378 INFO L273 TraceCheckUtils]: 46: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {2386#false} is VALID [2018-11-23 11:59:11,378 INFO L273 TraceCheckUtils]: 47: Hoare triple {2386#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2386#false} is VALID [2018-11-23 11:59:11,378 INFO L273 TraceCheckUtils]: 48: Hoare triple {2386#false} assume !(~i~0 < 100000); {2386#false} is VALID [2018-11-23 11:59:11,378 INFO L273 TraceCheckUtils]: 49: Hoare triple {2386#false} havoc ~x~0;~x~0 := 0; {2386#false} is VALID [2018-11-23 11:59:11,378 INFO L273 TraceCheckUtils]: 50: Hoare triple {2386#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {2386#false} is VALID [2018-11-23 11:59:11,378 INFO L256 TraceCheckUtils]: 51: Hoare triple {2386#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {2386#false} is VALID [2018-11-23 11:59:11,378 INFO L273 TraceCheckUtils]: 52: Hoare triple {2386#false} ~cond := #in~cond; {2386#false} is VALID [2018-11-23 11:59:11,379 INFO L273 TraceCheckUtils]: 53: Hoare triple {2386#false} assume 0 == ~cond; {2386#false} is VALID [2018-11-23 11:59:11,379 INFO L273 TraceCheckUtils]: 54: Hoare triple {2386#false} assume !false; {2386#false} is VALID [2018-11-23 11:59:11,380 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-23 11:59:11,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:11,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-11-23 11:59:11,402 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-11-23 11:59:11,403 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:11,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:59:11,456 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:59:11,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:59:11,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:59:11,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:59:11,457 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 12 states. [2018-11-23 11:59:12,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:12,130 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2018-11-23 11:59:12,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:59:12,130 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-11-23 11:59:12,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:12,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:59:12,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 112 transitions. [2018-11-23 11:59:12,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:59:12,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 112 transitions. [2018-11-23 11:59:12,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 112 transitions. [2018-11-23 11:59:12,350 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:12,352 INFO L225 Difference]: With dead ends: 118 [2018-11-23 11:59:12,353 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 11:59:12,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:59:12,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 11:59:12,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2018-11-23 11:59:12,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:12,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 70 states. [2018-11-23 11:59:12,387 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 70 states. [2018-11-23 11:59:12,387 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 70 states. [2018-11-23 11:59:12,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:12,390 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2018-11-23 11:59:12,390 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-11-23 11:59:12,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:12,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:12,390 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 75 states. [2018-11-23 11:59:12,390 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 75 states. [2018-11-23 11:59:12,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:12,392 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2018-11-23 11:59:12,392 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-11-23 11:59:12,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:12,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:12,393 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:12,393 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:12,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 11:59:12,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2018-11-23 11:59:12,395 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 55 [2018-11-23 11:59:12,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:12,396 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2018-11-23 11:59:12,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:59:12,396 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2018-11-23 11:59:12,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 11:59:12,397 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:12,397 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 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] [2018-11-23 11:59:12,397 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:12,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:12,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1745421270, now seen corresponding path program 6 times [2018-11-23 11:59:12,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:12,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:12,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:12,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:12,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:12,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:12,606 INFO L256 TraceCheckUtils]: 0: Hoare triple {2986#true} call ULTIMATE.init(); {2986#true} is VALID [2018-11-23 11:59:12,606 INFO L273 TraceCheckUtils]: 1: Hoare triple {2986#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2986#true} is VALID [2018-11-23 11:59:12,606 INFO L273 TraceCheckUtils]: 2: Hoare triple {2986#true} assume true; {2986#true} is VALID [2018-11-23 11:59:12,607 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2986#true} {2986#true} #105#return; {2986#true} is VALID [2018-11-23 11:59:12,607 INFO L256 TraceCheckUtils]: 4: Hoare triple {2986#true} call #t~ret13 := main(); {2986#true} is VALID [2018-11-23 11:59:12,608 INFO L273 TraceCheckUtils]: 5: Hoare triple {2986#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);havoc ~a~0;~a~0 := 0; {2988#(= main_~a~0 0)} is VALID [2018-11-23 11:59:12,608 INFO L273 TraceCheckUtils]: 6: Hoare triple {2988#(= 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; {2988#(= main_~a~0 0)} is VALID [2018-11-23 11:59:12,609 INFO L273 TraceCheckUtils]: 7: Hoare triple {2988#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2989#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:12,609 INFO L273 TraceCheckUtils]: 8: Hoare triple {2989#(<= 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; {2989#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:12,610 INFO L273 TraceCheckUtils]: 9: Hoare triple {2989#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2990#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:12,610 INFO L273 TraceCheckUtils]: 10: Hoare triple {2990#(<= 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; {2990#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:12,610 INFO L273 TraceCheckUtils]: 11: Hoare triple {2990#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2991#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:12,611 INFO L273 TraceCheckUtils]: 12: Hoare triple {2991#(<= 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; {2991#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:12,611 INFO L273 TraceCheckUtils]: 13: Hoare triple {2991#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2992#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:12,612 INFO L273 TraceCheckUtils]: 14: Hoare triple {2992#(<= 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; {2992#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:12,612 INFO L273 TraceCheckUtils]: 15: Hoare triple {2992#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2993#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:12,613 INFO L273 TraceCheckUtils]: 16: Hoare triple {2993#(<= 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; {2993#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:12,628 INFO L273 TraceCheckUtils]: 17: Hoare triple {2993#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2994#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:12,631 INFO L273 TraceCheckUtils]: 18: Hoare triple {2994#(<= main_~a~0 6)} assume !(~a~0 < 100000); {2987#false} is VALID [2018-11-23 11:59:12,631 INFO L273 TraceCheckUtils]: 19: Hoare triple {2987#false} havoc ~i~0;~i~0 := 0; {2987#false} is VALID [2018-11-23 11:59:12,632 INFO L273 TraceCheckUtils]: 20: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2987#false} is VALID [2018-11-23 11:59:12,632 INFO L273 TraceCheckUtils]: 21: Hoare triple {2987#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2987#false} is VALID [2018-11-23 11:59:12,632 INFO L273 TraceCheckUtils]: 22: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2987#false} is VALID [2018-11-23 11:59:12,632 INFO L273 TraceCheckUtils]: 23: Hoare triple {2987#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2987#false} is VALID [2018-11-23 11:59:12,632 INFO L273 TraceCheckUtils]: 24: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2987#false} is VALID [2018-11-23 11:59:12,632 INFO L273 TraceCheckUtils]: 25: Hoare triple {2987#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2987#false} is VALID [2018-11-23 11:59:12,632 INFO L273 TraceCheckUtils]: 26: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2987#false} is VALID [2018-11-23 11:59:12,632 INFO L273 TraceCheckUtils]: 27: Hoare triple {2987#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2987#false} is VALID [2018-11-23 11:59:12,633 INFO L273 TraceCheckUtils]: 28: Hoare triple {2987#false} assume !(~i~0 < 100000); {2987#false} is VALID [2018-11-23 11:59:12,633 INFO L273 TraceCheckUtils]: 29: Hoare triple {2987#false} ~i~0 := 0; {2987#false} is VALID [2018-11-23 11:59:12,633 INFO L273 TraceCheckUtils]: 30: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2987#false} is VALID [2018-11-23 11:59:12,633 INFO L273 TraceCheckUtils]: 31: Hoare triple {2987#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2987#false} is VALID [2018-11-23 11:59:12,633 INFO L273 TraceCheckUtils]: 32: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2987#false} is VALID [2018-11-23 11:59:12,633 INFO L273 TraceCheckUtils]: 33: Hoare triple {2987#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2987#false} is VALID [2018-11-23 11:59:12,633 INFO L273 TraceCheckUtils]: 34: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2987#false} is VALID [2018-11-23 11:59:12,634 INFO L273 TraceCheckUtils]: 35: Hoare triple {2987#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2987#false} is VALID [2018-11-23 11:59:12,634 INFO L273 TraceCheckUtils]: 36: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2987#false} is VALID [2018-11-23 11:59:12,634 INFO L273 TraceCheckUtils]: 37: Hoare triple {2987#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2987#false} is VALID [2018-11-23 11:59:12,634 INFO L273 TraceCheckUtils]: 38: Hoare triple {2987#false} assume !(~i~0 < 100000); {2987#false} is VALID [2018-11-23 11:59:12,634 INFO L273 TraceCheckUtils]: 39: Hoare triple {2987#false} ~i~0 := 0; {2987#false} is VALID [2018-11-23 11:59:12,634 INFO L273 TraceCheckUtils]: 40: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {2987#false} is VALID [2018-11-23 11:59:12,634 INFO L273 TraceCheckUtils]: 41: Hoare triple {2987#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2987#false} is VALID [2018-11-23 11:59:12,634 INFO L273 TraceCheckUtils]: 42: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {2987#false} is VALID [2018-11-23 11:59:12,635 INFO L273 TraceCheckUtils]: 43: Hoare triple {2987#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2987#false} is VALID [2018-11-23 11:59:12,635 INFO L273 TraceCheckUtils]: 44: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {2987#false} is VALID [2018-11-23 11:59:12,635 INFO L273 TraceCheckUtils]: 45: Hoare triple {2987#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2987#false} is VALID [2018-11-23 11:59:12,635 INFO L273 TraceCheckUtils]: 46: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {2987#false} is VALID [2018-11-23 11:59:12,635 INFO L273 TraceCheckUtils]: 47: Hoare triple {2987#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2987#false} is VALID [2018-11-23 11:59:12,635 INFO L273 TraceCheckUtils]: 48: Hoare triple {2987#false} assume !(~i~0 < 100000); {2987#false} is VALID [2018-11-23 11:59:12,635 INFO L273 TraceCheckUtils]: 49: Hoare triple {2987#false} ~i~0 := 0; {2987#false} is VALID [2018-11-23 11:59:12,635 INFO L273 TraceCheckUtils]: 50: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {2987#false} is VALID [2018-11-23 11:59:12,636 INFO L273 TraceCheckUtils]: 51: Hoare triple {2987#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2987#false} is VALID [2018-11-23 11:59:12,636 INFO L273 TraceCheckUtils]: 52: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {2987#false} is VALID [2018-11-23 11:59:12,636 INFO L273 TraceCheckUtils]: 53: Hoare triple {2987#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2987#false} is VALID [2018-11-23 11:59:12,636 INFO L273 TraceCheckUtils]: 54: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {2987#false} is VALID [2018-11-23 11:59:12,636 INFO L273 TraceCheckUtils]: 55: Hoare triple {2987#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2987#false} is VALID [2018-11-23 11:59:12,636 INFO L273 TraceCheckUtils]: 56: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {2987#false} is VALID [2018-11-23 11:59:12,636 INFO L273 TraceCheckUtils]: 57: Hoare triple {2987#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2987#false} is VALID [2018-11-23 11:59:12,636 INFO L273 TraceCheckUtils]: 58: Hoare triple {2987#false} assume !(~i~0 < 100000); {2987#false} is VALID [2018-11-23 11:59:12,637 INFO L273 TraceCheckUtils]: 59: Hoare triple {2987#false} havoc ~x~0;~x~0 := 0; {2987#false} is VALID [2018-11-23 11:59:12,637 INFO L273 TraceCheckUtils]: 60: Hoare triple {2987#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {2987#false} is VALID [2018-11-23 11:59:12,637 INFO L256 TraceCheckUtils]: 61: Hoare triple {2987#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {2987#false} is VALID [2018-11-23 11:59:12,637 INFO L273 TraceCheckUtils]: 62: Hoare triple {2987#false} ~cond := #in~cond; {2987#false} is VALID [2018-11-23 11:59:12,637 INFO L273 TraceCheckUtils]: 63: Hoare triple {2987#false} assume 0 == ~cond; {2987#false} is VALID [2018-11-23 11:59:12,637 INFO L273 TraceCheckUtils]: 64: Hoare triple {2987#false} assume !false; {2987#false} is VALID [2018-11-23 11:59:12,639 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 11:59:12,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:12,639 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:59:12,648 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:59:12,829 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 11:59:12,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:12,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:13,322 INFO L256 TraceCheckUtils]: 0: Hoare triple {2986#true} call ULTIMATE.init(); {2986#true} is VALID [2018-11-23 11:59:13,322 INFO L273 TraceCheckUtils]: 1: Hoare triple {2986#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2986#true} is VALID [2018-11-23 11:59:13,322 INFO L273 TraceCheckUtils]: 2: Hoare triple {2986#true} assume true; {2986#true} is VALID [2018-11-23 11:59:13,322 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2986#true} {2986#true} #105#return; {2986#true} is VALID [2018-11-23 11:59:13,322 INFO L256 TraceCheckUtils]: 4: Hoare triple {2986#true} call #t~ret13 := main(); {2986#true} is VALID [2018-11-23 11:59:13,323 INFO L273 TraceCheckUtils]: 5: Hoare triple {2986#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);havoc ~a~0;~a~0 := 0; {2986#true} is VALID [2018-11-23 11:59:13,323 INFO L273 TraceCheckUtils]: 6: Hoare triple {2986#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; {2986#true} is VALID [2018-11-23 11:59:13,323 INFO L273 TraceCheckUtils]: 7: Hoare triple {2986#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2986#true} is VALID [2018-11-23 11:59:13,323 INFO L273 TraceCheckUtils]: 8: Hoare triple {2986#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; {2986#true} is VALID [2018-11-23 11:59:13,323 INFO L273 TraceCheckUtils]: 9: Hoare triple {2986#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2986#true} is VALID [2018-11-23 11:59:13,323 INFO L273 TraceCheckUtils]: 10: Hoare triple {2986#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; {2986#true} is VALID [2018-11-23 11:59:13,323 INFO L273 TraceCheckUtils]: 11: Hoare triple {2986#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2986#true} is VALID [2018-11-23 11:59:13,324 INFO L273 TraceCheckUtils]: 12: Hoare triple {2986#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; {2986#true} is VALID [2018-11-23 11:59:13,324 INFO L273 TraceCheckUtils]: 13: Hoare triple {2986#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2986#true} is VALID [2018-11-23 11:59:13,324 INFO L273 TraceCheckUtils]: 14: Hoare triple {2986#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; {2986#true} is VALID [2018-11-23 11:59:13,324 INFO L273 TraceCheckUtils]: 15: Hoare triple {2986#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2986#true} is VALID [2018-11-23 11:59:13,324 INFO L273 TraceCheckUtils]: 16: Hoare triple {2986#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; {2986#true} is VALID [2018-11-23 11:59:13,324 INFO L273 TraceCheckUtils]: 17: Hoare triple {2986#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2986#true} is VALID [2018-11-23 11:59:13,324 INFO L273 TraceCheckUtils]: 18: Hoare triple {2986#true} assume !(~a~0 < 100000); {2986#true} is VALID [2018-11-23 11:59:13,324 INFO L273 TraceCheckUtils]: 19: Hoare triple {2986#true} havoc ~i~0;~i~0 := 0; {2986#true} is VALID [2018-11-23 11:59:13,325 INFO L273 TraceCheckUtils]: 20: Hoare triple {2986#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2986#true} is VALID [2018-11-23 11:59:13,325 INFO L273 TraceCheckUtils]: 21: Hoare triple {2986#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2986#true} is VALID [2018-11-23 11:59:13,325 INFO L273 TraceCheckUtils]: 22: Hoare triple {2986#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2986#true} is VALID [2018-11-23 11:59:13,325 INFO L273 TraceCheckUtils]: 23: Hoare triple {2986#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2986#true} is VALID [2018-11-23 11:59:13,325 INFO L273 TraceCheckUtils]: 24: Hoare triple {2986#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2986#true} is VALID [2018-11-23 11:59:13,325 INFO L273 TraceCheckUtils]: 25: Hoare triple {2986#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2986#true} is VALID [2018-11-23 11:59:13,325 INFO L273 TraceCheckUtils]: 26: Hoare triple {2986#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2986#true} is VALID [2018-11-23 11:59:13,325 INFO L273 TraceCheckUtils]: 27: Hoare triple {2986#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2986#true} is VALID [2018-11-23 11:59:13,326 INFO L273 TraceCheckUtils]: 28: Hoare triple {2986#true} assume !(~i~0 < 100000); {2986#true} is VALID [2018-11-23 11:59:13,326 INFO L273 TraceCheckUtils]: 29: Hoare triple {2986#true} ~i~0 := 0; {3085#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:13,327 INFO L273 TraceCheckUtils]: 30: Hoare triple {3085#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3085#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:13,327 INFO L273 TraceCheckUtils]: 31: Hoare triple {3085#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3092#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:13,329 INFO L273 TraceCheckUtils]: 32: Hoare triple {3092#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3092#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:13,329 INFO L273 TraceCheckUtils]: 33: Hoare triple {3092#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3099#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:13,331 INFO L273 TraceCheckUtils]: 34: Hoare triple {3099#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3099#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:13,331 INFO L273 TraceCheckUtils]: 35: Hoare triple {3099#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3106#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:13,331 INFO L273 TraceCheckUtils]: 36: Hoare triple {3106#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3106#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:13,332 INFO L273 TraceCheckUtils]: 37: Hoare triple {3106#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3113#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:13,332 INFO L273 TraceCheckUtils]: 38: Hoare triple {3113#(<= main_~i~0 4)} assume !(~i~0 < 100000); {2987#false} is VALID [2018-11-23 11:59:13,333 INFO L273 TraceCheckUtils]: 39: Hoare triple {2987#false} ~i~0 := 0; {2987#false} is VALID [2018-11-23 11:59:13,333 INFO L273 TraceCheckUtils]: 40: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {2987#false} is VALID [2018-11-23 11:59:13,333 INFO L273 TraceCheckUtils]: 41: Hoare triple {2987#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2987#false} is VALID [2018-11-23 11:59:13,333 INFO L273 TraceCheckUtils]: 42: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {2987#false} is VALID [2018-11-23 11:59:13,333 INFO L273 TraceCheckUtils]: 43: Hoare triple {2987#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2987#false} is VALID [2018-11-23 11:59:13,333 INFO L273 TraceCheckUtils]: 44: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {2987#false} is VALID [2018-11-23 11:59:13,333 INFO L273 TraceCheckUtils]: 45: Hoare triple {2987#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2987#false} is VALID [2018-11-23 11:59:13,333 INFO L273 TraceCheckUtils]: 46: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {2987#false} is VALID [2018-11-23 11:59:13,334 INFO L273 TraceCheckUtils]: 47: Hoare triple {2987#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2987#false} is VALID [2018-11-23 11:59:13,334 INFO L273 TraceCheckUtils]: 48: Hoare triple {2987#false} assume !(~i~0 < 100000); {2987#false} is VALID [2018-11-23 11:59:13,334 INFO L273 TraceCheckUtils]: 49: Hoare triple {2987#false} ~i~0 := 0; {2987#false} is VALID [2018-11-23 11:59:13,334 INFO L273 TraceCheckUtils]: 50: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {2987#false} is VALID [2018-11-23 11:59:13,334 INFO L273 TraceCheckUtils]: 51: Hoare triple {2987#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2987#false} is VALID [2018-11-23 11:59:13,334 INFO L273 TraceCheckUtils]: 52: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {2987#false} is VALID [2018-11-23 11:59:13,334 INFO L273 TraceCheckUtils]: 53: Hoare triple {2987#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2987#false} is VALID [2018-11-23 11:59:13,334 INFO L273 TraceCheckUtils]: 54: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {2987#false} is VALID [2018-11-23 11:59:13,335 INFO L273 TraceCheckUtils]: 55: Hoare triple {2987#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2987#false} is VALID [2018-11-23 11:59:13,335 INFO L273 TraceCheckUtils]: 56: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {2987#false} is VALID [2018-11-23 11:59:13,335 INFO L273 TraceCheckUtils]: 57: Hoare triple {2987#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2987#false} is VALID [2018-11-23 11:59:13,335 INFO L273 TraceCheckUtils]: 58: Hoare triple {2987#false} assume !(~i~0 < 100000); {2987#false} is VALID [2018-11-23 11:59:13,335 INFO L273 TraceCheckUtils]: 59: Hoare triple {2987#false} havoc ~x~0;~x~0 := 0; {2987#false} is VALID [2018-11-23 11:59:13,335 INFO L273 TraceCheckUtils]: 60: Hoare triple {2987#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {2987#false} is VALID [2018-11-23 11:59:13,336 INFO L256 TraceCheckUtils]: 61: Hoare triple {2987#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {2987#false} is VALID [2018-11-23 11:59:13,336 INFO L273 TraceCheckUtils]: 62: Hoare triple {2987#false} ~cond := #in~cond; {2987#false} is VALID [2018-11-23 11:59:13,336 INFO L273 TraceCheckUtils]: 63: Hoare triple {2987#false} assume 0 == ~cond; {2987#false} is VALID [2018-11-23 11:59:13,336 INFO L273 TraceCheckUtils]: 64: Hoare triple {2987#false} assume !false; {2987#false} is VALID [2018-11-23 11:59:13,338 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 11:59:13,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:13,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2018-11-23 11:59:13,358 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2018-11-23 11:59:13,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:13,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:59:13,438 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:13,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:59:13,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:59:13,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:59:13,439 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand 14 states. [2018-11-23 11:59:13,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:13,891 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2018-11-23 11:59:13,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:59:13,891 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2018-11-23 11:59:13,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:13,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:59:13,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 122 transitions. [2018-11-23 11:59:13,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:59:13,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 122 transitions. [2018-11-23 11:59:13,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 122 transitions. [2018-11-23 11:59:14,043 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:14,045 INFO L225 Difference]: With dead ends: 136 [2018-11-23 11:59:14,045 INFO L226 Difference]: Without dead ends: 85 [2018-11-23 11:59:14,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:59:14,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-23 11:59:14,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2018-11-23 11:59:14,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:14,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 80 states. [2018-11-23 11:59:14,086 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 80 states. [2018-11-23 11:59:14,087 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 80 states. [2018-11-23 11:59:14,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:14,090 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-11-23 11:59:14,090 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-11-23 11:59:14,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:14,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:14,091 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 85 states. [2018-11-23 11:59:14,091 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 85 states. [2018-11-23 11:59:14,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:14,094 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-11-23 11:59:14,094 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-11-23 11:59:14,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:14,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:14,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:14,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:14,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 11:59:14,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2018-11-23 11:59:14,097 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 65 [2018-11-23 11:59:14,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:14,098 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2018-11-23 11:59:14,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:59:14,098 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2018-11-23 11:59:14,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 11:59:14,098 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:14,099 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 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:59:14,099 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:14,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:14,099 INFO L82 PathProgramCache]: Analyzing trace with hash 268285676, now seen corresponding path program 7 times [2018-11-23 11:59:14,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:14,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:14,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:14,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:14,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:14,867 INFO L256 TraceCheckUtils]: 0: Hoare triple {3681#true} call ULTIMATE.init(); {3681#true} is VALID [2018-11-23 11:59:14,867 INFO L273 TraceCheckUtils]: 1: Hoare triple {3681#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3681#true} is VALID [2018-11-23 11:59:14,867 INFO L273 TraceCheckUtils]: 2: Hoare triple {3681#true} assume true; {3681#true} is VALID [2018-11-23 11:59:14,868 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3681#true} {3681#true} #105#return; {3681#true} is VALID [2018-11-23 11:59:14,868 INFO L256 TraceCheckUtils]: 4: Hoare triple {3681#true} call #t~ret13 := main(); {3681#true} is VALID [2018-11-23 11:59:14,869 INFO L273 TraceCheckUtils]: 5: Hoare triple {3681#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);havoc ~a~0;~a~0 := 0; {3683#(= main_~a~0 0)} is VALID [2018-11-23 11:59:14,869 INFO L273 TraceCheckUtils]: 6: Hoare triple {3683#(= 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; {3683#(= main_~a~0 0)} is VALID [2018-11-23 11:59:14,870 INFO L273 TraceCheckUtils]: 7: Hoare triple {3683#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3684#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:14,870 INFO L273 TraceCheckUtils]: 8: Hoare triple {3684#(<= 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; {3684#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:14,871 INFO L273 TraceCheckUtils]: 9: Hoare triple {3684#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3685#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:14,871 INFO L273 TraceCheckUtils]: 10: Hoare triple {3685#(<= 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; {3685#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:14,872 INFO L273 TraceCheckUtils]: 11: Hoare triple {3685#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3686#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:14,873 INFO L273 TraceCheckUtils]: 12: Hoare triple {3686#(<= 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; {3686#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:14,874 INFO L273 TraceCheckUtils]: 13: Hoare triple {3686#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3687#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:14,874 INFO L273 TraceCheckUtils]: 14: Hoare triple {3687#(<= 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; {3687#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:14,875 INFO L273 TraceCheckUtils]: 15: Hoare triple {3687#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3688#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:14,876 INFO L273 TraceCheckUtils]: 16: Hoare triple {3688#(<= 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; {3688#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:14,877 INFO L273 TraceCheckUtils]: 17: Hoare triple {3688#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3689#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:14,877 INFO L273 TraceCheckUtils]: 18: Hoare triple {3689#(<= 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; {3689#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:14,878 INFO L273 TraceCheckUtils]: 19: Hoare triple {3689#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3690#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:14,879 INFO L273 TraceCheckUtils]: 20: Hoare triple {3690#(<= main_~a~0 7)} assume !(~a~0 < 100000); {3682#false} is VALID [2018-11-23 11:59:14,879 INFO L273 TraceCheckUtils]: 21: Hoare triple {3682#false} havoc ~i~0;~i~0 := 0; {3682#false} is VALID [2018-11-23 11:59:14,880 INFO L273 TraceCheckUtils]: 22: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3682#false} is VALID [2018-11-23 11:59:14,880 INFO L273 TraceCheckUtils]: 23: Hoare triple {3682#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3682#false} is VALID [2018-11-23 11:59:14,880 INFO L273 TraceCheckUtils]: 24: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3682#false} is VALID [2018-11-23 11:59:14,881 INFO L273 TraceCheckUtils]: 25: Hoare triple {3682#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3682#false} is VALID [2018-11-23 11:59:14,881 INFO L273 TraceCheckUtils]: 26: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3682#false} is VALID [2018-11-23 11:59:14,881 INFO L273 TraceCheckUtils]: 27: Hoare triple {3682#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3682#false} is VALID [2018-11-23 11:59:14,881 INFO L273 TraceCheckUtils]: 28: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3682#false} is VALID [2018-11-23 11:59:14,881 INFO L273 TraceCheckUtils]: 29: Hoare triple {3682#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3682#false} is VALID [2018-11-23 11:59:14,882 INFO L273 TraceCheckUtils]: 30: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3682#false} is VALID [2018-11-23 11:59:14,882 INFO L273 TraceCheckUtils]: 31: Hoare triple {3682#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3682#false} is VALID [2018-11-23 11:59:14,882 INFO L273 TraceCheckUtils]: 32: Hoare triple {3682#false} assume !(~i~0 < 100000); {3682#false} is VALID [2018-11-23 11:59:14,882 INFO L273 TraceCheckUtils]: 33: Hoare triple {3682#false} ~i~0 := 0; {3682#false} is VALID [2018-11-23 11:59:14,883 INFO L273 TraceCheckUtils]: 34: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3682#false} is VALID [2018-11-23 11:59:14,883 INFO L273 TraceCheckUtils]: 35: Hoare triple {3682#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3682#false} is VALID [2018-11-23 11:59:14,883 INFO L273 TraceCheckUtils]: 36: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3682#false} is VALID [2018-11-23 11:59:14,883 INFO L273 TraceCheckUtils]: 37: Hoare triple {3682#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3682#false} is VALID [2018-11-23 11:59:14,884 INFO L273 TraceCheckUtils]: 38: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3682#false} is VALID [2018-11-23 11:59:14,884 INFO L273 TraceCheckUtils]: 39: Hoare triple {3682#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3682#false} is VALID [2018-11-23 11:59:14,884 INFO L273 TraceCheckUtils]: 40: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3682#false} is VALID [2018-11-23 11:59:14,884 INFO L273 TraceCheckUtils]: 41: Hoare triple {3682#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3682#false} is VALID [2018-11-23 11:59:14,885 INFO L273 TraceCheckUtils]: 42: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3682#false} is VALID [2018-11-23 11:59:14,885 INFO L273 TraceCheckUtils]: 43: Hoare triple {3682#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3682#false} is VALID [2018-11-23 11:59:14,885 INFO L273 TraceCheckUtils]: 44: Hoare triple {3682#false} assume !(~i~0 < 100000); {3682#false} is VALID [2018-11-23 11:59:14,885 INFO L273 TraceCheckUtils]: 45: Hoare triple {3682#false} ~i~0 := 0; {3682#false} is VALID [2018-11-23 11:59:14,886 INFO L273 TraceCheckUtils]: 46: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {3682#false} is VALID [2018-11-23 11:59:14,886 INFO L273 TraceCheckUtils]: 47: Hoare triple {3682#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3682#false} is VALID [2018-11-23 11:59:14,886 INFO L273 TraceCheckUtils]: 48: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {3682#false} is VALID [2018-11-23 11:59:14,886 INFO L273 TraceCheckUtils]: 49: Hoare triple {3682#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3682#false} is VALID [2018-11-23 11:59:14,886 INFO L273 TraceCheckUtils]: 50: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {3682#false} is VALID [2018-11-23 11:59:14,886 INFO L273 TraceCheckUtils]: 51: Hoare triple {3682#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3682#false} is VALID [2018-11-23 11:59:14,887 INFO L273 TraceCheckUtils]: 52: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {3682#false} is VALID [2018-11-23 11:59:14,887 INFO L273 TraceCheckUtils]: 53: Hoare triple {3682#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3682#false} is VALID [2018-11-23 11:59:14,887 INFO L273 TraceCheckUtils]: 54: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {3682#false} is VALID [2018-11-23 11:59:14,887 INFO L273 TraceCheckUtils]: 55: Hoare triple {3682#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3682#false} is VALID [2018-11-23 11:59:14,887 INFO L273 TraceCheckUtils]: 56: Hoare triple {3682#false} assume !(~i~0 < 100000); {3682#false} is VALID [2018-11-23 11:59:14,888 INFO L273 TraceCheckUtils]: 57: Hoare triple {3682#false} ~i~0 := 0; {3682#false} is VALID [2018-11-23 11:59:14,888 INFO L273 TraceCheckUtils]: 58: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {3682#false} is VALID [2018-11-23 11:59:14,888 INFO L273 TraceCheckUtils]: 59: Hoare triple {3682#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3682#false} is VALID [2018-11-23 11:59:14,888 INFO L273 TraceCheckUtils]: 60: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {3682#false} is VALID [2018-11-23 11:59:14,888 INFO L273 TraceCheckUtils]: 61: Hoare triple {3682#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3682#false} is VALID [2018-11-23 11:59:14,888 INFO L273 TraceCheckUtils]: 62: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {3682#false} is VALID [2018-11-23 11:59:14,889 INFO L273 TraceCheckUtils]: 63: Hoare triple {3682#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3682#false} is VALID [2018-11-23 11:59:14,889 INFO L273 TraceCheckUtils]: 64: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {3682#false} is VALID [2018-11-23 11:59:14,889 INFO L273 TraceCheckUtils]: 65: Hoare triple {3682#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3682#false} is VALID [2018-11-23 11:59:14,889 INFO L273 TraceCheckUtils]: 66: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {3682#false} is VALID [2018-11-23 11:59:14,889 INFO L273 TraceCheckUtils]: 67: Hoare triple {3682#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3682#false} is VALID [2018-11-23 11:59:14,889 INFO L273 TraceCheckUtils]: 68: Hoare triple {3682#false} assume !(~i~0 < 100000); {3682#false} is VALID [2018-11-23 11:59:14,890 INFO L273 TraceCheckUtils]: 69: Hoare triple {3682#false} havoc ~x~0;~x~0 := 0; {3682#false} is VALID [2018-11-23 11:59:14,890 INFO L273 TraceCheckUtils]: 70: Hoare triple {3682#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {3682#false} is VALID [2018-11-23 11:59:14,890 INFO L256 TraceCheckUtils]: 71: Hoare triple {3682#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {3682#false} is VALID [2018-11-23 11:59:14,890 INFO L273 TraceCheckUtils]: 72: Hoare triple {3682#false} ~cond := #in~cond; {3682#false} is VALID [2018-11-23 11:59:14,890 INFO L273 TraceCheckUtils]: 73: Hoare triple {3682#false} assume 0 == ~cond; {3682#false} is VALID [2018-11-23 11:59:14,891 INFO L273 TraceCheckUtils]: 74: Hoare triple {3682#false} assume !false; {3682#false} is VALID [2018-11-23 11:59:14,894 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 11:59:14,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:14,894 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:59:14,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:14,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:15,103 INFO L256 TraceCheckUtils]: 0: Hoare triple {3681#true} call ULTIMATE.init(); {3681#true} is VALID [2018-11-23 11:59:15,103 INFO L273 TraceCheckUtils]: 1: Hoare triple {3681#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3681#true} is VALID [2018-11-23 11:59:15,103 INFO L273 TraceCheckUtils]: 2: Hoare triple {3681#true} assume true; {3681#true} is VALID [2018-11-23 11:59:15,104 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3681#true} {3681#true} #105#return; {3681#true} is VALID [2018-11-23 11:59:15,104 INFO L256 TraceCheckUtils]: 4: Hoare triple {3681#true} call #t~ret13 := main(); {3681#true} is VALID [2018-11-23 11:59:15,105 INFO L273 TraceCheckUtils]: 5: Hoare triple {3681#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);havoc ~a~0;~a~0 := 0; {3709#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:15,106 INFO L273 TraceCheckUtils]: 6: Hoare triple {3709#(<= 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; {3709#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:15,106 INFO L273 TraceCheckUtils]: 7: Hoare triple {3709#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3684#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:15,107 INFO L273 TraceCheckUtils]: 8: Hoare triple {3684#(<= 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; {3684#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:15,107 INFO L273 TraceCheckUtils]: 9: Hoare triple {3684#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3685#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:15,107 INFO L273 TraceCheckUtils]: 10: Hoare triple {3685#(<= 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; {3685#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:15,108 INFO L273 TraceCheckUtils]: 11: Hoare triple {3685#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3686#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:15,108 INFO L273 TraceCheckUtils]: 12: Hoare triple {3686#(<= 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; {3686#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:15,109 INFO L273 TraceCheckUtils]: 13: Hoare triple {3686#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3687#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:15,109 INFO L273 TraceCheckUtils]: 14: Hoare triple {3687#(<= 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; {3687#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:15,110 INFO L273 TraceCheckUtils]: 15: Hoare triple {3687#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3688#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:15,111 INFO L273 TraceCheckUtils]: 16: Hoare triple {3688#(<= 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; {3688#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:15,111 INFO L273 TraceCheckUtils]: 17: Hoare triple {3688#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3689#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:15,112 INFO L273 TraceCheckUtils]: 18: Hoare triple {3689#(<= 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; {3689#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:15,113 INFO L273 TraceCheckUtils]: 19: Hoare triple {3689#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3690#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:15,114 INFO L273 TraceCheckUtils]: 20: Hoare triple {3690#(<= main_~a~0 7)} assume !(~a~0 < 100000); {3682#false} is VALID [2018-11-23 11:59:15,114 INFO L273 TraceCheckUtils]: 21: Hoare triple {3682#false} havoc ~i~0;~i~0 := 0; {3682#false} is VALID [2018-11-23 11:59:15,114 INFO L273 TraceCheckUtils]: 22: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3682#false} is VALID [2018-11-23 11:59:15,114 INFO L273 TraceCheckUtils]: 23: Hoare triple {3682#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3682#false} is VALID [2018-11-23 11:59:15,114 INFO L273 TraceCheckUtils]: 24: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3682#false} is VALID [2018-11-23 11:59:15,115 INFO L273 TraceCheckUtils]: 25: Hoare triple {3682#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3682#false} is VALID [2018-11-23 11:59:15,115 INFO L273 TraceCheckUtils]: 26: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3682#false} is VALID [2018-11-23 11:59:15,115 INFO L273 TraceCheckUtils]: 27: Hoare triple {3682#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3682#false} is VALID [2018-11-23 11:59:15,115 INFO L273 TraceCheckUtils]: 28: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3682#false} is VALID [2018-11-23 11:59:15,116 INFO L273 TraceCheckUtils]: 29: Hoare triple {3682#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3682#false} is VALID [2018-11-23 11:59:15,116 INFO L273 TraceCheckUtils]: 30: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3682#false} is VALID [2018-11-23 11:59:15,116 INFO L273 TraceCheckUtils]: 31: Hoare triple {3682#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3682#false} is VALID [2018-11-23 11:59:15,116 INFO L273 TraceCheckUtils]: 32: Hoare triple {3682#false} assume !(~i~0 < 100000); {3682#false} is VALID [2018-11-23 11:59:15,116 INFO L273 TraceCheckUtils]: 33: Hoare triple {3682#false} ~i~0 := 0; {3682#false} is VALID [2018-11-23 11:59:15,117 INFO L273 TraceCheckUtils]: 34: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3682#false} is VALID [2018-11-23 11:59:15,117 INFO L273 TraceCheckUtils]: 35: Hoare triple {3682#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3682#false} is VALID [2018-11-23 11:59:15,117 INFO L273 TraceCheckUtils]: 36: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3682#false} is VALID [2018-11-23 11:59:15,117 INFO L273 TraceCheckUtils]: 37: Hoare triple {3682#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3682#false} is VALID [2018-11-23 11:59:15,117 INFO L273 TraceCheckUtils]: 38: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3682#false} is VALID [2018-11-23 11:59:15,118 INFO L273 TraceCheckUtils]: 39: Hoare triple {3682#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3682#false} is VALID [2018-11-23 11:59:15,118 INFO L273 TraceCheckUtils]: 40: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3682#false} is VALID [2018-11-23 11:59:15,118 INFO L273 TraceCheckUtils]: 41: Hoare triple {3682#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3682#false} is VALID [2018-11-23 11:59:15,118 INFO L273 TraceCheckUtils]: 42: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3682#false} is VALID [2018-11-23 11:59:15,118 INFO L273 TraceCheckUtils]: 43: Hoare triple {3682#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3682#false} is VALID [2018-11-23 11:59:15,118 INFO L273 TraceCheckUtils]: 44: Hoare triple {3682#false} assume !(~i~0 < 100000); {3682#false} is VALID [2018-11-23 11:59:15,118 INFO L273 TraceCheckUtils]: 45: Hoare triple {3682#false} ~i~0 := 0; {3682#false} is VALID [2018-11-23 11:59:15,118 INFO L273 TraceCheckUtils]: 46: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {3682#false} is VALID [2018-11-23 11:59:15,119 INFO L273 TraceCheckUtils]: 47: Hoare triple {3682#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3682#false} is VALID [2018-11-23 11:59:15,119 INFO L273 TraceCheckUtils]: 48: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {3682#false} is VALID [2018-11-23 11:59:15,119 INFO L273 TraceCheckUtils]: 49: Hoare triple {3682#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3682#false} is VALID [2018-11-23 11:59:15,119 INFO L273 TraceCheckUtils]: 50: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {3682#false} is VALID [2018-11-23 11:59:15,119 INFO L273 TraceCheckUtils]: 51: Hoare triple {3682#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3682#false} is VALID [2018-11-23 11:59:15,119 INFO L273 TraceCheckUtils]: 52: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {3682#false} is VALID [2018-11-23 11:59:15,119 INFO L273 TraceCheckUtils]: 53: Hoare triple {3682#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3682#false} is VALID [2018-11-23 11:59:15,119 INFO L273 TraceCheckUtils]: 54: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {3682#false} is VALID [2018-11-23 11:59:15,119 INFO L273 TraceCheckUtils]: 55: Hoare triple {3682#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3682#false} is VALID [2018-11-23 11:59:15,120 INFO L273 TraceCheckUtils]: 56: Hoare triple {3682#false} assume !(~i~0 < 100000); {3682#false} is VALID [2018-11-23 11:59:15,120 INFO L273 TraceCheckUtils]: 57: Hoare triple {3682#false} ~i~0 := 0; {3682#false} is VALID [2018-11-23 11:59:15,120 INFO L273 TraceCheckUtils]: 58: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {3682#false} is VALID [2018-11-23 11:59:15,120 INFO L273 TraceCheckUtils]: 59: Hoare triple {3682#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3682#false} is VALID [2018-11-23 11:59:15,120 INFO L273 TraceCheckUtils]: 60: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {3682#false} is VALID [2018-11-23 11:59:15,120 INFO L273 TraceCheckUtils]: 61: Hoare triple {3682#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3682#false} is VALID [2018-11-23 11:59:15,120 INFO L273 TraceCheckUtils]: 62: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {3682#false} is VALID [2018-11-23 11:59:15,121 INFO L273 TraceCheckUtils]: 63: Hoare triple {3682#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3682#false} is VALID [2018-11-23 11:59:15,121 INFO L273 TraceCheckUtils]: 64: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {3682#false} is VALID [2018-11-23 11:59:15,121 INFO L273 TraceCheckUtils]: 65: Hoare triple {3682#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3682#false} is VALID [2018-11-23 11:59:15,121 INFO L273 TraceCheckUtils]: 66: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {3682#false} is VALID [2018-11-23 11:59:15,121 INFO L273 TraceCheckUtils]: 67: Hoare triple {3682#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3682#false} is VALID [2018-11-23 11:59:15,121 INFO L273 TraceCheckUtils]: 68: Hoare triple {3682#false} assume !(~i~0 < 100000); {3682#false} is VALID [2018-11-23 11:59:15,121 INFO L273 TraceCheckUtils]: 69: Hoare triple {3682#false} havoc ~x~0;~x~0 := 0; {3682#false} is VALID [2018-11-23 11:59:15,121 INFO L273 TraceCheckUtils]: 70: Hoare triple {3682#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {3682#false} is VALID [2018-11-23 11:59:15,122 INFO L256 TraceCheckUtils]: 71: Hoare triple {3682#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {3682#false} is VALID [2018-11-23 11:59:15,122 INFO L273 TraceCheckUtils]: 72: Hoare triple {3682#false} ~cond := #in~cond; {3682#false} is VALID [2018-11-23 11:59:15,122 INFO L273 TraceCheckUtils]: 73: Hoare triple {3682#false} assume 0 == ~cond; {3682#false} is VALID [2018-11-23 11:59:15,122 INFO L273 TraceCheckUtils]: 74: Hoare triple {3682#false} assume !false; {3682#false} is VALID [2018-11-23 11:59:15,124 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 11:59:15,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:15,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 11:59:15,145 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2018-11-23 11:59:15,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:15,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:59:15,193 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:15,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:59:15,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:59:15,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:59:15,194 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 11 states. [2018-11-23 11:59:15,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:15,491 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2018-11-23 11:59:15,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:59:15,491 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2018-11-23 11:59:15,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:15,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:59:15,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2018-11-23 11:59:15,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:59:15,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2018-11-23 11:59:15,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 80 transitions. [2018-11-23 11:59:15,609 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:15,611 INFO L225 Difference]: With dead ends: 142 [2018-11-23 11:59:15,612 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 11:59:15,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:59:15,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 11:59:15,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-11-23 11:59:15,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:15,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 82 states. [2018-11-23 11:59:15,700 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 82 states. [2018-11-23 11:59:15,700 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 82 states. [2018-11-23 11:59:15,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:15,703 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2018-11-23 11:59:15,703 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-11-23 11:59:15,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:15,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:15,704 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 83 states. [2018-11-23 11:59:15,704 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 83 states. [2018-11-23 11:59:15,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:15,706 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2018-11-23 11:59:15,706 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-11-23 11:59:15,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:15,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:15,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:15,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:15,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 11:59:15,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2018-11-23 11:59:15,708 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 75 [2018-11-23 11:59:15,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:15,708 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2018-11-23 11:59:15,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:59:15,708 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2018-11-23 11:59:15,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 11:59:15,709 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:15,709 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 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:59:15,709 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:15,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:15,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1197147766, now seen corresponding path program 8 times [2018-11-23 11:59:15,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:15,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:15,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:15,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:15,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:15,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:16,474 INFO L256 TraceCheckUtils]: 0: Hoare triple {4413#true} call ULTIMATE.init(); {4413#true} is VALID [2018-11-23 11:59:16,474 INFO L273 TraceCheckUtils]: 1: Hoare triple {4413#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4413#true} is VALID [2018-11-23 11:59:16,474 INFO L273 TraceCheckUtils]: 2: Hoare triple {4413#true} assume true; {4413#true} is VALID [2018-11-23 11:59:16,475 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4413#true} {4413#true} #105#return; {4413#true} is VALID [2018-11-23 11:59:16,475 INFO L256 TraceCheckUtils]: 4: Hoare triple {4413#true} call #t~ret13 := main(); {4413#true} is VALID [2018-11-23 11:59:16,476 INFO L273 TraceCheckUtils]: 5: Hoare triple {4413#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);havoc ~a~0;~a~0 := 0; {4415#(= main_~a~0 0)} is VALID [2018-11-23 11:59:16,476 INFO L273 TraceCheckUtils]: 6: Hoare triple {4415#(= 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; {4415#(= main_~a~0 0)} is VALID [2018-11-23 11:59:16,477 INFO L273 TraceCheckUtils]: 7: Hoare triple {4415#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4416#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:16,477 INFO L273 TraceCheckUtils]: 8: Hoare triple {4416#(<= 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; {4416#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:16,478 INFO L273 TraceCheckUtils]: 9: Hoare triple {4416#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4417#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:16,478 INFO L273 TraceCheckUtils]: 10: Hoare triple {4417#(<= 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; {4417#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:16,496 INFO L273 TraceCheckUtils]: 11: Hoare triple {4417#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4418#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:16,505 INFO L273 TraceCheckUtils]: 12: Hoare triple {4418#(<= 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; {4418#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:16,513 INFO L273 TraceCheckUtils]: 13: Hoare triple {4418#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4419#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:16,514 INFO L273 TraceCheckUtils]: 14: Hoare triple {4419#(<= 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; {4419#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:16,515 INFO L273 TraceCheckUtils]: 15: Hoare triple {4419#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4420#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:16,515 INFO L273 TraceCheckUtils]: 16: Hoare triple {4420#(<= 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; {4420#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:16,515 INFO L273 TraceCheckUtils]: 17: Hoare triple {4420#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4421#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:16,516 INFO L273 TraceCheckUtils]: 18: Hoare triple {4421#(<= 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; {4421#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:16,516 INFO L273 TraceCheckUtils]: 19: Hoare triple {4421#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4422#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:16,516 INFO L273 TraceCheckUtils]: 20: Hoare triple {4422#(<= 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; {4422#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:16,517 INFO L273 TraceCheckUtils]: 21: Hoare triple {4422#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4423#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:16,518 INFO L273 TraceCheckUtils]: 22: Hoare triple {4423#(<= main_~a~0 8)} assume !(~a~0 < 100000); {4414#false} is VALID [2018-11-23 11:59:16,518 INFO L273 TraceCheckUtils]: 23: Hoare triple {4414#false} havoc ~i~0;~i~0 := 0; {4414#false} is VALID [2018-11-23 11:59:16,518 INFO L273 TraceCheckUtils]: 24: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4414#false} is VALID [2018-11-23 11:59:16,518 INFO L273 TraceCheckUtils]: 25: Hoare triple {4414#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4414#false} is VALID [2018-11-23 11:59:16,518 INFO L273 TraceCheckUtils]: 26: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4414#false} is VALID [2018-11-23 11:59:16,519 INFO L273 TraceCheckUtils]: 27: Hoare triple {4414#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4414#false} is VALID [2018-11-23 11:59:16,519 INFO L273 TraceCheckUtils]: 28: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4414#false} is VALID [2018-11-23 11:59:16,519 INFO L273 TraceCheckUtils]: 29: Hoare triple {4414#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4414#false} is VALID [2018-11-23 11:59:16,519 INFO L273 TraceCheckUtils]: 30: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4414#false} is VALID [2018-11-23 11:59:16,520 INFO L273 TraceCheckUtils]: 31: Hoare triple {4414#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4414#false} is VALID [2018-11-23 11:59:16,520 INFO L273 TraceCheckUtils]: 32: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4414#false} is VALID [2018-11-23 11:59:16,520 INFO L273 TraceCheckUtils]: 33: Hoare triple {4414#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4414#false} is VALID [2018-11-23 11:59:16,520 INFO L273 TraceCheckUtils]: 34: Hoare triple {4414#false} assume !(~i~0 < 100000); {4414#false} is VALID [2018-11-23 11:59:16,520 INFO L273 TraceCheckUtils]: 35: Hoare triple {4414#false} ~i~0 := 0; {4414#false} is VALID [2018-11-23 11:59:16,521 INFO L273 TraceCheckUtils]: 36: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4414#false} is VALID [2018-11-23 11:59:16,521 INFO L273 TraceCheckUtils]: 37: Hoare triple {4414#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4414#false} is VALID [2018-11-23 11:59:16,521 INFO L273 TraceCheckUtils]: 38: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4414#false} is VALID [2018-11-23 11:59:16,521 INFO L273 TraceCheckUtils]: 39: Hoare triple {4414#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4414#false} is VALID [2018-11-23 11:59:16,521 INFO L273 TraceCheckUtils]: 40: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4414#false} is VALID [2018-11-23 11:59:16,522 INFO L273 TraceCheckUtils]: 41: Hoare triple {4414#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4414#false} is VALID [2018-11-23 11:59:16,522 INFO L273 TraceCheckUtils]: 42: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4414#false} is VALID [2018-11-23 11:59:16,522 INFO L273 TraceCheckUtils]: 43: Hoare triple {4414#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4414#false} is VALID [2018-11-23 11:59:16,522 INFO L273 TraceCheckUtils]: 44: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4414#false} is VALID [2018-11-23 11:59:16,522 INFO L273 TraceCheckUtils]: 45: Hoare triple {4414#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4414#false} is VALID [2018-11-23 11:59:16,525 INFO L273 TraceCheckUtils]: 46: Hoare triple {4414#false} assume !(~i~0 < 100000); {4414#false} is VALID [2018-11-23 11:59:16,525 INFO L273 TraceCheckUtils]: 47: Hoare triple {4414#false} ~i~0 := 0; {4414#false} is VALID [2018-11-23 11:59:16,525 INFO L273 TraceCheckUtils]: 48: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {4414#false} is VALID [2018-11-23 11:59:16,525 INFO L273 TraceCheckUtils]: 49: Hoare triple {4414#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4414#false} is VALID [2018-11-23 11:59:16,525 INFO L273 TraceCheckUtils]: 50: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {4414#false} is VALID [2018-11-23 11:59:16,526 INFO L273 TraceCheckUtils]: 51: Hoare triple {4414#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4414#false} is VALID [2018-11-23 11:59:16,526 INFO L273 TraceCheckUtils]: 52: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {4414#false} is VALID [2018-11-23 11:59:16,526 INFO L273 TraceCheckUtils]: 53: Hoare triple {4414#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4414#false} is VALID [2018-11-23 11:59:16,526 INFO L273 TraceCheckUtils]: 54: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {4414#false} is VALID [2018-11-23 11:59:16,526 INFO L273 TraceCheckUtils]: 55: Hoare triple {4414#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4414#false} is VALID [2018-11-23 11:59:16,526 INFO L273 TraceCheckUtils]: 56: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {4414#false} is VALID [2018-11-23 11:59:16,527 INFO L273 TraceCheckUtils]: 57: Hoare triple {4414#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4414#false} is VALID [2018-11-23 11:59:16,527 INFO L273 TraceCheckUtils]: 58: Hoare triple {4414#false} assume !(~i~0 < 100000); {4414#false} is VALID [2018-11-23 11:59:16,527 INFO L273 TraceCheckUtils]: 59: Hoare triple {4414#false} ~i~0 := 0; {4414#false} is VALID [2018-11-23 11:59:16,527 INFO L273 TraceCheckUtils]: 60: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {4414#false} is VALID [2018-11-23 11:59:16,527 INFO L273 TraceCheckUtils]: 61: Hoare triple {4414#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4414#false} is VALID [2018-11-23 11:59:16,527 INFO L273 TraceCheckUtils]: 62: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {4414#false} is VALID [2018-11-23 11:59:16,528 INFO L273 TraceCheckUtils]: 63: Hoare triple {4414#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4414#false} is VALID [2018-11-23 11:59:16,528 INFO L273 TraceCheckUtils]: 64: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {4414#false} is VALID [2018-11-23 11:59:16,528 INFO L273 TraceCheckUtils]: 65: Hoare triple {4414#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4414#false} is VALID [2018-11-23 11:59:16,528 INFO L273 TraceCheckUtils]: 66: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {4414#false} is VALID [2018-11-23 11:59:16,528 INFO L273 TraceCheckUtils]: 67: Hoare triple {4414#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4414#false} is VALID [2018-11-23 11:59:16,528 INFO L273 TraceCheckUtils]: 68: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {4414#false} is VALID [2018-11-23 11:59:16,529 INFO L273 TraceCheckUtils]: 69: Hoare triple {4414#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4414#false} is VALID [2018-11-23 11:59:16,529 INFO L273 TraceCheckUtils]: 70: Hoare triple {4414#false} assume !(~i~0 < 100000); {4414#false} is VALID [2018-11-23 11:59:16,529 INFO L273 TraceCheckUtils]: 71: Hoare triple {4414#false} havoc ~x~0;~x~0 := 0; {4414#false} is VALID [2018-11-23 11:59:16,529 INFO L273 TraceCheckUtils]: 72: Hoare triple {4414#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {4414#false} is VALID [2018-11-23 11:59:16,529 INFO L256 TraceCheckUtils]: 73: Hoare triple {4414#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {4414#false} is VALID [2018-11-23 11:59:16,529 INFO L273 TraceCheckUtils]: 74: Hoare triple {4414#false} ~cond := #in~cond; {4414#false} is VALID [2018-11-23 11:59:16,530 INFO L273 TraceCheckUtils]: 75: Hoare triple {4414#false} assume 0 == ~cond; {4414#false} is VALID [2018-11-23 11:59:16,530 INFO L273 TraceCheckUtils]: 76: Hoare triple {4414#false} assume !false; {4414#false} is VALID [2018-11-23 11:59:16,533 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 11:59:16,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:16,534 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:59:16,545 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:59:16,583 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:59:16,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:16,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:16,774 INFO L256 TraceCheckUtils]: 0: Hoare triple {4413#true} call ULTIMATE.init(); {4413#true} is VALID [2018-11-23 11:59:16,774 INFO L273 TraceCheckUtils]: 1: Hoare triple {4413#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4413#true} is VALID [2018-11-23 11:59:16,775 INFO L273 TraceCheckUtils]: 2: Hoare triple {4413#true} assume true; {4413#true} is VALID [2018-11-23 11:59:16,775 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4413#true} {4413#true} #105#return; {4413#true} is VALID [2018-11-23 11:59:16,775 INFO L256 TraceCheckUtils]: 4: Hoare triple {4413#true} call #t~ret13 := main(); {4413#true} is VALID [2018-11-23 11:59:16,776 INFO L273 TraceCheckUtils]: 5: Hoare triple {4413#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);havoc ~a~0;~a~0 := 0; {4442#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:16,777 INFO L273 TraceCheckUtils]: 6: Hoare triple {4442#(<= 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; {4442#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:16,778 INFO L273 TraceCheckUtils]: 7: Hoare triple {4442#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4416#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:16,778 INFO L273 TraceCheckUtils]: 8: Hoare triple {4416#(<= 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; {4416#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:16,779 INFO L273 TraceCheckUtils]: 9: Hoare triple {4416#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4417#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:16,780 INFO L273 TraceCheckUtils]: 10: Hoare triple {4417#(<= 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; {4417#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:16,780 INFO L273 TraceCheckUtils]: 11: Hoare triple {4417#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4418#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:16,781 INFO L273 TraceCheckUtils]: 12: Hoare triple {4418#(<= 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; {4418#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:16,782 INFO L273 TraceCheckUtils]: 13: Hoare triple {4418#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4419#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:16,782 INFO L273 TraceCheckUtils]: 14: Hoare triple {4419#(<= 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; {4419#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:16,783 INFO L273 TraceCheckUtils]: 15: Hoare triple {4419#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4420#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:16,784 INFO L273 TraceCheckUtils]: 16: Hoare triple {4420#(<= 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; {4420#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:16,784 INFO L273 TraceCheckUtils]: 17: Hoare triple {4420#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4421#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:16,785 INFO L273 TraceCheckUtils]: 18: Hoare triple {4421#(<= 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; {4421#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:16,803 INFO L273 TraceCheckUtils]: 19: Hoare triple {4421#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4422#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:16,818 INFO L273 TraceCheckUtils]: 20: Hoare triple {4422#(<= 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; {4422#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:16,827 INFO L273 TraceCheckUtils]: 21: Hoare triple {4422#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4423#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:16,828 INFO L273 TraceCheckUtils]: 22: Hoare triple {4423#(<= main_~a~0 8)} assume !(~a~0 < 100000); {4414#false} is VALID [2018-11-23 11:59:16,828 INFO L273 TraceCheckUtils]: 23: Hoare triple {4414#false} havoc ~i~0;~i~0 := 0; {4414#false} is VALID [2018-11-23 11:59:16,828 INFO L273 TraceCheckUtils]: 24: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4414#false} is VALID [2018-11-23 11:59:16,828 INFO L273 TraceCheckUtils]: 25: Hoare triple {4414#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4414#false} is VALID [2018-11-23 11:59:16,828 INFO L273 TraceCheckUtils]: 26: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4414#false} is VALID [2018-11-23 11:59:16,829 INFO L273 TraceCheckUtils]: 27: Hoare triple {4414#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4414#false} is VALID [2018-11-23 11:59:16,829 INFO L273 TraceCheckUtils]: 28: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4414#false} is VALID [2018-11-23 11:59:16,829 INFO L273 TraceCheckUtils]: 29: Hoare triple {4414#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4414#false} is VALID [2018-11-23 11:59:16,829 INFO L273 TraceCheckUtils]: 30: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4414#false} is VALID [2018-11-23 11:59:16,829 INFO L273 TraceCheckUtils]: 31: Hoare triple {4414#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4414#false} is VALID [2018-11-23 11:59:16,829 INFO L273 TraceCheckUtils]: 32: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4414#false} is VALID [2018-11-23 11:59:16,829 INFO L273 TraceCheckUtils]: 33: Hoare triple {4414#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4414#false} is VALID [2018-11-23 11:59:16,829 INFO L273 TraceCheckUtils]: 34: Hoare triple {4414#false} assume !(~i~0 < 100000); {4414#false} is VALID [2018-11-23 11:59:16,830 INFO L273 TraceCheckUtils]: 35: Hoare triple {4414#false} ~i~0 := 0; {4414#false} is VALID [2018-11-23 11:59:16,830 INFO L273 TraceCheckUtils]: 36: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4414#false} is VALID [2018-11-23 11:59:16,830 INFO L273 TraceCheckUtils]: 37: Hoare triple {4414#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4414#false} is VALID [2018-11-23 11:59:16,830 INFO L273 TraceCheckUtils]: 38: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4414#false} is VALID [2018-11-23 11:59:16,830 INFO L273 TraceCheckUtils]: 39: Hoare triple {4414#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4414#false} is VALID [2018-11-23 11:59:16,830 INFO L273 TraceCheckUtils]: 40: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4414#false} is VALID [2018-11-23 11:59:16,830 INFO L273 TraceCheckUtils]: 41: Hoare triple {4414#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4414#false} is VALID [2018-11-23 11:59:16,830 INFO L273 TraceCheckUtils]: 42: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4414#false} is VALID [2018-11-23 11:59:16,831 INFO L273 TraceCheckUtils]: 43: Hoare triple {4414#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4414#false} is VALID [2018-11-23 11:59:16,831 INFO L273 TraceCheckUtils]: 44: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4414#false} is VALID [2018-11-23 11:59:16,831 INFO L273 TraceCheckUtils]: 45: Hoare triple {4414#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4414#false} is VALID [2018-11-23 11:59:16,831 INFO L273 TraceCheckUtils]: 46: Hoare triple {4414#false} assume !(~i~0 < 100000); {4414#false} is VALID [2018-11-23 11:59:16,831 INFO L273 TraceCheckUtils]: 47: Hoare triple {4414#false} ~i~0 := 0; {4414#false} is VALID [2018-11-23 11:59:16,831 INFO L273 TraceCheckUtils]: 48: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {4414#false} is VALID [2018-11-23 11:59:16,831 INFO L273 TraceCheckUtils]: 49: Hoare triple {4414#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4414#false} is VALID [2018-11-23 11:59:16,831 INFO L273 TraceCheckUtils]: 50: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {4414#false} is VALID [2018-11-23 11:59:16,832 INFO L273 TraceCheckUtils]: 51: Hoare triple {4414#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4414#false} is VALID [2018-11-23 11:59:16,832 INFO L273 TraceCheckUtils]: 52: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {4414#false} is VALID [2018-11-23 11:59:16,832 INFO L273 TraceCheckUtils]: 53: Hoare triple {4414#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4414#false} is VALID [2018-11-23 11:59:16,832 INFO L273 TraceCheckUtils]: 54: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {4414#false} is VALID [2018-11-23 11:59:16,832 INFO L273 TraceCheckUtils]: 55: Hoare triple {4414#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4414#false} is VALID [2018-11-23 11:59:16,832 INFO L273 TraceCheckUtils]: 56: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {4414#false} is VALID [2018-11-23 11:59:16,832 INFO L273 TraceCheckUtils]: 57: Hoare triple {4414#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4414#false} is VALID [2018-11-23 11:59:16,832 INFO L273 TraceCheckUtils]: 58: Hoare triple {4414#false} assume !(~i~0 < 100000); {4414#false} is VALID [2018-11-23 11:59:16,833 INFO L273 TraceCheckUtils]: 59: Hoare triple {4414#false} ~i~0 := 0; {4414#false} is VALID [2018-11-23 11:59:16,833 INFO L273 TraceCheckUtils]: 60: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {4414#false} is VALID [2018-11-23 11:59:16,833 INFO L273 TraceCheckUtils]: 61: Hoare triple {4414#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4414#false} is VALID [2018-11-23 11:59:16,833 INFO L273 TraceCheckUtils]: 62: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {4414#false} is VALID [2018-11-23 11:59:16,833 INFO L273 TraceCheckUtils]: 63: Hoare triple {4414#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4414#false} is VALID [2018-11-23 11:59:16,833 INFO L273 TraceCheckUtils]: 64: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {4414#false} is VALID [2018-11-23 11:59:16,833 INFO L273 TraceCheckUtils]: 65: Hoare triple {4414#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4414#false} is VALID [2018-11-23 11:59:16,833 INFO L273 TraceCheckUtils]: 66: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {4414#false} is VALID [2018-11-23 11:59:16,833 INFO L273 TraceCheckUtils]: 67: Hoare triple {4414#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4414#false} is VALID [2018-11-23 11:59:16,834 INFO L273 TraceCheckUtils]: 68: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {4414#false} is VALID [2018-11-23 11:59:16,834 INFO L273 TraceCheckUtils]: 69: Hoare triple {4414#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4414#false} is VALID [2018-11-23 11:59:16,834 INFO L273 TraceCheckUtils]: 70: Hoare triple {4414#false} assume !(~i~0 < 100000); {4414#false} is VALID [2018-11-23 11:59:16,834 INFO L273 TraceCheckUtils]: 71: Hoare triple {4414#false} havoc ~x~0;~x~0 := 0; {4414#false} is VALID [2018-11-23 11:59:16,834 INFO L273 TraceCheckUtils]: 72: Hoare triple {4414#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {4414#false} is VALID [2018-11-23 11:59:16,834 INFO L256 TraceCheckUtils]: 73: Hoare triple {4414#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {4414#false} is VALID [2018-11-23 11:59:16,834 INFO L273 TraceCheckUtils]: 74: Hoare triple {4414#false} ~cond := #in~cond; {4414#false} is VALID [2018-11-23 11:59:16,834 INFO L273 TraceCheckUtils]: 75: Hoare triple {4414#false} assume 0 == ~cond; {4414#false} is VALID [2018-11-23 11:59:16,835 INFO L273 TraceCheckUtils]: 76: Hoare triple {4414#false} assume !false; {4414#false} is VALID [2018-11-23 11:59:16,839 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 11:59:16,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:16,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 11:59:16,859 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 77 [2018-11-23 11:59:16,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:16,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:59:16,911 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:16,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:59:16,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:59:16,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:59:16,912 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 12 states. [2018-11-23 11:59:17,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:17,248 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2018-11-23 11:59:17,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:59:17,248 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 77 [2018-11-23 11:59:17,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:17,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:59:17,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2018-11-23 11:59:17,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:59:17,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2018-11-23 11:59:17,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 82 transitions. [2018-11-23 11:59:17,376 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:59:17,378 INFO L225 Difference]: With dead ends: 144 [2018-11-23 11:59:17,379 INFO L226 Difference]: Without dead ends: 85 [2018-11-23 11:59:17,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:59:17,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-23 11:59:17,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-11-23 11:59:17,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:17,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 84 states. [2018-11-23 11:59:17,420 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 84 states. [2018-11-23 11:59:17,420 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 84 states. [2018-11-23 11:59:17,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:17,423 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-11-23 11:59:17,424 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-11-23 11:59:17,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:17,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:17,425 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 85 states. [2018-11-23 11:59:17,425 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 85 states. [2018-11-23 11:59:17,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:17,427 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-11-23 11:59:17,427 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-11-23 11:59:17,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:17,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:17,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:17,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:17,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 11:59:17,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-11-23 11:59:17,430 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 77 [2018-11-23 11:59:17,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:17,431 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-11-23 11:59:17,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:59:17,431 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-11-23 11:59:17,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 11:59:17,432 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:17,432 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 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:59:17,432 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:17,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:17,433 INFO L82 PathProgramCache]: Analyzing trace with hash -729412440, now seen corresponding path program 9 times [2018-11-23 11:59:17,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:17,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:17,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:17,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:17,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:17,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:17,712 INFO L256 TraceCheckUtils]: 0: Hoare triple {5162#true} call ULTIMATE.init(); {5162#true} is VALID [2018-11-23 11:59:17,713 INFO L273 TraceCheckUtils]: 1: Hoare triple {5162#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5162#true} is VALID [2018-11-23 11:59:17,713 INFO L273 TraceCheckUtils]: 2: Hoare triple {5162#true} assume true; {5162#true} is VALID [2018-11-23 11:59:17,713 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5162#true} {5162#true} #105#return; {5162#true} is VALID [2018-11-23 11:59:17,714 INFO L256 TraceCheckUtils]: 4: Hoare triple {5162#true} call #t~ret13 := main(); {5162#true} is VALID [2018-11-23 11:59:17,714 INFO L273 TraceCheckUtils]: 5: Hoare triple {5162#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);havoc ~a~0;~a~0 := 0; {5164#(= main_~a~0 0)} is VALID [2018-11-23 11:59:17,715 INFO L273 TraceCheckUtils]: 6: Hoare triple {5164#(= 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; {5164#(= main_~a~0 0)} is VALID [2018-11-23 11:59:17,715 INFO L273 TraceCheckUtils]: 7: Hoare triple {5164#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5165#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:17,715 INFO L273 TraceCheckUtils]: 8: Hoare triple {5165#(<= 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; {5165#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:17,716 INFO L273 TraceCheckUtils]: 9: Hoare triple {5165#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5166#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:17,716 INFO L273 TraceCheckUtils]: 10: Hoare triple {5166#(<= 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; {5166#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:17,717 INFO L273 TraceCheckUtils]: 11: Hoare triple {5166#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5167#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:17,717 INFO L273 TraceCheckUtils]: 12: Hoare triple {5167#(<= 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; {5167#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:17,718 INFO L273 TraceCheckUtils]: 13: Hoare triple {5167#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5168#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:17,719 INFO L273 TraceCheckUtils]: 14: Hoare triple {5168#(<= 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; {5168#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:17,720 INFO L273 TraceCheckUtils]: 15: Hoare triple {5168#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5169#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:17,720 INFO L273 TraceCheckUtils]: 16: Hoare triple {5169#(<= 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; {5169#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:17,721 INFO L273 TraceCheckUtils]: 17: Hoare triple {5169#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5170#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:17,722 INFO L273 TraceCheckUtils]: 18: Hoare triple {5170#(<= 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; {5170#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:17,723 INFO L273 TraceCheckUtils]: 19: Hoare triple {5170#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5171#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:17,723 INFO L273 TraceCheckUtils]: 20: Hoare triple {5171#(<= 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; {5171#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:17,724 INFO L273 TraceCheckUtils]: 21: Hoare triple {5171#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5172#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:17,725 INFO L273 TraceCheckUtils]: 22: Hoare triple {5172#(<= 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; {5172#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:17,726 INFO L273 TraceCheckUtils]: 23: Hoare triple {5172#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5173#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:17,727 INFO L273 TraceCheckUtils]: 24: Hoare triple {5173#(<= main_~a~0 9)} assume !(~a~0 < 100000); {5163#false} is VALID [2018-11-23 11:59:17,727 INFO L273 TraceCheckUtils]: 25: Hoare triple {5163#false} havoc ~i~0;~i~0 := 0; {5163#false} is VALID [2018-11-23 11:59:17,727 INFO L273 TraceCheckUtils]: 26: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5163#false} is VALID [2018-11-23 11:59:17,728 INFO L273 TraceCheckUtils]: 27: Hoare triple {5163#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5163#false} is VALID [2018-11-23 11:59:17,728 INFO L273 TraceCheckUtils]: 28: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5163#false} is VALID [2018-11-23 11:59:17,728 INFO L273 TraceCheckUtils]: 29: Hoare triple {5163#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5163#false} is VALID [2018-11-23 11:59:17,728 INFO L273 TraceCheckUtils]: 30: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5163#false} is VALID [2018-11-23 11:59:17,729 INFO L273 TraceCheckUtils]: 31: Hoare triple {5163#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5163#false} is VALID [2018-11-23 11:59:17,729 INFO L273 TraceCheckUtils]: 32: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5163#false} is VALID [2018-11-23 11:59:17,729 INFO L273 TraceCheckUtils]: 33: Hoare triple {5163#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5163#false} is VALID [2018-11-23 11:59:17,729 INFO L273 TraceCheckUtils]: 34: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5163#false} is VALID [2018-11-23 11:59:17,729 INFO L273 TraceCheckUtils]: 35: Hoare triple {5163#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5163#false} is VALID [2018-11-23 11:59:17,730 INFO L273 TraceCheckUtils]: 36: Hoare triple {5163#false} assume !(~i~0 < 100000); {5163#false} is VALID [2018-11-23 11:59:17,730 INFO L273 TraceCheckUtils]: 37: Hoare triple {5163#false} ~i~0 := 0; {5163#false} is VALID [2018-11-23 11:59:17,730 INFO L273 TraceCheckUtils]: 38: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5163#false} is VALID [2018-11-23 11:59:17,730 INFO L273 TraceCheckUtils]: 39: Hoare triple {5163#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5163#false} is VALID [2018-11-23 11:59:17,730 INFO L273 TraceCheckUtils]: 40: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5163#false} is VALID [2018-11-23 11:59:17,731 INFO L273 TraceCheckUtils]: 41: Hoare triple {5163#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5163#false} is VALID [2018-11-23 11:59:17,731 INFO L273 TraceCheckUtils]: 42: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5163#false} is VALID [2018-11-23 11:59:17,731 INFO L273 TraceCheckUtils]: 43: Hoare triple {5163#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5163#false} is VALID [2018-11-23 11:59:17,731 INFO L273 TraceCheckUtils]: 44: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5163#false} is VALID [2018-11-23 11:59:17,731 INFO L273 TraceCheckUtils]: 45: Hoare triple {5163#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5163#false} is VALID [2018-11-23 11:59:17,731 INFO L273 TraceCheckUtils]: 46: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5163#false} is VALID [2018-11-23 11:59:17,732 INFO L273 TraceCheckUtils]: 47: Hoare triple {5163#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5163#false} is VALID [2018-11-23 11:59:17,732 INFO L273 TraceCheckUtils]: 48: Hoare triple {5163#false} assume !(~i~0 < 100000); {5163#false} is VALID [2018-11-23 11:59:17,732 INFO L273 TraceCheckUtils]: 49: Hoare triple {5163#false} ~i~0 := 0; {5163#false} is VALID [2018-11-23 11:59:17,732 INFO L273 TraceCheckUtils]: 50: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {5163#false} is VALID [2018-11-23 11:59:17,732 INFO L273 TraceCheckUtils]: 51: Hoare triple {5163#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5163#false} is VALID [2018-11-23 11:59:17,732 INFO L273 TraceCheckUtils]: 52: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {5163#false} is VALID [2018-11-23 11:59:17,732 INFO L273 TraceCheckUtils]: 53: Hoare triple {5163#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5163#false} is VALID [2018-11-23 11:59:17,733 INFO L273 TraceCheckUtils]: 54: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {5163#false} is VALID [2018-11-23 11:59:17,733 INFO L273 TraceCheckUtils]: 55: Hoare triple {5163#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5163#false} is VALID [2018-11-23 11:59:17,733 INFO L273 TraceCheckUtils]: 56: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {5163#false} is VALID [2018-11-23 11:59:17,733 INFO L273 TraceCheckUtils]: 57: Hoare triple {5163#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5163#false} is VALID [2018-11-23 11:59:17,733 INFO L273 TraceCheckUtils]: 58: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {5163#false} is VALID [2018-11-23 11:59:17,733 INFO L273 TraceCheckUtils]: 59: Hoare triple {5163#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5163#false} is VALID [2018-11-23 11:59:17,733 INFO L273 TraceCheckUtils]: 60: Hoare triple {5163#false} assume !(~i~0 < 100000); {5163#false} is VALID [2018-11-23 11:59:17,734 INFO L273 TraceCheckUtils]: 61: Hoare triple {5163#false} ~i~0 := 0; {5163#false} is VALID [2018-11-23 11:59:17,734 INFO L273 TraceCheckUtils]: 62: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {5163#false} is VALID [2018-11-23 11:59:17,734 INFO L273 TraceCheckUtils]: 63: Hoare triple {5163#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5163#false} is VALID [2018-11-23 11:59:17,734 INFO L273 TraceCheckUtils]: 64: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {5163#false} is VALID [2018-11-23 11:59:17,734 INFO L273 TraceCheckUtils]: 65: Hoare triple {5163#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5163#false} is VALID [2018-11-23 11:59:17,734 INFO L273 TraceCheckUtils]: 66: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {5163#false} is VALID [2018-11-23 11:59:17,735 INFO L273 TraceCheckUtils]: 67: Hoare triple {5163#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5163#false} is VALID [2018-11-23 11:59:17,735 INFO L273 TraceCheckUtils]: 68: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {5163#false} is VALID [2018-11-23 11:59:17,735 INFO L273 TraceCheckUtils]: 69: Hoare triple {5163#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5163#false} is VALID [2018-11-23 11:59:17,735 INFO L273 TraceCheckUtils]: 70: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {5163#false} is VALID [2018-11-23 11:59:17,735 INFO L273 TraceCheckUtils]: 71: Hoare triple {5163#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5163#false} is VALID [2018-11-23 11:59:17,735 INFO L273 TraceCheckUtils]: 72: Hoare triple {5163#false} assume !(~i~0 < 100000); {5163#false} is VALID [2018-11-23 11:59:17,735 INFO L273 TraceCheckUtils]: 73: Hoare triple {5163#false} havoc ~x~0;~x~0 := 0; {5163#false} is VALID [2018-11-23 11:59:17,736 INFO L273 TraceCheckUtils]: 74: Hoare triple {5163#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {5163#false} is VALID [2018-11-23 11:59:17,736 INFO L256 TraceCheckUtils]: 75: Hoare triple {5163#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {5163#false} is VALID [2018-11-23 11:59:17,736 INFO L273 TraceCheckUtils]: 76: Hoare triple {5163#false} ~cond := #in~cond; {5163#false} is VALID [2018-11-23 11:59:17,736 INFO L273 TraceCheckUtils]: 77: Hoare triple {5163#false} assume 0 == ~cond; {5163#false} is VALID [2018-11-23 11:59:17,736 INFO L273 TraceCheckUtils]: 78: Hoare triple {5163#false} assume !false; {5163#false} is VALID [2018-11-23 11:59:17,743 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 11:59:17,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:17,744 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:59:17,772 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:59:18,215 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 11:59:18,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:18,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:18,525 INFO L256 TraceCheckUtils]: 0: Hoare triple {5162#true} call ULTIMATE.init(); {5162#true} is VALID [2018-11-23 11:59:18,525 INFO L273 TraceCheckUtils]: 1: Hoare triple {5162#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5162#true} is VALID [2018-11-23 11:59:18,525 INFO L273 TraceCheckUtils]: 2: Hoare triple {5162#true} assume true; {5162#true} is VALID [2018-11-23 11:59:18,525 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5162#true} {5162#true} #105#return; {5162#true} is VALID [2018-11-23 11:59:18,526 INFO L256 TraceCheckUtils]: 4: Hoare triple {5162#true} call #t~ret13 := main(); {5162#true} is VALID [2018-11-23 11:59:18,526 INFO L273 TraceCheckUtils]: 5: Hoare triple {5162#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);havoc ~a~0;~a~0 := 0; {5162#true} is VALID [2018-11-23 11:59:18,526 INFO L273 TraceCheckUtils]: 6: Hoare triple {5162#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; {5162#true} is VALID [2018-11-23 11:59:18,526 INFO L273 TraceCheckUtils]: 7: Hoare triple {5162#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5162#true} is VALID [2018-11-23 11:59:18,526 INFO L273 TraceCheckUtils]: 8: Hoare triple {5162#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; {5162#true} is VALID [2018-11-23 11:59:18,527 INFO L273 TraceCheckUtils]: 9: Hoare triple {5162#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5162#true} is VALID [2018-11-23 11:59:18,527 INFO L273 TraceCheckUtils]: 10: Hoare triple {5162#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; {5162#true} is VALID [2018-11-23 11:59:18,527 INFO L273 TraceCheckUtils]: 11: Hoare triple {5162#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5162#true} is VALID [2018-11-23 11:59:18,527 INFO L273 TraceCheckUtils]: 12: Hoare triple {5162#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; {5162#true} is VALID [2018-11-23 11:59:18,527 INFO L273 TraceCheckUtils]: 13: Hoare triple {5162#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5162#true} is VALID [2018-11-23 11:59:18,528 INFO L273 TraceCheckUtils]: 14: Hoare triple {5162#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; {5162#true} is VALID [2018-11-23 11:59:18,528 INFO L273 TraceCheckUtils]: 15: Hoare triple {5162#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5162#true} is VALID [2018-11-23 11:59:18,528 INFO L273 TraceCheckUtils]: 16: Hoare triple {5162#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; {5162#true} is VALID [2018-11-23 11:59:18,528 INFO L273 TraceCheckUtils]: 17: Hoare triple {5162#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5162#true} is VALID [2018-11-23 11:59:18,528 INFO L273 TraceCheckUtils]: 18: Hoare triple {5162#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; {5162#true} is VALID [2018-11-23 11:59:18,528 INFO L273 TraceCheckUtils]: 19: Hoare triple {5162#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5162#true} is VALID [2018-11-23 11:59:18,528 INFO L273 TraceCheckUtils]: 20: Hoare triple {5162#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; {5162#true} is VALID [2018-11-23 11:59:18,529 INFO L273 TraceCheckUtils]: 21: Hoare triple {5162#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5162#true} is VALID [2018-11-23 11:59:18,529 INFO L273 TraceCheckUtils]: 22: Hoare triple {5162#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; {5162#true} is VALID [2018-11-23 11:59:18,529 INFO L273 TraceCheckUtils]: 23: Hoare triple {5162#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5162#true} is VALID [2018-11-23 11:59:18,529 INFO L273 TraceCheckUtils]: 24: Hoare triple {5162#true} assume !(~a~0 < 100000); {5162#true} is VALID [2018-11-23 11:59:18,529 INFO L273 TraceCheckUtils]: 25: Hoare triple {5162#true} havoc ~i~0;~i~0 := 0; {5162#true} is VALID [2018-11-23 11:59:18,529 INFO L273 TraceCheckUtils]: 26: Hoare triple {5162#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5162#true} is VALID [2018-11-23 11:59:18,529 INFO L273 TraceCheckUtils]: 27: Hoare triple {5162#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5162#true} is VALID [2018-11-23 11:59:18,529 INFO L273 TraceCheckUtils]: 28: Hoare triple {5162#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5162#true} is VALID [2018-11-23 11:59:18,529 INFO L273 TraceCheckUtils]: 29: Hoare triple {5162#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5162#true} is VALID [2018-11-23 11:59:18,530 INFO L273 TraceCheckUtils]: 30: Hoare triple {5162#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5162#true} is VALID [2018-11-23 11:59:18,530 INFO L273 TraceCheckUtils]: 31: Hoare triple {5162#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5162#true} is VALID [2018-11-23 11:59:18,530 INFO L273 TraceCheckUtils]: 32: Hoare triple {5162#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5162#true} is VALID [2018-11-23 11:59:18,530 INFO L273 TraceCheckUtils]: 33: Hoare triple {5162#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5162#true} is VALID [2018-11-23 11:59:18,530 INFO L273 TraceCheckUtils]: 34: Hoare triple {5162#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5162#true} is VALID [2018-11-23 11:59:18,530 INFO L273 TraceCheckUtils]: 35: Hoare triple {5162#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5162#true} is VALID [2018-11-23 11:59:18,530 INFO L273 TraceCheckUtils]: 36: Hoare triple {5162#true} assume !(~i~0 < 100000); {5162#true} is VALID [2018-11-23 11:59:18,530 INFO L273 TraceCheckUtils]: 37: Hoare triple {5162#true} ~i~0 := 0; {5162#true} is VALID [2018-11-23 11:59:18,531 INFO L273 TraceCheckUtils]: 38: Hoare triple {5162#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5162#true} is VALID [2018-11-23 11:59:18,531 INFO L273 TraceCheckUtils]: 39: Hoare triple {5162#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5162#true} is VALID [2018-11-23 11:59:18,531 INFO L273 TraceCheckUtils]: 40: Hoare triple {5162#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5162#true} is VALID [2018-11-23 11:59:18,531 INFO L273 TraceCheckUtils]: 41: Hoare triple {5162#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5162#true} is VALID [2018-11-23 11:59:18,531 INFO L273 TraceCheckUtils]: 42: Hoare triple {5162#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5162#true} is VALID [2018-11-23 11:59:18,531 INFO L273 TraceCheckUtils]: 43: Hoare triple {5162#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5162#true} is VALID [2018-11-23 11:59:18,531 INFO L273 TraceCheckUtils]: 44: Hoare triple {5162#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5162#true} is VALID [2018-11-23 11:59:18,531 INFO L273 TraceCheckUtils]: 45: Hoare triple {5162#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5162#true} is VALID [2018-11-23 11:59:18,532 INFO L273 TraceCheckUtils]: 46: Hoare triple {5162#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5162#true} is VALID [2018-11-23 11:59:18,532 INFO L273 TraceCheckUtils]: 47: Hoare triple {5162#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5162#true} is VALID [2018-11-23 11:59:18,532 INFO L273 TraceCheckUtils]: 48: Hoare triple {5162#true} assume !(~i~0 < 100000); {5162#true} is VALID [2018-11-23 11:59:18,532 INFO L273 TraceCheckUtils]: 49: Hoare triple {5162#true} ~i~0 := 0; {5162#true} is VALID [2018-11-23 11:59:18,532 INFO L273 TraceCheckUtils]: 50: Hoare triple {5162#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {5162#true} is VALID [2018-11-23 11:59:18,532 INFO L273 TraceCheckUtils]: 51: Hoare triple {5162#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5162#true} is VALID [2018-11-23 11:59:18,532 INFO L273 TraceCheckUtils]: 52: Hoare triple {5162#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {5162#true} is VALID [2018-11-23 11:59:18,532 INFO L273 TraceCheckUtils]: 53: Hoare triple {5162#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5162#true} is VALID [2018-11-23 11:59:18,532 INFO L273 TraceCheckUtils]: 54: Hoare triple {5162#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {5162#true} is VALID [2018-11-23 11:59:18,533 INFO L273 TraceCheckUtils]: 55: Hoare triple {5162#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5162#true} is VALID [2018-11-23 11:59:18,533 INFO L273 TraceCheckUtils]: 56: Hoare triple {5162#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {5162#true} is VALID [2018-11-23 11:59:18,533 INFO L273 TraceCheckUtils]: 57: Hoare triple {5162#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5162#true} is VALID [2018-11-23 11:59:18,533 INFO L273 TraceCheckUtils]: 58: Hoare triple {5162#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {5162#true} is VALID [2018-11-23 11:59:18,533 INFO L273 TraceCheckUtils]: 59: Hoare triple {5162#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5162#true} is VALID [2018-11-23 11:59:18,533 INFO L273 TraceCheckUtils]: 60: Hoare triple {5162#true} assume !(~i~0 < 100000); {5162#true} is VALID [2018-11-23 11:59:18,534 INFO L273 TraceCheckUtils]: 61: Hoare triple {5162#true} ~i~0 := 0; {5360#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:18,534 INFO L273 TraceCheckUtils]: 62: Hoare triple {5360#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {5360#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:18,535 INFO L273 TraceCheckUtils]: 63: Hoare triple {5360#(<= main_~i~0 0)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5367#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:18,535 INFO L273 TraceCheckUtils]: 64: Hoare triple {5367#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {5367#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:18,535 INFO L273 TraceCheckUtils]: 65: Hoare triple {5367#(<= main_~i~0 1)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5374#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:18,536 INFO L273 TraceCheckUtils]: 66: Hoare triple {5374#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {5374#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:18,536 INFO L273 TraceCheckUtils]: 67: Hoare triple {5374#(<= main_~i~0 2)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5381#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:18,536 INFO L273 TraceCheckUtils]: 68: Hoare triple {5381#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {5381#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:18,537 INFO L273 TraceCheckUtils]: 69: Hoare triple {5381#(<= main_~i~0 3)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5388#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:18,537 INFO L273 TraceCheckUtils]: 70: Hoare triple {5388#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {5388#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:18,538 INFO L273 TraceCheckUtils]: 71: Hoare triple {5388#(<= main_~i~0 4)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5395#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:18,538 INFO L273 TraceCheckUtils]: 72: Hoare triple {5395#(<= main_~i~0 5)} assume !(~i~0 < 100000); {5163#false} is VALID [2018-11-23 11:59:18,538 INFO L273 TraceCheckUtils]: 73: Hoare triple {5163#false} havoc ~x~0;~x~0 := 0; {5163#false} is VALID [2018-11-23 11:59:18,539 INFO L273 TraceCheckUtils]: 74: Hoare triple {5163#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {5163#false} is VALID [2018-11-23 11:59:18,539 INFO L256 TraceCheckUtils]: 75: Hoare triple {5163#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {5163#false} is VALID [2018-11-23 11:59:18,539 INFO L273 TraceCheckUtils]: 76: Hoare triple {5163#false} ~cond := #in~cond; {5163#false} is VALID [2018-11-23 11:59:18,539 INFO L273 TraceCheckUtils]: 77: Hoare triple {5163#false} assume 0 == ~cond; {5163#false} is VALID [2018-11-23 11:59:18,540 INFO L273 TraceCheckUtils]: 78: Hoare triple {5163#false} assume !false; {5163#false} is VALID [2018-11-23 11:59:18,544 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-11-23 11:59:18,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:18,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2018-11-23 11:59:18,564 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 79 [2018-11-23 11:59:18,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:18,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:59:18,634 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:18,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:59:18,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:59:18,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:59:18,636 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 18 states. [2018-11-23 11:59:19,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:19,819 INFO L93 Difference]: Finished difference Result 158 states and 172 transitions. [2018-11-23 11:59:19,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:59:19,819 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 79 [2018-11-23 11:59:19,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:19,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:59:19,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 136 transitions. [2018-11-23 11:59:19,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:59:19,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 136 transitions. [2018-11-23 11:59:19,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 136 transitions. [2018-11-23 11:59:20,365 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:20,369 INFO L225 Difference]: With dead ends: 158 [2018-11-23 11:59:20,370 INFO L226 Difference]: Without dead ends: 99 [2018-11-23 11:59:20,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:59:20,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-23 11:59:20,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2018-11-23 11:59:20,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:20,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 94 states. [2018-11-23 11:59:20,857 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 94 states. [2018-11-23 11:59:20,857 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 94 states. [2018-11-23 11:59:20,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:20,860 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2018-11-23 11:59:20,860 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2018-11-23 11:59:20,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:20,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:20,860 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 99 states. [2018-11-23 11:59:20,861 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 99 states. [2018-11-23 11:59:20,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:20,863 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2018-11-23 11:59:20,863 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2018-11-23 11:59:20,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:20,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:20,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:20,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:20,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-23 11:59:20,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2018-11-23 11:59:20,866 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 79 [2018-11-23 11:59:20,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:20,867 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2018-11-23 11:59:20,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:59:20,867 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2018-11-23 11:59:20,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-23 11:59:20,868 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:20,868 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 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] [2018-11-23 11:59:20,868 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:20,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:20,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1671831870, now seen corresponding path program 10 times [2018-11-23 11:59:20,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:20,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:20,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:20,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:20,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:21,264 INFO L256 TraceCheckUtils]: 0: Hoare triple {5985#true} call ULTIMATE.init(); {5985#true} is VALID [2018-11-23 11:59:21,265 INFO L273 TraceCheckUtils]: 1: Hoare triple {5985#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5985#true} is VALID [2018-11-23 11:59:21,265 INFO L273 TraceCheckUtils]: 2: Hoare triple {5985#true} assume true; {5985#true} is VALID [2018-11-23 11:59:21,265 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5985#true} {5985#true} #105#return; {5985#true} is VALID [2018-11-23 11:59:21,265 INFO L256 TraceCheckUtils]: 4: Hoare triple {5985#true} call #t~ret13 := main(); {5985#true} is VALID [2018-11-23 11:59:21,265 INFO L273 TraceCheckUtils]: 5: Hoare triple {5985#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);havoc ~a~0;~a~0 := 0; {5987#(= main_~a~0 0)} is VALID [2018-11-23 11:59:21,266 INFO L273 TraceCheckUtils]: 6: Hoare triple {5987#(= 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; {5987#(= main_~a~0 0)} is VALID [2018-11-23 11:59:21,266 INFO L273 TraceCheckUtils]: 7: Hoare triple {5987#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5988#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:21,266 INFO L273 TraceCheckUtils]: 8: Hoare triple {5988#(<= 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; {5988#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:21,267 INFO L273 TraceCheckUtils]: 9: Hoare triple {5988#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5989#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:21,267 INFO L273 TraceCheckUtils]: 10: Hoare triple {5989#(<= 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; {5989#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:21,268 INFO L273 TraceCheckUtils]: 11: Hoare triple {5989#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5990#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:21,268 INFO L273 TraceCheckUtils]: 12: Hoare triple {5990#(<= 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; {5990#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:21,268 INFO L273 TraceCheckUtils]: 13: Hoare triple {5990#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5991#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:21,269 INFO L273 TraceCheckUtils]: 14: Hoare triple {5991#(<= 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; {5991#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:21,269 INFO L273 TraceCheckUtils]: 15: Hoare triple {5991#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5992#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:21,270 INFO L273 TraceCheckUtils]: 16: Hoare triple {5992#(<= 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; {5992#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:21,271 INFO L273 TraceCheckUtils]: 17: Hoare triple {5992#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5993#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:21,271 INFO L273 TraceCheckUtils]: 18: Hoare triple {5993#(<= 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; {5993#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:21,272 INFO L273 TraceCheckUtils]: 19: Hoare triple {5993#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5994#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:21,272 INFO L273 TraceCheckUtils]: 20: Hoare triple {5994#(<= 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; {5994#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:21,273 INFO L273 TraceCheckUtils]: 21: Hoare triple {5994#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5995#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:21,274 INFO L273 TraceCheckUtils]: 22: Hoare triple {5995#(<= 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; {5995#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:21,275 INFO L273 TraceCheckUtils]: 23: Hoare triple {5995#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5996#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:21,275 INFO L273 TraceCheckUtils]: 24: Hoare triple {5996#(<= 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; {5996#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:21,276 INFO L273 TraceCheckUtils]: 25: Hoare triple {5996#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5997#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:21,277 INFO L273 TraceCheckUtils]: 26: Hoare triple {5997#(<= main_~a~0 10)} assume !(~a~0 < 100000); {5986#false} is VALID [2018-11-23 11:59:21,277 INFO L273 TraceCheckUtils]: 27: Hoare triple {5986#false} havoc ~i~0;~i~0 := 0; {5986#false} is VALID [2018-11-23 11:59:21,277 INFO L273 TraceCheckUtils]: 28: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5986#false} is VALID [2018-11-23 11:59:21,277 INFO L273 TraceCheckUtils]: 29: Hoare triple {5986#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5986#false} is VALID [2018-11-23 11:59:21,278 INFO L273 TraceCheckUtils]: 30: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5986#false} is VALID [2018-11-23 11:59:21,278 INFO L273 TraceCheckUtils]: 31: Hoare triple {5986#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5986#false} is VALID [2018-11-23 11:59:21,278 INFO L273 TraceCheckUtils]: 32: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5986#false} is VALID [2018-11-23 11:59:21,278 INFO L273 TraceCheckUtils]: 33: Hoare triple {5986#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5986#false} is VALID [2018-11-23 11:59:21,278 INFO L273 TraceCheckUtils]: 34: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5986#false} is VALID [2018-11-23 11:59:21,279 INFO L273 TraceCheckUtils]: 35: Hoare triple {5986#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5986#false} is VALID [2018-11-23 11:59:21,279 INFO L273 TraceCheckUtils]: 36: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5986#false} is VALID [2018-11-23 11:59:21,279 INFO L273 TraceCheckUtils]: 37: Hoare triple {5986#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5986#false} is VALID [2018-11-23 11:59:21,279 INFO L273 TraceCheckUtils]: 38: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5986#false} is VALID [2018-11-23 11:59:21,279 INFO L273 TraceCheckUtils]: 39: Hoare triple {5986#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5986#false} is VALID [2018-11-23 11:59:21,280 INFO L273 TraceCheckUtils]: 40: Hoare triple {5986#false} assume !(~i~0 < 100000); {5986#false} is VALID [2018-11-23 11:59:21,280 INFO L273 TraceCheckUtils]: 41: Hoare triple {5986#false} ~i~0 := 0; {5986#false} is VALID [2018-11-23 11:59:21,280 INFO L273 TraceCheckUtils]: 42: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5986#false} is VALID [2018-11-23 11:59:21,280 INFO L273 TraceCheckUtils]: 43: Hoare triple {5986#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5986#false} is VALID [2018-11-23 11:59:21,280 INFO L273 TraceCheckUtils]: 44: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5986#false} is VALID [2018-11-23 11:59:21,281 INFO L273 TraceCheckUtils]: 45: Hoare triple {5986#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5986#false} is VALID [2018-11-23 11:59:21,281 INFO L273 TraceCheckUtils]: 46: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5986#false} is VALID [2018-11-23 11:59:21,281 INFO L273 TraceCheckUtils]: 47: Hoare triple {5986#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5986#false} is VALID [2018-11-23 11:59:21,281 INFO L273 TraceCheckUtils]: 48: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5986#false} is VALID [2018-11-23 11:59:21,281 INFO L273 TraceCheckUtils]: 49: Hoare triple {5986#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5986#false} is VALID [2018-11-23 11:59:21,282 INFO L273 TraceCheckUtils]: 50: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5986#false} is VALID [2018-11-23 11:59:21,282 INFO L273 TraceCheckUtils]: 51: Hoare triple {5986#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5986#false} is VALID [2018-11-23 11:59:21,282 INFO L273 TraceCheckUtils]: 52: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5986#false} is VALID [2018-11-23 11:59:21,282 INFO L273 TraceCheckUtils]: 53: Hoare triple {5986#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5986#false} is VALID [2018-11-23 11:59:21,282 INFO L273 TraceCheckUtils]: 54: Hoare triple {5986#false} assume !(~i~0 < 100000); {5986#false} is VALID [2018-11-23 11:59:21,282 INFO L273 TraceCheckUtils]: 55: Hoare triple {5986#false} ~i~0 := 0; {5986#false} is VALID [2018-11-23 11:59:21,282 INFO L273 TraceCheckUtils]: 56: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {5986#false} is VALID [2018-11-23 11:59:21,283 INFO L273 TraceCheckUtils]: 57: Hoare triple {5986#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5986#false} is VALID [2018-11-23 11:59:21,283 INFO L273 TraceCheckUtils]: 58: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {5986#false} is VALID [2018-11-23 11:59:21,283 INFO L273 TraceCheckUtils]: 59: Hoare triple {5986#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5986#false} is VALID [2018-11-23 11:59:21,283 INFO L273 TraceCheckUtils]: 60: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {5986#false} is VALID [2018-11-23 11:59:21,283 INFO L273 TraceCheckUtils]: 61: Hoare triple {5986#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5986#false} is VALID [2018-11-23 11:59:21,283 INFO L273 TraceCheckUtils]: 62: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {5986#false} is VALID [2018-11-23 11:59:21,283 INFO L273 TraceCheckUtils]: 63: Hoare triple {5986#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5986#false} is VALID [2018-11-23 11:59:21,284 INFO L273 TraceCheckUtils]: 64: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {5986#false} is VALID [2018-11-23 11:59:21,284 INFO L273 TraceCheckUtils]: 65: Hoare triple {5986#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5986#false} is VALID [2018-11-23 11:59:21,284 INFO L273 TraceCheckUtils]: 66: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {5986#false} is VALID [2018-11-23 11:59:21,284 INFO L273 TraceCheckUtils]: 67: Hoare triple {5986#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5986#false} is VALID [2018-11-23 11:59:21,284 INFO L273 TraceCheckUtils]: 68: Hoare triple {5986#false} assume !(~i~0 < 100000); {5986#false} is VALID [2018-11-23 11:59:21,285 INFO L273 TraceCheckUtils]: 69: Hoare triple {5986#false} ~i~0 := 0; {5986#false} is VALID [2018-11-23 11:59:21,285 INFO L273 TraceCheckUtils]: 70: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {5986#false} is VALID [2018-11-23 11:59:21,285 INFO L273 TraceCheckUtils]: 71: Hoare triple {5986#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5986#false} is VALID [2018-11-23 11:59:21,285 INFO L273 TraceCheckUtils]: 72: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {5986#false} is VALID [2018-11-23 11:59:21,285 INFO L273 TraceCheckUtils]: 73: Hoare triple {5986#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5986#false} is VALID [2018-11-23 11:59:21,285 INFO L273 TraceCheckUtils]: 74: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {5986#false} is VALID [2018-11-23 11:59:21,286 INFO L273 TraceCheckUtils]: 75: Hoare triple {5986#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5986#false} is VALID [2018-11-23 11:59:21,286 INFO L273 TraceCheckUtils]: 76: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {5986#false} is VALID [2018-11-23 11:59:21,286 INFO L273 TraceCheckUtils]: 77: Hoare triple {5986#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5986#false} is VALID [2018-11-23 11:59:21,286 INFO L273 TraceCheckUtils]: 78: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {5986#false} is VALID [2018-11-23 11:59:21,286 INFO L273 TraceCheckUtils]: 79: Hoare triple {5986#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5986#false} is VALID [2018-11-23 11:59:21,287 INFO L273 TraceCheckUtils]: 80: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {5986#false} is VALID [2018-11-23 11:59:21,287 INFO L273 TraceCheckUtils]: 81: Hoare triple {5986#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5986#false} is VALID [2018-11-23 11:59:21,287 INFO L273 TraceCheckUtils]: 82: Hoare triple {5986#false} assume !(~i~0 < 100000); {5986#false} is VALID [2018-11-23 11:59:21,287 INFO L273 TraceCheckUtils]: 83: Hoare triple {5986#false} havoc ~x~0;~x~0 := 0; {5986#false} is VALID [2018-11-23 11:59:21,287 INFO L273 TraceCheckUtils]: 84: Hoare triple {5986#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {5986#false} is VALID [2018-11-23 11:59:21,287 INFO L256 TraceCheckUtils]: 85: Hoare triple {5986#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {5986#false} is VALID [2018-11-23 11:59:21,288 INFO L273 TraceCheckUtils]: 86: Hoare triple {5986#false} ~cond := #in~cond; {5986#false} is VALID [2018-11-23 11:59:21,288 INFO L273 TraceCheckUtils]: 87: Hoare triple {5986#false} assume 0 == ~cond; {5986#false} is VALID [2018-11-23 11:59:21,288 INFO L273 TraceCheckUtils]: 88: Hoare triple {5986#false} assume !false; {5986#false} is VALID [2018-11-23 11:59:21,292 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-23 11:59:21,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:21,293 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:59:21,310 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:59:21,363 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:59:21,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:21,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:21,568 INFO L256 TraceCheckUtils]: 0: Hoare triple {5985#true} call ULTIMATE.init(); {5985#true} is VALID [2018-11-23 11:59:21,568 INFO L273 TraceCheckUtils]: 1: Hoare triple {5985#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5985#true} is VALID [2018-11-23 11:59:21,568 INFO L273 TraceCheckUtils]: 2: Hoare triple {5985#true} assume true; {5985#true} is VALID [2018-11-23 11:59:21,568 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5985#true} {5985#true} #105#return; {5985#true} is VALID [2018-11-23 11:59:21,569 INFO L256 TraceCheckUtils]: 4: Hoare triple {5985#true} call #t~ret13 := main(); {5985#true} is VALID [2018-11-23 11:59:21,569 INFO L273 TraceCheckUtils]: 5: Hoare triple {5985#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);havoc ~a~0;~a~0 := 0; {5985#true} is VALID [2018-11-23 11:59:21,569 INFO L273 TraceCheckUtils]: 6: Hoare triple {5985#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; {5985#true} is VALID [2018-11-23 11:59:21,569 INFO L273 TraceCheckUtils]: 7: Hoare triple {5985#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5985#true} is VALID [2018-11-23 11:59:21,569 INFO L273 TraceCheckUtils]: 8: Hoare triple {5985#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; {5985#true} is VALID [2018-11-23 11:59:21,569 INFO L273 TraceCheckUtils]: 9: Hoare triple {5985#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5985#true} is VALID [2018-11-23 11:59:21,569 INFO L273 TraceCheckUtils]: 10: Hoare triple {5985#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; {5985#true} is VALID [2018-11-23 11:59:21,569 INFO L273 TraceCheckUtils]: 11: Hoare triple {5985#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5985#true} is VALID [2018-11-23 11:59:21,570 INFO L273 TraceCheckUtils]: 12: Hoare triple {5985#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; {5985#true} is VALID [2018-11-23 11:59:21,570 INFO L273 TraceCheckUtils]: 13: Hoare triple {5985#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5985#true} is VALID [2018-11-23 11:59:21,570 INFO L273 TraceCheckUtils]: 14: Hoare triple {5985#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; {5985#true} is VALID [2018-11-23 11:59:21,570 INFO L273 TraceCheckUtils]: 15: Hoare triple {5985#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5985#true} is VALID [2018-11-23 11:59:21,570 INFO L273 TraceCheckUtils]: 16: Hoare triple {5985#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; {5985#true} is VALID [2018-11-23 11:59:21,570 INFO L273 TraceCheckUtils]: 17: Hoare triple {5985#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5985#true} is VALID [2018-11-23 11:59:21,570 INFO L273 TraceCheckUtils]: 18: Hoare triple {5985#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; {5985#true} is VALID [2018-11-23 11:59:21,570 INFO L273 TraceCheckUtils]: 19: Hoare triple {5985#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5985#true} is VALID [2018-11-23 11:59:21,570 INFO L273 TraceCheckUtils]: 20: Hoare triple {5985#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; {5985#true} is VALID [2018-11-23 11:59:21,571 INFO L273 TraceCheckUtils]: 21: Hoare triple {5985#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5985#true} is VALID [2018-11-23 11:59:21,571 INFO L273 TraceCheckUtils]: 22: Hoare triple {5985#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; {5985#true} is VALID [2018-11-23 11:59:21,571 INFO L273 TraceCheckUtils]: 23: Hoare triple {5985#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5985#true} is VALID [2018-11-23 11:59:21,571 INFO L273 TraceCheckUtils]: 24: Hoare triple {5985#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; {5985#true} is VALID [2018-11-23 11:59:21,571 INFO L273 TraceCheckUtils]: 25: Hoare triple {5985#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5985#true} is VALID [2018-11-23 11:59:21,571 INFO L273 TraceCheckUtils]: 26: Hoare triple {5985#true} assume !(~a~0 < 100000); {5985#true} is VALID [2018-11-23 11:59:21,571 INFO L273 TraceCheckUtils]: 27: Hoare triple {5985#true} havoc ~i~0;~i~0 := 0; {5985#true} is VALID [2018-11-23 11:59:21,571 INFO L273 TraceCheckUtils]: 28: Hoare triple {5985#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5985#true} is VALID [2018-11-23 11:59:21,572 INFO L273 TraceCheckUtils]: 29: Hoare triple {5985#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5985#true} is VALID [2018-11-23 11:59:21,572 INFO L273 TraceCheckUtils]: 30: Hoare triple {5985#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5985#true} is VALID [2018-11-23 11:59:21,572 INFO L273 TraceCheckUtils]: 31: Hoare triple {5985#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5985#true} is VALID [2018-11-23 11:59:21,572 INFO L273 TraceCheckUtils]: 32: Hoare triple {5985#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5985#true} is VALID [2018-11-23 11:59:21,572 INFO L273 TraceCheckUtils]: 33: Hoare triple {5985#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5985#true} is VALID [2018-11-23 11:59:21,572 INFO L273 TraceCheckUtils]: 34: Hoare triple {5985#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5985#true} is VALID [2018-11-23 11:59:21,572 INFO L273 TraceCheckUtils]: 35: Hoare triple {5985#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5985#true} is VALID [2018-11-23 11:59:21,572 INFO L273 TraceCheckUtils]: 36: Hoare triple {5985#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5985#true} is VALID [2018-11-23 11:59:21,573 INFO L273 TraceCheckUtils]: 37: Hoare triple {5985#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5985#true} is VALID [2018-11-23 11:59:21,573 INFO L273 TraceCheckUtils]: 38: Hoare triple {5985#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5985#true} is VALID [2018-11-23 11:59:21,573 INFO L273 TraceCheckUtils]: 39: Hoare triple {5985#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5985#true} is VALID [2018-11-23 11:59:21,573 INFO L273 TraceCheckUtils]: 40: Hoare triple {5985#true} assume !(~i~0 < 100000); {5985#true} is VALID [2018-11-23 11:59:21,573 INFO L273 TraceCheckUtils]: 41: Hoare triple {5985#true} ~i~0 := 0; {5985#true} is VALID [2018-11-23 11:59:21,573 INFO L273 TraceCheckUtils]: 42: Hoare triple {5985#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5985#true} is VALID [2018-11-23 11:59:21,573 INFO L273 TraceCheckUtils]: 43: Hoare triple {5985#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5985#true} is VALID [2018-11-23 11:59:21,573 INFO L273 TraceCheckUtils]: 44: Hoare triple {5985#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5985#true} is VALID [2018-11-23 11:59:21,573 INFO L273 TraceCheckUtils]: 45: Hoare triple {5985#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5985#true} is VALID [2018-11-23 11:59:21,574 INFO L273 TraceCheckUtils]: 46: Hoare triple {5985#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5985#true} is VALID [2018-11-23 11:59:21,574 INFO L273 TraceCheckUtils]: 47: Hoare triple {5985#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5985#true} is VALID [2018-11-23 11:59:21,574 INFO L273 TraceCheckUtils]: 48: Hoare triple {5985#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5985#true} is VALID [2018-11-23 11:59:21,574 INFO L273 TraceCheckUtils]: 49: Hoare triple {5985#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5985#true} is VALID [2018-11-23 11:59:21,574 INFO L273 TraceCheckUtils]: 50: Hoare triple {5985#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5985#true} is VALID [2018-11-23 11:59:21,574 INFO L273 TraceCheckUtils]: 51: Hoare triple {5985#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5985#true} is VALID [2018-11-23 11:59:21,574 INFO L273 TraceCheckUtils]: 52: Hoare triple {5985#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5985#true} is VALID [2018-11-23 11:59:21,574 INFO L273 TraceCheckUtils]: 53: Hoare triple {5985#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5985#true} is VALID [2018-11-23 11:59:21,575 INFO L273 TraceCheckUtils]: 54: Hoare triple {5985#true} assume !(~i~0 < 100000); {5985#true} is VALID [2018-11-23 11:59:21,575 INFO L273 TraceCheckUtils]: 55: Hoare triple {5985#true} ~i~0 := 0; {6166#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:21,575 INFO L273 TraceCheckUtils]: 56: Hoare triple {6166#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6166#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:21,576 INFO L273 TraceCheckUtils]: 57: Hoare triple {6166#(<= main_~i~0 0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6173#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:21,576 INFO L273 TraceCheckUtils]: 58: Hoare triple {6173#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6173#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:21,577 INFO L273 TraceCheckUtils]: 59: Hoare triple {6173#(<= main_~i~0 1)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6180#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:21,577 INFO L273 TraceCheckUtils]: 60: Hoare triple {6180#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6180#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:21,578 INFO L273 TraceCheckUtils]: 61: Hoare triple {6180#(<= main_~i~0 2)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6187#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:21,578 INFO L273 TraceCheckUtils]: 62: Hoare triple {6187#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6187#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:21,578 INFO L273 TraceCheckUtils]: 63: Hoare triple {6187#(<= main_~i~0 3)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6194#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:21,579 INFO L273 TraceCheckUtils]: 64: Hoare triple {6194#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6194#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:21,579 INFO L273 TraceCheckUtils]: 65: Hoare triple {6194#(<= main_~i~0 4)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6201#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:21,579 INFO L273 TraceCheckUtils]: 66: Hoare triple {6201#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6201#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:21,580 INFO L273 TraceCheckUtils]: 67: Hoare triple {6201#(<= main_~i~0 5)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6208#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:21,581 INFO L273 TraceCheckUtils]: 68: Hoare triple {6208#(<= main_~i~0 6)} assume !(~i~0 < 100000); {5986#false} is VALID [2018-11-23 11:59:21,581 INFO L273 TraceCheckUtils]: 69: Hoare triple {5986#false} ~i~0 := 0; {5986#false} is VALID [2018-11-23 11:59:21,581 INFO L273 TraceCheckUtils]: 70: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {5986#false} is VALID [2018-11-23 11:59:21,581 INFO L273 TraceCheckUtils]: 71: Hoare triple {5986#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5986#false} is VALID [2018-11-23 11:59:21,582 INFO L273 TraceCheckUtils]: 72: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {5986#false} is VALID [2018-11-23 11:59:21,582 INFO L273 TraceCheckUtils]: 73: Hoare triple {5986#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5986#false} is VALID [2018-11-23 11:59:21,582 INFO L273 TraceCheckUtils]: 74: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {5986#false} is VALID [2018-11-23 11:59:21,582 INFO L273 TraceCheckUtils]: 75: Hoare triple {5986#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5986#false} is VALID [2018-11-23 11:59:21,582 INFO L273 TraceCheckUtils]: 76: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {5986#false} is VALID [2018-11-23 11:59:21,583 INFO L273 TraceCheckUtils]: 77: Hoare triple {5986#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5986#false} is VALID [2018-11-23 11:59:21,583 INFO L273 TraceCheckUtils]: 78: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {5986#false} is VALID [2018-11-23 11:59:21,583 INFO L273 TraceCheckUtils]: 79: Hoare triple {5986#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5986#false} is VALID [2018-11-23 11:59:21,583 INFO L273 TraceCheckUtils]: 80: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {5986#false} is VALID [2018-11-23 11:59:21,583 INFO L273 TraceCheckUtils]: 81: Hoare triple {5986#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5986#false} is VALID [2018-11-23 11:59:21,584 INFO L273 TraceCheckUtils]: 82: Hoare triple {5986#false} assume !(~i~0 < 100000); {5986#false} is VALID [2018-11-23 11:59:21,584 INFO L273 TraceCheckUtils]: 83: Hoare triple {5986#false} havoc ~x~0;~x~0 := 0; {5986#false} is VALID [2018-11-23 11:59:21,584 INFO L273 TraceCheckUtils]: 84: Hoare triple {5986#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {5986#false} is VALID [2018-11-23 11:59:21,584 INFO L256 TraceCheckUtils]: 85: Hoare triple {5986#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {5986#false} is VALID [2018-11-23 11:59:21,584 INFO L273 TraceCheckUtils]: 86: Hoare triple {5986#false} ~cond := #in~cond; {5986#false} is VALID [2018-11-23 11:59:21,585 INFO L273 TraceCheckUtils]: 87: Hoare triple {5986#false} assume 0 == ~cond; {5986#false} is VALID [2018-11-23 11:59:21,585 INFO L273 TraceCheckUtils]: 88: Hoare triple {5986#false} assume !false; {5986#false} is VALID [2018-11-23 11:59:21,588 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2018-11-23 11:59:21,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:21,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2018-11-23 11:59:21,609 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 89 [2018-11-23 11:59:21,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:21,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:59:21,679 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:21,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:59:21,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:59:21,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:59:21,680 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand 20 states. [2018-11-23 11:59:22,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:22,864 INFO L93 Difference]: Finished difference Result 176 states and 190 transitions. [2018-11-23 11:59:22,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:59:22,864 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 89 [2018-11-23 11:59:22,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:22,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:59:22,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 146 transitions. [2018-11-23 11:59:22,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:59:22,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 146 transitions. [2018-11-23 11:59:22,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 146 transitions. [2018-11-23 11:59:23,525 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:23,527 INFO L225 Difference]: With dead ends: 176 [2018-11-23 11:59:23,527 INFO L226 Difference]: Without dead ends: 109 [2018-11-23 11:59:23,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:59:23,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-23 11:59:23,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2018-11-23 11:59:23,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:23,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 104 states. [2018-11-23 11:59:23,573 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 104 states. [2018-11-23 11:59:23,573 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 104 states. [2018-11-23 11:59:23,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:23,575 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2018-11-23 11:59:23,575 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2018-11-23 11:59:23,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:23,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:23,576 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 109 states. [2018-11-23 11:59:23,576 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 109 states. [2018-11-23 11:59:23,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:23,579 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2018-11-23 11:59:23,579 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2018-11-23 11:59:23,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:23,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:23,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:23,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:23,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 11:59:23,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2018-11-23 11:59:23,582 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 89 [2018-11-23 11:59:23,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:23,582 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2018-11-23 11:59:23,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:59:23,582 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2018-11-23 11:59:23,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-23 11:59:23,583 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:23,583 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 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] [2018-11-23 11:59:23,584 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:23,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:23,584 INFO L82 PathProgramCache]: Analyzing trace with hash -708791724, now seen corresponding path program 11 times [2018-11-23 11:59:23,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:23,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:23,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:23,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:23,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:24,728 INFO L256 TraceCheckUtils]: 0: Hoare triple {6902#true} call ULTIMATE.init(); {6902#true} is VALID [2018-11-23 11:59:24,728 INFO L273 TraceCheckUtils]: 1: Hoare triple {6902#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6902#true} is VALID [2018-11-23 11:59:24,729 INFO L273 TraceCheckUtils]: 2: Hoare triple {6902#true} assume true; {6902#true} is VALID [2018-11-23 11:59:24,729 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6902#true} {6902#true} #105#return; {6902#true} is VALID [2018-11-23 11:59:24,729 INFO L256 TraceCheckUtils]: 4: Hoare triple {6902#true} call #t~ret13 := main(); {6902#true} is VALID [2018-11-23 11:59:24,730 INFO L273 TraceCheckUtils]: 5: Hoare triple {6902#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);havoc ~a~0;~a~0 := 0; {6904#(= main_~a~0 0)} is VALID [2018-11-23 11:59:24,730 INFO L273 TraceCheckUtils]: 6: Hoare triple {6904#(= 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; {6904#(= main_~a~0 0)} is VALID [2018-11-23 11:59:24,731 INFO L273 TraceCheckUtils]: 7: Hoare triple {6904#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6905#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:24,731 INFO L273 TraceCheckUtils]: 8: Hoare triple {6905#(<= 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; {6905#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:24,732 INFO L273 TraceCheckUtils]: 9: Hoare triple {6905#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6906#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:24,733 INFO L273 TraceCheckUtils]: 10: Hoare triple {6906#(<= 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; {6906#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:24,734 INFO L273 TraceCheckUtils]: 11: Hoare triple {6906#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6907#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:24,734 INFO L273 TraceCheckUtils]: 12: Hoare triple {6907#(<= 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; {6907#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:24,735 INFO L273 TraceCheckUtils]: 13: Hoare triple {6907#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6908#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:24,735 INFO L273 TraceCheckUtils]: 14: Hoare triple {6908#(<= 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; {6908#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:24,736 INFO L273 TraceCheckUtils]: 15: Hoare triple {6908#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6909#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:24,737 INFO L273 TraceCheckUtils]: 16: Hoare triple {6909#(<= 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; {6909#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:24,737 INFO L273 TraceCheckUtils]: 17: Hoare triple {6909#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6910#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:24,738 INFO L273 TraceCheckUtils]: 18: Hoare triple {6910#(<= 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; {6910#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:24,739 INFO L273 TraceCheckUtils]: 19: Hoare triple {6910#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6911#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:24,739 INFO L273 TraceCheckUtils]: 20: Hoare triple {6911#(<= 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; {6911#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:24,740 INFO L273 TraceCheckUtils]: 21: Hoare triple {6911#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6912#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:24,740 INFO L273 TraceCheckUtils]: 22: Hoare triple {6912#(<= 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; {6912#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:24,741 INFO L273 TraceCheckUtils]: 23: Hoare triple {6912#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6913#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:24,742 INFO L273 TraceCheckUtils]: 24: Hoare triple {6913#(<= 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; {6913#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:24,743 INFO L273 TraceCheckUtils]: 25: Hoare triple {6913#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6914#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:24,743 INFO L273 TraceCheckUtils]: 26: Hoare triple {6914#(<= 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; {6914#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:24,744 INFO L273 TraceCheckUtils]: 27: Hoare triple {6914#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6915#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:24,745 INFO L273 TraceCheckUtils]: 28: Hoare triple {6915#(<= main_~a~0 11)} assume !(~a~0 < 100000); {6903#false} is VALID [2018-11-23 11:59:24,745 INFO L273 TraceCheckUtils]: 29: Hoare triple {6903#false} havoc ~i~0;~i~0 := 0; {6903#false} is VALID [2018-11-23 11:59:24,745 INFO L273 TraceCheckUtils]: 30: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6903#false} is VALID [2018-11-23 11:59:24,745 INFO L273 TraceCheckUtils]: 31: Hoare triple {6903#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6903#false} is VALID [2018-11-23 11:59:24,745 INFO L273 TraceCheckUtils]: 32: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6903#false} is VALID [2018-11-23 11:59:24,746 INFO L273 TraceCheckUtils]: 33: Hoare triple {6903#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6903#false} is VALID [2018-11-23 11:59:24,746 INFO L273 TraceCheckUtils]: 34: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6903#false} is VALID [2018-11-23 11:59:24,746 INFO L273 TraceCheckUtils]: 35: Hoare triple {6903#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6903#false} is VALID [2018-11-23 11:59:24,746 INFO L273 TraceCheckUtils]: 36: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6903#false} is VALID [2018-11-23 11:59:24,746 INFO L273 TraceCheckUtils]: 37: Hoare triple {6903#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6903#false} is VALID [2018-11-23 11:59:24,747 INFO L273 TraceCheckUtils]: 38: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6903#false} is VALID [2018-11-23 11:59:24,747 INFO L273 TraceCheckUtils]: 39: Hoare triple {6903#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6903#false} is VALID [2018-11-23 11:59:24,747 INFO L273 TraceCheckUtils]: 40: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6903#false} is VALID [2018-11-23 11:59:24,747 INFO L273 TraceCheckUtils]: 41: Hoare triple {6903#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6903#false} is VALID [2018-11-23 11:59:24,747 INFO L273 TraceCheckUtils]: 42: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6903#false} is VALID [2018-11-23 11:59:24,748 INFO L273 TraceCheckUtils]: 43: Hoare triple {6903#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6903#false} is VALID [2018-11-23 11:59:24,748 INFO L273 TraceCheckUtils]: 44: Hoare triple {6903#false} assume !(~i~0 < 100000); {6903#false} is VALID [2018-11-23 11:59:24,748 INFO L273 TraceCheckUtils]: 45: Hoare triple {6903#false} ~i~0 := 0; {6903#false} is VALID [2018-11-23 11:59:24,748 INFO L273 TraceCheckUtils]: 46: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6903#false} is VALID [2018-11-23 11:59:24,748 INFO L273 TraceCheckUtils]: 47: Hoare triple {6903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6903#false} is VALID [2018-11-23 11:59:24,748 INFO L273 TraceCheckUtils]: 48: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6903#false} is VALID [2018-11-23 11:59:24,748 INFO L273 TraceCheckUtils]: 49: Hoare triple {6903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6903#false} is VALID [2018-11-23 11:59:24,748 INFO L273 TraceCheckUtils]: 50: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6903#false} is VALID [2018-11-23 11:59:24,749 INFO L273 TraceCheckUtils]: 51: Hoare triple {6903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6903#false} is VALID [2018-11-23 11:59:24,749 INFO L273 TraceCheckUtils]: 52: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6903#false} is VALID [2018-11-23 11:59:24,749 INFO L273 TraceCheckUtils]: 53: Hoare triple {6903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6903#false} is VALID [2018-11-23 11:59:24,749 INFO L273 TraceCheckUtils]: 54: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6903#false} is VALID [2018-11-23 11:59:24,749 INFO L273 TraceCheckUtils]: 55: Hoare triple {6903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6903#false} is VALID [2018-11-23 11:59:24,749 INFO L273 TraceCheckUtils]: 56: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6903#false} is VALID [2018-11-23 11:59:24,749 INFO L273 TraceCheckUtils]: 57: Hoare triple {6903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6903#false} is VALID [2018-11-23 11:59:24,749 INFO L273 TraceCheckUtils]: 58: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6903#false} is VALID [2018-11-23 11:59:24,749 INFO L273 TraceCheckUtils]: 59: Hoare triple {6903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6903#false} is VALID [2018-11-23 11:59:24,750 INFO L273 TraceCheckUtils]: 60: Hoare triple {6903#false} assume !(~i~0 < 100000); {6903#false} is VALID [2018-11-23 11:59:24,750 INFO L273 TraceCheckUtils]: 61: Hoare triple {6903#false} ~i~0 := 0; {6903#false} is VALID [2018-11-23 11:59:24,750 INFO L273 TraceCheckUtils]: 62: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6903#false} is VALID [2018-11-23 11:59:24,750 INFO L273 TraceCheckUtils]: 63: Hoare triple {6903#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6903#false} is VALID [2018-11-23 11:59:24,750 INFO L273 TraceCheckUtils]: 64: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6903#false} is VALID [2018-11-23 11:59:24,750 INFO L273 TraceCheckUtils]: 65: Hoare triple {6903#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6903#false} is VALID [2018-11-23 11:59:24,750 INFO L273 TraceCheckUtils]: 66: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6903#false} is VALID [2018-11-23 11:59:24,750 INFO L273 TraceCheckUtils]: 67: Hoare triple {6903#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6903#false} is VALID [2018-11-23 11:59:24,751 INFO L273 TraceCheckUtils]: 68: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6903#false} is VALID [2018-11-23 11:59:24,751 INFO L273 TraceCheckUtils]: 69: Hoare triple {6903#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6903#false} is VALID [2018-11-23 11:59:24,751 INFO L273 TraceCheckUtils]: 70: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6903#false} is VALID [2018-11-23 11:59:24,751 INFO L273 TraceCheckUtils]: 71: Hoare triple {6903#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6903#false} is VALID [2018-11-23 11:59:24,751 INFO L273 TraceCheckUtils]: 72: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6903#false} is VALID [2018-11-23 11:59:24,751 INFO L273 TraceCheckUtils]: 73: Hoare triple {6903#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6903#false} is VALID [2018-11-23 11:59:24,751 INFO L273 TraceCheckUtils]: 74: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6903#false} is VALID [2018-11-23 11:59:24,751 INFO L273 TraceCheckUtils]: 75: Hoare triple {6903#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6903#false} is VALID [2018-11-23 11:59:24,751 INFO L273 TraceCheckUtils]: 76: Hoare triple {6903#false} assume !(~i~0 < 100000); {6903#false} is VALID [2018-11-23 11:59:24,752 INFO L273 TraceCheckUtils]: 77: Hoare triple {6903#false} ~i~0 := 0; {6903#false} is VALID [2018-11-23 11:59:24,752 INFO L273 TraceCheckUtils]: 78: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {6903#false} is VALID [2018-11-23 11:59:24,752 INFO L273 TraceCheckUtils]: 79: Hoare triple {6903#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6903#false} is VALID [2018-11-23 11:59:24,752 INFO L273 TraceCheckUtils]: 80: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {6903#false} is VALID [2018-11-23 11:59:24,752 INFO L273 TraceCheckUtils]: 81: Hoare triple {6903#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6903#false} is VALID [2018-11-23 11:59:24,752 INFO L273 TraceCheckUtils]: 82: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {6903#false} is VALID [2018-11-23 11:59:24,753 INFO L273 TraceCheckUtils]: 83: Hoare triple {6903#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6903#false} is VALID [2018-11-23 11:59:24,753 INFO L273 TraceCheckUtils]: 84: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {6903#false} is VALID [2018-11-23 11:59:24,753 INFO L273 TraceCheckUtils]: 85: Hoare triple {6903#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6903#false} is VALID [2018-11-23 11:59:24,753 INFO L273 TraceCheckUtils]: 86: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {6903#false} is VALID [2018-11-23 11:59:24,753 INFO L273 TraceCheckUtils]: 87: Hoare triple {6903#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6903#false} is VALID [2018-11-23 11:59:24,753 INFO L273 TraceCheckUtils]: 88: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {6903#false} is VALID [2018-11-23 11:59:24,754 INFO L273 TraceCheckUtils]: 89: Hoare triple {6903#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6903#false} is VALID [2018-11-23 11:59:24,754 INFO L273 TraceCheckUtils]: 90: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {6903#false} is VALID [2018-11-23 11:59:24,754 INFO L273 TraceCheckUtils]: 91: Hoare triple {6903#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6903#false} is VALID [2018-11-23 11:59:24,754 INFO L273 TraceCheckUtils]: 92: Hoare triple {6903#false} assume !(~i~0 < 100000); {6903#false} is VALID [2018-11-23 11:59:24,754 INFO L273 TraceCheckUtils]: 93: Hoare triple {6903#false} havoc ~x~0;~x~0 := 0; {6903#false} is VALID [2018-11-23 11:59:24,754 INFO L273 TraceCheckUtils]: 94: Hoare triple {6903#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {6903#false} is VALID [2018-11-23 11:59:24,755 INFO L256 TraceCheckUtils]: 95: Hoare triple {6903#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {6903#false} is VALID [2018-11-23 11:59:24,755 INFO L273 TraceCheckUtils]: 96: Hoare triple {6903#false} ~cond := #in~cond; {6903#false} is VALID [2018-11-23 11:59:24,755 INFO L273 TraceCheckUtils]: 97: Hoare triple {6903#false} assume 0 == ~cond; {6903#false} is VALID [2018-11-23 11:59:24,755 INFO L273 TraceCheckUtils]: 98: Hoare triple {6903#false} assume !false; {6903#false} is VALID [2018-11-23 11:59:24,760 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-11-23 11:59:24,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:24,761 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:59:24,775 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:00:06,644 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 12:00:06,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:06,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:06,857 INFO L256 TraceCheckUtils]: 0: Hoare triple {6902#true} call ULTIMATE.init(); {6902#true} is VALID [2018-11-23 12:00:06,858 INFO L273 TraceCheckUtils]: 1: Hoare triple {6902#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6902#true} is VALID [2018-11-23 12:00:06,858 INFO L273 TraceCheckUtils]: 2: Hoare triple {6902#true} assume true; {6902#true} is VALID [2018-11-23 12:00:06,858 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6902#true} {6902#true} #105#return; {6902#true} is VALID [2018-11-23 12:00:06,858 INFO L256 TraceCheckUtils]: 4: Hoare triple {6902#true} call #t~ret13 := main(); {6902#true} is VALID [2018-11-23 12:00:06,860 INFO L273 TraceCheckUtils]: 5: Hoare triple {6902#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);havoc ~a~0;~a~0 := 0; {6934#(<= main_~a~0 0)} is VALID [2018-11-23 12:00:06,860 INFO L273 TraceCheckUtils]: 6: Hoare triple {6934#(<= 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; {6934#(<= main_~a~0 0)} is VALID [2018-11-23 12:00:06,861 INFO L273 TraceCheckUtils]: 7: Hoare triple {6934#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6905#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:06,861 INFO L273 TraceCheckUtils]: 8: Hoare triple {6905#(<= 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; {6905#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:06,861 INFO L273 TraceCheckUtils]: 9: Hoare triple {6905#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6906#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:06,862 INFO L273 TraceCheckUtils]: 10: Hoare triple {6906#(<= 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; {6906#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:06,862 INFO L273 TraceCheckUtils]: 11: Hoare triple {6906#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6907#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:06,863 INFO L273 TraceCheckUtils]: 12: Hoare triple {6907#(<= 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; {6907#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:06,863 INFO L273 TraceCheckUtils]: 13: Hoare triple {6907#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6908#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:06,863 INFO L273 TraceCheckUtils]: 14: Hoare triple {6908#(<= 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; {6908#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:06,864 INFO L273 TraceCheckUtils]: 15: Hoare triple {6908#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6909#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:06,865 INFO L273 TraceCheckUtils]: 16: Hoare triple {6909#(<= 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; {6909#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:06,865 INFO L273 TraceCheckUtils]: 17: Hoare triple {6909#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6910#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:06,866 INFO L273 TraceCheckUtils]: 18: Hoare triple {6910#(<= 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; {6910#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:06,867 INFO L273 TraceCheckUtils]: 19: Hoare triple {6910#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6911#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:06,867 INFO L273 TraceCheckUtils]: 20: Hoare triple {6911#(<= 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; {6911#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:06,868 INFO L273 TraceCheckUtils]: 21: Hoare triple {6911#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6912#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:06,869 INFO L273 TraceCheckUtils]: 22: Hoare triple {6912#(<= 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; {6912#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:06,869 INFO L273 TraceCheckUtils]: 23: Hoare triple {6912#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6913#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:06,870 INFO L273 TraceCheckUtils]: 24: Hoare triple {6913#(<= 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; {6913#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:06,871 INFO L273 TraceCheckUtils]: 25: Hoare triple {6913#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6914#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:06,871 INFO L273 TraceCheckUtils]: 26: Hoare triple {6914#(<= 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; {6914#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:06,872 INFO L273 TraceCheckUtils]: 27: Hoare triple {6914#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6915#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:06,873 INFO L273 TraceCheckUtils]: 28: Hoare triple {6915#(<= main_~a~0 11)} assume !(~a~0 < 100000); {6903#false} is VALID [2018-11-23 12:00:06,873 INFO L273 TraceCheckUtils]: 29: Hoare triple {6903#false} havoc ~i~0;~i~0 := 0; {6903#false} is VALID [2018-11-23 12:00:06,873 INFO L273 TraceCheckUtils]: 30: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6903#false} is VALID [2018-11-23 12:00:06,873 INFO L273 TraceCheckUtils]: 31: Hoare triple {6903#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6903#false} is VALID [2018-11-23 12:00:06,873 INFO L273 TraceCheckUtils]: 32: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6903#false} is VALID [2018-11-23 12:00:06,874 INFO L273 TraceCheckUtils]: 33: Hoare triple {6903#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6903#false} is VALID [2018-11-23 12:00:06,874 INFO L273 TraceCheckUtils]: 34: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6903#false} is VALID [2018-11-23 12:00:06,874 INFO L273 TraceCheckUtils]: 35: Hoare triple {6903#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6903#false} is VALID [2018-11-23 12:00:06,874 INFO L273 TraceCheckUtils]: 36: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6903#false} is VALID [2018-11-23 12:00:06,874 INFO L273 TraceCheckUtils]: 37: Hoare triple {6903#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6903#false} is VALID [2018-11-23 12:00:06,875 INFO L273 TraceCheckUtils]: 38: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6903#false} is VALID [2018-11-23 12:00:06,875 INFO L273 TraceCheckUtils]: 39: Hoare triple {6903#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6903#false} is VALID [2018-11-23 12:00:06,875 INFO L273 TraceCheckUtils]: 40: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6903#false} is VALID [2018-11-23 12:00:06,875 INFO L273 TraceCheckUtils]: 41: Hoare triple {6903#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6903#false} is VALID [2018-11-23 12:00:06,875 INFO L273 TraceCheckUtils]: 42: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6903#false} is VALID [2018-11-23 12:00:06,876 INFO L273 TraceCheckUtils]: 43: Hoare triple {6903#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6903#false} is VALID [2018-11-23 12:00:06,876 INFO L273 TraceCheckUtils]: 44: Hoare triple {6903#false} assume !(~i~0 < 100000); {6903#false} is VALID [2018-11-23 12:00:06,876 INFO L273 TraceCheckUtils]: 45: Hoare triple {6903#false} ~i~0 := 0; {6903#false} is VALID [2018-11-23 12:00:06,876 INFO L273 TraceCheckUtils]: 46: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6903#false} is VALID [2018-11-23 12:00:06,877 INFO L273 TraceCheckUtils]: 47: Hoare triple {6903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6903#false} is VALID [2018-11-23 12:00:06,877 INFO L273 TraceCheckUtils]: 48: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6903#false} is VALID [2018-11-23 12:00:06,877 INFO L273 TraceCheckUtils]: 49: Hoare triple {6903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6903#false} is VALID [2018-11-23 12:00:06,877 INFO L273 TraceCheckUtils]: 50: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6903#false} is VALID [2018-11-23 12:00:06,877 INFO L273 TraceCheckUtils]: 51: Hoare triple {6903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6903#false} is VALID [2018-11-23 12:00:06,877 INFO L273 TraceCheckUtils]: 52: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6903#false} is VALID [2018-11-23 12:00:06,878 INFO L273 TraceCheckUtils]: 53: Hoare triple {6903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6903#false} is VALID [2018-11-23 12:00:06,878 INFO L273 TraceCheckUtils]: 54: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6903#false} is VALID [2018-11-23 12:00:06,878 INFO L273 TraceCheckUtils]: 55: Hoare triple {6903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6903#false} is VALID [2018-11-23 12:00:06,878 INFO L273 TraceCheckUtils]: 56: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6903#false} is VALID [2018-11-23 12:00:06,878 INFO L273 TraceCheckUtils]: 57: Hoare triple {6903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6903#false} is VALID [2018-11-23 12:00:06,878 INFO L273 TraceCheckUtils]: 58: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6903#false} is VALID [2018-11-23 12:00:06,878 INFO L273 TraceCheckUtils]: 59: Hoare triple {6903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6903#false} is VALID [2018-11-23 12:00:06,878 INFO L273 TraceCheckUtils]: 60: Hoare triple {6903#false} assume !(~i~0 < 100000); {6903#false} is VALID [2018-11-23 12:00:06,879 INFO L273 TraceCheckUtils]: 61: Hoare triple {6903#false} ~i~0 := 0; {6903#false} is VALID [2018-11-23 12:00:06,879 INFO L273 TraceCheckUtils]: 62: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6903#false} is VALID [2018-11-23 12:00:06,879 INFO L273 TraceCheckUtils]: 63: Hoare triple {6903#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6903#false} is VALID [2018-11-23 12:00:06,879 INFO L273 TraceCheckUtils]: 64: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6903#false} is VALID [2018-11-23 12:00:06,879 INFO L273 TraceCheckUtils]: 65: Hoare triple {6903#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6903#false} is VALID [2018-11-23 12:00:06,879 INFO L273 TraceCheckUtils]: 66: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6903#false} is VALID [2018-11-23 12:00:06,879 INFO L273 TraceCheckUtils]: 67: Hoare triple {6903#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6903#false} is VALID [2018-11-23 12:00:06,879 INFO L273 TraceCheckUtils]: 68: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6903#false} is VALID [2018-11-23 12:00:06,879 INFO L273 TraceCheckUtils]: 69: Hoare triple {6903#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6903#false} is VALID [2018-11-23 12:00:06,880 INFO L273 TraceCheckUtils]: 70: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6903#false} is VALID [2018-11-23 12:00:06,880 INFO L273 TraceCheckUtils]: 71: Hoare triple {6903#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6903#false} is VALID [2018-11-23 12:00:06,880 INFO L273 TraceCheckUtils]: 72: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6903#false} is VALID [2018-11-23 12:00:06,880 INFO L273 TraceCheckUtils]: 73: Hoare triple {6903#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6903#false} is VALID [2018-11-23 12:00:06,880 INFO L273 TraceCheckUtils]: 74: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6903#false} is VALID [2018-11-23 12:00:06,880 INFO L273 TraceCheckUtils]: 75: Hoare triple {6903#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6903#false} is VALID [2018-11-23 12:00:06,880 INFO L273 TraceCheckUtils]: 76: Hoare triple {6903#false} assume !(~i~0 < 100000); {6903#false} is VALID [2018-11-23 12:00:06,880 INFO L273 TraceCheckUtils]: 77: Hoare triple {6903#false} ~i~0 := 0; {6903#false} is VALID [2018-11-23 12:00:06,881 INFO L273 TraceCheckUtils]: 78: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {6903#false} is VALID [2018-11-23 12:00:06,881 INFO L273 TraceCheckUtils]: 79: Hoare triple {6903#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6903#false} is VALID [2018-11-23 12:00:06,881 INFO L273 TraceCheckUtils]: 80: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {6903#false} is VALID [2018-11-23 12:00:06,881 INFO L273 TraceCheckUtils]: 81: Hoare triple {6903#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6903#false} is VALID [2018-11-23 12:00:06,881 INFO L273 TraceCheckUtils]: 82: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {6903#false} is VALID [2018-11-23 12:00:06,881 INFO L273 TraceCheckUtils]: 83: Hoare triple {6903#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6903#false} is VALID [2018-11-23 12:00:06,881 INFO L273 TraceCheckUtils]: 84: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {6903#false} is VALID [2018-11-23 12:00:06,881 INFO L273 TraceCheckUtils]: 85: Hoare triple {6903#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6903#false} is VALID [2018-11-23 12:00:06,881 INFO L273 TraceCheckUtils]: 86: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {6903#false} is VALID [2018-11-23 12:00:06,882 INFO L273 TraceCheckUtils]: 87: Hoare triple {6903#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6903#false} is VALID [2018-11-23 12:00:06,882 INFO L273 TraceCheckUtils]: 88: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {6903#false} is VALID [2018-11-23 12:00:06,882 INFO L273 TraceCheckUtils]: 89: Hoare triple {6903#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6903#false} is VALID [2018-11-23 12:00:06,882 INFO L273 TraceCheckUtils]: 90: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {6903#false} is VALID [2018-11-23 12:00:06,882 INFO L273 TraceCheckUtils]: 91: Hoare triple {6903#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6903#false} is VALID [2018-11-23 12:00:06,882 INFO L273 TraceCheckUtils]: 92: Hoare triple {6903#false} assume !(~i~0 < 100000); {6903#false} is VALID [2018-11-23 12:00:06,882 INFO L273 TraceCheckUtils]: 93: Hoare triple {6903#false} havoc ~x~0;~x~0 := 0; {6903#false} is VALID [2018-11-23 12:00:06,882 INFO L273 TraceCheckUtils]: 94: Hoare triple {6903#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {6903#false} is VALID [2018-11-23 12:00:06,883 INFO L256 TraceCheckUtils]: 95: Hoare triple {6903#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {6903#false} is VALID [2018-11-23 12:00:06,883 INFO L273 TraceCheckUtils]: 96: Hoare triple {6903#false} ~cond := #in~cond; {6903#false} is VALID [2018-11-23 12:00:06,883 INFO L273 TraceCheckUtils]: 97: Hoare triple {6903#false} assume 0 == ~cond; {6903#false} is VALID [2018-11-23 12:00:06,883 INFO L273 TraceCheckUtils]: 98: Hoare triple {6903#false} assume !false; {6903#false} is VALID [2018-11-23 12:00:06,887 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-11-23 12:00:06,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:06,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 12:00:06,915 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 99 [2018-11-23 12:00:06,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:06,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:00:06,965 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:06,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:00:06,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:00:06,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:00:06,967 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand 15 states. [2018-11-23 12:00:07,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:07,216 INFO L93 Difference]: Finished difference Result 182 states and 192 transitions. [2018-11-23 12:00:07,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:00:07,216 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 99 [2018-11-23 12:00:07,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:07,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:00:07,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 88 transitions. [2018-11-23 12:00:07,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:00:07,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 88 transitions. [2018-11-23 12:00:07,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 88 transitions. [2018-11-23 12:00:07,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:07,787 INFO L225 Difference]: With dead ends: 182 [2018-11-23 12:00:07,787 INFO L226 Difference]: Without dead ends: 107 [2018-11-23 12:00:07,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:00:07,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-23 12:00:07,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2018-11-23 12:00:07,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:07,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand 106 states. [2018-11-23 12:00:07,960 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 106 states. [2018-11-23 12:00:07,960 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 106 states. [2018-11-23 12:00:07,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:07,965 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-11-23 12:00:07,965 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-11-23 12:00:07,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:07,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:07,966 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 107 states. [2018-11-23 12:00:07,966 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 107 states. [2018-11-23 12:00:07,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:07,968 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-11-23 12:00:07,968 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-11-23 12:00:07,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:07,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:07,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:07,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:07,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-23 12:00:07,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-11-23 12:00:07,971 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 99 [2018-11-23 12:00:07,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:07,972 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-11-23 12:00:07,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:00:07,972 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-11-23 12:00:07,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-23 12:00:07,973 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:07,973 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 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] [2018-11-23 12:00:07,973 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:07,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:07,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1022264590, now seen corresponding path program 12 times [2018-11-23 12:00:07,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:07,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:07,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:07,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:07,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:08,393 INFO L256 TraceCheckUtils]: 0: Hoare triple {7854#true} call ULTIMATE.init(); {7854#true} is VALID [2018-11-23 12:00:08,393 INFO L273 TraceCheckUtils]: 1: Hoare triple {7854#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7854#true} is VALID [2018-11-23 12:00:08,394 INFO L273 TraceCheckUtils]: 2: Hoare triple {7854#true} assume true; {7854#true} is VALID [2018-11-23 12:00:08,394 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7854#true} {7854#true} #105#return; {7854#true} is VALID [2018-11-23 12:00:08,394 INFO L256 TraceCheckUtils]: 4: Hoare triple {7854#true} call #t~ret13 := main(); {7854#true} is VALID [2018-11-23 12:00:08,395 INFO L273 TraceCheckUtils]: 5: Hoare triple {7854#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);havoc ~a~0;~a~0 := 0; {7856#(= main_~a~0 0)} is VALID [2018-11-23 12:00:08,395 INFO L273 TraceCheckUtils]: 6: Hoare triple {7856#(= 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; {7856#(= main_~a~0 0)} is VALID [2018-11-23 12:00:08,396 INFO L273 TraceCheckUtils]: 7: Hoare triple {7856#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7857#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:08,396 INFO L273 TraceCheckUtils]: 8: Hoare triple {7857#(<= 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; {7857#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:08,397 INFO L273 TraceCheckUtils]: 9: Hoare triple {7857#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7858#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:08,397 INFO L273 TraceCheckUtils]: 10: Hoare triple {7858#(<= 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; {7858#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:08,398 INFO L273 TraceCheckUtils]: 11: Hoare triple {7858#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7859#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:08,399 INFO L273 TraceCheckUtils]: 12: Hoare triple {7859#(<= 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; {7859#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:08,400 INFO L273 TraceCheckUtils]: 13: Hoare triple {7859#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7860#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:08,400 INFO L273 TraceCheckUtils]: 14: Hoare triple {7860#(<= 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; {7860#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:08,401 INFO L273 TraceCheckUtils]: 15: Hoare triple {7860#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7861#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:08,402 INFO L273 TraceCheckUtils]: 16: Hoare triple {7861#(<= 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; {7861#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:08,403 INFO L273 TraceCheckUtils]: 17: Hoare triple {7861#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7862#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:08,403 INFO L273 TraceCheckUtils]: 18: Hoare triple {7862#(<= 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; {7862#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:08,404 INFO L273 TraceCheckUtils]: 19: Hoare triple {7862#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7863#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:08,405 INFO L273 TraceCheckUtils]: 20: Hoare triple {7863#(<= 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; {7863#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:08,406 INFO L273 TraceCheckUtils]: 21: Hoare triple {7863#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7864#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:08,406 INFO L273 TraceCheckUtils]: 22: Hoare triple {7864#(<= 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; {7864#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:08,407 INFO L273 TraceCheckUtils]: 23: Hoare triple {7864#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7865#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:08,408 INFO L273 TraceCheckUtils]: 24: Hoare triple {7865#(<= 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; {7865#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:08,409 INFO L273 TraceCheckUtils]: 25: Hoare triple {7865#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7866#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:08,409 INFO L273 TraceCheckUtils]: 26: Hoare triple {7866#(<= 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; {7866#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:08,410 INFO L273 TraceCheckUtils]: 27: Hoare triple {7866#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7867#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:08,411 INFO L273 TraceCheckUtils]: 28: Hoare triple {7867#(<= 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; {7867#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:08,412 INFO L273 TraceCheckUtils]: 29: Hoare triple {7867#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7868#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:08,412 INFO L273 TraceCheckUtils]: 30: Hoare triple {7868#(<= main_~a~0 12)} assume !(~a~0 < 100000); {7855#false} is VALID [2018-11-23 12:00:08,413 INFO L273 TraceCheckUtils]: 31: Hoare triple {7855#false} havoc ~i~0;~i~0 := 0; {7855#false} is VALID [2018-11-23 12:00:08,413 INFO L273 TraceCheckUtils]: 32: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7855#false} is VALID [2018-11-23 12:00:08,413 INFO L273 TraceCheckUtils]: 33: Hoare triple {7855#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7855#false} is VALID [2018-11-23 12:00:08,413 INFO L273 TraceCheckUtils]: 34: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7855#false} is VALID [2018-11-23 12:00:08,414 INFO L273 TraceCheckUtils]: 35: Hoare triple {7855#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7855#false} is VALID [2018-11-23 12:00:08,414 INFO L273 TraceCheckUtils]: 36: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7855#false} is VALID [2018-11-23 12:00:08,414 INFO L273 TraceCheckUtils]: 37: Hoare triple {7855#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7855#false} is VALID [2018-11-23 12:00:08,415 INFO L273 TraceCheckUtils]: 38: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7855#false} is VALID [2018-11-23 12:00:08,415 INFO L273 TraceCheckUtils]: 39: Hoare triple {7855#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7855#false} is VALID [2018-11-23 12:00:08,415 INFO L273 TraceCheckUtils]: 40: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7855#false} is VALID [2018-11-23 12:00:08,415 INFO L273 TraceCheckUtils]: 41: Hoare triple {7855#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7855#false} is VALID [2018-11-23 12:00:08,416 INFO L273 TraceCheckUtils]: 42: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7855#false} is VALID [2018-11-23 12:00:08,416 INFO L273 TraceCheckUtils]: 43: Hoare triple {7855#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7855#false} is VALID [2018-11-23 12:00:08,416 INFO L273 TraceCheckUtils]: 44: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7855#false} is VALID [2018-11-23 12:00:08,416 INFO L273 TraceCheckUtils]: 45: Hoare triple {7855#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7855#false} is VALID [2018-11-23 12:00:08,417 INFO L273 TraceCheckUtils]: 46: Hoare triple {7855#false} assume !(~i~0 < 100000); {7855#false} is VALID [2018-11-23 12:00:08,417 INFO L273 TraceCheckUtils]: 47: Hoare triple {7855#false} ~i~0 := 0; {7855#false} is VALID [2018-11-23 12:00:08,417 INFO L273 TraceCheckUtils]: 48: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7855#false} is VALID [2018-11-23 12:00:08,417 INFO L273 TraceCheckUtils]: 49: Hoare triple {7855#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7855#false} is VALID [2018-11-23 12:00:08,417 INFO L273 TraceCheckUtils]: 50: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7855#false} is VALID [2018-11-23 12:00:08,418 INFO L273 TraceCheckUtils]: 51: Hoare triple {7855#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7855#false} is VALID [2018-11-23 12:00:08,418 INFO L273 TraceCheckUtils]: 52: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7855#false} is VALID [2018-11-23 12:00:08,418 INFO L273 TraceCheckUtils]: 53: Hoare triple {7855#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7855#false} is VALID [2018-11-23 12:00:08,418 INFO L273 TraceCheckUtils]: 54: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7855#false} is VALID [2018-11-23 12:00:08,418 INFO L273 TraceCheckUtils]: 55: Hoare triple {7855#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7855#false} is VALID [2018-11-23 12:00:08,418 INFO L273 TraceCheckUtils]: 56: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7855#false} is VALID [2018-11-23 12:00:08,418 INFO L273 TraceCheckUtils]: 57: Hoare triple {7855#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7855#false} is VALID [2018-11-23 12:00:08,419 INFO L273 TraceCheckUtils]: 58: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7855#false} is VALID [2018-11-23 12:00:08,419 INFO L273 TraceCheckUtils]: 59: Hoare triple {7855#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7855#false} is VALID [2018-11-23 12:00:08,419 INFO L273 TraceCheckUtils]: 60: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7855#false} is VALID [2018-11-23 12:00:08,419 INFO L273 TraceCheckUtils]: 61: Hoare triple {7855#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7855#false} is VALID [2018-11-23 12:00:08,419 INFO L273 TraceCheckUtils]: 62: Hoare triple {7855#false} assume !(~i~0 < 100000); {7855#false} is VALID [2018-11-23 12:00:08,419 INFO L273 TraceCheckUtils]: 63: Hoare triple {7855#false} ~i~0 := 0; {7855#false} is VALID [2018-11-23 12:00:08,419 INFO L273 TraceCheckUtils]: 64: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {7855#false} is VALID [2018-11-23 12:00:08,420 INFO L273 TraceCheckUtils]: 65: Hoare triple {7855#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7855#false} is VALID [2018-11-23 12:00:08,420 INFO L273 TraceCheckUtils]: 66: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {7855#false} is VALID [2018-11-23 12:00:08,420 INFO L273 TraceCheckUtils]: 67: Hoare triple {7855#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7855#false} is VALID [2018-11-23 12:00:08,420 INFO L273 TraceCheckUtils]: 68: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {7855#false} is VALID [2018-11-23 12:00:08,420 INFO L273 TraceCheckUtils]: 69: Hoare triple {7855#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7855#false} is VALID [2018-11-23 12:00:08,420 INFO L273 TraceCheckUtils]: 70: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {7855#false} is VALID [2018-11-23 12:00:08,421 INFO L273 TraceCheckUtils]: 71: Hoare triple {7855#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7855#false} is VALID [2018-11-23 12:00:08,421 INFO L273 TraceCheckUtils]: 72: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {7855#false} is VALID [2018-11-23 12:00:08,421 INFO L273 TraceCheckUtils]: 73: Hoare triple {7855#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7855#false} is VALID [2018-11-23 12:00:08,421 INFO L273 TraceCheckUtils]: 74: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {7855#false} is VALID [2018-11-23 12:00:08,421 INFO L273 TraceCheckUtils]: 75: Hoare triple {7855#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7855#false} is VALID [2018-11-23 12:00:08,421 INFO L273 TraceCheckUtils]: 76: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {7855#false} is VALID [2018-11-23 12:00:08,421 INFO L273 TraceCheckUtils]: 77: Hoare triple {7855#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7855#false} is VALID [2018-11-23 12:00:08,422 INFO L273 TraceCheckUtils]: 78: Hoare triple {7855#false} assume !(~i~0 < 100000); {7855#false} is VALID [2018-11-23 12:00:08,422 INFO L273 TraceCheckUtils]: 79: Hoare triple {7855#false} ~i~0 := 0; {7855#false} is VALID [2018-11-23 12:00:08,422 INFO L273 TraceCheckUtils]: 80: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {7855#false} is VALID [2018-11-23 12:00:08,422 INFO L273 TraceCheckUtils]: 81: Hoare triple {7855#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7855#false} is VALID [2018-11-23 12:00:08,422 INFO L273 TraceCheckUtils]: 82: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {7855#false} is VALID [2018-11-23 12:00:08,422 INFO L273 TraceCheckUtils]: 83: Hoare triple {7855#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7855#false} is VALID [2018-11-23 12:00:08,422 INFO L273 TraceCheckUtils]: 84: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {7855#false} is VALID [2018-11-23 12:00:08,423 INFO L273 TraceCheckUtils]: 85: Hoare triple {7855#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7855#false} is VALID [2018-11-23 12:00:08,423 INFO L273 TraceCheckUtils]: 86: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {7855#false} is VALID [2018-11-23 12:00:08,423 INFO L273 TraceCheckUtils]: 87: Hoare triple {7855#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7855#false} is VALID [2018-11-23 12:00:08,423 INFO L273 TraceCheckUtils]: 88: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {7855#false} is VALID [2018-11-23 12:00:08,423 INFO L273 TraceCheckUtils]: 89: Hoare triple {7855#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7855#false} is VALID [2018-11-23 12:00:08,423 INFO L273 TraceCheckUtils]: 90: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {7855#false} is VALID [2018-11-23 12:00:08,423 INFO L273 TraceCheckUtils]: 91: Hoare triple {7855#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7855#false} is VALID [2018-11-23 12:00:08,424 INFO L273 TraceCheckUtils]: 92: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {7855#false} is VALID [2018-11-23 12:00:08,424 INFO L273 TraceCheckUtils]: 93: Hoare triple {7855#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7855#false} is VALID [2018-11-23 12:00:08,424 INFO L273 TraceCheckUtils]: 94: Hoare triple {7855#false} assume !(~i~0 < 100000); {7855#false} is VALID [2018-11-23 12:00:08,424 INFO L273 TraceCheckUtils]: 95: Hoare triple {7855#false} havoc ~x~0;~x~0 := 0; {7855#false} is VALID [2018-11-23 12:00:08,424 INFO L273 TraceCheckUtils]: 96: Hoare triple {7855#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {7855#false} is VALID [2018-11-23 12:00:08,424 INFO L256 TraceCheckUtils]: 97: Hoare triple {7855#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {7855#false} is VALID [2018-11-23 12:00:08,425 INFO L273 TraceCheckUtils]: 98: Hoare triple {7855#false} ~cond := #in~cond; {7855#false} is VALID [2018-11-23 12:00:08,425 INFO L273 TraceCheckUtils]: 99: Hoare triple {7855#false} assume 0 == ~cond; {7855#false} is VALID [2018-11-23 12:00:08,425 INFO L273 TraceCheckUtils]: 100: Hoare triple {7855#false} assume !false; {7855#false} is VALID [2018-11-23 12:00:08,434 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-11-23 12:00:08,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:08,435 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:08,445 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:00:20,875 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 12:00:20,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:20,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:21,260 INFO L256 TraceCheckUtils]: 0: Hoare triple {7854#true} call ULTIMATE.init(); {7854#true} is VALID [2018-11-23 12:00:21,261 INFO L273 TraceCheckUtils]: 1: Hoare triple {7854#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7854#true} is VALID [2018-11-23 12:00:21,261 INFO L273 TraceCheckUtils]: 2: Hoare triple {7854#true} assume true; {7854#true} is VALID [2018-11-23 12:00:21,261 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7854#true} {7854#true} #105#return; {7854#true} is VALID [2018-11-23 12:00:21,261 INFO L256 TraceCheckUtils]: 4: Hoare triple {7854#true} call #t~ret13 := main(); {7854#true} is VALID [2018-11-23 12:00:21,262 INFO L273 TraceCheckUtils]: 5: Hoare triple {7854#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);havoc ~a~0;~a~0 := 0; {7854#true} is VALID [2018-11-23 12:00:21,262 INFO L273 TraceCheckUtils]: 6: Hoare triple {7854#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; {7854#true} is VALID [2018-11-23 12:00:21,262 INFO L273 TraceCheckUtils]: 7: Hoare triple {7854#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7854#true} is VALID [2018-11-23 12:00:21,262 INFO L273 TraceCheckUtils]: 8: Hoare triple {7854#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; {7854#true} is VALID [2018-11-23 12:00:21,263 INFO L273 TraceCheckUtils]: 9: Hoare triple {7854#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7854#true} is VALID [2018-11-23 12:00:21,263 INFO L273 TraceCheckUtils]: 10: Hoare triple {7854#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; {7854#true} is VALID [2018-11-23 12:00:21,263 INFO L273 TraceCheckUtils]: 11: Hoare triple {7854#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7854#true} is VALID [2018-11-23 12:00:21,263 INFO L273 TraceCheckUtils]: 12: Hoare triple {7854#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; {7854#true} is VALID [2018-11-23 12:00:21,264 INFO L273 TraceCheckUtils]: 13: Hoare triple {7854#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7854#true} is VALID [2018-11-23 12:00:21,264 INFO L273 TraceCheckUtils]: 14: Hoare triple {7854#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; {7854#true} is VALID [2018-11-23 12:00:21,264 INFO L273 TraceCheckUtils]: 15: Hoare triple {7854#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7854#true} is VALID [2018-11-23 12:00:21,264 INFO L273 TraceCheckUtils]: 16: Hoare triple {7854#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; {7854#true} is VALID [2018-11-23 12:00:21,264 INFO L273 TraceCheckUtils]: 17: Hoare triple {7854#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7854#true} is VALID [2018-11-23 12:00:21,265 INFO L273 TraceCheckUtils]: 18: Hoare triple {7854#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; {7854#true} is VALID [2018-11-23 12:00:21,265 INFO L273 TraceCheckUtils]: 19: Hoare triple {7854#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7854#true} is VALID [2018-11-23 12:00:21,265 INFO L273 TraceCheckUtils]: 20: Hoare triple {7854#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; {7854#true} is VALID [2018-11-23 12:00:21,265 INFO L273 TraceCheckUtils]: 21: Hoare triple {7854#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7854#true} is VALID [2018-11-23 12:00:21,266 INFO L273 TraceCheckUtils]: 22: Hoare triple {7854#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; {7854#true} is VALID [2018-11-23 12:00:21,266 INFO L273 TraceCheckUtils]: 23: Hoare triple {7854#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7854#true} is VALID [2018-11-23 12:00:21,266 INFO L273 TraceCheckUtils]: 24: Hoare triple {7854#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; {7854#true} is VALID [2018-11-23 12:00:21,266 INFO L273 TraceCheckUtils]: 25: Hoare triple {7854#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7854#true} is VALID [2018-11-23 12:00:21,266 INFO L273 TraceCheckUtils]: 26: Hoare triple {7854#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; {7854#true} is VALID [2018-11-23 12:00:21,267 INFO L273 TraceCheckUtils]: 27: Hoare triple {7854#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7854#true} is VALID [2018-11-23 12:00:21,267 INFO L273 TraceCheckUtils]: 28: Hoare triple {7854#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; {7854#true} is VALID [2018-11-23 12:00:21,267 INFO L273 TraceCheckUtils]: 29: Hoare triple {7854#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7854#true} is VALID [2018-11-23 12:00:21,267 INFO L273 TraceCheckUtils]: 30: Hoare triple {7854#true} assume !(~a~0 < 100000); {7854#true} is VALID [2018-11-23 12:00:21,282 INFO L273 TraceCheckUtils]: 31: Hoare triple {7854#true} havoc ~i~0;~i~0 := 0; {7965#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:21,291 INFO L273 TraceCheckUtils]: 32: Hoare triple {7965#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7965#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:21,307 INFO L273 TraceCheckUtils]: 33: Hoare triple {7965#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7972#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:21,316 INFO L273 TraceCheckUtils]: 34: Hoare triple {7972#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7972#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:21,317 INFO L273 TraceCheckUtils]: 35: Hoare triple {7972#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7979#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:21,319 INFO L273 TraceCheckUtils]: 36: Hoare triple {7979#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7979#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:21,322 INFO L273 TraceCheckUtils]: 37: Hoare triple {7979#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7986#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:21,322 INFO L273 TraceCheckUtils]: 38: Hoare triple {7986#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7986#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:21,324 INFO L273 TraceCheckUtils]: 39: Hoare triple {7986#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7993#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:21,324 INFO L273 TraceCheckUtils]: 40: Hoare triple {7993#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7993#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:21,327 INFO L273 TraceCheckUtils]: 41: Hoare triple {7993#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8000#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:21,327 INFO L273 TraceCheckUtils]: 42: Hoare triple {8000#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8000#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:21,330 INFO L273 TraceCheckUtils]: 43: Hoare triple {8000#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8007#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:21,330 INFO L273 TraceCheckUtils]: 44: Hoare triple {8007#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8007#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:21,332 INFO L273 TraceCheckUtils]: 45: Hoare triple {8007#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8014#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:21,332 INFO L273 TraceCheckUtils]: 46: Hoare triple {8014#(<= main_~i~0 7)} assume !(~i~0 < 100000); {7855#false} is VALID [2018-11-23 12:00:21,332 INFO L273 TraceCheckUtils]: 47: Hoare triple {7855#false} ~i~0 := 0; {7855#false} is VALID [2018-11-23 12:00:21,332 INFO L273 TraceCheckUtils]: 48: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7855#false} is VALID [2018-11-23 12:00:21,333 INFO L273 TraceCheckUtils]: 49: Hoare triple {7855#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7855#false} is VALID [2018-11-23 12:00:21,333 INFO L273 TraceCheckUtils]: 50: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7855#false} is VALID [2018-11-23 12:00:21,333 INFO L273 TraceCheckUtils]: 51: Hoare triple {7855#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7855#false} is VALID [2018-11-23 12:00:21,333 INFO L273 TraceCheckUtils]: 52: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7855#false} is VALID [2018-11-23 12:00:21,333 INFO L273 TraceCheckUtils]: 53: Hoare triple {7855#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7855#false} is VALID [2018-11-23 12:00:21,333 INFO L273 TraceCheckUtils]: 54: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7855#false} is VALID [2018-11-23 12:00:21,333 INFO L273 TraceCheckUtils]: 55: Hoare triple {7855#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7855#false} is VALID [2018-11-23 12:00:21,334 INFO L273 TraceCheckUtils]: 56: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7855#false} is VALID [2018-11-23 12:00:21,334 INFO L273 TraceCheckUtils]: 57: Hoare triple {7855#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7855#false} is VALID [2018-11-23 12:00:21,334 INFO L273 TraceCheckUtils]: 58: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7855#false} is VALID [2018-11-23 12:00:21,334 INFO L273 TraceCheckUtils]: 59: Hoare triple {7855#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7855#false} is VALID [2018-11-23 12:00:21,334 INFO L273 TraceCheckUtils]: 60: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7855#false} is VALID [2018-11-23 12:00:21,334 INFO L273 TraceCheckUtils]: 61: Hoare triple {7855#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7855#false} is VALID [2018-11-23 12:00:21,334 INFO L273 TraceCheckUtils]: 62: Hoare triple {7855#false} assume !(~i~0 < 100000); {7855#false} is VALID [2018-11-23 12:00:21,335 INFO L273 TraceCheckUtils]: 63: Hoare triple {7855#false} ~i~0 := 0; {7855#false} is VALID [2018-11-23 12:00:21,335 INFO L273 TraceCheckUtils]: 64: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {7855#false} is VALID [2018-11-23 12:00:21,335 INFO L273 TraceCheckUtils]: 65: Hoare triple {7855#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7855#false} is VALID [2018-11-23 12:00:21,335 INFO L273 TraceCheckUtils]: 66: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {7855#false} is VALID [2018-11-23 12:00:21,335 INFO L273 TraceCheckUtils]: 67: Hoare triple {7855#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7855#false} is VALID [2018-11-23 12:00:21,335 INFO L273 TraceCheckUtils]: 68: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {7855#false} is VALID [2018-11-23 12:00:21,336 INFO L273 TraceCheckUtils]: 69: Hoare triple {7855#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7855#false} is VALID [2018-11-23 12:00:21,336 INFO L273 TraceCheckUtils]: 70: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {7855#false} is VALID [2018-11-23 12:00:21,336 INFO L273 TraceCheckUtils]: 71: Hoare triple {7855#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7855#false} is VALID [2018-11-23 12:00:21,336 INFO L273 TraceCheckUtils]: 72: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {7855#false} is VALID [2018-11-23 12:00:21,336 INFO L273 TraceCheckUtils]: 73: Hoare triple {7855#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7855#false} is VALID [2018-11-23 12:00:21,336 INFO L273 TraceCheckUtils]: 74: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {7855#false} is VALID [2018-11-23 12:00:21,336 INFO L273 TraceCheckUtils]: 75: Hoare triple {7855#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7855#false} is VALID [2018-11-23 12:00:21,337 INFO L273 TraceCheckUtils]: 76: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {7855#false} is VALID [2018-11-23 12:00:21,337 INFO L273 TraceCheckUtils]: 77: Hoare triple {7855#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7855#false} is VALID [2018-11-23 12:00:21,337 INFO L273 TraceCheckUtils]: 78: Hoare triple {7855#false} assume !(~i~0 < 100000); {7855#false} is VALID [2018-11-23 12:00:21,337 INFO L273 TraceCheckUtils]: 79: Hoare triple {7855#false} ~i~0 := 0; {7855#false} is VALID [2018-11-23 12:00:21,337 INFO L273 TraceCheckUtils]: 80: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {7855#false} is VALID [2018-11-23 12:00:21,337 INFO L273 TraceCheckUtils]: 81: Hoare triple {7855#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7855#false} is VALID [2018-11-23 12:00:21,337 INFO L273 TraceCheckUtils]: 82: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {7855#false} is VALID [2018-11-23 12:00:21,338 INFO L273 TraceCheckUtils]: 83: Hoare triple {7855#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7855#false} is VALID [2018-11-23 12:00:21,338 INFO L273 TraceCheckUtils]: 84: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {7855#false} is VALID [2018-11-23 12:00:21,338 INFO L273 TraceCheckUtils]: 85: Hoare triple {7855#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7855#false} is VALID [2018-11-23 12:00:21,338 INFO L273 TraceCheckUtils]: 86: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {7855#false} is VALID [2018-11-23 12:00:21,338 INFO L273 TraceCheckUtils]: 87: Hoare triple {7855#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7855#false} is VALID [2018-11-23 12:00:21,338 INFO L273 TraceCheckUtils]: 88: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {7855#false} is VALID [2018-11-23 12:00:21,338 INFO L273 TraceCheckUtils]: 89: Hoare triple {7855#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7855#false} is VALID [2018-11-23 12:00:21,339 INFO L273 TraceCheckUtils]: 90: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {7855#false} is VALID [2018-11-23 12:00:21,339 INFO L273 TraceCheckUtils]: 91: Hoare triple {7855#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7855#false} is VALID [2018-11-23 12:00:21,339 INFO L273 TraceCheckUtils]: 92: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {7855#false} is VALID [2018-11-23 12:00:21,339 INFO L273 TraceCheckUtils]: 93: Hoare triple {7855#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7855#false} is VALID [2018-11-23 12:00:21,339 INFO L273 TraceCheckUtils]: 94: Hoare triple {7855#false} assume !(~i~0 < 100000); {7855#false} is VALID [2018-11-23 12:00:21,339 INFO L273 TraceCheckUtils]: 95: Hoare triple {7855#false} havoc ~x~0;~x~0 := 0; {7855#false} is VALID [2018-11-23 12:00:21,339 INFO L273 TraceCheckUtils]: 96: Hoare triple {7855#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {7855#false} is VALID [2018-11-23 12:00:21,340 INFO L256 TraceCheckUtils]: 97: Hoare triple {7855#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {7855#false} is VALID [2018-11-23 12:00:21,340 INFO L273 TraceCheckUtils]: 98: Hoare triple {7855#false} ~cond := #in~cond; {7855#false} is VALID [2018-11-23 12:00:21,340 INFO L273 TraceCheckUtils]: 99: Hoare triple {7855#false} assume 0 == ~cond; {7855#false} is VALID [2018-11-23 12:00:21,340 INFO L273 TraceCheckUtils]: 100: Hoare triple {7855#false} assume !false; {7855#false} is VALID [2018-11-23 12:00:21,349 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2018-11-23 12:00:21,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:21,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2018-11-23 12:00:21,393 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 101 [2018-11-23 12:00:21,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:21,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:00:21,474 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:21,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:00:21,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:00:21,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:00:21,475 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 23 states. [2018-11-23 12:00:22,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:22,493 INFO L93 Difference]: Finished difference Result 196 states and 210 transitions. [2018-11-23 12:00:22,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 12:00:22,493 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 101 [2018-11-23 12:00:22,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:22,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:00:22,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 158 transitions. [2018-11-23 12:00:22,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:00:22,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 158 transitions. [2018-11-23 12:00:22,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 158 transitions. [2018-11-23 12:00:22,641 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:22,644 INFO L225 Difference]: With dead ends: 196 [2018-11-23 12:00:22,645 INFO L226 Difference]: Without dead ends: 121 [2018-11-23 12:00:22,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:00:22,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-23 12:00:22,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 116. [2018-11-23 12:00:22,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:22,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 116 states. [2018-11-23 12:00:22,700 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 116 states. [2018-11-23 12:00:22,700 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 116 states. [2018-11-23 12:00:22,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:22,702 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2018-11-23 12:00:22,702 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2018-11-23 12:00:22,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:22,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:22,703 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 121 states. [2018-11-23 12:00:22,703 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 121 states. [2018-11-23 12:00:22,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:22,706 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2018-11-23 12:00:22,706 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2018-11-23 12:00:22,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:22,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:22,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:22,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:22,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-23 12:00:22,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 121 transitions. [2018-11-23 12:00:22,709 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 121 transitions. Word has length 101 [2018-11-23 12:00:22,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:22,709 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 121 transitions. [2018-11-23 12:00:22,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:00:22,709 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 121 transitions. [2018-11-23 12:00:22,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-23 12:00:22,710 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:22,710 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 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] [2018-11-23 12:00:22,711 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:22,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:22,711 INFO L82 PathProgramCache]: Analyzing trace with hash -198624504, now seen corresponding path program 13 times [2018-11-23 12:00:22,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:22,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:22,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:22,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:22,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:23,036 INFO L256 TraceCheckUtils]: 0: Hoare triple {8882#true} call ULTIMATE.init(); {8882#true} is VALID [2018-11-23 12:00:23,036 INFO L273 TraceCheckUtils]: 1: Hoare triple {8882#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8882#true} is VALID [2018-11-23 12:00:23,036 INFO L273 TraceCheckUtils]: 2: Hoare triple {8882#true} assume true; {8882#true} is VALID [2018-11-23 12:00:23,037 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8882#true} {8882#true} #105#return; {8882#true} is VALID [2018-11-23 12:00:23,037 INFO L256 TraceCheckUtils]: 4: Hoare triple {8882#true} call #t~ret13 := main(); {8882#true} is VALID [2018-11-23 12:00:23,037 INFO L273 TraceCheckUtils]: 5: Hoare triple {8882#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);havoc ~a~0;~a~0 := 0; {8884#(= main_~a~0 0)} is VALID [2018-11-23 12:00:23,038 INFO L273 TraceCheckUtils]: 6: Hoare triple {8884#(= 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; {8884#(= main_~a~0 0)} is VALID [2018-11-23 12:00:23,038 INFO L273 TraceCheckUtils]: 7: Hoare triple {8884#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8885#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:23,039 INFO L273 TraceCheckUtils]: 8: Hoare triple {8885#(<= 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; {8885#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:23,039 INFO L273 TraceCheckUtils]: 9: Hoare triple {8885#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8886#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:23,039 INFO L273 TraceCheckUtils]: 10: Hoare triple {8886#(<= 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; {8886#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:23,040 INFO L273 TraceCheckUtils]: 11: Hoare triple {8886#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8887#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:23,040 INFO L273 TraceCheckUtils]: 12: Hoare triple {8887#(<= 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; {8887#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:23,040 INFO L273 TraceCheckUtils]: 13: Hoare triple {8887#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8888#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:23,041 INFO L273 TraceCheckUtils]: 14: Hoare triple {8888#(<= 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; {8888#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:23,041 INFO L273 TraceCheckUtils]: 15: Hoare triple {8888#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8889#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:23,042 INFO L273 TraceCheckUtils]: 16: Hoare triple {8889#(<= 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; {8889#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:23,043 INFO L273 TraceCheckUtils]: 17: Hoare triple {8889#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8890#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:23,043 INFO L273 TraceCheckUtils]: 18: Hoare triple {8890#(<= 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; {8890#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:23,044 INFO L273 TraceCheckUtils]: 19: Hoare triple {8890#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8891#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:23,044 INFO L273 TraceCheckUtils]: 20: Hoare triple {8891#(<= 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; {8891#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:23,045 INFO L273 TraceCheckUtils]: 21: Hoare triple {8891#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8892#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:23,046 INFO L273 TraceCheckUtils]: 22: Hoare triple {8892#(<= 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; {8892#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:23,046 INFO L273 TraceCheckUtils]: 23: Hoare triple {8892#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8893#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:23,047 INFO L273 TraceCheckUtils]: 24: Hoare triple {8893#(<= 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; {8893#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:23,047 INFO L273 TraceCheckUtils]: 25: Hoare triple {8893#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8894#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:23,048 INFO L273 TraceCheckUtils]: 26: Hoare triple {8894#(<= 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; {8894#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:23,049 INFO L273 TraceCheckUtils]: 27: Hoare triple {8894#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8895#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:23,049 INFO L273 TraceCheckUtils]: 28: Hoare triple {8895#(<= 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; {8895#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:23,050 INFO L273 TraceCheckUtils]: 29: Hoare triple {8895#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8896#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:23,050 INFO L273 TraceCheckUtils]: 30: Hoare triple {8896#(<= 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; {8896#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:23,051 INFO L273 TraceCheckUtils]: 31: Hoare triple {8896#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8897#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:23,052 INFO L273 TraceCheckUtils]: 32: Hoare triple {8897#(<= main_~a~0 13)} assume !(~a~0 < 100000); {8883#false} is VALID [2018-11-23 12:00:23,052 INFO L273 TraceCheckUtils]: 33: Hoare triple {8883#false} havoc ~i~0;~i~0 := 0; {8883#false} is VALID [2018-11-23 12:00:23,052 INFO L273 TraceCheckUtils]: 34: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8883#false} is VALID [2018-11-23 12:00:23,052 INFO L273 TraceCheckUtils]: 35: Hoare triple {8883#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8883#false} is VALID [2018-11-23 12:00:23,052 INFO L273 TraceCheckUtils]: 36: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8883#false} is VALID [2018-11-23 12:00:23,053 INFO L273 TraceCheckUtils]: 37: Hoare triple {8883#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8883#false} is VALID [2018-11-23 12:00:23,053 INFO L273 TraceCheckUtils]: 38: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8883#false} is VALID [2018-11-23 12:00:23,053 INFO L273 TraceCheckUtils]: 39: Hoare triple {8883#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8883#false} is VALID [2018-11-23 12:00:23,054 INFO L273 TraceCheckUtils]: 40: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8883#false} is VALID [2018-11-23 12:00:23,054 INFO L273 TraceCheckUtils]: 41: Hoare triple {8883#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8883#false} is VALID [2018-11-23 12:00:23,054 INFO L273 TraceCheckUtils]: 42: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8883#false} is VALID [2018-11-23 12:00:23,054 INFO L273 TraceCheckUtils]: 43: Hoare triple {8883#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8883#false} is VALID [2018-11-23 12:00:23,055 INFO L273 TraceCheckUtils]: 44: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8883#false} is VALID [2018-11-23 12:00:23,055 INFO L273 TraceCheckUtils]: 45: Hoare triple {8883#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8883#false} is VALID [2018-11-23 12:00:23,055 INFO L273 TraceCheckUtils]: 46: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8883#false} is VALID [2018-11-23 12:00:23,055 INFO L273 TraceCheckUtils]: 47: Hoare triple {8883#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8883#false} is VALID [2018-11-23 12:00:23,056 INFO L273 TraceCheckUtils]: 48: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8883#false} is VALID [2018-11-23 12:00:23,056 INFO L273 TraceCheckUtils]: 49: Hoare triple {8883#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8883#false} is VALID [2018-11-23 12:00:23,056 INFO L273 TraceCheckUtils]: 50: Hoare triple {8883#false} assume !(~i~0 < 100000); {8883#false} is VALID [2018-11-23 12:00:23,056 INFO L273 TraceCheckUtils]: 51: Hoare triple {8883#false} ~i~0 := 0; {8883#false} is VALID [2018-11-23 12:00:23,056 INFO L273 TraceCheckUtils]: 52: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8883#false} is VALID [2018-11-23 12:00:23,057 INFO L273 TraceCheckUtils]: 53: Hoare triple {8883#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8883#false} is VALID [2018-11-23 12:00:23,057 INFO L273 TraceCheckUtils]: 54: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8883#false} is VALID [2018-11-23 12:00:23,057 INFO L273 TraceCheckUtils]: 55: Hoare triple {8883#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8883#false} is VALID [2018-11-23 12:00:23,057 INFO L273 TraceCheckUtils]: 56: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8883#false} is VALID [2018-11-23 12:00:23,057 INFO L273 TraceCheckUtils]: 57: Hoare triple {8883#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8883#false} is VALID [2018-11-23 12:00:23,057 INFO L273 TraceCheckUtils]: 58: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8883#false} is VALID [2018-11-23 12:00:23,057 INFO L273 TraceCheckUtils]: 59: Hoare triple {8883#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8883#false} is VALID [2018-11-23 12:00:23,058 INFO L273 TraceCheckUtils]: 60: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8883#false} is VALID [2018-11-23 12:00:23,058 INFO L273 TraceCheckUtils]: 61: Hoare triple {8883#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8883#false} is VALID [2018-11-23 12:00:23,058 INFO L273 TraceCheckUtils]: 62: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8883#false} is VALID [2018-11-23 12:00:23,058 INFO L273 TraceCheckUtils]: 63: Hoare triple {8883#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8883#false} is VALID [2018-11-23 12:00:23,058 INFO L273 TraceCheckUtils]: 64: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8883#false} is VALID [2018-11-23 12:00:23,058 INFO L273 TraceCheckUtils]: 65: Hoare triple {8883#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8883#false} is VALID [2018-11-23 12:00:23,059 INFO L273 TraceCheckUtils]: 66: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8883#false} is VALID [2018-11-23 12:00:23,059 INFO L273 TraceCheckUtils]: 67: Hoare triple {8883#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8883#false} is VALID [2018-11-23 12:00:23,059 INFO L273 TraceCheckUtils]: 68: Hoare triple {8883#false} assume !(~i~0 < 100000); {8883#false} is VALID [2018-11-23 12:00:23,059 INFO L273 TraceCheckUtils]: 69: Hoare triple {8883#false} ~i~0 := 0; {8883#false} is VALID [2018-11-23 12:00:23,059 INFO L273 TraceCheckUtils]: 70: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8883#false} is VALID [2018-11-23 12:00:23,059 INFO L273 TraceCheckUtils]: 71: Hoare triple {8883#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8883#false} is VALID [2018-11-23 12:00:23,060 INFO L273 TraceCheckUtils]: 72: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8883#false} is VALID [2018-11-23 12:00:23,060 INFO L273 TraceCheckUtils]: 73: Hoare triple {8883#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8883#false} is VALID [2018-11-23 12:00:23,060 INFO L273 TraceCheckUtils]: 74: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8883#false} is VALID [2018-11-23 12:00:23,060 INFO L273 TraceCheckUtils]: 75: Hoare triple {8883#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8883#false} is VALID [2018-11-23 12:00:23,060 INFO L273 TraceCheckUtils]: 76: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8883#false} is VALID [2018-11-23 12:00:23,060 INFO L273 TraceCheckUtils]: 77: Hoare triple {8883#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8883#false} is VALID [2018-11-23 12:00:23,060 INFO L273 TraceCheckUtils]: 78: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8883#false} is VALID [2018-11-23 12:00:23,061 INFO L273 TraceCheckUtils]: 79: Hoare triple {8883#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8883#false} is VALID [2018-11-23 12:00:23,061 INFO L273 TraceCheckUtils]: 80: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8883#false} is VALID [2018-11-23 12:00:23,061 INFO L273 TraceCheckUtils]: 81: Hoare triple {8883#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8883#false} is VALID [2018-11-23 12:00:23,061 INFO L273 TraceCheckUtils]: 82: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8883#false} is VALID [2018-11-23 12:00:23,061 INFO L273 TraceCheckUtils]: 83: Hoare triple {8883#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8883#false} is VALID [2018-11-23 12:00:23,061 INFO L273 TraceCheckUtils]: 84: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8883#false} is VALID [2018-11-23 12:00:23,062 INFO L273 TraceCheckUtils]: 85: Hoare triple {8883#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8883#false} is VALID [2018-11-23 12:00:23,062 INFO L273 TraceCheckUtils]: 86: Hoare triple {8883#false} assume !(~i~0 < 100000); {8883#false} is VALID [2018-11-23 12:00:23,062 INFO L273 TraceCheckUtils]: 87: Hoare triple {8883#false} ~i~0 := 0; {8883#false} is VALID [2018-11-23 12:00:23,062 INFO L273 TraceCheckUtils]: 88: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {8883#false} is VALID [2018-11-23 12:00:23,062 INFO L273 TraceCheckUtils]: 89: Hoare triple {8883#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8883#false} is VALID [2018-11-23 12:00:23,062 INFO L273 TraceCheckUtils]: 90: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {8883#false} is VALID [2018-11-23 12:00:23,063 INFO L273 TraceCheckUtils]: 91: Hoare triple {8883#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8883#false} is VALID [2018-11-23 12:00:23,063 INFO L273 TraceCheckUtils]: 92: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {8883#false} is VALID [2018-11-23 12:00:23,063 INFO L273 TraceCheckUtils]: 93: Hoare triple {8883#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8883#false} is VALID [2018-11-23 12:00:23,063 INFO L273 TraceCheckUtils]: 94: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {8883#false} is VALID [2018-11-23 12:00:23,063 INFO L273 TraceCheckUtils]: 95: Hoare triple {8883#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8883#false} is VALID [2018-11-23 12:00:23,063 INFO L273 TraceCheckUtils]: 96: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {8883#false} is VALID [2018-11-23 12:00:23,063 INFO L273 TraceCheckUtils]: 97: Hoare triple {8883#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8883#false} is VALID [2018-11-23 12:00:23,064 INFO L273 TraceCheckUtils]: 98: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {8883#false} is VALID [2018-11-23 12:00:23,064 INFO L273 TraceCheckUtils]: 99: Hoare triple {8883#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8883#false} is VALID [2018-11-23 12:00:23,064 INFO L273 TraceCheckUtils]: 100: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {8883#false} is VALID [2018-11-23 12:00:23,064 INFO L273 TraceCheckUtils]: 101: Hoare triple {8883#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8883#false} is VALID [2018-11-23 12:00:23,064 INFO L273 TraceCheckUtils]: 102: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {8883#false} is VALID [2018-11-23 12:00:23,064 INFO L273 TraceCheckUtils]: 103: Hoare triple {8883#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8883#false} is VALID [2018-11-23 12:00:23,065 INFO L273 TraceCheckUtils]: 104: Hoare triple {8883#false} assume !(~i~0 < 100000); {8883#false} is VALID [2018-11-23 12:00:23,065 INFO L273 TraceCheckUtils]: 105: Hoare triple {8883#false} havoc ~x~0;~x~0 := 0; {8883#false} is VALID [2018-11-23 12:00:23,065 INFO L273 TraceCheckUtils]: 106: Hoare triple {8883#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {8883#false} is VALID [2018-11-23 12:00:23,065 INFO L256 TraceCheckUtils]: 107: Hoare triple {8883#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {8883#false} is VALID [2018-11-23 12:00:23,065 INFO L273 TraceCheckUtils]: 108: Hoare triple {8883#false} ~cond := #in~cond; {8883#false} is VALID [2018-11-23 12:00:23,065 INFO L273 TraceCheckUtils]: 109: Hoare triple {8883#false} assume 0 == ~cond; {8883#false} is VALID [2018-11-23 12:00:23,065 INFO L273 TraceCheckUtils]: 110: Hoare triple {8883#false} assume !false; {8883#false} is VALID [2018-11-23 12:00:23,070 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-23 12:00:23,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:23,071 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:23,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:00:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:23,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:23,368 INFO L256 TraceCheckUtils]: 0: Hoare triple {8882#true} call ULTIMATE.init(); {8882#true} is VALID [2018-11-23 12:00:23,369 INFO L273 TraceCheckUtils]: 1: Hoare triple {8882#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8882#true} is VALID [2018-11-23 12:00:23,369 INFO L273 TraceCheckUtils]: 2: Hoare triple {8882#true} assume true; {8882#true} is VALID [2018-11-23 12:00:23,369 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8882#true} {8882#true} #105#return; {8882#true} is VALID [2018-11-23 12:00:23,369 INFO L256 TraceCheckUtils]: 4: Hoare triple {8882#true} call #t~ret13 := main(); {8882#true} is VALID [2018-11-23 12:00:23,370 INFO L273 TraceCheckUtils]: 5: Hoare triple {8882#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);havoc ~a~0;~a~0 := 0; {8916#(<= main_~a~0 0)} is VALID [2018-11-23 12:00:23,371 INFO L273 TraceCheckUtils]: 6: Hoare triple {8916#(<= 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; {8916#(<= main_~a~0 0)} is VALID [2018-11-23 12:00:23,371 INFO L273 TraceCheckUtils]: 7: Hoare triple {8916#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8885#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:23,372 INFO L273 TraceCheckUtils]: 8: Hoare triple {8885#(<= 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; {8885#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:23,372 INFO L273 TraceCheckUtils]: 9: Hoare triple {8885#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8886#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:23,372 INFO L273 TraceCheckUtils]: 10: Hoare triple {8886#(<= 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; {8886#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:23,373 INFO L273 TraceCheckUtils]: 11: Hoare triple {8886#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8887#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:23,374 INFO L273 TraceCheckUtils]: 12: Hoare triple {8887#(<= 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; {8887#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:23,374 INFO L273 TraceCheckUtils]: 13: Hoare triple {8887#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8888#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:23,375 INFO L273 TraceCheckUtils]: 14: Hoare triple {8888#(<= 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; {8888#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:23,376 INFO L273 TraceCheckUtils]: 15: Hoare triple {8888#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8889#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:23,376 INFO L273 TraceCheckUtils]: 16: Hoare triple {8889#(<= 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; {8889#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:23,377 INFO L273 TraceCheckUtils]: 17: Hoare triple {8889#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8890#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:23,377 INFO L273 TraceCheckUtils]: 18: Hoare triple {8890#(<= 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; {8890#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:23,378 INFO L273 TraceCheckUtils]: 19: Hoare triple {8890#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8891#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:23,379 INFO L273 TraceCheckUtils]: 20: Hoare triple {8891#(<= 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; {8891#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:23,379 INFO L273 TraceCheckUtils]: 21: Hoare triple {8891#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8892#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:23,380 INFO L273 TraceCheckUtils]: 22: Hoare triple {8892#(<= 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; {8892#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:23,381 INFO L273 TraceCheckUtils]: 23: Hoare triple {8892#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8893#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:23,381 INFO L273 TraceCheckUtils]: 24: Hoare triple {8893#(<= 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; {8893#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:23,382 INFO L273 TraceCheckUtils]: 25: Hoare triple {8893#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8894#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:23,383 INFO L273 TraceCheckUtils]: 26: Hoare triple {8894#(<= 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; {8894#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:23,383 INFO L273 TraceCheckUtils]: 27: Hoare triple {8894#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8895#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:23,384 INFO L273 TraceCheckUtils]: 28: Hoare triple {8895#(<= 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; {8895#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:23,385 INFO L273 TraceCheckUtils]: 29: Hoare triple {8895#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8896#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:23,385 INFO L273 TraceCheckUtils]: 30: Hoare triple {8896#(<= 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; {8896#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:23,386 INFO L273 TraceCheckUtils]: 31: Hoare triple {8896#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8897#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:23,386 INFO L273 TraceCheckUtils]: 32: Hoare triple {8897#(<= main_~a~0 13)} assume !(~a~0 < 100000); {8883#false} is VALID [2018-11-23 12:00:23,387 INFO L273 TraceCheckUtils]: 33: Hoare triple {8883#false} havoc ~i~0;~i~0 := 0; {8883#false} is VALID [2018-11-23 12:00:23,387 INFO L273 TraceCheckUtils]: 34: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8883#false} is VALID [2018-11-23 12:00:23,387 INFO L273 TraceCheckUtils]: 35: Hoare triple {8883#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8883#false} is VALID [2018-11-23 12:00:23,387 INFO L273 TraceCheckUtils]: 36: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8883#false} is VALID [2018-11-23 12:00:23,388 INFO L273 TraceCheckUtils]: 37: Hoare triple {8883#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8883#false} is VALID [2018-11-23 12:00:23,388 INFO L273 TraceCheckUtils]: 38: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8883#false} is VALID [2018-11-23 12:00:23,388 INFO L273 TraceCheckUtils]: 39: Hoare triple {8883#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8883#false} is VALID [2018-11-23 12:00:23,388 INFO L273 TraceCheckUtils]: 40: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8883#false} is VALID [2018-11-23 12:00:23,388 INFO L273 TraceCheckUtils]: 41: Hoare triple {8883#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8883#false} is VALID [2018-11-23 12:00:23,389 INFO L273 TraceCheckUtils]: 42: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8883#false} is VALID [2018-11-23 12:00:23,389 INFO L273 TraceCheckUtils]: 43: Hoare triple {8883#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8883#false} is VALID [2018-11-23 12:00:23,389 INFO L273 TraceCheckUtils]: 44: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8883#false} is VALID [2018-11-23 12:00:23,389 INFO L273 TraceCheckUtils]: 45: Hoare triple {8883#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8883#false} is VALID [2018-11-23 12:00:23,389 INFO L273 TraceCheckUtils]: 46: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8883#false} is VALID [2018-11-23 12:00:23,389 INFO L273 TraceCheckUtils]: 47: Hoare triple {8883#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8883#false} is VALID [2018-11-23 12:00:23,390 INFO L273 TraceCheckUtils]: 48: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8883#false} is VALID [2018-11-23 12:00:23,390 INFO L273 TraceCheckUtils]: 49: Hoare triple {8883#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8883#false} is VALID [2018-11-23 12:00:23,390 INFO L273 TraceCheckUtils]: 50: Hoare triple {8883#false} assume !(~i~0 < 100000); {8883#false} is VALID [2018-11-23 12:00:23,390 INFO L273 TraceCheckUtils]: 51: Hoare triple {8883#false} ~i~0 := 0; {8883#false} is VALID [2018-11-23 12:00:23,390 INFO L273 TraceCheckUtils]: 52: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8883#false} is VALID [2018-11-23 12:00:23,391 INFO L273 TraceCheckUtils]: 53: Hoare triple {8883#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8883#false} is VALID [2018-11-23 12:00:23,391 INFO L273 TraceCheckUtils]: 54: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8883#false} is VALID [2018-11-23 12:00:23,391 INFO L273 TraceCheckUtils]: 55: Hoare triple {8883#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8883#false} is VALID [2018-11-23 12:00:23,391 INFO L273 TraceCheckUtils]: 56: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8883#false} is VALID [2018-11-23 12:00:23,391 INFO L273 TraceCheckUtils]: 57: Hoare triple {8883#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8883#false} is VALID [2018-11-23 12:00:23,391 INFO L273 TraceCheckUtils]: 58: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8883#false} is VALID [2018-11-23 12:00:23,391 INFO L273 TraceCheckUtils]: 59: Hoare triple {8883#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8883#false} is VALID [2018-11-23 12:00:23,391 INFO L273 TraceCheckUtils]: 60: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8883#false} is VALID [2018-11-23 12:00:23,391 INFO L273 TraceCheckUtils]: 61: Hoare triple {8883#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8883#false} is VALID [2018-11-23 12:00:23,392 INFO L273 TraceCheckUtils]: 62: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8883#false} is VALID [2018-11-23 12:00:23,392 INFO L273 TraceCheckUtils]: 63: Hoare triple {8883#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8883#false} is VALID [2018-11-23 12:00:23,392 INFO L273 TraceCheckUtils]: 64: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8883#false} is VALID [2018-11-23 12:00:23,392 INFO L273 TraceCheckUtils]: 65: Hoare triple {8883#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8883#false} is VALID [2018-11-23 12:00:23,392 INFO L273 TraceCheckUtils]: 66: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8883#false} is VALID [2018-11-23 12:00:23,392 INFO L273 TraceCheckUtils]: 67: Hoare triple {8883#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8883#false} is VALID [2018-11-23 12:00:23,392 INFO L273 TraceCheckUtils]: 68: Hoare triple {8883#false} assume !(~i~0 < 100000); {8883#false} is VALID [2018-11-23 12:00:23,392 INFO L273 TraceCheckUtils]: 69: Hoare triple {8883#false} ~i~0 := 0; {8883#false} is VALID [2018-11-23 12:00:23,392 INFO L273 TraceCheckUtils]: 70: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8883#false} is VALID [2018-11-23 12:00:23,393 INFO L273 TraceCheckUtils]: 71: Hoare triple {8883#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8883#false} is VALID [2018-11-23 12:00:23,393 INFO L273 TraceCheckUtils]: 72: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8883#false} is VALID [2018-11-23 12:00:23,393 INFO L273 TraceCheckUtils]: 73: Hoare triple {8883#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8883#false} is VALID [2018-11-23 12:00:23,393 INFO L273 TraceCheckUtils]: 74: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8883#false} is VALID [2018-11-23 12:00:23,393 INFO L273 TraceCheckUtils]: 75: Hoare triple {8883#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8883#false} is VALID [2018-11-23 12:00:23,393 INFO L273 TraceCheckUtils]: 76: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8883#false} is VALID [2018-11-23 12:00:23,393 INFO L273 TraceCheckUtils]: 77: Hoare triple {8883#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8883#false} is VALID [2018-11-23 12:00:23,393 INFO L273 TraceCheckUtils]: 78: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8883#false} is VALID [2018-11-23 12:00:23,393 INFO L273 TraceCheckUtils]: 79: Hoare triple {8883#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8883#false} is VALID [2018-11-23 12:00:23,394 INFO L273 TraceCheckUtils]: 80: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8883#false} is VALID [2018-11-23 12:00:23,394 INFO L273 TraceCheckUtils]: 81: Hoare triple {8883#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8883#false} is VALID [2018-11-23 12:00:23,394 INFO L273 TraceCheckUtils]: 82: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8883#false} is VALID [2018-11-23 12:00:23,394 INFO L273 TraceCheckUtils]: 83: Hoare triple {8883#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8883#false} is VALID [2018-11-23 12:00:23,394 INFO L273 TraceCheckUtils]: 84: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8883#false} is VALID [2018-11-23 12:00:23,394 INFO L273 TraceCheckUtils]: 85: Hoare triple {8883#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8883#false} is VALID [2018-11-23 12:00:23,394 INFO L273 TraceCheckUtils]: 86: Hoare triple {8883#false} assume !(~i~0 < 100000); {8883#false} is VALID [2018-11-23 12:00:23,394 INFO L273 TraceCheckUtils]: 87: Hoare triple {8883#false} ~i~0 := 0; {8883#false} is VALID [2018-11-23 12:00:23,394 INFO L273 TraceCheckUtils]: 88: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {8883#false} is VALID [2018-11-23 12:00:23,395 INFO L273 TraceCheckUtils]: 89: Hoare triple {8883#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8883#false} is VALID [2018-11-23 12:00:23,395 INFO L273 TraceCheckUtils]: 90: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {8883#false} is VALID [2018-11-23 12:00:23,395 INFO L273 TraceCheckUtils]: 91: Hoare triple {8883#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8883#false} is VALID [2018-11-23 12:00:23,395 INFO L273 TraceCheckUtils]: 92: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {8883#false} is VALID [2018-11-23 12:00:23,395 INFO L273 TraceCheckUtils]: 93: Hoare triple {8883#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8883#false} is VALID [2018-11-23 12:00:23,395 INFO L273 TraceCheckUtils]: 94: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {8883#false} is VALID [2018-11-23 12:00:23,395 INFO L273 TraceCheckUtils]: 95: Hoare triple {8883#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8883#false} is VALID [2018-11-23 12:00:23,395 INFO L273 TraceCheckUtils]: 96: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {8883#false} is VALID [2018-11-23 12:00:23,396 INFO L273 TraceCheckUtils]: 97: Hoare triple {8883#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8883#false} is VALID [2018-11-23 12:00:23,396 INFO L273 TraceCheckUtils]: 98: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {8883#false} is VALID [2018-11-23 12:00:23,396 INFO L273 TraceCheckUtils]: 99: Hoare triple {8883#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8883#false} is VALID [2018-11-23 12:00:23,396 INFO L273 TraceCheckUtils]: 100: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {8883#false} is VALID [2018-11-23 12:00:23,396 INFO L273 TraceCheckUtils]: 101: Hoare triple {8883#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8883#false} is VALID [2018-11-23 12:00:23,396 INFO L273 TraceCheckUtils]: 102: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {8883#false} is VALID [2018-11-23 12:00:23,396 INFO L273 TraceCheckUtils]: 103: Hoare triple {8883#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8883#false} is VALID [2018-11-23 12:00:23,396 INFO L273 TraceCheckUtils]: 104: Hoare triple {8883#false} assume !(~i~0 < 100000); {8883#false} is VALID [2018-11-23 12:00:23,396 INFO L273 TraceCheckUtils]: 105: Hoare triple {8883#false} havoc ~x~0;~x~0 := 0; {8883#false} is VALID [2018-11-23 12:00:23,397 INFO L273 TraceCheckUtils]: 106: Hoare triple {8883#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {8883#false} is VALID [2018-11-23 12:00:23,397 INFO L256 TraceCheckUtils]: 107: Hoare triple {8883#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {8883#false} is VALID [2018-11-23 12:00:23,397 INFO L273 TraceCheckUtils]: 108: Hoare triple {8883#false} ~cond := #in~cond; {8883#false} is VALID [2018-11-23 12:00:23,397 INFO L273 TraceCheckUtils]: 109: Hoare triple {8883#false} assume 0 == ~cond; {8883#false} is VALID [2018-11-23 12:00:23,397 INFO L273 TraceCheckUtils]: 110: Hoare triple {8883#false} assume !false; {8883#false} is VALID [2018-11-23 12:00:23,402 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-23 12:00:23,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:23,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:00:23,421 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 111 [2018-11-23 12:00:23,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:23,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:00:23,476 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:23,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:00:23,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:00:23,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:00:23,477 INFO L87 Difference]: Start difference. First operand 116 states and 121 transitions. Second operand 17 states. [2018-11-23 12:00:23,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:23,813 INFO L93 Difference]: Finished difference Result 202 states and 212 transitions. [2018-11-23 12:00:23,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:00:23,814 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 111 [2018-11-23 12:00:23,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:23,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:00:23,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 92 transitions. [2018-11-23 12:00:23,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:00:23,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 92 transitions. [2018-11-23 12:00:23,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 92 transitions. [2018-11-23 12:00:23,899 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:23,901 INFO L225 Difference]: With dead ends: 202 [2018-11-23 12:00:23,902 INFO L226 Difference]: Without dead ends: 119 [2018-11-23 12:00:23,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:00:23,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-23 12:00:23,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2018-11-23 12:00:23,950 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:23,950 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 118 states. [2018-11-23 12:00:23,951 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 118 states. [2018-11-23 12:00:23,951 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 118 states. [2018-11-23 12:00:23,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:23,953 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2018-11-23 12:00:23,953 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2018-11-23 12:00:23,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:23,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:23,954 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 119 states. [2018-11-23 12:00:23,954 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 119 states. [2018-11-23 12:00:23,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:23,957 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2018-11-23 12:00:23,957 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2018-11-23 12:00:23,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:23,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:23,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:23,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:23,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-23 12:00:23,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 123 transitions. [2018-11-23 12:00:23,960 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 123 transitions. Word has length 111 [2018-11-23 12:00:23,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:23,960 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 123 transitions. [2018-11-23 12:00:23,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:00:23,960 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 123 transitions. [2018-11-23 12:00:23,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-23 12:00:23,961 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:23,962 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 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] [2018-11-23 12:00:23,962 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:23,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:23,962 INFO L82 PathProgramCache]: Analyzing trace with hash -76806490, now seen corresponding path program 14 times [2018-11-23 12:00:23,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:23,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:23,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:23,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:00:23,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:24,346 INFO L256 TraceCheckUtils]: 0: Hoare triple {9944#true} call ULTIMATE.init(); {9944#true} is VALID [2018-11-23 12:00:24,347 INFO L273 TraceCheckUtils]: 1: Hoare triple {9944#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9944#true} is VALID [2018-11-23 12:00:24,347 INFO L273 TraceCheckUtils]: 2: Hoare triple {9944#true} assume true; {9944#true} is VALID [2018-11-23 12:00:24,347 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9944#true} {9944#true} #105#return; {9944#true} is VALID [2018-11-23 12:00:24,347 INFO L256 TraceCheckUtils]: 4: Hoare triple {9944#true} call #t~ret13 := main(); {9944#true} is VALID [2018-11-23 12:00:24,347 INFO L273 TraceCheckUtils]: 5: Hoare triple {9944#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);havoc ~a~0;~a~0 := 0; {9946#(= main_~a~0 0)} is VALID [2018-11-23 12:00:24,348 INFO L273 TraceCheckUtils]: 6: Hoare triple {9946#(= 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; {9946#(= main_~a~0 0)} is VALID [2018-11-23 12:00:24,348 INFO L273 TraceCheckUtils]: 7: Hoare triple {9946#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9947#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:24,348 INFO L273 TraceCheckUtils]: 8: Hoare triple {9947#(<= 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; {9947#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:24,349 INFO L273 TraceCheckUtils]: 9: Hoare triple {9947#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9948#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:24,350 INFO L273 TraceCheckUtils]: 10: Hoare triple {9948#(<= 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; {9948#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:24,350 INFO L273 TraceCheckUtils]: 11: Hoare triple {9948#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9949#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:24,351 INFO L273 TraceCheckUtils]: 12: Hoare triple {9949#(<= 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; {9949#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:24,352 INFO L273 TraceCheckUtils]: 13: Hoare triple {9949#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9950#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:24,352 INFO L273 TraceCheckUtils]: 14: Hoare triple {9950#(<= 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; {9950#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:24,353 INFO L273 TraceCheckUtils]: 15: Hoare triple {9950#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9951#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:24,354 INFO L273 TraceCheckUtils]: 16: Hoare triple {9951#(<= 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; {9951#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:24,354 INFO L273 TraceCheckUtils]: 17: Hoare triple {9951#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9952#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:24,355 INFO L273 TraceCheckUtils]: 18: Hoare triple {9952#(<= 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; {9952#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:24,356 INFO L273 TraceCheckUtils]: 19: Hoare triple {9952#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9953#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:24,356 INFO L273 TraceCheckUtils]: 20: Hoare triple {9953#(<= 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; {9953#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:24,357 INFO L273 TraceCheckUtils]: 21: Hoare triple {9953#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9954#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:24,357 INFO L273 TraceCheckUtils]: 22: Hoare triple {9954#(<= 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; {9954#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:24,358 INFO L273 TraceCheckUtils]: 23: Hoare triple {9954#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9955#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:24,359 INFO L273 TraceCheckUtils]: 24: Hoare triple {9955#(<= 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; {9955#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:24,359 INFO L273 TraceCheckUtils]: 25: Hoare triple {9955#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9956#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:24,360 INFO L273 TraceCheckUtils]: 26: Hoare triple {9956#(<= 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; {9956#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:24,361 INFO L273 TraceCheckUtils]: 27: Hoare triple {9956#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9957#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:24,361 INFO L273 TraceCheckUtils]: 28: Hoare triple {9957#(<= 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; {9957#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:24,362 INFO L273 TraceCheckUtils]: 29: Hoare triple {9957#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9958#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:24,362 INFO L273 TraceCheckUtils]: 30: Hoare triple {9958#(<= 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; {9958#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:24,363 INFO L273 TraceCheckUtils]: 31: Hoare triple {9958#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9959#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:24,364 INFO L273 TraceCheckUtils]: 32: Hoare triple {9959#(<= 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; {9959#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:24,364 INFO L273 TraceCheckUtils]: 33: Hoare triple {9959#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9960#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:24,365 INFO L273 TraceCheckUtils]: 34: Hoare triple {9960#(<= main_~a~0 14)} assume !(~a~0 < 100000); {9945#false} is VALID [2018-11-23 12:00:24,365 INFO L273 TraceCheckUtils]: 35: Hoare triple {9945#false} havoc ~i~0;~i~0 := 0; {9945#false} is VALID [2018-11-23 12:00:24,365 INFO L273 TraceCheckUtils]: 36: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9945#false} is VALID [2018-11-23 12:00:24,366 INFO L273 TraceCheckUtils]: 37: Hoare triple {9945#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9945#false} is VALID [2018-11-23 12:00:24,366 INFO L273 TraceCheckUtils]: 38: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9945#false} is VALID [2018-11-23 12:00:24,366 INFO L273 TraceCheckUtils]: 39: Hoare triple {9945#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9945#false} is VALID [2018-11-23 12:00:24,366 INFO L273 TraceCheckUtils]: 40: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9945#false} is VALID [2018-11-23 12:00:24,366 INFO L273 TraceCheckUtils]: 41: Hoare triple {9945#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9945#false} is VALID [2018-11-23 12:00:24,367 INFO L273 TraceCheckUtils]: 42: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9945#false} is VALID [2018-11-23 12:00:24,367 INFO L273 TraceCheckUtils]: 43: Hoare triple {9945#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9945#false} is VALID [2018-11-23 12:00:24,367 INFO L273 TraceCheckUtils]: 44: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9945#false} is VALID [2018-11-23 12:00:24,367 INFO L273 TraceCheckUtils]: 45: Hoare triple {9945#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9945#false} is VALID [2018-11-23 12:00:24,367 INFO L273 TraceCheckUtils]: 46: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9945#false} is VALID [2018-11-23 12:00:24,368 INFO L273 TraceCheckUtils]: 47: Hoare triple {9945#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9945#false} is VALID [2018-11-23 12:00:24,368 INFO L273 TraceCheckUtils]: 48: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9945#false} is VALID [2018-11-23 12:00:24,368 INFO L273 TraceCheckUtils]: 49: Hoare triple {9945#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9945#false} is VALID [2018-11-23 12:00:24,368 INFO L273 TraceCheckUtils]: 50: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9945#false} is VALID [2018-11-23 12:00:24,368 INFO L273 TraceCheckUtils]: 51: Hoare triple {9945#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9945#false} is VALID [2018-11-23 12:00:24,369 INFO L273 TraceCheckUtils]: 52: Hoare triple {9945#false} assume !(~i~0 < 100000); {9945#false} is VALID [2018-11-23 12:00:24,369 INFO L273 TraceCheckUtils]: 53: Hoare triple {9945#false} ~i~0 := 0; {9945#false} is VALID [2018-11-23 12:00:24,369 INFO L273 TraceCheckUtils]: 54: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9945#false} is VALID [2018-11-23 12:00:24,369 INFO L273 TraceCheckUtils]: 55: Hoare triple {9945#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9945#false} is VALID [2018-11-23 12:00:24,369 INFO L273 TraceCheckUtils]: 56: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9945#false} is VALID [2018-11-23 12:00:24,370 INFO L273 TraceCheckUtils]: 57: Hoare triple {9945#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9945#false} is VALID [2018-11-23 12:00:24,370 INFO L273 TraceCheckUtils]: 58: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9945#false} is VALID [2018-11-23 12:00:24,370 INFO L273 TraceCheckUtils]: 59: Hoare triple {9945#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9945#false} is VALID [2018-11-23 12:00:24,370 INFO L273 TraceCheckUtils]: 60: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9945#false} is VALID [2018-11-23 12:00:24,370 INFO L273 TraceCheckUtils]: 61: Hoare triple {9945#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9945#false} is VALID [2018-11-23 12:00:24,370 INFO L273 TraceCheckUtils]: 62: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9945#false} is VALID [2018-11-23 12:00:24,371 INFO L273 TraceCheckUtils]: 63: Hoare triple {9945#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9945#false} is VALID [2018-11-23 12:00:24,371 INFO L273 TraceCheckUtils]: 64: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9945#false} is VALID [2018-11-23 12:00:24,371 INFO L273 TraceCheckUtils]: 65: Hoare triple {9945#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9945#false} is VALID [2018-11-23 12:00:24,371 INFO L273 TraceCheckUtils]: 66: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9945#false} is VALID [2018-11-23 12:00:24,371 INFO L273 TraceCheckUtils]: 67: Hoare triple {9945#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9945#false} is VALID [2018-11-23 12:00:24,371 INFO L273 TraceCheckUtils]: 68: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9945#false} is VALID [2018-11-23 12:00:24,371 INFO L273 TraceCheckUtils]: 69: Hoare triple {9945#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9945#false} is VALID [2018-11-23 12:00:24,371 INFO L273 TraceCheckUtils]: 70: Hoare triple {9945#false} assume !(~i~0 < 100000); {9945#false} is VALID [2018-11-23 12:00:24,371 INFO L273 TraceCheckUtils]: 71: Hoare triple {9945#false} ~i~0 := 0; {9945#false} is VALID [2018-11-23 12:00:24,372 INFO L273 TraceCheckUtils]: 72: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {9945#false} is VALID [2018-11-23 12:00:24,372 INFO L273 TraceCheckUtils]: 73: Hoare triple {9945#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9945#false} is VALID [2018-11-23 12:00:24,372 INFO L273 TraceCheckUtils]: 74: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {9945#false} is VALID [2018-11-23 12:00:24,372 INFO L273 TraceCheckUtils]: 75: Hoare triple {9945#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9945#false} is VALID [2018-11-23 12:00:24,372 INFO L273 TraceCheckUtils]: 76: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {9945#false} is VALID [2018-11-23 12:00:24,372 INFO L273 TraceCheckUtils]: 77: Hoare triple {9945#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9945#false} is VALID [2018-11-23 12:00:24,372 INFO L273 TraceCheckUtils]: 78: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {9945#false} is VALID [2018-11-23 12:00:24,372 INFO L273 TraceCheckUtils]: 79: Hoare triple {9945#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9945#false} is VALID [2018-11-23 12:00:24,372 INFO L273 TraceCheckUtils]: 80: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {9945#false} is VALID [2018-11-23 12:00:24,373 INFO L273 TraceCheckUtils]: 81: Hoare triple {9945#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9945#false} is VALID [2018-11-23 12:00:24,373 INFO L273 TraceCheckUtils]: 82: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {9945#false} is VALID [2018-11-23 12:00:24,373 INFO L273 TraceCheckUtils]: 83: Hoare triple {9945#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9945#false} is VALID [2018-11-23 12:00:24,373 INFO L273 TraceCheckUtils]: 84: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {9945#false} is VALID [2018-11-23 12:00:24,373 INFO L273 TraceCheckUtils]: 85: Hoare triple {9945#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9945#false} is VALID [2018-11-23 12:00:24,373 INFO L273 TraceCheckUtils]: 86: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {9945#false} is VALID [2018-11-23 12:00:24,373 INFO L273 TraceCheckUtils]: 87: Hoare triple {9945#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9945#false} is VALID [2018-11-23 12:00:24,373 INFO L273 TraceCheckUtils]: 88: Hoare triple {9945#false} assume !(~i~0 < 100000); {9945#false} is VALID [2018-11-23 12:00:24,373 INFO L273 TraceCheckUtils]: 89: Hoare triple {9945#false} ~i~0 := 0; {9945#false} is VALID [2018-11-23 12:00:24,374 INFO L273 TraceCheckUtils]: 90: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {9945#false} is VALID [2018-11-23 12:00:24,374 INFO L273 TraceCheckUtils]: 91: Hoare triple {9945#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9945#false} is VALID [2018-11-23 12:00:24,374 INFO L273 TraceCheckUtils]: 92: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {9945#false} is VALID [2018-11-23 12:00:24,374 INFO L273 TraceCheckUtils]: 93: Hoare triple {9945#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9945#false} is VALID [2018-11-23 12:00:24,374 INFO L273 TraceCheckUtils]: 94: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {9945#false} is VALID [2018-11-23 12:00:24,374 INFO L273 TraceCheckUtils]: 95: Hoare triple {9945#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9945#false} is VALID [2018-11-23 12:00:24,374 INFO L273 TraceCheckUtils]: 96: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {9945#false} is VALID [2018-11-23 12:00:24,374 INFO L273 TraceCheckUtils]: 97: Hoare triple {9945#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9945#false} is VALID [2018-11-23 12:00:24,374 INFO L273 TraceCheckUtils]: 98: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {9945#false} is VALID [2018-11-23 12:00:24,374 INFO L273 TraceCheckUtils]: 99: Hoare triple {9945#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9945#false} is VALID [2018-11-23 12:00:24,375 INFO L273 TraceCheckUtils]: 100: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {9945#false} is VALID [2018-11-23 12:00:24,375 INFO L273 TraceCheckUtils]: 101: Hoare triple {9945#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9945#false} is VALID [2018-11-23 12:00:24,375 INFO L273 TraceCheckUtils]: 102: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {9945#false} is VALID [2018-11-23 12:00:24,375 INFO L273 TraceCheckUtils]: 103: Hoare triple {9945#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9945#false} is VALID [2018-11-23 12:00:24,375 INFO L273 TraceCheckUtils]: 104: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {9945#false} is VALID [2018-11-23 12:00:24,375 INFO L273 TraceCheckUtils]: 105: Hoare triple {9945#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9945#false} is VALID [2018-11-23 12:00:24,375 INFO L273 TraceCheckUtils]: 106: Hoare triple {9945#false} assume !(~i~0 < 100000); {9945#false} is VALID [2018-11-23 12:00:24,375 INFO L273 TraceCheckUtils]: 107: Hoare triple {9945#false} havoc ~x~0;~x~0 := 0; {9945#false} is VALID [2018-11-23 12:00:24,375 INFO L273 TraceCheckUtils]: 108: Hoare triple {9945#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {9945#false} is VALID [2018-11-23 12:00:24,376 INFO L256 TraceCheckUtils]: 109: Hoare triple {9945#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {9945#false} is VALID [2018-11-23 12:00:24,376 INFO L273 TraceCheckUtils]: 110: Hoare triple {9945#false} ~cond := #in~cond; {9945#false} is VALID [2018-11-23 12:00:24,376 INFO L273 TraceCheckUtils]: 111: Hoare triple {9945#false} assume 0 == ~cond; {9945#false} is VALID [2018-11-23 12:00:24,376 INFO L273 TraceCheckUtils]: 112: Hoare triple {9945#false} assume !false; {9945#false} is VALID [2018-11-23 12:00:24,381 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-23 12:00:24,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:24,381 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:24,391 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:00:24,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:00:24,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:24,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:24,637 INFO L256 TraceCheckUtils]: 0: Hoare triple {9944#true} call ULTIMATE.init(); {9944#true} is VALID [2018-11-23 12:00:24,637 INFO L273 TraceCheckUtils]: 1: Hoare triple {9944#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9944#true} is VALID [2018-11-23 12:00:24,638 INFO L273 TraceCheckUtils]: 2: Hoare triple {9944#true} assume true; {9944#true} is VALID [2018-11-23 12:00:24,638 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9944#true} {9944#true} #105#return; {9944#true} is VALID [2018-11-23 12:00:24,638 INFO L256 TraceCheckUtils]: 4: Hoare triple {9944#true} call #t~ret13 := main(); {9944#true} is VALID [2018-11-23 12:00:24,639 INFO L273 TraceCheckUtils]: 5: Hoare triple {9944#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);havoc ~a~0;~a~0 := 0; {9979#(<= main_~a~0 0)} is VALID [2018-11-23 12:00:24,639 INFO L273 TraceCheckUtils]: 6: Hoare triple {9979#(<= 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; {9979#(<= main_~a~0 0)} is VALID [2018-11-23 12:00:24,640 INFO L273 TraceCheckUtils]: 7: Hoare triple {9979#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9947#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:24,640 INFO L273 TraceCheckUtils]: 8: Hoare triple {9947#(<= 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; {9947#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:24,641 INFO L273 TraceCheckUtils]: 9: Hoare triple {9947#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9948#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:24,641 INFO L273 TraceCheckUtils]: 10: Hoare triple {9948#(<= 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; {9948#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:24,642 INFO L273 TraceCheckUtils]: 11: Hoare triple {9948#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9949#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:24,642 INFO L273 TraceCheckUtils]: 12: Hoare triple {9949#(<= 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; {9949#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:24,643 INFO L273 TraceCheckUtils]: 13: Hoare triple {9949#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9950#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:24,644 INFO L273 TraceCheckUtils]: 14: Hoare triple {9950#(<= 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; {9950#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:24,644 INFO L273 TraceCheckUtils]: 15: Hoare triple {9950#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9951#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:24,645 INFO L273 TraceCheckUtils]: 16: Hoare triple {9951#(<= 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; {9951#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:24,646 INFO L273 TraceCheckUtils]: 17: Hoare triple {9951#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9952#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:24,646 INFO L273 TraceCheckUtils]: 18: Hoare triple {9952#(<= 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; {9952#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:24,647 INFO L273 TraceCheckUtils]: 19: Hoare triple {9952#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9953#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:24,647 INFO L273 TraceCheckUtils]: 20: Hoare triple {9953#(<= 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; {9953#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:24,648 INFO L273 TraceCheckUtils]: 21: Hoare triple {9953#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9954#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:24,649 INFO L273 TraceCheckUtils]: 22: Hoare triple {9954#(<= 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; {9954#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:24,650 INFO L273 TraceCheckUtils]: 23: Hoare triple {9954#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9955#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:24,650 INFO L273 TraceCheckUtils]: 24: Hoare triple {9955#(<= 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; {9955#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:24,651 INFO L273 TraceCheckUtils]: 25: Hoare triple {9955#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9956#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:24,651 INFO L273 TraceCheckUtils]: 26: Hoare triple {9956#(<= 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; {9956#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:24,652 INFO L273 TraceCheckUtils]: 27: Hoare triple {9956#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9957#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:24,653 INFO L273 TraceCheckUtils]: 28: Hoare triple {9957#(<= 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; {9957#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:24,653 INFO L273 TraceCheckUtils]: 29: Hoare triple {9957#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9958#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:24,654 INFO L273 TraceCheckUtils]: 30: Hoare triple {9958#(<= 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; {9958#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:24,655 INFO L273 TraceCheckUtils]: 31: Hoare triple {9958#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9959#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:24,655 INFO L273 TraceCheckUtils]: 32: Hoare triple {9959#(<= 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; {9959#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:24,656 INFO L273 TraceCheckUtils]: 33: Hoare triple {9959#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9960#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:24,657 INFO L273 TraceCheckUtils]: 34: Hoare triple {9960#(<= main_~a~0 14)} assume !(~a~0 < 100000); {9945#false} is VALID [2018-11-23 12:00:24,657 INFO L273 TraceCheckUtils]: 35: Hoare triple {9945#false} havoc ~i~0;~i~0 := 0; {9945#false} is VALID [2018-11-23 12:00:24,657 INFO L273 TraceCheckUtils]: 36: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9945#false} is VALID [2018-11-23 12:00:24,657 INFO L273 TraceCheckUtils]: 37: Hoare triple {9945#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9945#false} is VALID [2018-11-23 12:00:24,657 INFO L273 TraceCheckUtils]: 38: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9945#false} is VALID [2018-11-23 12:00:24,658 INFO L273 TraceCheckUtils]: 39: Hoare triple {9945#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9945#false} is VALID [2018-11-23 12:00:24,658 INFO L273 TraceCheckUtils]: 40: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9945#false} is VALID [2018-11-23 12:00:24,658 INFO L273 TraceCheckUtils]: 41: Hoare triple {9945#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9945#false} is VALID [2018-11-23 12:00:24,658 INFO L273 TraceCheckUtils]: 42: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9945#false} is VALID [2018-11-23 12:00:24,658 INFO L273 TraceCheckUtils]: 43: Hoare triple {9945#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9945#false} is VALID [2018-11-23 12:00:24,659 INFO L273 TraceCheckUtils]: 44: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9945#false} is VALID [2018-11-23 12:00:24,659 INFO L273 TraceCheckUtils]: 45: Hoare triple {9945#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9945#false} is VALID [2018-11-23 12:00:24,659 INFO L273 TraceCheckUtils]: 46: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9945#false} is VALID [2018-11-23 12:00:24,659 INFO L273 TraceCheckUtils]: 47: Hoare triple {9945#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9945#false} is VALID [2018-11-23 12:00:24,659 INFO L273 TraceCheckUtils]: 48: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9945#false} is VALID [2018-11-23 12:00:24,660 INFO L273 TraceCheckUtils]: 49: Hoare triple {9945#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9945#false} is VALID [2018-11-23 12:00:24,660 INFO L273 TraceCheckUtils]: 50: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9945#false} is VALID [2018-11-23 12:00:24,660 INFO L273 TraceCheckUtils]: 51: Hoare triple {9945#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9945#false} is VALID [2018-11-23 12:00:24,660 INFO L273 TraceCheckUtils]: 52: Hoare triple {9945#false} assume !(~i~0 < 100000); {9945#false} is VALID [2018-11-23 12:00:24,660 INFO L273 TraceCheckUtils]: 53: Hoare triple {9945#false} ~i~0 := 0; {9945#false} is VALID [2018-11-23 12:00:24,661 INFO L273 TraceCheckUtils]: 54: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9945#false} is VALID [2018-11-23 12:00:24,661 INFO L273 TraceCheckUtils]: 55: Hoare triple {9945#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9945#false} is VALID [2018-11-23 12:00:24,661 INFO L273 TraceCheckUtils]: 56: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9945#false} is VALID [2018-11-23 12:00:24,661 INFO L273 TraceCheckUtils]: 57: Hoare triple {9945#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9945#false} is VALID [2018-11-23 12:00:24,661 INFO L273 TraceCheckUtils]: 58: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9945#false} is VALID [2018-11-23 12:00:24,662 INFO L273 TraceCheckUtils]: 59: Hoare triple {9945#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9945#false} is VALID [2018-11-23 12:00:24,662 INFO L273 TraceCheckUtils]: 60: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9945#false} is VALID [2018-11-23 12:00:24,662 INFO L273 TraceCheckUtils]: 61: Hoare triple {9945#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9945#false} is VALID [2018-11-23 12:00:24,662 INFO L273 TraceCheckUtils]: 62: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9945#false} is VALID [2018-11-23 12:00:24,662 INFO L273 TraceCheckUtils]: 63: Hoare triple {9945#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9945#false} is VALID [2018-11-23 12:00:24,662 INFO L273 TraceCheckUtils]: 64: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9945#false} is VALID [2018-11-23 12:00:24,662 INFO L273 TraceCheckUtils]: 65: Hoare triple {9945#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9945#false} is VALID [2018-11-23 12:00:24,662 INFO L273 TraceCheckUtils]: 66: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9945#false} is VALID [2018-11-23 12:00:24,663 INFO L273 TraceCheckUtils]: 67: Hoare triple {9945#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9945#false} is VALID [2018-11-23 12:00:24,663 INFO L273 TraceCheckUtils]: 68: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9945#false} is VALID [2018-11-23 12:00:24,663 INFO L273 TraceCheckUtils]: 69: Hoare triple {9945#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9945#false} is VALID [2018-11-23 12:00:24,663 INFO L273 TraceCheckUtils]: 70: Hoare triple {9945#false} assume !(~i~0 < 100000); {9945#false} is VALID [2018-11-23 12:00:24,663 INFO L273 TraceCheckUtils]: 71: Hoare triple {9945#false} ~i~0 := 0; {9945#false} is VALID [2018-11-23 12:00:24,663 INFO L273 TraceCheckUtils]: 72: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {9945#false} is VALID [2018-11-23 12:00:24,663 INFO L273 TraceCheckUtils]: 73: Hoare triple {9945#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9945#false} is VALID [2018-11-23 12:00:24,663 INFO L273 TraceCheckUtils]: 74: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {9945#false} is VALID [2018-11-23 12:00:24,663 INFO L273 TraceCheckUtils]: 75: Hoare triple {9945#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9945#false} is VALID [2018-11-23 12:00:24,664 INFO L273 TraceCheckUtils]: 76: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {9945#false} is VALID [2018-11-23 12:00:24,664 INFO L273 TraceCheckUtils]: 77: Hoare triple {9945#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9945#false} is VALID [2018-11-23 12:00:24,664 INFO L273 TraceCheckUtils]: 78: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {9945#false} is VALID [2018-11-23 12:00:24,664 INFO L273 TraceCheckUtils]: 79: Hoare triple {9945#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9945#false} is VALID [2018-11-23 12:00:24,664 INFO L273 TraceCheckUtils]: 80: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {9945#false} is VALID [2018-11-23 12:00:24,664 INFO L273 TraceCheckUtils]: 81: Hoare triple {9945#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9945#false} is VALID [2018-11-23 12:00:24,664 INFO L273 TraceCheckUtils]: 82: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {9945#false} is VALID [2018-11-23 12:00:24,664 INFO L273 TraceCheckUtils]: 83: Hoare triple {9945#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9945#false} is VALID [2018-11-23 12:00:24,664 INFO L273 TraceCheckUtils]: 84: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {9945#false} is VALID [2018-11-23 12:00:24,665 INFO L273 TraceCheckUtils]: 85: Hoare triple {9945#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9945#false} is VALID [2018-11-23 12:00:24,665 INFO L273 TraceCheckUtils]: 86: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {9945#false} is VALID [2018-11-23 12:00:24,665 INFO L273 TraceCheckUtils]: 87: Hoare triple {9945#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9945#false} is VALID [2018-11-23 12:00:24,665 INFO L273 TraceCheckUtils]: 88: Hoare triple {9945#false} assume !(~i~0 < 100000); {9945#false} is VALID [2018-11-23 12:00:24,665 INFO L273 TraceCheckUtils]: 89: Hoare triple {9945#false} ~i~0 := 0; {9945#false} is VALID [2018-11-23 12:00:24,665 INFO L273 TraceCheckUtils]: 90: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {9945#false} is VALID [2018-11-23 12:00:24,665 INFO L273 TraceCheckUtils]: 91: Hoare triple {9945#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9945#false} is VALID [2018-11-23 12:00:24,665 INFO L273 TraceCheckUtils]: 92: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {9945#false} is VALID [2018-11-23 12:00:24,665 INFO L273 TraceCheckUtils]: 93: Hoare triple {9945#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9945#false} is VALID [2018-11-23 12:00:24,666 INFO L273 TraceCheckUtils]: 94: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {9945#false} is VALID [2018-11-23 12:00:24,666 INFO L273 TraceCheckUtils]: 95: Hoare triple {9945#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9945#false} is VALID [2018-11-23 12:00:24,666 INFO L273 TraceCheckUtils]: 96: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {9945#false} is VALID [2018-11-23 12:00:24,666 INFO L273 TraceCheckUtils]: 97: Hoare triple {9945#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9945#false} is VALID [2018-11-23 12:00:24,666 INFO L273 TraceCheckUtils]: 98: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {9945#false} is VALID [2018-11-23 12:00:24,666 INFO L273 TraceCheckUtils]: 99: Hoare triple {9945#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9945#false} is VALID [2018-11-23 12:00:24,666 INFO L273 TraceCheckUtils]: 100: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {9945#false} is VALID [2018-11-23 12:00:24,666 INFO L273 TraceCheckUtils]: 101: Hoare triple {9945#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9945#false} is VALID [2018-11-23 12:00:24,666 INFO L273 TraceCheckUtils]: 102: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {9945#false} is VALID [2018-11-23 12:00:24,667 INFO L273 TraceCheckUtils]: 103: Hoare triple {9945#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9945#false} is VALID [2018-11-23 12:00:24,667 INFO L273 TraceCheckUtils]: 104: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {9945#false} is VALID [2018-11-23 12:00:24,667 INFO L273 TraceCheckUtils]: 105: Hoare triple {9945#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9945#false} is VALID [2018-11-23 12:00:24,667 INFO L273 TraceCheckUtils]: 106: Hoare triple {9945#false} assume !(~i~0 < 100000); {9945#false} is VALID [2018-11-23 12:00:24,667 INFO L273 TraceCheckUtils]: 107: Hoare triple {9945#false} havoc ~x~0;~x~0 := 0; {9945#false} is VALID [2018-11-23 12:00:24,667 INFO L273 TraceCheckUtils]: 108: Hoare triple {9945#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {9945#false} is VALID [2018-11-23 12:00:24,667 INFO L256 TraceCheckUtils]: 109: Hoare triple {9945#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {9945#false} is VALID [2018-11-23 12:00:24,667 INFO L273 TraceCheckUtils]: 110: Hoare triple {9945#false} ~cond := #in~cond; {9945#false} is VALID [2018-11-23 12:00:24,668 INFO L273 TraceCheckUtils]: 111: Hoare triple {9945#false} assume 0 == ~cond; {9945#false} is VALID [2018-11-23 12:00:24,668 INFO L273 TraceCheckUtils]: 112: Hoare triple {9945#false} assume !false; {9945#false} is VALID [2018-11-23 12:00:24,673 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-23 12:00:24,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:24,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:00:24,693 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 113 [2018-11-23 12:00:24,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:24,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:00:24,777 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:24,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:00:24,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:00:24,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:00:24,778 INFO L87 Difference]: Start difference. First operand 118 states and 123 transitions. Second operand 18 states. [2018-11-23 12:00:25,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:25,265 INFO L93 Difference]: Finished difference Result 204 states and 214 transitions. [2018-11-23 12:00:25,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:00:25,265 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 113 [2018-11-23 12:00:25,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:25,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:00:25,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 94 transitions. [2018-11-23 12:00:25,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:00:25,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 94 transitions. [2018-11-23 12:00:25,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 94 transitions. [2018-11-23 12:00:25,356 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:25,359 INFO L225 Difference]: With dead ends: 204 [2018-11-23 12:00:25,359 INFO L226 Difference]: Without dead ends: 121 [2018-11-23 12:00:25,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 113 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 12:00:25,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-23 12:00:25,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2018-11-23 12:00:25,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:25,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 120 states. [2018-11-23 12:00:25,411 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 120 states. [2018-11-23 12:00:25,411 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 120 states. [2018-11-23 12:00:25,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:25,413 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2018-11-23 12:00:25,413 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2018-11-23 12:00:25,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:25,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:25,413 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 121 states. [2018-11-23 12:00:25,414 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 121 states. [2018-11-23 12:00:25,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:25,416 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2018-11-23 12:00:25,416 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2018-11-23 12:00:25,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:25,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:25,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:25,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:25,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-23 12:00:25,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2018-11-23 12:00:25,419 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 113 [2018-11-23 12:00:25,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:25,419 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2018-11-23 12:00:25,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:00:25,419 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2018-11-23 12:00:25,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-23 12:00:25,420 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:25,420 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 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] [2018-11-23 12:00:25,421 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:25,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:25,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1026187972, now seen corresponding path program 15 times [2018-11-23 12:00:25,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:25,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:25,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:25,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:25,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:25,697 INFO L256 TraceCheckUtils]: 0: Hoare triple {11023#true} call ULTIMATE.init(); {11023#true} is VALID [2018-11-23 12:00:25,697 INFO L273 TraceCheckUtils]: 1: Hoare triple {11023#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11023#true} is VALID [2018-11-23 12:00:25,698 INFO L273 TraceCheckUtils]: 2: Hoare triple {11023#true} assume true; {11023#true} is VALID [2018-11-23 12:00:25,698 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11023#true} {11023#true} #105#return; {11023#true} is VALID [2018-11-23 12:00:25,698 INFO L256 TraceCheckUtils]: 4: Hoare triple {11023#true} call #t~ret13 := main(); {11023#true} is VALID [2018-11-23 12:00:25,699 INFO L273 TraceCheckUtils]: 5: Hoare triple {11023#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);havoc ~a~0;~a~0 := 0; {11025#(= main_~a~0 0)} is VALID [2018-11-23 12:00:25,699 INFO L273 TraceCheckUtils]: 6: Hoare triple {11025#(= 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; {11025#(= main_~a~0 0)} is VALID [2018-11-23 12:00:25,700 INFO L273 TraceCheckUtils]: 7: Hoare triple {11025#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11026#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:25,700 INFO L273 TraceCheckUtils]: 8: Hoare triple {11026#(<= 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; {11026#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:25,701 INFO L273 TraceCheckUtils]: 9: Hoare triple {11026#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11027#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:25,701 INFO L273 TraceCheckUtils]: 10: Hoare triple {11027#(<= 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; {11027#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:25,701 INFO L273 TraceCheckUtils]: 11: Hoare triple {11027#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11028#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:25,702 INFO L273 TraceCheckUtils]: 12: Hoare triple {11028#(<= 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; {11028#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:25,702 INFO L273 TraceCheckUtils]: 13: Hoare triple {11028#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11029#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:25,702 INFO L273 TraceCheckUtils]: 14: Hoare triple {11029#(<= 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; {11029#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:25,703 INFO L273 TraceCheckUtils]: 15: Hoare triple {11029#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11030#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:25,704 INFO L273 TraceCheckUtils]: 16: Hoare triple {11030#(<= 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; {11030#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:25,704 INFO L273 TraceCheckUtils]: 17: Hoare triple {11030#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11031#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:25,705 INFO L273 TraceCheckUtils]: 18: Hoare triple {11031#(<= 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; {11031#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:25,706 INFO L273 TraceCheckUtils]: 19: Hoare triple {11031#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11032#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:25,706 INFO L273 TraceCheckUtils]: 20: Hoare triple {11032#(<= 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; {11032#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:25,707 INFO L273 TraceCheckUtils]: 21: Hoare triple {11032#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11033#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:25,707 INFO L273 TraceCheckUtils]: 22: Hoare triple {11033#(<= 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; {11033#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:25,708 INFO L273 TraceCheckUtils]: 23: Hoare triple {11033#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11034#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:25,709 INFO L273 TraceCheckUtils]: 24: Hoare triple {11034#(<= 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; {11034#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:25,709 INFO L273 TraceCheckUtils]: 25: Hoare triple {11034#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11035#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:25,710 INFO L273 TraceCheckUtils]: 26: Hoare triple {11035#(<= 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; {11035#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:25,711 INFO L273 TraceCheckUtils]: 27: Hoare triple {11035#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11036#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:25,711 INFO L273 TraceCheckUtils]: 28: Hoare triple {11036#(<= 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; {11036#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:25,712 INFO L273 TraceCheckUtils]: 29: Hoare triple {11036#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11037#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:25,712 INFO L273 TraceCheckUtils]: 30: Hoare triple {11037#(<= 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; {11037#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:25,713 INFO L273 TraceCheckUtils]: 31: Hoare triple {11037#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11038#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:25,714 INFO L273 TraceCheckUtils]: 32: Hoare triple {11038#(<= 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; {11038#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:25,714 INFO L273 TraceCheckUtils]: 33: Hoare triple {11038#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11039#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:25,715 INFO L273 TraceCheckUtils]: 34: Hoare triple {11039#(<= 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; {11039#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:25,716 INFO L273 TraceCheckUtils]: 35: Hoare triple {11039#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11040#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:25,716 INFO L273 TraceCheckUtils]: 36: Hoare triple {11040#(<= main_~a~0 15)} assume !(~a~0 < 100000); {11024#false} is VALID [2018-11-23 12:00:25,717 INFO L273 TraceCheckUtils]: 37: Hoare triple {11024#false} havoc ~i~0;~i~0 := 0; {11024#false} is VALID [2018-11-23 12:00:25,717 INFO L273 TraceCheckUtils]: 38: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11024#false} is VALID [2018-11-23 12:00:25,717 INFO L273 TraceCheckUtils]: 39: Hoare triple {11024#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11024#false} is VALID [2018-11-23 12:00:25,717 INFO L273 TraceCheckUtils]: 40: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11024#false} is VALID [2018-11-23 12:00:25,717 INFO L273 TraceCheckUtils]: 41: Hoare triple {11024#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11024#false} is VALID [2018-11-23 12:00:25,718 INFO L273 TraceCheckUtils]: 42: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11024#false} is VALID [2018-11-23 12:00:25,718 INFO L273 TraceCheckUtils]: 43: Hoare triple {11024#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11024#false} is VALID [2018-11-23 12:00:25,718 INFO L273 TraceCheckUtils]: 44: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11024#false} is VALID [2018-11-23 12:00:25,718 INFO L273 TraceCheckUtils]: 45: Hoare triple {11024#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11024#false} is VALID [2018-11-23 12:00:25,718 INFO L273 TraceCheckUtils]: 46: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11024#false} is VALID [2018-11-23 12:00:25,719 INFO L273 TraceCheckUtils]: 47: Hoare triple {11024#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11024#false} is VALID [2018-11-23 12:00:25,719 INFO L273 TraceCheckUtils]: 48: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11024#false} is VALID [2018-11-23 12:00:25,719 INFO L273 TraceCheckUtils]: 49: Hoare triple {11024#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11024#false} is VALID [2018-11-23 12:00:25,719 INFO L273 TraceCheckUtils]: 50: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11024#false} is VALID [2018-11-23 12:00:25,719 INFO L273 TraceCheckUtils]: 51: Hoare triple {11024#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11024#false} is VALID [2018-11-23 12:00:25,720 INFO L273 TraceCheckUtils]: 52: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11024#false} is VALID [2018-11-23 12:00:25,720 INFO L273 TraceCheckUtils]: 53: Hoare triple {11024#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11024#false} is VALID [2018-11-23 12:00:25,720 INFO L273 TraceCheckUtils]: 54: Hoare triple {11024#false} assume !(~i~0 < 100000); {11024#false} is VALID [2018-11-23 12:00:25,720 INFO L273 TraceCheckUtils]: 55: Hoare triple {11024#false} ~i~0 := 0; {11024#false} is VALID [2018-11-23 12:00:25,720 INFO L273 TraceCheckUtils]: 56: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11024#false} is VALID [2018-11-23 12:00:25,720 INFO L273 TraceCheckUtils]: 57: Hoare triple {11024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11024#false} is VALID [2018-11-23 12:00:25,720 INFO L273 TraceCheckUtils]: 58: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11024#false} is VALID [2018-11-23 12:00:25,720 INFO L273 TraceCheckUtils]: 59: Hoare triple {11024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11024#false} is VALID [2018-11-23 12:00:25,721 INFO L273 TraceCheckUtils]: 60: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11024#false} is VALID [2018-11-23 12:00:25,721 INFO L273 TraceCheckUtils]: 61: Hoare triple {11024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11024#false} is VALID [2018-11-23 12:00:25,721 INFO L273 TraceCheckUtils]: 62: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11024#false} is VALID [2018-11-23 12:00:25,721 INFO L273 TraceCheckUtils]: 63: Hoare triple {11024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11024#false} is VALID [2018-11-23 12:00:25,721 INFO L273 TraceCheckUtils]: 64: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11024#false} is VALID [2018-11-23 12:00:25,721 INFO L273 TraceCheckUtils]: 65: Hoare triple {11024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11024#false} is VALID [2018-11-23 12:00:25,721 INFO L273 TraceCheckUtils]: 66: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11024#false} is VALID [2018-11-23 12:00:25,721 INFO L273 TraceCheckUtils]: 67: Hoare triple {11024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11024#false} is VALID [2018-11-23 12:00:25,721 INFO L273 TraceCheckUtils]: 68: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11024#false} is VALID [2018-11-23 12:00:25,722 INFO L273 TraceCheckUtils]: 69: Hoare triple {11024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11024#false} is VALID [2018-11-23 12:00:25,722 INFO L273 TraceCheckUtils]: 70: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11024#false} is VALID [2018-11-23 12:00:25,722 INFO L273 TraceCheckUtils]: 71: Hoare triple {11024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11024#false} is VALID [2018-11-23 12:00:25,722 INFO L273 TraceCheckUtils]: 72: Hoare triple {11024#false} assume !(~i~0 < 100000); {11024#false} is VALID [2018-11-23 12:00:25,722 INFO L273 TraceCheckUtils]: 73: Hoare triple {11024#false} ~i~0 := 0; {11024#false} is VALID [2018-11-23 12:00:25,722 INFO L273 TraceCheckUtils]: 74: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11024#false} is VALID [2018-11-23 12:00:25,722 INFO L273 TraceCheckUtils]: 75: Hoare triple {11024#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11024#false} is VALID [2018-11-23 12:00:25,722 INFO L273 TraceCheckUtils]: 76: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11024#false} is VALID [2018-11-23 12:00:25,722 INFO L273 TraceCheckUtils]: 77: Hoare triple {11024#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11024#false} is VALID [2018-11-23 12:00:25,723 INFO L273 TraceCheckUtils]: 78: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11024#false} is VALID [2018-11-23 12:00:25,723 INFO L273 TraceCheckUtils]: 79: Hoare triple {11024#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11024#false} is VALID [2018-11-23 12:00:25,723 INFO L273 TraceCheckUtils]: 80: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11024#false} is VALID [2018-11-23 12:00:25,723 INFO L273 TraceCheckUtils]: 81: Hoare triple {11024#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11024#false} is VALID [2018-11-23 12:00:25,723 INFO L273 TraceCheckUtils]: 82: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11024#false} is VALID [2018-11-23 12:00:25,723 INFO L273 TraceCheckUtils]: 83: Hoare triple {11024#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11024#false} is VALID [2018-11-23 12:00:25,723 INFO L273 TraceCheckUtils]: 84: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11024#false} is VALID [2018-11-23 12:00:25,723 INFO L273 TraceCheckUtils]: 85: Hoare triple {11024#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11024#false} is VALID [2018-11-23 12:00:25,724 INFO L273 TraceCheckUtils]: 86: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11024#false} is VALID [2018-11-23 12:00:25,724 INFO L273 TraceCheckUtils]: 87: Hoare triple {11024#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11024#false} is VALID [2018-11-23 12:00:25,724 INFO L273 TraceCheckUtils]: 88: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11024#false} is VALID [2018-11-23 12:00:25,724 INFO L273 TraceCheckUtils]: 89: Hoare triple {11024#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11024#false} is VALID [2018-11-23 12:00:25,724 INFO L273 TraceCheckUtils]: 90: Hoare triple {11024#false} assume !(~i~0 < 100000); {11024#false} is VALID [2018-11-23 12:00:25,724 INFO L273 TraceCheckUtils]: 91: Hoare triple {11024#false} ~i~0 := 0; {11024#false} is VALID [2018-11-23 12:00:25,724 INFO L273 TraceCheckUtils]: 92: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11024#false} is VALID [2018-11-23 12:00:25,724 INFO L273 TraceCheckUtils]: 93: Hoare triple {11024#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11024#false} is VALID [2018-11-23 12:00:25,724 INFO L273 TraceCheckUtils]: 94: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11024#false} is VALID [2018-11-23 12:00:25,725 INFO L273 TraceCheckUtils]: 95: Hoare triple {11024#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11024#false} is VALID [2018-11-23 12:00:25,725 INFO L273 TraceCheckUtils]: 96: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11024#false} is VALID [2018-11-23 12:00:25,725 INFO L273 TraceCheckUtils]: 97: Hoare triple {11024#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11024#false} is VALID [2018-11-23 12:00:25,725 INFO L273 TraceCheckUtils]: 98: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11024#false} is VALID [2018-11-23 12:00:25,725 INFO L273 TraceCheckUtils]: 99: Hoare triple {11024#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11024#false} is VALID [2018-11-23 12:00:25,725 INFO L273 TraceCheckUtils]: 100: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11024#false} is VALID [2018-11-23 12:00:25,725 INFO L273 TraceCheckUtils]: 101: Hoare triple {11024#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11024#false} is VALID [2018-11-23 12:00:25,725 INFO L273 TraceCheckUtils]: 102: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11024#false} is VALID [2018-11-23 12:00:25,725 INFO L273 TraceCheckUtils]: 103: Hoare triple {11024#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11024#false} is VALID [2018-11-23 12:00:25,726 INFO L273 TraceCheckUtils]: 104: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11024#false} is VALID [2018-11-23 12:00:25,726 INFO L273 TraceCheckUtils]: 105: Hoare triple {11024#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11024#false} is VALID [2018-11-23 12:00:25,726 INFO L273 TraceCheckUtils]: 106: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11024#false} is VALID [2018-11-23 12:00:25,726 INFO L273 TraceCheckUtils]: 107: Hoare triple {11024#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11024#false} is VALID [2018-11-23 12:00:25,726 INFO L273 TraceCheckUtils]: 108: Hoare triple {11024#false} assume !(~i~0 < 100000); {11024#false} is VALID [2018-11-23 12:00:25,726 INFO L273 TraceCheckUtils]: 109: Hoare triple {11024#false} havoc ~x~0;~x~0 := 0; {11024#false} is VALID [2018-11-23 12:00:25,726 INFO L273 TraceCheckUtils]: 110: Hoare triple {11024#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {11024#false} is VALID [2018-11-23 12:00:25,726 INFO L256 TraceCheckUtils]: 111: Hoare triple {11024#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {11024#false} is VALID [2018-11-23 12:00:25,726 INFO L273 TraceCheckUtils]: 112: Hoare triple {11024#false} ~cond := #in~cond; {11024#false} is VALID [2018-11-23 12:00:25,727 INFO L273 TraceCheckUtils]: 113: Hoare triple {11024#false} assume 0 == ~cond; {11024#false} is VALID [2018-11-23 12:00:25,727 INFO L273 TraceCheckUtils]: 114: Hoare triple {11024#false} assume !false; {11024#false} is VALID [2018-11-23 12:00:25,732 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-23 12:00:25,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:25,733 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:25,741 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:00:35,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 12:00:35,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:35,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:36,213 INFO L256 TraceCheckUtils]: 0: Hoare triple {11023#true} call ULTIMATE.init(); {11023#true} is VALID [2018-11-23 12:00:36,213 INFO L273 TraceCheckUtils]: 1: Hoare triple {11023#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11023#true} is VALID [2018-11-23 12:00:36,213 INFO L273 TraceCheckUtils]: 2: Hoare triple {11023#true} assume true; {11023#true} is VALID [2018-11-23 12:00:36,213 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11023#true} {11023#true} #105#return; {11023#true} is VALID [2018-11-23 12:00:36,214 INFO L256 TraceCheckUtils]: 4: Hoare triple {11023#true} call #t~ret13 := main(); {11023#true} is VALID [2018-11-23 12:00:36,214 INFO L273 TraceCheckUtils]: 5: Hoare triple {11023#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);havoc ~a~0;~a~0 := 0; {11023#true} is VALID [2018-11-23 12:00:36,214 INFO L273 TraceCheckUtils]: 6: Hoare triple {11023#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; {11023#true} is VALID [2018-11-23 12:00:36,214 INFO L273 TraceCheckUtils]: 7: Hoare triple {11023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11023#true} is VALID [2018-11-23 12:00:36,215 INFO L273 TraceCheckUtils]: 8: Hoare triple {11023#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; {11023#true} is VALID [2018-11-23 12:00:36,215 INFO L273 TraceCheckUtils]: 9: Hoare triple {11023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11023#true} is VALID [2018-11-23 12:00:36,215 INFO L273 TraceCheckUtils]: 10: Hoare triple {11023#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; {11023#true} is VALID [2018-11-23 12:00:36,215 INFO L273 TraceCheckUtils]: 11: Hoare triple {11023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11023#true} is VALID [2018-11-23 12:00:36,215 INFO L273 TraceCheckUtils]: 12: Hoare triple {11023#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; {11023#true} is VALID [2018-11-23 12:00:36,216 INFO L273 TraceCheckUtils]: 13: Hoare triple {11023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11023#true} is VALID [2018-11-23 12:00:36,216 INFO L273 TraceCheckUtils]: 14: Hoare triple {11023#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; {11023#true} is VALID [2018-11-23 12:00:36,216 INFO L273 TraceCheckUtils]: 15: Hoare triple {11023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11023#true} is VALID [2018-11-23 12:00:36,216 INFO L273 TraceCheckUtils]: 16: Hoare triple {11023#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; {11023#true} is VALID [2018-11-23 12:00:36,216 INFO L273 TraceCheckUtils]: 17: Hoare triple {11023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11023#true} is VALID [2018-11-23 12:00:36,216 INFO L273 TraceCheckUtils]: 18: Hoare triple {11023#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; {11023#true} is VALID [2018-11-23 12:00:36,216 INFO L273 TraceCheckUtils]: 19: Hoare triple {11023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11023#true} is VALID [2018-11-23 12:00:36,216 INFO L273 TraceCheckUtils]: 20: Hoare triple {11023#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; {11023#true} is VALID [2018-11-23 12:00:36,216 INFO L273 TraceCheckUtils]: 21: Hoare triple {11023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11023#true} is VALID [2018-11-23 12:00:36,217 INFO L273 TraceCheckUtils]: 22: Hoare triple {11023#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; {11023#true} is VALID [2018-11-23 12:00:36,217 INFO L273 TraceCheckUtils]: 23: Hoare triple {11023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11023#true} is VALID [2018-11-23 12:00:36,217 INFO L273 TraceCheckUtils]: 24: Hoare triple {11023#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; {11023#true} is VALID [2018-11-23 12:00:36,217 INFO L273 TraceCheckUtils]: 25: Hoare triple {11023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11023#true} is VALID [2018-11-23 12:00:36,217 INFO L273 TraceCheckUtils]: 26: Hoare triple {11023#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; {11023#true} is VALID [2018-11-23 12:00:36,217 INFO L273 TraceCheckUtils]: 27: Hoare triple {11023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11023#true} is VALID [2018-11-23 12:00:36,217 INFO L273 TraceCheckUtils]: 28: Hoare triple {11023#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; {11023#true} is VALID [2018-11-23 12:00:36,217 INFO L273 TraceCheckUtils]: 29: Hoare triple {11023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11023#true} is VALID [2018-11-23 12:00:36,218 INFO L273 TraceCheckUtils]: 30: Hoare triple {11023#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; {11023#true} is VALID [2018-11-23 12:00:36,218 INFO L273 TraceCheckUtils]: 31: Hoare triple {11023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11023#true} is VALID [2018-11-23 12:00:36,218 INFO L273 TraceCheckUtils]: 32: Hoare triple {11023#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; {11023#true} is VALID [2018-11-23 12:00:36,218 INFO L273 TraceCheckUtils]: 33: Hoare triple {11023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11023#true} is VALID [2018-11-23 12:00:36,218 INFO L273 TraceCheckUtils]: 34: Hoare triple {11023#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; {11023#true} is VALID [2018-11-23 12:00:36,218 INFO L273 TraceCheckUtils]: 35: Hoare triple {11023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11023#true} is VALID [2018-11-23 12:00:36,218 INFO L273 TraceCheckUtils]: 36: Hoare triple {11023#true} assume !(~a~0 < 100000); {11023#true} is VALID [2018-11-23 12:00:36,218 INFO L273 TraceCheckUtils]: 37: Hoare triple {11023#true} havoc ~i~0;~i~0 := 0; {11023#true} is VALID [2018-11-23 12:00:36,218 INFO L273 TraceCheckUtils]: 38: Hoare triple {11023#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11023#true} is VALID [2018-11-23 12:00:36,219 INFO L273 TraceCheckUtils]: 39: Hoare triple {11023#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11023#true} is VALID [2018-11-23 12:00:36,219 INFO L273 TraceCheckUtils]: 40: Hoare triple {11023#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11023#true} is VALID [2018-11-23 12:00:36,219 INFO L273 TraceCheckUtils]: 41: Hoare triple {11023#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11023#true} is VALID [2018-11-23 12:00:36,219 INFO L273 TraceCheckUtils]: 42: Hoare triple {11023#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11023#true} is VALID [2018-11-23 12:00:36,219 INFO L273 TraceCheckUtils]: 43: Hoare triple {11023#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11023#true} is VALID [2018-11-23 12:00:36,219 INFO L273 TraceCheckUtils]: 44: Hoare triple {11023#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11023#true} is VALID [2018-11-23 12:00:36,219 INFO L273 TraceCheckUtils]: 45: Hoare triple {11023#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11023#true} is VALID [2018-11-23 12:00:36,219 INFO L273 TraceCheckUtils]: 46: Hoare triple {11023#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11023#true} is VALID [2018-11-23 12:00:36,219 INFO L273 TraceCheckUtils]: 47: Hoare triple {11023#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11023#true} is VALID [2018-11-23 12:00:36,220 INFO L273 TraceCheckUtils]: 48: Hoare triple {11023#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11023#true} is VALID [2018-11-23 12:00:36,220 INFO L273 TraceCheckUtils]: 49: Hoare triple {11023#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11023#true} is VALID [2018-11-23 12:00:36,220 INFO L273 TraceCheckUtils]: 50: Hoare triple {11023#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11023#true} is VALID [2018-11-23 12:00:36,220 INFO L273 TraceCheckUtils]: 51: Hoare triple {11023#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11023#true} is VALID [2018-11-23 12:00:36,220 INFO L273 TraceCheckUtils]: 52: Hoare triple {11023#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11023#true} is VALID [2018-11-23 12:00:36,220 INFO L273 TraceCheckUtils]: 53: Hoare triple {11023#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11023#true} is VALID [2018-11-23 12:00:36,220 INFO L273 TraceCheckUtils]: 54: Hoare triple {11023#true} assume !(~i~0 < 100000); {11023#true} is VALID [2018-11-23 12:00:36,220 INFO L273 TraceCheckUtils]: 55: Hoare triple {11023#true} ~i~0 := 0; {11023#true} is VALID [2018-11-23 12:00:36,220 INFO L273 TraceCheckUtils]: 56: Hoare triple {11023#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11023#true} is VALID [2018-11-23 12:00:36,221 INFO L273 TraceCheckUtils]: 57: Hoare triple {11023#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11023#true} is VALID [2018-11-23 12:00:36,221 INFO L273 TraceCheckUtils]: 58: Hoare triple {11023#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11023#true} is VALID [2018-11-23 12:00:36,221 INFO L273 TraceCheckUtils]: 59: Hoare triple {11023#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11023#true} is VALID [2018-11-23 12:00:36,221 INFO L273 TraceCheckUtils]: 60: Hoare triple {11023#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11023#true} is VALID [2018-11-23 12:00:36,221 INFO L273 TraceCheckUtils]: 61: Hoare triple {11023#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11023#true} is VALID [2018-11-23 12:00:36,221 INFO L273 TraceCheckUtils]: 62: Hoare triple {11023#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11023#true} is VALID [2018-11-23 12:00:36,221 INFO L273 TraceCheckUtils]: 63: Hoare triple {11023#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11023#true} is VALID [2018-11-23 12:00:36,221 INFO L273 TraceCheckUtils]: 64: Hoare triple {11023#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11023#true} is VALID [2018-11-23 12:00:36,222 INFO L273 TraceCheckUtils]: 65: Hoare triple {11023#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11023#true} is VALID [2018-11-23 12:00:36,222 INFO L273 TraceCheckUtils]: 66: Hoare triple {11023#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11023#true} is VALID [2018-11-23 12:00:36,222 INFO L273 TraceCheckUtils]: 67: Hoare triple {11023#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11023#true} is VALID [2018-11-23 12:00:36,222 INFO L273 TraceCheckUtils]: 68: Hoare triple {11023#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11023#true} is VALID [2018-11-23 12:00:36,222 INFO L273 TraceCheckUtils]: 69: Hoare triple {11023#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11023#true} is VALID [2018-11-23 12:00:36,222 INFO L273 TraceCheckUtils]: 70: Hoare triple {11023#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11023#true} is VALID [2018-11-23 12:00:36,222 INFO L273 TraceCheckUtils]: 71: Hoare triple {11023#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11023#true} is VALID [2018-11-23 12:00:36,222 INFO L273 TraceCheckUtils]: 72: Hoare triple {11023#true} assume !(~i~0 < 100000); {11023#true} is VALID [2018-11-23 12:00:36,223 INFO L273 TraceCheckUtils]: 73: Hoare triple {11023#true} ~i~0 := 0; {11263#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:36,223 INFO L273 TraceCheckUtils]: 74: Hoare triple {11263#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11263#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:36,224 INFO L273 TraceCheckUtils]: 75: Hoare triple {11263#(<= main_~i~0 0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11270#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:36,224 INFO L273 TraceCheckUtils]: 76: Hoare triple {11270#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11270#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:36,224 INFO L273 TraceCheckUtils]: 77: Hoare triple {11270#(<= main_~i~0 1)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11277#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:36,225 INFO L273 TraceCheckUtils]: 78: Hoare triple {11277#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11277#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:36,225 INFO L273 TraceCheckUtils]: 79: Hoare triple {11277#(<= main_~i~0 2)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11284#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:36,226 INFO L273 TraceCheckUtils]: 80: Hoare triple {11284#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11284#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:36,226 INFO L273 TraceCheckUtils]: 81: Hoare triple {11284#(<= main_~i~0 3)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11291#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:36,227 INFO L273 TraceCheckUtils]: 82: Hoare triple {11291#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11291#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:36,228 INFO L273 TraceCheckUtils]: 83: Hoare triple {11291#(<= main_~i~0 4)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11298#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:36,228 INFO L273 TraceCheckUtils]: 84: Hoare triple {11298#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11298#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:36,229 INFO L273 TraceCheckUtils]: 85: Hoare triple {11298#(<= main_~i~0 5)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11305#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:36,229 INFO L273 TraceCheckUtils]: 86: Hoare triple {11305#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11305#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:36,230 INFO L273 TraceCheckUtils]: 87: Hoare triple {11305#(<= main_~i~0 6)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11312#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:36,231 INFO L273 TraceCheckUtils]: 88: Hoare triple {11312#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11312#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:36,231 INFO L273 TraceCheckUtils]: 89: Hoare triple {11312#(<= main_~i~0 7)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11319#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:36,232 INFO L273 TraceCheckUtils]: 90: Hoare triple {11319#(<= main_~i~0 8)} assume !(~i~0 < 100000); {11024#false} is VALID [2018-11-23 12:00:36,232 INFO L273 TraceCheckUtils]: 91: Hoare triple {11024#false} ~i~0 := 0; {11024#false} is VALID [2018-11-23 12:00:36,232 INFO L273 TraceCheckUtils]: 92: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11024#false} is VALID [2018-11-23 12:00:36,233 INFO L273 TraceCheckUtils]: 93: Hoare triple {11024#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11024#false} is VALID [2018-11-23 12:00:36,233 INFO L273 TraceCheckUtils]: 94: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11024#false} is VALID [2018-11-23 12:00:36,233 INFO L273 TraceCheckUtils]: 95: Hoare triple {11024#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11024#false} is VALID [2018-11-23 12:00:36,233 INFO L273 TraceCheckUtils]: 96: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11024#false} is VALID [2018-11-23 12:00:36,233 INFO L273 TraceCheckUtils]: 97: Hoare triple {11024#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11024#false} is VALID [2018-11-23 12:00:36,234 INFO L273 TraceCheckUtils]: 98: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11024#false} is VALID [2018-11-23 12:00:36,234 INFO L273 TraceCheckUtils]: 99: Hoare triple {11024#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11024#false} is VALID [2018-11-23 12:00:36,234 INFO L273 TraceCheckUtils]: 100: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11024#false} is VALID [2018-11-23 12:00:36,234 INFO L273 TraceCheckUtils]: 101: Hoare triple {11024#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11024#false} is VALID [2018-11-23 12:00:36,234 INFO L273 TraceCheckUtils]: 102: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11024#false} is VALID [2018-11-23 12:00:36,235 INFO L273 TraceCheckUtils]: 103: Hoare triple {11024#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11024#false} is VALID [2018-11-23 12:00:36,235 INFO L273 TraceCheckUtils]: 104: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11024#false} is VALID [2018-11-23 12:00:36,235 INFO L273 TraceCheckUtils]: 105: Hoare triple {11024#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11024#false} is VALID [2018-11-23 12:00:36,235 INFO L273 TraceCheckUtils]: 106: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11024#false} is VALID [2018-11-23 12:00:36,235 INFO L273 TraceCheckUtils]: 107: Hoare triple {11024#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11024#false} is VALID [2018-11-23 12:00:36,236 INFO L273 TraceCheckUtils]: 108: Hoare triple {11024#false} assume !(~i~0 < 100000); {11024#false} is VALID [2018-11-23 12:00:36,236 INFO L273 TraceCheckUtils]: 109: Hoare triple {11024#false} havoc ~x~0;~x~0 := 0; {11024#false} is VALID [2018-11-23 12:00:36,236 INFO L273 TraceCheckUtils]: 110: Hoare triple {11024#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {11024#false} is VALID [2018-11-23 12:00:36,236 INFO L256 TraceCheckUtils]: 111: Hoare triple {11024#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {11024#false} is VALID [2018-11-23 12:00:36,237 INFO L273 TraceCheckUtils]: 112: Hoare triple {11024#false} ~cond := #in~cond; {11024#false} is VALID [2018-11-23 12:00:36,237 INFO L273 TraceCheckUtils]: 113: Hoare triple {11024#false} assume 0 == ~cond; {11024#false} is VALID [2018-11-23 12:00:36,237 INFO L273 TraceCheckUtils]: 114: Hoare triple {11024#false} assume !false; {11024#false} is VALID [2018-11-23 12:00:36,242 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2018-11-23 12:00:36,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:36,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 27 [2018-11-23 12:00:36,265 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 115 [2018-11-23 12:00:36,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:36,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 12:00:36,374 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:36,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 12:00:36,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 12:00:36,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:00:36,375 INFO L87 Difference]: Start difference. First operand 120 states and 125 transitions. Second operand 27 states. [2018-11-23 12:00:37,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:37,918 INFO L93 Difference]: Finished difference Result 218 states and 232 transitions. [2018-11-23 12:00:37,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 12:00:37,919 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 115 [2018-11-23 12:00:37,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:37,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:00:37,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 172 transitions. [2018-11-23 12:00:37,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:00:37,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 172 transitions. [2018-11-23 12:00:37,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 172 transitions. [2018-11-23 12:00:38,098 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:38,101 INFO L225 Difference]: With dead ends: 218 [2018-11-23 12:00:38,101 INFO L226 Difference]: Without dead ends: 135 [2018-11-23 12:00:38,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:00:38,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-23 12:00:38,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 130. [2018-11-23 12:00:38,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:38,159 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand 130 states. [2018-11-23 12:00:38,159 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 130 states. [2018-11-23 12:00:38,160 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 130 states. [2018-11-23 12:00:38,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:38,162 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2018-11-23 12:00:38,162 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 140 transitions. [2018-11-23 12:00:38,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:38,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:38,163 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 135 states. [2018-11-23 12:00:38,163 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 135 states. [2018-11-23 12:00:38,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:38,165 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2018-11-23 12:00:38,165 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 140 transitions. [2018-11-23 12:00:38,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:38,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:38,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:38,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:38,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-23 12:00:38,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 135 transitions. [2018-11-23 12:00:38,167 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 135 transitions. Word has length 115 [2018-11-23 12:00:38,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:38,168 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 135 transitions. [2018-11-23 12:00:38,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 12:00:38,168 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 135 transitions. [2018-11-23 12:00:38,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-23 12:00:38,169 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:38,169 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 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] [2018-11-23 12:00:38,169 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:38,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:38,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1002095706, now seen corresponding path program 16 times [2018-11-23 12:00:38,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:38,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:38,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:38,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:38,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:38,551 INFO L256 TraceCheckUtils]: 0: Hoare triple {12179#true} call ULTIMATE.init(); {12179#true} is VALID [2018-11-23 12:00:38,551 INFO L273 TraceCheckUtils]: 1: Hoare triple {12179#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12179#true} is VALID [2018-11-23 12:00:38,551 INFO L273 TraceCheckUtils]: 2: Hoare triple {12179#true} assume true; {12179#true} is VALID [2018-11-23 12:00:38,551 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12179#true} {12179#true} #105#return; {12179#true} is VALID [2018-11-23 12:00:38,551 INFO L256 TraceCheckUtils]: 4: Hoare triple {12179#true} call #t~ret13 := main(); {12179#true} is VALID [2018-11-23 12:00:38,552 INFO L273 TraceCheckUtils]: 5: Hoare triple {12179#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);havoc ~a~0;~a~0 := 0; {12181#(= main_~a~0 0)} is VALID [2018-11-23 12:00:38,552 INFO L273 TraceCheckUtils]: 6: Hoare triple {12181#(= 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; {12181#(= main_~a~0 0)} is VALID [2018-11-23 12:00:38,553 INFO L273 TraceCheckUtils]: 7: Hoare triple {12181#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12182#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:38,553 INFO L273 TraceCheckUtils]: 8: Hoare triple {12182#(<= 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; {12182#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:38,554 INFO L273 TraceCheckUtils]: 9: Hoare triple {12182#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12183#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:38,555 INFO L273 TraceCheckUtils]: 10: Hoare triple {12183#(<= 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; {12183#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:38,555 INFO L273 TraceCheckUtils]: 11: Hoare triple {12183#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12184#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:38,556 INFO L273 TraceCheckUtils]: 12: Hoare triple {12184#(<= 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; {12184#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:38,557 INFO L273 TraceCheckUtils]: 13: Hoare triple {12184#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12185#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:38,557 INFO L273 TraceCheckUtils]: 14: Hoare triple {12185#(<= 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; {12185#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:38,558 INFO L273 TraceCheckUtils]: 15: Hoare triple {12185#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12186#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:38,558 INFO L273 TraceCheckUtils]: 16: Hoare triple {12186#(<= 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; {12186#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:38,559 INFO L273 TraceCheckUtils]: 17: Hoare triple {12186#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12187#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:38,560 INFO L273 TraceCheckUtils]: 18: Hoare triple {12187#(<= 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; {12187#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:38,560 INFO L273 TraceCheckUtils]: 19: Hoare triple {12187#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12188#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:38,561 INFO L273 TraceCheckUtils]: 20: Hoare triple {12188#(<= 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; {12188#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:38,562 INFO L273 TraceCheckUtils]: 21: Hoare triple {12188#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12189#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:38,562 INFO L273 TraceCheckUtils]: 22: Hoare triple {12189#(<= 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; {12189#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:38,563 INFO L273 TraceCheckUtils]: 23: Hoare triple {12189#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12190#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:38,564 INFO L273 TraceCheckUtils]: 24: Hoare triple {12190#(<= 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; {12190#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:38,564 INFO L273 TraceCheckUtils]: 25: Hoare triple {12190#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12191#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:38,565 INFO L273 TraceCheckUtils]: 26: Hoare triple {12191#(<= 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; {12191#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:38,566 INFO L273 TraceCheckUtils]: 27: Hoare triple {12191#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12192#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:38,566 INFO L273 TraceCheckUtils]: 28: Hoare triple {12192#(<= 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; {12192#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:38,567 INFO L273 TraceCheckUtils]: 29: Hoare triple {12192#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12193#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:38,567 INFO L273 TraceCheckUtils]: 30: Hoare triple {12193#(<= 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; {12193#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:38,568 INFO L273 TraceCheckUtils]: 31: Hoare triple {12193#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12194#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:38,569 INFO L273 TraceCheckUtils]: 32: Hoare triple {12194#(<= 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; {12194#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:38,569 INFO L273 TraceCheckUtils]: 33: Hoare triple {12194#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12195#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:38,570 INFO L273 TraceCheckUtils]: 34: Hoare triple {12195#(<= 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; {12195#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:38,571 INFO L273 TraceCheckUtils]: 35: Hoare triple {12195#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12196#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:38,571 INFO L273 TraceCheckUtils]: 36: Hoare triple {12196#(<= 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; {12196#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:38,572 INFO L273 TraceCheckUtils]: 37: Hoare triple {12196#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12197#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:38,573 INFO L273 TraceCheckUtils]: 38: Hoare triple {12197#(<= main_~a~0 16)} assume !(~a~0 < 100000); {12180#false} is VALID [2018-11-23 12:00:38,573 INFO L273 TraceCheckUtils]: 39: Hoare triple {12180#false} havoc ~i~0;~i~0 := 0; {12180#false} is VALID [2018-11-23 12:00:38,573 INFO L273 TraceCheckUtils]: 40: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12180#false} is VALID [2018-11-23 12:00:38,573 INFO L273 TraceCheckUtils]: 41: Hoare triple {12180#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12180#false} is VALID [2018-11-23 12:00:38,573 INFO L273 TraceCheckUtils]: 42: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12180#false} is VALID [2018-11-23 12:00:38,574 INFO L273 TraceCheckUtils]: 43: Hoare triple {12180#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12180#false} is VALID [2018-11-23 12:00:38,574 INFO L273 TraceCheckUtils]: 44: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12180#false} is VALID [2018-11-23 12:00:38,574 INFO L273 TraceCheckUtils]: 45: Hoare triple {12180#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12180#false} is VALID [2018-11-23 12:00:38,574 INFO L273 TraceCheckUtils]: 46: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12180#false} is VALID [2018-11-23 12:00:38,574 INFO L273 TraceCheckUtils]: 47: Hoare triple {12180#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12180#false} is VALID [2018-11-23 12:00:38,575 INFO L273 TraceCheckUtils]: 48: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12180#false} is VALID [2018-11-23 12:00:38,575 INFO L273 TraceCheckUtils]: 49: Hoare triple {12180#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12180#false} is VALID [2018-11-23 12:00:38,575 INFO L273 TraceCheckUtils]: 50: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12180#false} is VALID [2018-11-23 12:00:38,575 INFO L273 TraceCheckUtils]: 51: Hoare triple {12180#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12180#false} is VALID [2018-11-23 12:00:38,575 INFO L273 TraceCheckUtils]: 52: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12180#false} is VALID [2018-11-23 12:00:38,575 INFO L273 TraceCheckUtils]: 53: Hoare triple {12180#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12180#false} is VALID [2018-11-23 12:00:38,576 INFO L273 TraceCheckUtils]: 54: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12180#false} is VALID [2018-11-23 12:00:38,576 INFO L273 TraceCheckUtils]: 55: Hoare triple {12180#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12180#false} is VALID [2018-11-23 12:00:38,576 INFO L273 TraceCheckUtils]: 56: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12180#false} is VALID [2018-11-23 12:00:38,576 INFO L273 TraceCheckUtils]: 57: Hoare triple {12180#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12180#false} is VALID [2018-11-23 12:00:38,576 INFO L273 TraceCheckUtils]: 58: Hoare triple {12180#false} assume !(~i~0 < 100000); {12180#false} is VALID [2018-11-23 12:00:38,576 INFO L273 TraceCheckUtils]: 59: Hoare triple {12180#false} ~i~0 := 0; {12180#false} is VALID [2018-11-23 12:00:38,576 INFO L273 TraceCheckUtils]: 60: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12180#false} is VALID [2018-11-23 12:00:38,576 INFO L273 TraceCheckUtils]: 61: Hoare triple {12180#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12180#false} is VALID [2018-11-23 12:00:38,576 INFO L273 TraceCheckUtils]: 62: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12180#false} is VALID [2018-11-23 12:00:38,577 INFO L273 TraceCheckUtils]: 63: Hoare triple {12180#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12180#false} is VALID [2018-11-23 12:00:38,577 INFO L273 TraceCheckUtils]: 64: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12180#false} is VALID [2018-11-23 12:00:38,577 INFO L273 TraceCheckUtils]: 65: Hoare triple {12180#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12180#false} is VALID [2018-11-23 12:00:38,577 INFO L273 TraceCheckUtils]: 66: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12180#false} is VALID [2018-11-23 12:00:38,577 INFO L273 TraceCheckUtils]: 67: Hoare triple {12180#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12180#false} is VALID [2018-11-23 12:00:38,577 INFO L273 TraceCheckUtils]: 68: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12180#false} is VALID [2018-11-23 12:00:38,577 INFO L273 TraceCheckUtils]: 69: Hoare triple {12180#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12180#false} is VALID [2018-11-23 12:00:38,577 INFO L273 TraceCheckUtils]: 70: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12180#false} is VALID [2018-11-23 12:00:38,577 INFO L273 TraceCheckUtils]: 71: Hoare triple {12180#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12180#false} is VALID [2018-11-23 12:00:38,578 INFO L273 TraceCheckUtils]: 72: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12180#false} is VALID [2018-11-23 12:00:38,578 INFO L273 TraceCheckUtils]: 73: Hoare triple {12180#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12180#false} is VALID [2018-11-23 12:00:38,578 INFO L273 TraceCheckUtils]: 74: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12180#false} is VALID [2018-11-23 12:00:38,578 INFO L273 TraceCheckUtils]: 75: Hoare triple {12180#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12180#false} is VALID [2018-11-23 12:00:38,578 INFO L273 TraceCheckUtils]: 76: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12180#false} is VALID [2018-11-23 12:00:38,578 INFO L273 TraceCheckUtils]: 77: Hoare triple {12180#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12180#false} is VALID [2018-11-23 12:00:38,578 INFO L273 TraceCheckUtils]: 78: Hoare triple {12180#false} assume !(~i~0 < 100000); {12180#false} is VALID [2018-11-23 12:00:38,578 INFO L273 TraceCheckUtils]: 79: Hoare triple {12180#false} ~i~0 := 0; {12180#false} is VALID [2018-11-23 12:00:38,578 INFO L273 TraceCheckUtils]: 80: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {12180#false} is VALID [2018-11-23 12:00:38,579 INFO L273 TraceCheckUtils]: 81: Hoare triple {12180#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12180#false} is VALID [2018-11-23 12:00:38,579 INFO L273 TraceCheckUtils]: 82: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {12180#false} is VALID [2018-11-23 12:00:38,579 INFO L273 TraceCheckUtils]: 83: Hoare triple {12180#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12180#false} is VALID [2018-11-23 12:00:38,579 INFO L273 TraceCheckUtils]: 84: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {12180#false} is VALID [2018-11-23 12:00:38,579 INFO L273 TraceCheckUtils]: 85: Hoare triple {12180#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12180#false} is VALID [2018-11-23 12:00:38,579 INFO L273 TraceCheckUtils]: 86: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {12180#false} is VALID [2018-11-23 12:00:38,579 INFO L273 TraceCheckUtils]: 87: Hoare triple {12180#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12180#false} is VALID [2018-11-23 12:00:38,579 INFO L273 TraceCheckUtils]: 88: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {12180#false} is VALID [2018-11-23 12:00:38,580 INFO L273 TraceCheckUtils]: 89: Hoare triple {12180#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12180#false} is VALID [2018-11-23 12:00:38,580 INFO L273 TraceCheckUtils]: 90: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {12180#false} is VALID [2018-11-23 12:00:38,580 INFO L273 TraceCheckUtils]: 91: Hoare triple {12180#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12180#false} is VALID [2018-11-23 12:00:38,580 INFO L273 TraceCheckUtils]: 92: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {12180#false} is VALID [2018-11-23 12:00:38,580 INFO L273 TraceCheckUtils]: 93: Hoare triple {12180#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12180#false} is VALID [2018-11-23 12:00:38,580 INFO L273 TraceCheckUtils]: 94: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {12180#false} is VALID [2018-11-23 12:00:38,580 INFO L273 TraceCheckUtils]: 95: Hoare triple {12180#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12180#false} is VALID [2018-11-23 12:00:38,580 INFO L273 TraceCheckUtils]: 96: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {12180#false} is VALID [2018-11-23 12:00:38,580 INFO L273 TraceCheckUtils]: 97: Hoare triple {12180#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12180#false} is VALID [2018-11-23 12:00:38,581 INFO L273 TraceCheckUtils]: 98: Hoare triple {12180#false} assume !(~i~0 < 100000); {12180#false} is VALID [2018-11-23 12:00:38,581 INFO L273 TraceCheckUtils]: 99: Hoare triple {12180#false} ~i~0 := 0; {12180#false} is VALID [2018-11-23 12:00:38,581 INFO L273 TraceCheckUtils]: 100: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {12180#false} is VALID [2018-11-23 12:00:38,581 INFO L273 TraceCheckUtils]: 101: Hoare triple {12180#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {12180#false} is VALID [2018-11-23 12:00:38,581 INFO L273 TraceCheckUtils]: 102: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {12180#false} is VALID [2018-11-23 12:00:38,581 INFO L273 TraceCheckUtils]: 103: Hoare triple {12180#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {12180#false} is VALID [2018-11-23 12:00:38,581 INFO L273 TraceCheckUtils]: 104: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {12180#false} is VALID [2018-11-23 12:00:38,581 INFO L273 TraceCheckUtils]: 105: Hoare triple {12180#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {12180#false} is VALID [2018-11-23 12:00:38,581 INFO L273 TraceCheckUtils]: 106: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {12180#false} is VALID [2018-11-23 12:00:38,582 INFO L273 TraceCheckUtils]: 107: Hoare triple {12180#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {12180#false} is VALID [2018-11-23 12:00:38,582 INFO L273 TraceCheckUtils]: 108: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {12180#false} is VALID [2018-11-23 12:00:38,582 INFO L273 TraceCheckUtils]: 109: Hoare triple {12180#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {12180#false} is VALID [2018-11-23 12:00:38,582 INFO L273 TraceCheckUtils]: 110: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {12180#false} is VALID [2018-11-23 12:00:38,582 INFO L273 TraceCheckUtils]: 111: Hoare triple {12180#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {12180#false} is VALID [2018-11-23 12:00:38,582 INFO L273 TraceCheckUtils]: 112: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {12180#false} is VALID [2018-11-23 12:00:38,582 INFO L273 TraceCheckUtils]: 113: Hoare triple {12180#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {12180#false} is VALID [2018-11-23 12:00:38,582 INFO L273 TraceCheckUtils]: 114: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {12180#false} is VALID [2018-11-23 12:00:38,582 INFO L273 TraceCheckUtils]: 115: Hoare triple {12180#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {12180#false} is VALID [2018-11-23 12:00:38,583 INFO L273 TraceCheckUtils]: 116: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {12180#false} is VALID [2018-11-23 12:00:38,583 INFO L273 TraceCheckUtils]: 117: Hoare triple {12180#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {12180#false} is VALID [2018-11-23 12:00:38,583 INFO L273 TraceCheckUtils]: 118: Hoare triple {12180#false} assume !(~i~0 < 100000); {12180#false} is VALID [2018-11-23 12:00:38,583 INFO L273 TraceCheckUtils]: 119: Hoare triple {12180#false} havoc ~x~0;~x~0 := 0; {12180#false} is VALID [2018-11-23 12:00:38,583 INFO L273 TraceCheckUtils]: 120: Hoare triple {12180#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {12180#false} is VALID [2018-11-23 12:00:38,583 INFO L256 TraceCheckUtils]: 121: Hoare triple {12180#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {12180#false} is VALID [2018-11-23 12:00:38,583 INFO L273 TraceCheckUtils]: 122: Hoare triple {12180#false} ~cond := #in~cond; {12180#false} is VALID [2018-11-23 12:00:38,583 INFO L273 TraceCheckUtils]: 123: Hoare triple {12180#false} assume 0 == ~cond; {12180#false} is VALID [2018-11-23 12:00:38,584 INFO L273 TraceCheckUtils]: 124: Hoare triple {12180#false} assume !false; {12180#false} is VALID [2018-11-23 12:00:38,590 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-11-23 12:00:38,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:38,590 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:38,600 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:00:38,658 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:00:38,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:38,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:38,925 INFO L256 TraceCheckUtils]: 0: Hoare triple {12179#true} call ULTIMATE.init(); {12179#true} is VALID [2018-11-23 12:00:38,925 INFO L273 TraceCheckUtils]: 1: Hoare triple {12179#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12179#true} is VALID [2018-11-23 12:00:38,925 INFO L273 TraceCheckUtils]: 2: Hoare triple {12179#true} assume true; {12179#true} is VALID [2018-11-23 12:00:38,925 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12179#true} {12179#true} #105#return; {12179#true} is VALID [2018-11-23 12:00:38,925 INFO L256 TraceCheckUtils]: 4: Hoare triple {12179#true} call #t~ret13 := main(); {12179#true} is VALID [2018-11-23 12:00:38,926 INFO L273 TraceCheckUtils]: 5: Hoare triple {12179#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);havoc ~a~0;~a~0 := 0; {12216#(<= main_~a~0 0)} is VALID [2018-11-23 12:00:38,927 INFO L273 TraceCheckUtils]: 6: Hoare triple {12216#(<= 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; {12216#(<= main_~a~0 0)} is VALID [2018-11-23 12:00:38,927 INFO L273 TraceCheckUtils]: 7: Hoare triple {12216#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12182#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:38,928 INFO L273 TraceCheckUtils]: 8: Hoare triple {12182#(<= 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; {12182#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:38,929 INFO L273 TraceCheckUtils]: 9: Hoare triple {12182#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12183#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:38,929 INFO L273 TraceCheckUtils]: 10: Hoare triple {12183#(<= 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; {12183#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:38,930 INFO L273 TraceCheckUtils]: 11: Hoare triple {12183#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12184#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:38,930 INFO L273 TraceCheckUtils]: 12: Hoare triple {12184#(<= 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; {12184#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:38,931 INFO L273 TraceCheckUtils]: 13: Hoare triple {12184#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12185#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:38,932 INFO L273 TraceCheckUtils]: 14: Hoare triple {12185#(<= 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; {12185#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:38,932 INFO L273 TraceCheckUtils]: 15: Hoare triple {12185#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12186#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:38,933 INFO L273 TraceCheckUtils]: 16: Hoare triple {12186#(<= 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; {12186#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:38,934 INFO L273 TraceCheckUtils]: 17: Hoare triple {12186#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12187#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:38,934 INFO L273 TraceCheckUtils]: 18: Hoare triple {12187#(<= 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; {12187#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:38,935 INFO L273 TraceCheckUtils]: 19: Hoare triple {12187#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12188#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:38,936 INFO L273 TraceCheckUtils]: 20: Hoare triple {12188#(<= 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; {12188#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:38,936 INFO L273 TraceCheckUtils]: 21: Hoare triple {12188#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12189#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:38,937 INFO L273 TraceCheckUtils]: 22: Hoare triple {12189#(<= 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; {12189#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:38,938 INFO L273 TraceCheckUtils]: 23: Hoare triple {12189#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12190#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:38,938 INFO L273 TraceCheckUtils]: 24: Hoare triple {12190#(<= 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; {12190#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:38,939 INFO L273 TraceCheckUtils]: 25: Hoare triple {12190#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12191#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:38,939 INFO L273 TraceCheckUtils]: 26: Hoare triple {12191#(<= 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; {12191#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:38,940 INFO L273 TraceCheckUtils]: 27: Hoare triple {12191#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12192#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:38,941 INFO L273 TraceCheckUtils]: 28: Hoare triple {12192#(<= 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; {12192#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:38,941 INFO L273 TraceCheckUtils]: 29: Hoare triple {12192#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12193#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:38,942 INFO L273 TraceCheckUtils]: 30: Hoare triple {12193#(<= 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; {12193#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:38,943 INFO L273 TraceCheckUtils]: 31: Hoare triple {12193#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12194#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:38,943 INFO L273 TraceCheckUtils]: 32: Hoare triple {12194#(<= 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; {12194#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:38,944 INFO L273 TraceCheckUtils]: 33: Hoare triple {12194#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12195#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:38,944 INFO L273 TraceCheckUtils]: 34: Hoare triple {12195#(<= 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; {12195#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:38,945 INFO L273 TraceCheckUtils]: 35: Hoare triple {12195#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12196#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:38,946 INFO L273 TraceCheckUtils]: 36: Hoare triple {12196#(<= 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; {12196#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:38,946 INFO L273 TraceCheckUtils]: 37: Hoare triple {12196#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12197#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:38,947 INFO L273 TraceCheckUtils]: 38: Hoare triple {12197#(<= main_~a~0 16)} assume !(~a~0 < 100000); {12180#false} is VALID [2018-11-23 12:00:38,947 INFO L273 TraceCheckUtils]: 39: Hoare triple {12180#false} havoc ~i~0;~i~0 := 0; {12180#false} is VALID [2018-11-23 12:00:38,948 INFO L273 TraceCheckUtils]: 40: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12180#false} is VALID [2018-11-23 12:00:38,948 INFO L273 TraceCheckUtils]: 41: Hoare triple {12180#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12180#false} is VALID [2018-11-23 12:00:38,948 INFO L273 TraceCheckUtils]: 42: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12180#false} is VALID [2018-11-23 12:00:38,948 INFO L273 TraceCheckUtils]: 43: Hoare triple {12180#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12180#false} is VALID [2018-11-23 12:00:38,948 INFO L273 TraceCheckUtils]: 44: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12180#false} is VALID [2018-11-23 12:00:38,948 INFO L273 TraceCheckUtils]: 45: Hoare triple {12180#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12180#false} is VALID [2018-11-23 12:00:38,949 INFO L273 TraceCheckUtils]: 46: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12180#false} is VALID [2018-11-23 12:00:38,949 INFO L273 TraceCheckUtils]: 47: Hoare triple {12180#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12180#false} is VALID [2018-11-23 12:00:38,949 INFO L273 TraceCheckUtils]: 48: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12180#false} is VALID [2018-11-23 12:00:38,949 INFO L273 TraceCheckUtils]: 49: Hoare triple {12180#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12180#false} is VALID [2018-11-23 12:00:38,949 INFO L273 TraceCheckUtils]: 50: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12180#false} is VALID [2018-11-23 12:00:38,950 INFO L273 TraceCheckUtils]: 51: Hoare triple {12180#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12180#false} is VALID [2018-11-23 12:00:38,950 INFO L273 TraceCheckUtils]: 52: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12180#false} is VALID [2018-11-23 12:00:38,950 INFO L273 TraceCheckUtils]: 53: Hoare triple {12180#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12180#false} is VALID [2018-11-23 12:00:38,950 INFO L273 TraceCheckUtils]: 54: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12180#false} is VALID [2018-11-23 12:00:38,950 INFO L273 TraceCheckUtils]: 55: Hoare triple {12180#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12180#false} is VALID [2018-11-23 12:00:38,951 INFO L273 TraceCheckUtils]: 56: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12180#false} is VALID [2018-11-23 12:00:38,951 INFO L273 TraceCheckUtils]: 57: Hoare triple {12180#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12180#false} is VALID [2018-11-23 12:00:38,951 INFO L273 TraceCheckUtils]: 58: Hoare triple {12180#false} assume !(~i~0 < 100000); {12180#false} is VALID [2018-11-23 12:00:38,951 INFO L273 TraceCheckUtils]: 59: Hoare triple {12180#false} ~i~0 := 0; {12180#false} is VALID [2018-11-23 12:00:38,951 INFO L273 TraceCheckUtils]: 60: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12180#false} is VALID [2018-11-23 12:00:38,951 INFO L273 TraceCheckUtils]: 61: Hoare triple {12180#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12180#false} is VALID [2018-11-23 12:00:38,951 INFO L273 TraceCheckUtils]: 62: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12180#false} is VALID [2018-11-23 12:00:38,952 INFO L273 TraceCheckUtils]: 63: Hoare triple {12180#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12180#false} is VALID [2018-11-23 12:00:38,952 INFO L273 TraceCheckUtils]: 64: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12180#false} is VALID [2018-11-23 12:00:38,952 INFO L273 TraceCheckUtils]: 65: Hoare triple {12180#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12180#false} is VALID [2018-11-23 12:00:38,952 INFO L273 TraceCheckUtils]: 66: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12180#false} is VALID [2018-11-23 12:00:38,952 INFO L273 TraceCheckUtils]: 67: Hoare triple {12180#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12180#false} is VALID [2018-11-23 12:00:38,952 INFO L273 TraceCheckUtils]: 68: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12180#false} is VALID [2018-11-23 12:00:38,952 INFO L273 TraceCheckUtils]: 69: Hoare triple {12180#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12180#false} is VALID [2018-11-23 12:00:38,952 INFO L273 TraceCheckUtils]: 70: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12180#false} is VALID [2018-11-23 12:00:38,952 INFO L273 TraceCheckUtils]: 71: Hoare triple {12180#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12180#false} is VALID [2018-11-23 12:00:38,953 INFO L273 TraceCheckUtils]: 72: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12180#false} is VALID [2018-11-23 12:00:38,953 INFO L273 TraceCheckUtils]: 73: Hoare triple {12180#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12180#false} is VALID [2018-11-23 12:00:38,953 INFO L273 TraceCheckUtils]: 74: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12180#false} is VALID [2018-11-23 12:00:38,953 INFO L273 TraceCheckUtils]: 75: Hoare triple {12180#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12180#false} is VALID [2018-11-23 12:00:38,953 INFO L273 TraceCheckUtils]: 76: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12180#false} is VALID [2018-11-23 12:00:38,953 INFO L273 TraceCheckUtils]: 77: Hoare triple {12180#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12180#false} is VALID [2018-11-23 12:00:38,953 INFO L273 TraceCheckUtils]: 78: Hoare triple {12180#false} assume !(~i~0 < 100000); {12180#false} is VALID [2018-11-23 12:00:38,953 INFO L273 TraceCheckUtils]: 79: Hoare triple {12180#false} ~i~0 := 0; {12180#false} is VALID [2018-11-23 12:00:38,953 INFO L273 TraceCheckUtils]: 80: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {12180#false} is VALID [2018-11-23 12:00:38,954 INFO L273 TraceCheckUtils]: 81: Hoare triple {12180#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12180#false} is VALID [2018-11-23 12:00:38,954 INFO L273 TraceCheckUtils]: 82: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {12180#false} is VALID [2018-11-23 12:00:38,954 INFO L273 TraceCheckUtils]: 83: Hoare triple {12180#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12180#false} is VALID [2018-11-23 12:00:38,954 INFO L273 TraceCheckUtils]: 84: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {12180#false} is VALID [2018-11-23 12:00:38,954 INFO L273 TraceCheckUtils]: 85: Hoare triple {12180#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12180#false} is VALID [2018-11-23 12:00:38,954 INFO L273 TraceCheckUtils]: 86: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {12180#false} is VALID [2018-11-23 12:00:38,954 INFO L273 TraceCheckUtils]: 87: Hoare triple {12180#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12180#false} is VALID [2018-11-23 12:00:38,954 INFO L273 TraceCheckUtils]: 88: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {12180#false} is VALID [2018-11-23 12:00:38,954 INFO L273 TraceCheckUtils]: 89: Hoare triple {12180#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12180#false} is VALID [2018-11-23 12:00:38,955 INFO L273 TraceCheckUtils]: 90: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {12180#false} is VALID [2018-11-23 12:00:38,955 INFO L273 TraceCheckUtils]: 91: Hoare triple {12180#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12180#false} is VALID [2018-11-23 12:00:38,955 INFO L273 TraceCheckUtils]: 92: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {12180#false} is VALID [2018-11-23 12:00:38,955 INFO L273 TraceCheckUtils]: 93: Hoare triple {12180#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12180#false} is VALID [2018-11-23 12:00:38,955 INFO L273 TraceCheckUtils]: 94: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {12180#false} is VALID [2018-11-23 12:00:38,955 INFO L273 TraceCheckUtils]: 95: Hoare triple {12180#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12180#false} is VALID [2018-11-23 12:00:38,955 INFO L273 TraceCheckUtils]: 96: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {12180#false} is VALID [2018-11-23 12:00:38,955 INFO L273 TraceCheckUtils]: 97: Hoare triple {12180#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12180#false} is VALID [2018-11-23 12:00:38,955 INFO L273 TraceCheckUtils]: 98: Hoare triple {12180#false} assume !(~i~0 < 100000); {12180#false} is VALID [2018-11-23 12:00:38,956 INFO L273 TraceCheckUtils]: 99: Hoare triple {12180#false} ~i~0 := 0; {12180#false} is VALID [2018-11-23 12:00:38,956 INFO L273 TraceCheckUtils]: 100: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {12180#false} is VALID [2018-11-23 12:00:38,956 INFO L273 TraceCheckUtils]: 101: Hoare triple {12180#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {12180#false} is VALID [2018-11-23 12:00:38,956 INFO L273 TraceCheckUtils]: 102: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {12180#false} is VALID [2018-11-23 12:00:38,956 INFO L273 TraceCheckUtils]: 103: Hoare triple {12180#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {12180#false} is VALID [2018-11-23 12:00:38,956 INFO L273 TraceCheckUtils]: 104: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {12180#false} is VALID [2018-11-23 12:00:38,956 INFO L273 TraceCheckUtils]: 105: Hoare triple {12180#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {12180#false} is VALID [2018-11-23 12:00:38,956 INFO L273 TraceCheckUtils]: 106: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {12180#false} is VALID [2018-11-23 12:00:38,957 INFO L273 TraceCheckUtils]: 107: Hoare triple {12180#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {12180#false} is VALID [2018-11-23 12:00:38,957 INFO L273 TraceCheckUtils]: 108: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {12180#false} is VALID [2018-11-23 12:00:38,957 INFO L273 TraceCheckUtils]: 109: Hoare triple {12180#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {12180#false} is VALID [2018-11-23 12:00:38,957 INFO L273 TraceCheckUtils]: 110: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {12180#false} is VALID [2018-11-23 12:00:38,957 INFO L273 TraceCheckUtils]: 111: Hoare triple {12180#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {12180#false} is VALID [2018-11-23 12:00:38,957 INFO L273 TraceCheckUtils]: 112: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {12180#false} is VALID [2018-11-23 12:00:38,957 INFO L273 TraceCheckUtils]: 113: Hoare triple {12180#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {12180#false} is VALID [2018-11-23 12:00:38,957 INFO L273 TraceCheckUtils]: 114: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {12180#false} is VALID [2018-11-23 12:00:38,957 INFO L273 TraceCheckUtils]: 115: Hoare triple {12180#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {12180#false} is VALID [2018-11-23 12:00:38,958 INFO L273 TraceCheckUtils]: 116: Hoare triple {12180#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {12180#false} is VALID [2018-11-23 12:00:38,958 INFO L273 TraceCheckUtils]: 117: Hoare triple {12180#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {12180#false} is VALID [2018-11-23 12:00:38,958 INFO L273 TraceCheckUtils]: 118: Hoare triple {12180#false} assume !(~i~0 < 100000); {12180#false} is VALID [2018-11-23 12:00:38,958 INFO L273 TraceCheckUtils]: 119: Hoare triple {12180#false} havoc ~x~0;~x~0 := 0; {12180#false} is VALID [2018-11-23 12:00:38,958 INFO L273 TraceCheckUtils]: 120: Hoare triple {12180#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {12180#false} is VALID [2018-11-23 12:00:38,958 INFO L256 TraceCheckUtils]: 121: Hoare triple {12180#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {12180#false} is VALID [2018-11-23 12:00:38,958 INFO L273 TraceCheckUtils]: 122: Hoare triple {12180#false} ~cond := #in~cond; {12180#false} is VALID [2018-11-23 12:00:38,958 INFO L273 TraceCheckUtils]: 123: Hoare triple {12180#false} assume 0 == ~cond; {12180#false} is VALID [2018-11-23 12:00:38,958 INFO L273 TraceCheckUtils]: 124: Hoare triple {12180#false} assume !false; {12180#false} is VALID [2018-11-23 12:00:38,965 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-11-23 12:00:38,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:38,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 12:00:38,986 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 125 [2018-11-23 12:00:38,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:38,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:00:39,054 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:39,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:00:39,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:00:39,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:00:39,055 INFO L87 Difference]: Start difference. First operand 130 states and 135 transitions. Second operand 20 states. [2018-11-23 12:00:39,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:39,481 INFO L93 Difference]: Finished difference Result 224 states and 234 transitions. [2018-11-23 12:00:39,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:00:39,481 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 125 [2018-11-23 12:00:39,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:39,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:00:39,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 98 transitions. [2018-11-23 12:00:39,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:00:39,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 98 transitions. [2018-11-23 12:00:39,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 98 transitions. [2018-11-23 12:00:39,587 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:39,590 INFO L225 Difference]: With dead ends: 224 [2018-11-23 12:00:39,590 INFO L226 Difference]: Without dead ends: 133 [2018-11-23 12:00:39,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:00:39,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-23 12:00:39,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2018-11-23 12:00:39,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:39,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 132 states. [2018-11-23 12:00:39,643 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 132 states. [2018-11-23 12:00:39,643 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 132 states. [2018-11-23 12:00:39,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:39,645 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2018-11-23 12:00:39,645 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2018-11-23 12:00:39,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:39,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:39,646 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 133 states. [2018-11-23 12:00:39,646 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 133 states. [2018-11-23 12:00:39,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:39,648 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2018-11-23 12:00:39,648 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2018-11-23 12:00:39,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:39,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:39,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:39,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:39,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-23 12:00:39,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 137 transitions. [2018-11-23 12:00:39,651 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 137 transitions. Word has length 125 [2018-11-23 12:00:39,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:39,651 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 137 transitions. [2018-11-23 12:00:39,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:00:39,652 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 137 transitions. [2018-11-23 12:00:39,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-23 12:00:39,652 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:39,653 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 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] [2018-11-23 12:00:39,653 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:39,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:39,653 INFO L82 PathProgramCache]: Analyzing trace with hash -634789000, now seen corresponding path program 17 times [2018-11-23 12:00:39,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:39,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:39,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:39,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:39,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:40,008 INFO L256 TraceCheckUtils]: 0: Hoare triple {13368#true} call ULTIMATE.init(); {13368#true} is VALID [2018-11-23 12:00:40,008 INFO L273 TraceCheckUtils]: 1: Hoare triple {13368#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13368#true} is VALID [2018-11-23 12:00:40,009 INFO L273 TraceCheckUtils]: 2: Hoare triple {13368#true} assume true; {13368#true} is VALID [2018-11-23 12:00:40,009 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13368#true} {13368#true} #105#return; {13368#true} is VALID [2018-11-23 12:00:40,009 INFO L256 TraceCheckUtils]: 4: Hoare triple {13368#true} call #t~ret13 := main(); {13368#true} is VALID [2018-11-23 12:00:40,016 INFO L273 TraceCheckUtils]: 5: Hoare triple {13368#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);havoc ~a~0;~a~0 := 0; {13370#(= main_~a~0 0)} is VALID [2018-11-23 12:00:40,016 INFO L273 TraceCheckUtils]: 6: Hoare triple {13370#(= 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; {13370#(= main_~a~0 0)} is VALID [2018-11-23 12:00:40,017 INFO L273 TraceCheckUtils]: 7: Hoare triple {13370#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13371#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:40,017 INFO L273 TraceCheckUtils]: 8: Hoare triple {13371#(<= 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; {13371#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:40,018 INFO L273 TraceCheckUtils]: 9: Hoare triple {13371#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13372#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:40,018 INFO L273 TraceCheckUtils]: 10: Hoare triple {13372#(<= 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; {13372#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:40,018 INFO L273 TraceCheckUtils]: 11: Hoare triple {13372#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13373#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:40,019 INFO L273 TraceCheckUtils]: 12: Hoare triple {13373#(<= 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; {13373#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:40,019 INFO L273 TraceCheckUtils]: 13: Hoare triple {13373#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13374#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:40,019 INFO L273 TraceCheckUtils]: 14: Hoare triple {13374#(<= 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; {13374#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:40,020 INFO L273 TraceCheckUtils]: 15: Hoare triple {13374#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13375#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:40,020 INFO L273 TraceCheckUtils]: 16: Hoare triple {13375#(<= 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; {13375#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:40,021 INFO L273 TraceCheckUtils]: 17: Hoare triple {13375#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13376#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:40,021 INFO L273 TraceCheckUtils]: 18: Hoare triple {13376#(<= 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; {13376#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:40,022 INFO L273 TraceCheckUtils]: 19: Hoare triple {13376#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13377#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:40,022 INFO L273 TraceCheckUtils]: 20: Hoare triple {13377#(<= 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; {13377#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:40,023 INFO L273 TraceCheckUtils]: 21: Hoare triple {13377#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13378#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:40,024 INFO L273 TraceCheckUtils]: 22: Hoare triple {13378#(<= 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; {13378#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:40,024 INFO L273 TraceCheckUtils]: 23: Hoare triple {13378#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13379#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:40,025 INFO L273 TraceCheckUtils]: 24: Hoare triple {13379#(<= 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; {13379#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:40,026 INFO L273 TraceCheckUtils]: 25: Hoare triple {13379#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13380#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:40,026 INFO L273 TraceCheckUtils]: 26: Hoare triple {13380#(<= 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; {13380#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:40,027 INFO L273 TraceCheckUtils]: 27: Hoare triple {13380#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13381#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:40,028 INFO L273 TraceCheckUtils]: 28: Hoare triple {13381#(<= 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; {13381#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:40,028 INFO L273 TraceCheckUtils]: 29: Hoare triple {13381#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13382#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:40,029 INFO L273 TraceCheckUtils]: 30: Hoare triple {13382#(<= 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; {13382#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:40,030 INFO L273 TraceCheckUtils]: 31: Hoare triple {13382#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13383#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:40,030 INFO L273 TraceCheckUtils]: 32: Hoare triple {13383#(<= 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; {13383#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:40,031 INFO L273 TraceCheckUtils]: 33: Hoare triple {13383#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13384#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:40,031 INFO L273 TraceCheckUtils]: 34: Hoare triple {13384#(<= 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; {13384#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:40,032 INFO L273 TraceCheckUtils]: 35: Hoare triple {13384#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13385#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:40,033 INFO L273 TraceCheckUtils]: 36: Hoare triple {13385#(<= 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; {13385#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:40,035 INFO L273 TraceCheckUtils]: 37: Hoare triple {13385#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13386#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:40,035 INFO L273 TraceCheckUtils]: 38: Hoare triple {13386#(<= 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; {13386#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:40,038 INFO L273 TraceCheckUtils]: 39: Hoare triple {13386#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13387#(<= main_~a~0 17)} is VALID [2018-11-23 12:00:40,038 INFO L273 TraceCheckUtils]: 40: Hoare triple {13387#(<= main_~a~0 17)} assume !(~a~0 < 100000); {13369#false} is VALID [2018-11-23 12:00:40,038 INFO L273 TraceCheckUtils]: 41: Hoare triple {13369#false} havoc ~i~0;~i~0 := 0; {13369#false} is VALID [2018-11-23 12:00:40,038 INFO L273 TraceCheckUtils]: 42: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13369#false} is VALID [2018-11-23 12:00:40,039 INFO L273 TraceCheckUtils]: 43: Hoare triple {13369#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13369#false} is VALID [2018-11-23 12:00:40,039 INFO L273 TraceCheckUtils]: 44: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13369#false} is VALID [2018-11-23 12:00:40,039 INFO L273 TraceCheckUtils]: 45: Hoare triple {13369#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13369#false} is VALID [2018-11-23 12:00:40,039 INFO L273 TraceCheckUtils]: 46: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13369#false} is VALID [2018-11-23 12:00:40,039 INFO L273 TraceCheckUtils]: 47: Hoare triple {13369#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13369#false} is VALID [2018-11-23 12:00:40,039 INFO L273 TraceCheckUtils]: 48: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13369#false} is VALID [2018-11-23 12:00:40,039 INFO L273 TraceCheckUtils]: 49: Hoare triple {13369#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13369#false} is VALID [2018-11-23 12:00:40,039 INFO L273 TraceCheckUtils]: 50: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13369#false} is VALID [2018-11-23 12:00:40,040 INFO L273 TraceCheckUtils]: 51: Hoare triple {13369#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13369#false} is VALID [2018-11-23 12:00:40,040 INFO L273 TraceCheckUtils]: 52: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13369#false} is VALID [2018-11-23 12:00:40,040 INFO L273 TraceCheckUtils]: 53: Hoare triple {13369#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13369#false} is VALID [2018-11-23 12:00:40,040 INFO L273 TraceCheckUtils]: 54: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13369#false} is VALID [2018-11-23 12:00:40,040 INFO L273 TraceCheckUtils]: 55: Hoare triple {13369#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13369#false} is VALID [2018-11-23 12:00:40,040 INFO L273 TraceCheckUtils]: 56: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13369#false} is VALID [2018-11-23 12:00:40,040 INFO L273 TraceCheckUtils]: 57: Hoare triple {13369#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13369#false} is VALID [2018-11-23 12:00:40,040 INFO L273 TraceCheckUtils]: 58: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13369#false} is VALID [2018-11-23 12:00:40,041 INFO L273 TraceCheckUtils]: 59: Hoare triple {13369#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13369#false} is VALID [2018-11-23 12:00:40,041 INFO L273 TraceCheckUtils]: 60: Hoare triple {13369#false} assume !(~i~0 < 100000); {13369#false} is VALID [2018-11-23 12:00:40,041 INFO L273 TraceCheckUtils]: 61: Hoare triple {13369#false} ~i~0 := 0; {13369#false} is VALID [2018-11-23 12:00:40,041 INFO L273 TraceCheckUtils]: 62: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13369#false} is VALID [2018-11-23 12:00:40,041 INFO L273 TraceCheckUtils]: 63: Hoare triple {13369#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13369#false} is VALID [2018-11-23 12:00:40,041 INFO L273 TraceCheckUtils]: 64: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13369#false} is VALID [2018-11-23 12:00:40,041 INFO L273 TraceCheckUtils]: 65: Hoare triple {13369#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13369#false} is VALID [2018-11-23 12:00:40,041 INFO L273 TraceCheckUtils]: 66: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13369#false} is VALID [2018-11-23 12:00:40,042 INFO L273 TraceCheckUtils]: 67: Hoare triple {13369#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13369#false} is VALID [2018-11-23 12:00:40,042 INFO L273 TraceCheckUtils]: 68: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13369#false} is VALID [2018-11-23 12:00:40,042 INFO L273 TraceCheckUtils]: 69: Hoare triple {13369#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13369#false} is VALID [2018-11-23 12:00:40,042 INFO L273 TraceCheckUtils]: 70: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13369#false} is VALID [2018-11-23 12:00:40,042 INFO L273 TraceCheckUtils]: 71: Hoare triple {13369#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13369#false} is VALID [2018-11-23 12:00:40,042 INFO L273 TraceCheckUtils]: 72: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13369#false} is VALID [2018-11-23 12:00:40,042 INFO L273 TraceCheckUtils]: 73: Hoare triple {13369#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13369#false} is VALID [2018-11-23 12:00:40,042 INFO L273 TraceCheckUtils]: 74: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13369#false} is VALID [2018-11-23 12:00:40,042 INFO L273 TraceCheckUtils]: 75: Hoare triple {13369#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13369#false} is VALID [2018-11-23 12:00:40,043 INFO L273 TraceCheckUtils]: 76: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13369#false} is VALID [2018-11-23 12:00:40,043 INFO L273 TraceCheckUtils]: 77: Hoare triple {13369#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13369#false} is VALID [2018-11-23 12:00:40,043 INFO L273 TraceCheckUtils]: 78: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13369#false} is VALID [2018-11-23 12:00:40,043 INFO L273 TraceCheckUtils]: 79: Hoare triple {13369#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13369#false} is VALID [2018-11-23 12:00:40,043 INFO L273 TraceCheckUtils]: 80: Hoare triple {13369#false} assume !(~i~0 < 100000); {13369#false} is VALID [2018-11-23 12:00:40,043 INFO L273 TraceCheckUtils]: 81: Hoare triple {13369#false} ~i~0 := 0; {13369#false} is VALID [2018-11-23 12:00:40,043 INFO L273 TraceCheckUtils]: 82: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {13369#false} is VALID [2018-11-23 12:00:40,043 INFO L273 TraceCheckUtils]: 83: Hoare triple {13369#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13369#false} is VALID [2018-11-23 12:00:40,043 INFO L273 TraceCheckUtils]: 84: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {13369#false} is VALID [2018-11-23 12:00:40,044 INFO L273 TraceCheckUtils]: 85: Hoare triple {13369#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13369#false} is VALID [2018-11-23 12:00:40,044 INFO L273 TraceCheckUtils]: 86: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {13369#false} is VALID [2018-11-23 12:00:40,044 INFO L273 TraceCheckUtils]: 87: Hoare triple {13369#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13369#false} is VALID [2018-11-23 12:00:40,044 INFO L273 TraceCheckUtils]: 88: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {13369#false} is VALID [2018-11-23 12:00:40,044 INFO L273 TraceCheckUtils]: 89: Hoare triple {13369#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13369#false} is VALID [2018-11-23 12:00:40,044 INFO L273 TraceCheckUtils]: 90: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {13369#false} is VALID [2018-11-23 12:00:40,044 INFO L273 TraceCheckUtils]: 91: Hoare triple {13369#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13369#false} is VALID [2018-11-23 12:00:40,044 INFO L273 TraceCheckUtils]: 92: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {13369#false} is VALID [2018-11-23 12:00:40,045 INFO L273 TraceCheckUtils]: 93: Hoare triple {13369#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13369#false} is VALID [2018-11-23 12:00:40,045 INFO L273 TraceCheckUtils]: 94: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {13369#false} is VALID [2018-11-23 12:00:40,045 INFO L273 TraceCheckUtils]: 95: Hoare triple {13369#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13369#false} is VALID [2018-11-23 12:00:40,045 INFO L273 TraceCheckUtils]: 96: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {13369#false} is VALID [2018-11-23 12:00:40,045 INFO L273 TraceCheckUtils]: 97: Hoare triple {13369#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13369#false} is VALID [2018-11-23 12:00:40,045 INFO L273 TraceCheckUtils]: 98: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {13369#false} is VALID [2018-11-23 12:00:40,045 INFO L273 TraceCheckUtils]: 99: Hoare triple {13369#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13369#false} is VALID [2018-11-23 12:00:40,046 INFO L273 TraceCheckUtils]: 100: Hoare triple {13369#false} assume !(~i~0 < 100000); {13369#false} is VALID [2018-11-23 12:00:40,046 INFO L273 TraceCheckUtils]: 101: Hoare triple {13369#false} ~i~0 := 0; {13369#false} is VALID [2018-11-23 12:00:40,046 INFO L273 TraceCheckUtils]: 102: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {13369#false} is VALID [2018-11-23 12:00:40,046 INFO L273 TraceCheckUtils]: 103: Hoare triple {13369#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13369#false} is VALID [2018-11-23 12:00:40,046 INFO L273 TraceCheckUtils]: 104: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {13369#false} is VALID [2018-11-23 12:00:40,046 INFO L273 TraceCheckUtils]: 105: Hoare triple {13369#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13369#false} is VALID [2018-11-23 12:00:40,047 INFO L273 TraceCheckUtils]: 106: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {13369#false} is VALID [2018-11-23 12:00:40,047 INFO L273 TraceCheckUtils]: 107: Hoare triple {13369#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13369#false} is VALID [2018-11-23 12:00:40,047 INFO L273 TraceCheckUtils]: 108: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {13369#false} is VALID [2018-11-23 12:00:40,047 INFO L273 TraceCheckUtils]: 109: Hoare triple {13369#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13369#false} is VALID [2018-11-23 12:00:40,047 INFO L273 TraceCheckUtils]: 110: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {13369#false} is VALID [2018-11-23 12:00:40,048 INFO L273 TraceCheckUtils]: 111: Hoare triple {13369#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13369#false} is VALID [2018-11-23 12:00:40,048 INFO L273 TraceCheckUtils]: 112: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {13369#false} is VALID [2018-11-23 12:00:40,048 INFO L273 TraceCheckUtils]: 113: Hoare triple {13369#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13369#false} is VALID [2018-11-23 12:00:40,048 INFO L273 TraceCheckUtils]: 114: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {13369#false} is VALID [2018-11-23 12:00:40,048 INFO L273 TraceCheckUtils]: 115: Hoare triple {13369#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13369#false} is VALID [2018-11-23 12:00:40,049 INFO L273 TraceCheckUtils]: 116: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {13369#false} is VALID [2018-11-23 12:00:40,049 INFO L273 TraceCheckUtils]: 117: Hoare triple {13369#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13369#false} is VALID [2018-11-23 12:00:40,049 INFO L273 TraceCheckUtils]: 118: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {13369#false} is VALID [2018-11-23 12:00:40,049 INFO L273 TraceCheckUtils]: 119: Hoare triple {13369#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13369#false} is VALID [2018-11-23 12:00:40,049 INFO L273 TraceCheckUtils]: 120: Hoare triple {13369#false} assume !(~i~0 < 100000); {13369#false} is VALID [2018-11-23 12:00:40,049 INFO L273 TraceCheckUtils]: 121: Hoare triple {13369#false} havoc ~x~0;~x~0 := 0; {13369#false} is VALID [2018-11-23 12:00:40,050 INFO L273 TraceCheckUtils]: 122: Hoare triple {13369#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {13369#false} is VALID [2018-11-23 12:00:40,050 INFO L256 TraceCheckUtils]: 123: Hoare triple {13369#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {13369#false} is VALID [2018-11-23 12:00:40,050 INFO L273 TraceCheckUtils]: 124: Hoare triple {13369#false} ~cond := #in~cond; {13369#false} is VALID [2018-11-23 12:00:40,050 INFO L273 TraceCheckUtils]: 125: Hoare triple {13369#false} assume 0 == ~cond; {13369#false} is VALID [2018-11-23 12:00:40,050 INFO L273 TraceCheckUtils]: 126: Hoare triple {13369#false} assume !false; {13369#false} is VALID [2018-11-23 12:00:40,058 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-11-23 12:00:40,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:40,058 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:40,067 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:01:55,282 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-23 12:01:55,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:55,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:55,707 INFO L256 TraceCheckUtils]: 0: Hoare triple {13368#true} call ULTIMATE.init(); {13368#true} is VALID [2018-11-23 12:01:55,708 INFO L273 TraceCheckUtils]: 1: Hoare triple {13368#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13368#true} is VALID [2018-11-23 12:01:55,708 INFO L273 TraceCheckUtils]: 2: Hoare triple {13368#true} assume true; {13368#true} is VALID [2018-11-23 12:01:55,708 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13368#true} {13368#true} #105#return; {13368#true} is VALID [2018-11-23 12:01:55,708 INFO L256 TraceCheckUtils]: 4: Hoare triple {13368#true} call #t~ret13 := main(); {13368#true} is VALID [2018-11-23 12:01:55,709 INFO L273 TraceCheckUtils]: 5: Hoare triple {13368#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);havoc ~a~0;~a~0 := 0; {13368#true} is VALID [2018-11-23 12:01:55,709 INFO L273 TraceCheckUtils]: 6: Hoare triple {13368#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; {13368#true} is VALID [2018-11-23 12:01:55,709 INFO L273 TraceCheckUtils]: 7: Hoare triple {13368#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13368#true} is VALID [2018-11-23 12:01:55,709 INFO L273 TraceCheckUtils]: 8: Hoare triple {13368#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; {13368#true} is VALID [2018-11-23 12:01:55,709 INFO L273 TraceCheckUtils]: 9: Hoare triple {13368#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13368#true} is VALID [2018-11-23 12:01:55,710 INFO L273 TraceCheckUtils]: 10: Hoare triple {13368#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; {13368#true} is VALID [2018-11-23 12:01:55,710 INFO L273 TraceCheckUtils]: 11: Hoare triple {13368#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13368#true} is VALID [2018-11-23 12:01:55,710 INFO L273 TraceCheckUtils]: 12: Hoare triple {13368#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; {13368#true} is VALID [2018-11-23 12:01:55,710 INFO L273 TraceCheckUtils]: 13: Hoare triple {13368#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13368#true} is VALID [2018-11-23 12:01:55,710 INFO L273 TraceCheckUtils]: 14: Hoare triple {13368#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; {13368#true} is VALID [2018-11-23 12:01:55,710 INFO L273 TraceCheckUtils]: 15: Hoare triple {13368#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13368#true} is VALID [2018-11-23 12:01:55,711 INFO L273 TraceCheckUtils]: 16: Hoare triple {13368#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; {13368#true} is VALID [2018-11-23 12:01:55,711 INFO L273 TraceCheckUtils]: 17: Hoare triple {13368#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13368#true} is VALID [2018-11-23 12:01:55,711 INFO L273 TraceCheckUtils]: 18: Hoare triple {13368#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; {13368#true} is VALID [2018-11-23 12:01:55,711 INFO L273 TraceCheckUtils]: 19: Hoare triple {13368#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13368#true} is VALID [2018-11-23 12:01:55,711 INFO L273 TraceCheckUtils]: 20: Hoare triple {13368#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; {13368#true} is VALID [2018-11-23 12:01:55,711 INFO L273 TraceCheckUtils]: 21: Hoare triple {13368#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13368#true} is VALID [2018-11-23 12:01:55,712 INFO L273 TraceCheckUtils]: 22: Hoare triple {13368#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; {13368#true} is VALID [2018-11-23 12:01:55,712 INFO L273 TraceCheckUtils]: 23: Hoare triple {13368#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13368#true} is VALID [2018-11-23 12:01:55,712 INFO L273 TraceCheckUtils]: 24: Hoare triple {13368#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; {13368#true} is VALID [2018-11-23 12:01:55,712 INFO L273 TraceCheckUtils]: 25: Hoare triple {13368#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13368#true} is VALID [2018-11-23 12:01:55,712 INFO L273 TraceCheckUtils]: 26: Hoare triple {13368#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; {13368#true} is VALID [2018-11-23 12:01:55,712 INFO L273 TraceCheckUtils]: 27: Hoare triple {13368#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13368#true} is VALID [2018-11-23 12:01:55,713 INFO L273 TraceCheckUtils]: 28: Hoare triple {13368#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; {13368#true} is VALID [2018-11-23 12:01:55,713 INFO L273 TraceCheckUtils]: 29: Hoare triple {13368#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13368#true} is VALID [2018-11-23 12:01:55,713 INFO L273 TraceCheckUtils]: 30: Hoare triple {13368#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; {13368#true} is VALID [2018-11-23 12:01:55,713 INFO L273 TraceCheckUtils]: 31: Hoare triple {13368#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13368#true} is VALID [2018-11-23 12:01:55,713 INFO L273 TraceCheckUtils]: 32: Hoare triple {13368#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; {13368#true} is VALID [2018-11-23 12:01:55,713 INFO L273 TraceCheckUtils]: 33: Hoare triple {13368#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13368#true} is VALID [2018-11-23 12:01:55,714 INFO L273 TraceCheckUtils]: 34: Hoare triple {13368#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; {13368#true} is VALID [2018-11-23 12:01:55,714 INFO L273 TraceCheckUtils]: 35: Hoare triple {13368#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13368#true} is VALID [2018-11-23 12:01:55,714 INFO L273 TraceCheckUtils]: 36: Hoare triple {13368#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; {13368#true} is VALID [2018-11-23 12:01:55,714 INFO L273 TraceCheckUtils]: 37: Hoare triple {13368#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13368#true} is VALID [2018-11-23 12:01:55,714 INFO L273 TraceCheckUtils]: 38: Hoare triple {13368#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; {13368#true} is VALID [2018-11-23 12:01:55,715 INFO L273 TraceCheckUtils]: 39: Hoare triple {13368#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13368#true} is VALID [2018-11-23 12:01:55,715 INFO L273 TraceCheckUtils]: 40: Hoare triple {13368#true} assume !(~a~0 < 100000); {13368#true} is VALID [2018-11-23 12:01:55,715 INFO L273 TraceCheckUtils]: 41: Hoare triple {13368#true} havoc ~i~0;~i~0 := 0; {13368#true} is VALID [2018-11-23 12:01:55,715 INFO L273 TraceCheckUtils]: 42: Hoare triple {13368#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13368#true} is VALID [2018-11-23 12:01:55,715 INFO L273 TraceCheckUtils]: 43: Hoare triple {13368#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13368#true} is VALID [2018-11-23 12:01:55,715 INFO L273 TraceCheckUtils]: 44: Hoare triple {13368#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13368#true} is VALID [2018-11-23 12:01:55,715 INFO L273 TraceCheckUtils]: 45: Hoare triple {13368#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13368#true} is VALID [2018-11-23 12:01:55,716 INFO L273 TraceCheckUtils]: 46: Hoare triple {13368#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13368#true} is VALID [2018-11-23 12:01:55,716 INFO L273 TraceCheckUtils]: 47: Hoare triple {13368#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13368#true} is VALID [2018-11-23 12:01:55,716 INFO L273 TraceCheckUtils]: 48: Hoare triple {13368#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13368#true} is VALID [2018-11-23 12:01:55,716 INFO L273 TraceCheckUtils]: 49: Hoare triple {13368#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13368#true} is VALID [2018-11-23 12:01:55,716 INFO L273 TraceCheckUtils]: 50: Hoare triple {13368#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13368#true} is VALID [2018-11-23 12:01:55,716 INFO L273 TraceCheckUtils]: 51: Hoare triple {13368#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13368#true} is VALID [2018-11-23 12:01:55,717 INFO L273 TraceCheckUtils]: 52: Hoare triple {13368#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13368#true} is VALID [2018-11-23 12:01:55,717 INFO L273 TraceCheckUtils]: 53: Hoare triple {13368#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13368#true} is VALID [2018-11-23 12:01:55,717 INFO L273 TraceCheckUtils]: 54: Hoare triple {13368#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13368#true} is VALID [2018-11-23 12:01:55,717 INFO L273 TraceCheckUtils]: 55: Hoare triple {13368#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13368#true} is VALID [2018-11-23 12:01:55,717 INFO L273 TraceCheckUtils]: 56: Hoare triple {13368#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13368#true} is VALID [2018-11-23 12:01:55,717 INFO L273 TraceCheckUtils]: 57: Hoare triple {13368#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13368#true} is VALID [2018-11-23 12:01:55,718 INFO L273 TraceCheckUtils]: 58: Hoare triple {13368#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13368#true} is VALID [2018-11-23 12:01:55,718 INFO L273 TraceCheckUtils]: 59: Hoare triple {13368#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13368#true} is VALID [2018-11-23 12:01:55,718 INFO L273 TraceCheckUtils]: 60: Hoare triple {13368#true} assume !(~i~0 < 100000); {13368#true} is VALID [2018-11-23 12:01:55,718 INFO L273 TraceCheckUtils]: 61: Hoare triple {13368#true} ~i~0 := 0; {13368#true} is VALID [2018-11-23 12:01:55,718 INFO L273 TraceCheckUtils]: 62: Hoare triple {13368#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13368#true} is VALID [2018-11-23 12:01:55,718 INFO L273 TraceCheckUtils]: 63: Hoare triple {13368#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13368#true} is VALID [2018-11-23 12:01:55,719 INFO L273 TraceCheckUtils]: 64: Hoare triple {13368#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13368#true} is VALID [2018-11-23 12:01:55,719 INFO L273 TraceCheckUtils]: 65: Hoare triple {13368#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13368#true} is VALID [2018-11-23 12:01:55,719 INFO L273 TraceCheckUtils]: 66: Hoare triple {13368#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13368#true} is VALID [2018-11-23 12:01:55,719 INFO L273 TraceCheckUtils]: 67: Hoare triple {13368#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13368#true} is VALID [2018-11-23 12:01:55,719 INFO L273 TraceCheckUtils]: 68: Hoare triple {13368#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13368#true} is VALID [2018-11-23 12:01:55,719 INFO L273 TraceCheckUtils]: 69: Hoare triple {13368#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13368#true} is VALID [2018-11-23 12:01:55,720 INFO L273 TraceCheckUtils]: 70: Hoare triple {13368#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13368#true} is VALID [2018-11-23 12:01:55,720 INFO L273 TraceCheckUtils]: 71: Hoare triple {13368#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13368#true} is VALID [2018-11-23 12:01:55,720 INFO L273 TraceCheckUtils]: 72: Hoare triple {13368#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13368#true} is VALID [2018-11-23 12:01:55,720 INFO L273 TraceCheckUtils]: 73: Hoare triple {13368#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13368#true} is VALID [2018-11-23 12:01:55,720 INFO L273 TraceCheckUtils]: 74: Hoare triple {13368#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13368#true} is VALID [2018-11-23 12:01:55,720 INFO L273 TraceCheckUtils]: 75: Hoare triple {13368#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13368#true} is VALID [2018-11-23 12:01:55,721 INFO L273 TraceCheckUtils]: 76: Hoare triple {13368#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13368#true} is VALID [2018-11-23 12:01:55,721 INFO L273 TraceCheckUtils]: 77: Hoare triple {13368#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13368#true} is VALID [2018-11-23 12:01:55,721 INFO L273 TraceCheckUtils]: 78: Hoare triple {13368#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13368#true} is VALID [2018-11-23 12:01:55,721 INFO L273 TraceCheckUtils]: 79: Hoare triple {13368#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13368#true} is VALID [2018-11-23 12:01:55,721 INFO L273 TraceCheckUtils]: 80: Hoare triple {13368#true} assume !(~i~0 < 100000); {13368#true} is VALID [2018-11-23 12:01:55,737 INFO L273 TraceCheckUtils]: 81: Hoare triple {13368#true} ~i~0 := 0; {13634#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:55,742 INFO L273 TraceCheckUtils]: 82: Hoare triple {13634#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {13634#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:55,743 INFO L273 TraceCheckUtils]: 83: Hoare triple {13634#(<= main_~i~0 0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13641#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:55,744 INFO L273 TraceCheckUtils]: 84: Hoare triple {13641#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {13641#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:55,744 INFO L273 TraceCheckUtils]: 85: Hoare triple {13641#(<= main_~i~0 1)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13648#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:55,744 INFO L273 TraceCheckUtils]: 86: Hoare triple {13648#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {13648#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:55,745 INFO L273 TraceCheckUtils]: 87: Hoare triple {13648#(<= main_~i~0 2)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13655#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:55,745 INFO L273 TraceCheckUtils]: 88: Hoare triple {13655#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {13655#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:55,746 INFO L273 TraceCheckUtils]: 89: Hoare triple {13655#(<= main_~i~0 3)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13662#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:55,747 INFO L273 TraceCheckUtils]: 90: Hoare triple {13662#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {13662#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:55,747 INFO L273 TraceCheckUtils]: 91: Hoare triple {13662#(<= main_~i~0 4)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13669#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:55,748 INFO L273 TraceCheckUtils]: 92: Hoare triple {13669#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {13669#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:55,749 INFO L273 TraceCheckUtils]: 93: Hoare triple {13669#(<= main_~i~0 5)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13676#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:55,749 INFO L273 TraceCheckUtils]: 94: Hoare triple {13676#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {13676#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:55,750 INFO L273 TraceCheckUtils]: 95: Hoare triple {13676#(<= main_~i~0 6)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13683#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:55,750 INFO L273 TraceCheckUtils]: 96: Hoare triple {13683#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {13683#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:55,751 INFO L273 TraceCheckUtils]: 97: Hoare triple {13683#(<= main_~i~0 7)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13690#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:55,752 INFO L273 TraceCheckUtils]: 98: Hoare triple {13690#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {13690#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:55,752 INFO L273 TraceCheckUtils]: 99: Hoare triple {13690#(<= main_~i~0 8)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13697#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:55,753 INFO L273 TraceCheckUtils]: 100: Hoare triple {13697#(<= main_~i~0 9)} assume !(~i~0 < 100000); {13369#false} is VALID [2018-11-23 12:01:55,753 INFO L273 TraceCheckUtils]: 101: Hoare triple {13369#false} ~i~0 := 0; {13369#false} is VALID [2018-11-23 12:01:55,754 INFO L273 TraceCheckUtils]: 102: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {13369#false} is VALID [2018-11-23 12:01:55,754 INFO L273 TraceCheckUtils]: 103: Hoare triple {13369#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13369#false} is VALID [2018-11-23 12:01:55,754 INFO L273 TraceCheckUtils]: 104: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {13369#false} is VALID [2018-11-23 12:01:55,754 INFO L273 TraceCheckUtils]: 105: Hoare triple {13369#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13369#false} is VALID [2018-11-23 12:01:55,754 INFO L273 TraceCheckUtils]: 106: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {13369#false} is VALID [2018-11-23 12:01:55,755 INFO L273 TraceCheckUtils]: 107: Hoare triple {13369#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13369#false} is VALID [2018-11-23 12:01:55,755 INFO L273 TraceCheckUtils]: 108: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {13369#false} is VALID [2018-11-23 12:01:55,755 INFO L273 TraceCheckUtils]: 109: Hoare triple {13369#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13369#false} is VALID [2018-11-23 12:01:55,755 INFO L273 TraceCheckUtils]: 110: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {13369#false} is VALID [2018-11-23 12:01:55,755 INFO L273 TraceCheckUtils]: 111: Hoare triple {13369#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13369#false} is VALID [2018-11-23 12:01:55,756 INFO L273 TraceCheckUtils]: 112: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {13369#false} is VALID [2018-11-23 12:01:55,756 INFO L273 TraceCheckUtils]: 113: Hoare triple {13369#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13369#false} is VALID [2018-11-23 12:01:55,756 INFO L273 TraceCheckUtils]: 114: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {13369#false} is VALID [2018-11-23 12:01:55,756 INFO L273 TraceCheckUtils]: 115: Hoare triple {13369#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13369#false} is VALID [2018-11-23 12:01:55,756 INFO L273 TraceCheckUtils]: 116: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {13369#false} is VALID [2018-11-23 12:01:55,756 INFO L273 TraceCheckUtils]: 117: Hoare triple {13369#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13369#false} is VALID [2018-11-23 12:01:55,756 INFO L273 TraceCheckUtils]: 118: Hoare triple {13369#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {13369#false} is VALID [2018-11-23 12:01:55,757 INFO L273 TraceCheckUtils]: 119: Hoare triple {13369#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13369#false} is VALID [2018-11-23 12:01:55,757 INFO L273 TraceCheckUtils]: 120: Hoare triple {13369#false} assume !(~i~0 < 100000); {13369#false} is VALID [2018-11-23 12:01:55,757 INFO L273 TraceCheckUtils]: 121: Hoare triple {13369#false} havoc ~x~0;~x~0 := 0; {13369#false} is VALID [2018-11-23 12:01:55,757 INFO L273 TraceCheckUtils]: 122: Hoare triple {13369#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {13369#false} is VALID [2018-11-23 12:01:55,757 INFO L256 TraceCheckUtils]: 123: Hoare triple {13369#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {13369#false} is VALID [2018-11-23 12:01:55,757 INFO L273 TraceCheckUtils]: 124: Hoare triple {13369#false} ~cond := #in~cond; {13369#false} is VALID [2018-11-23 12:01:55,757 INFO L273 TraceCheckUtils]: 125: Hoare triple {13369#false} assume 0 == ~cond; {13369#false} is VALID [2018-11-23 12:01:55,757 INFO L273 TraceCheckUtils]: 126: Hoare triple {13369#false} assume !false; {13369#false} is VALID [2018-11-23 12:01:55,764 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2018-11-23 12:01:55,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:55,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12] total 30 [2018-11-23 12:01:55,797 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 127 [2018-11-23 12:01:55,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:55,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:01:55,892 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:55,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:01:55,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:01:55,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=615, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:01:55,893 INFO L87 Difference]: Start difference. First operand 132 states and 137 transitions. Second operand 30 states. [2018-11-23 12:01:57,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:57,040 INFO L93 Difference]: Finished difference Result 238 states and 252 transitions. [2018-11-23 12:01:57,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 12:01:57,041 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 127 [2018-11-23 12:01:57,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:57,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:01:57,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 184 transitions. [2018-11-23 12:01:57,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:01:57,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 184 transitions. [2018-11-23 12:01:57,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 184 transitions. [2018-11-23 12:01:57,416 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:57,419 INFO L225 Difference]: With dead ends: 238 [2018-11-23 12:01:57,419 INFO L226 Difference]: Without dead ends: 147 [2018-11-23 12:01:57,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=255, Invalid=615, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:01:57,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-23 12:01:57,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 142. [2018-11-23 12:01:57,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:57,491 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand 142 states. [2018-11-23 12:01:57,491 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 142 states. [2018-11-23 12:01:57,491 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 142 states. [2018-11-23 12:01:57,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:57,494 INFO L93 Difference]: Finished difference Result 147 states and 152 transitions. [2018-11-23 12:01:57,494 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 152 transitions. [2018-11-23 12:01:57,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:57,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:57,494 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 147 states. [2018-11-23 12:01:57,494 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 147 states. [2018-11-23 12:01:57,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:57,496 INFO L93 Difference]: Finished difference Result 147 states and 152 transitions. [2018-11-23 12:01:57,496 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 152 transitions. [2018-11-23 12:01:57,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:57,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:57,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:57,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:57,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-23 12:01:57,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 147 transitions. [2018-11-23 12:01:57,499 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 147 transitions. Word has length 127 [2018-11-23 12:01:57,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:57,499 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 147 transitions. [2018-11-23 12:01:57,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:01:57,499 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 147 transitions. [2018-11-23 12:01:57,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-23 12:01:57,500 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:57,500 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:57,500 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:57,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:57,500 INFO L82 PathProgramCache]: Analyzing trace with hash -41765874, now seen corresponding path program 18 times [2018-11-23 12:01:57,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:57,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:57,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:57,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:57,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:58,113 INFO L256 TraceCheckUtils]: 0: Hoare triple {14635#true} call ULTIMATE.init(); {14635#true} is VALID [2018-11-23 12:01:58,113 INFO L273 TraceCheckUtils]: 1: Hoare triple {14635#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14635#true} is VALID [2018-11-23 12:01:58,113 INFO L273 TraceCheckUtils]: 2: Hoare triple {14635#true} assume true; {14635#true} is VALID [2018-11-23 12:01:58,114 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14635#true} {14635#true} #105#return; {14635#true} is VALID [2018-11-23 12:01:58,114 INFO L256 TraceCheckUtils]: 4: Hoare triple {14635#true} call #t~ret13 := main(); {14635#true} is VALID [2018-11-23 12:01:58,115 INFO L273 TraceCheckUtils]: 5: Hoare triple {14635#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);havoc ~a~0;~a~0 := 0; {14637#(= main_~a~0 0)} is VALID [2018-11-23 12:01:58,115 INFO L273 TraceCheckUtils]: 6: Hoare triple {14637#(= 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; {14637#(= main_~a~0 0)} is VALID [2018-11-23 12:01:58,116 INFO L273 TraceCheckUtils]: 7: Hoare triple {14637#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14638#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:58,116 INFO L273 TraceCheckUtils]: 8: Hoare triple {14638#(<= 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; {14638#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:58,117 INFO L273 TraceCheckUtils]: 9: Hoare triple {14638#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14639#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:58,117 INFO L273 TraceCheckUtils]: 10: Hoare triple {14639#(<= 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; {14639#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:58,118 INFO L273 TraceCheckUtils]: 11: Hoare triple {14639#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14640#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:58,119 INFO L273 TraceCheckUtils]: 12: Hoare triple {14640#(<= 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; {14640#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:58,120 INFO L273 TraceCheckUtils]: 13: Hoare triple {14640#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14641#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:58,120 INFO L273 TraceCheckUtils]: 14: Hoare triple {14641#(<= 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; {14641#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:58,121 INFO L273 TraceCheckUtils]: 15: Hoare triple {14641#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14642#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:58,121 INFO L273 TraceCheckUtils]: 16: Hoare triple {14642#(<= 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; {14642#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:58,122 INFO L273 TraceCheckUtils]: 17: Hoare triple {14642#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14643#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:58,123 INFO L273 TraceCheckUtils]: 18: Hoare triple {14643#(<= 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; {14643#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:58,123 INFO L273 TraceCheckUtils]: 19: Hoare triple {14643#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14644#(<= main_~a~0 7)} is VALID [2018-11-23 12:01:58,124 INFO L273 TraceCheckUtils]: 20: Hoare triple {14644#(<= 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; {14644#(<= main_~a~0 7)} is VALID [2018-11-23 12:01:58,125 INFO L273 TraceCheckUtils]: 21: Hoare triple {14644#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14645#(<= main_~a~0 8)} is VALID [2018-11-23 12:01:58,125 INFO L273 TraceCheckUtils]: 22: Hoare triple {14645#(<= 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; {14645#(<= main_~a~0 8)} is VALID [2018-11-23 12:01:58,126 INFO L273 TraceCheckUtils]: 23: Hoare triple {14645#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14646#(<= main_~a~0 9)} is VALID [2018-11-23 12:01:58,126 INFO L273 TraceCheckUtils]: 24: Hoare triple {14646#(<= 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; {14646#(<= main_~a~0 9)} is VALID [2018-11-23 12:01:58,127 INFO L273 TraceCheckUtils]: 25: Hoare triple {14646#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14647#(<= main_~a~0 10)} is VALID [2018-11-23 12:01:58,128 INFO L273 TraceCheckUtils]: 26: Hoare triple {14647#(<= 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; {14647#(<= main_~a~0 10)} is VALID [2018-11-23 12:01:58,128 INFO L273 TraceCheckUtils]: 27: Hoare triple {14647#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14648#(<= main_~a~0 11)} is VALID [2018-11-23 12:01:58,129 INFO L273 TraceCheckUtils]: 28: Hoare triple {14648#(<= 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; {14648#(<= main_~a~0 11)} is VALID [2018-11-23 12:01:58,130 INFO L273 TraceCheckUtils]: 29: Hoare triple {14648#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14649#(<= main_~a~0 12)} is VALID [2018-11-23 12:01:58,130 INFO L273 TraceCheckUtils]: 30: Hoare triple {14649#(<= 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; {14649#(<= main_~a~0 12)} is VALID [2018-11-23 12:01:58,131 INFO L273 TraceCheckUtils]: 31: Hoare triple {14649#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14650#(<= main_~a~0 13)} is VALID [2018-11-23 12:01:58,132 INFO L273 TraceCheckUtils]: 32: Hoare triple {14650#(<= 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; {14650#(<= main_~a~0 13)} is VALID [2018-11-23 12:01:58,132 INFO L273 TraceCheckUtils]: 33: Hoare triple {14650#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14651#(<= main_~a~0 14)} is VALID [2018-11-23 12:01:58,133 INFO L273 TraceCheckUtils]: 34: Hoare triple {14651#(<= 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; {14651#(<= main_~a~0 14)} is VALID [2018-11-23 12:01:58,134 INFO L273 TraceCheckUtils]: 35: Hoare triple {14651#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14652#(<= main_~a~0 15)} is VALID [2018-11-23 12:01:58,134 INFO L273 TraceCheckUtils]: 36: Hoare triple {14652#(<= 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; {14652#(<= main_~a~0 15)} is VALID [2018-11-23 12:01:58,135 INFO L273 TraceCheckUtils]: 37: Hoare triple {14652#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14653#(<= main_~a~0 16)} is VALID [2018-11-23 12:01:58,135 INFO L273 TraceCheckUtils]: 38: Hoare triple {14653#(<= 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; {14653#(<= main_~a~0 16)} is VALID [2018-11-23 12:01:58,136 INFO L273 TraceCheckUtils]: 39: Hoare triple {14653#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14654#(<= main_~a~0 17)} is VALID [2018-11-23 12:01:58,137 INFO L273 TraceCheckUtils]: 40: Hoare triple {14654#(<= 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; {14654#(<= main_~a~0 17)} is VALID [2018-11-23 12:01:58,137 INFO L273 TraceCheckUtils]: 41: Hoare triple {14654#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14655#(<= main_~a~0 18)} is VALID [2018-11-23 12:01:58,138 INFO L273 TraceCheckUtils]: 42: Hoare triple {14655#(<= main_~a~0 18)} assume !(~a~0 < 100000); {14636#false} is VALID [2018-11-23 12:01:58,138 INFO L273 TraceCheckUtils]: 43: Hoare triple {14636#false} havoc ~i~0;~i~0 := 0; {14636#false} is VALID [2018-11-23 12:01:58,138 INFO L273 TraceCheckUtils]: 44: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14636#false} is VALID [2018-11-23 12:01:58,139 INFO L273 TraceCheckUtils]: 45: Hoare triple {14636#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14636#false} is VALID [2018-11-23 12:01:58,139 INFO L273 TraceCheckUtils]: 46: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14636#false} is VALID [2018-11-23 12:01:58,139 INFO L273 TraceCheckUtils]: 47: Hoare triple {14636#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14636#false} is VALID [2018-11-23 12:01:58,139 INFO L273 TraceCheckUtils]: 48: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14636#false} is VALID [2018-11-23 12:01:58,139 INFO L273 TraceCheckUtils]: 49: Hoare triple {14636#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14636#false} is VALID [2018-11-23 12:01:58,140 INFO L273 TraceCheckUtils]: 50: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14636#false} is VALID [2018-11-23 12:01:58,140 INFO L273 TraceCheckUtils]: 51: Hoare triple {14636#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14636#false} is VALID [2018-11-23 12:01:58,140 INFO L273 TraceCheckUtils]: 52: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14636#false} is VALID [2018-11-23 12:01:58,140 INFO L273 TraceCheckUtils]: 53: Hoare triple {14636#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14636#false} is VALID [2018-11-23 12:01:58,140 INFO L273 TraceCheckUtils]: 54: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14636#false} is VALID [2018-11-23 12:01:58,141 INFO L273 TraceCheckUtils]: 55: Hoare triple {14636#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14636#false} is VALID [2018-11-23 12:01:58,141 INFO L273 TraceCheckUtils]: 56: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14636#false} is VALID [2018-11-23 12:01:58,141 INFO L273 TraceCheckUtils]: 57: Hoare triple {14636#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14636#false} is VALID [2018-11-23 12:01:58,141 INFO L273 TraceCheckUtils]: 58: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14636#false} is VALID [2018-11-23 12:01:58,141 INFO L273 TraceCheckUtils]: 59: Hoare triple {14636#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14636#false} is VALID [2018-11-23 12:01:58,141 INFO L273 TraceCheckUtils]: 60: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14636#false} is VALID [2018-11-23 12:01:58,141 INFO L273 TraceCheckUtils]: 61: Hoare triple {14636#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14636#false} is VALID [2018-11-23 12:01:58,141 INFO L273 TraceCheckUtils]: 62: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14636#false} is VALID [2018-11-23 12:01:58,142 INFO L273 TraceCheckUtils]: 63: Hoare triple {14636#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14636#false} is VALID [2018-11-23 12:01:58,142 INFO L273 TraceCheckUtils]: 64: Hoare triple {14636#false} assume !(~i~0 < 100000); {14636#false} is VALID [2018-11-23 12:01:58,142 INFO L273 TraceCheckUtils]: 65: Hoare triple {14636#false} ~i~0 := 0; {14636#false} is VALID [2018-11-23 12:01:58,142 INFO L273 TraceCheckUtils]: 66: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14636#false} is VALID [2018-11-23 12:01:58,142 INFO L273 TraceCheckUtils]: 67: Hoare triple {14636#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14636#false} is VALID [2018-11-23 12:01:58,142 INFO L273 TraceCheckUtils]: 68: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14636#false} is VALID [2018-11-23 12:01:58,142 INFO L273 TraceCheckUtils]: 69: Hoare triple {14636#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14636#false} is VALID [2018-11-23 12:01:58,142 INFO L273 TraceCheckUtils]: 70: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14636#false} is VALID [2018-11-23 12:01:58,142 INFO L273 TraceCheckUtils]: 71: Hoare triple {14636#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14636#false} is VALID [2018-11-23 12:01:58,143 INFO L273 TraceCheckUtils]: 72: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14636#false} is VALID [2018-11-23 12:01:58,143 INFO L273 TraceCheckUtils]: 73: Hoare triple {14636#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14636#false} is VALID [2018-11-23 12:01:58,143 INFO L273 TraceCheckUtils]: 74: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14636#false} is VALID [2018-11-23 12:01:58,143 INFO L273 TraceCheckUtils]: 75: Hoare triple {14636#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14636#false} is VALID [2018-11-23 12:01:58,143 INFO L273 TraceCheckUtils]: 76: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14636#false} is VALID [2018-11-23 12:01:58,143 INFO L273 TraceCheckUtils]: 77: Hoare triple {14636#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14636#false} is VALID [2018-11-23 12:01:58,143 INFO L273 TraceCheckUtils]: 78: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14636#false} is VALID [2018-11-23 12:01:58,143 INFO L273 TraceCheckUtils]: 79: Hoare triple {14636#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14636#false} is VALID [2018-11-23 12:01:58,143 INFO L273 TraceCheckUtils]: 80: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14636#false} is VALID [2018-11-23 12:01:58,144 INFO L273 TraceCheckUtils]: 81: Hoare triple {14636#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14636#false} is VALID [2018-11-23 12:01:58,144 INFO L273 TraceCheckUtils]: 82: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14636#false} is VALID [2018-11-23 12:01:58,144 INFO L273 TraceCheckUtils]: 83: Hoare triple {14636#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14636#false} is VALID [2018-11-23 12:01:58,144 INFO L273 TraceCheckUtils]: 84: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14636#false} is VALID [2018-11-23 12:01:58,144 INFO L273 TraceCheckUtils]: 85: Hoare triple {14636#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14636#false} is VALID [2018-11-23 12:01:58,144 INFO L273 TraceCheckUtils]: 86: Hoare triple {14636#false} assume !(~i~0 < 100000); {14636#false} is VALID [2018-11-23 12:01:58,144 INFO L273 TraceCheckUtils]: 87: Hoare triple {14636#false} ~i~0 := 0; {14636#false} is VALID [2018-11-23 12:01:58,144 INFO L273 TraceCheckUtils]: 88: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {14636#false} is VALID [2018-11-23 12:01:58,144 INFO L273 TraceCheckUtils]: 89: Hoare triple {14636#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14636#false} is VALID [2018-11-23 12:01:58,145 INFO L273 TraceCheckUtils]: 90: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {14636#false} is VALID [2018-11-23 12:01:58,145 INFO L273 TraceCheckUtils]: 91: Hoare triple {14636#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14636#false} is VALID [2018-11-23 12:01:58,145 INFO L273 TraceCheckUtils]: 92: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {14636#false} is VALID [2018-11-23 12:01:58,145 INFO L273 TraceCheckUtils]: 93: Hoare triple {14636#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14636#false} is VALID [2018-11-23 12:01:58,145 INFO L273 TraceCheckUtils]: 94: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {14636#false} is VALID [2018-11-23 12:01:58,145 INFO L273 TraceCheckUtils]: 95: Hoare triple {14636#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14636#false} is VALID [2018-11-23 12:01:58,145 INFO L273 TraceCheckUtils]: 96: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {14636#false} is VALID [2018-11-23 12:01:58,145 INFO L273 TraceCheckUtils]: 97: Hoare triple {14636#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14636#false} is VALID [2018-11-23 12:01:58,145 INFO L273 TraceCheckUtils]: 98: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {14636#false} is VALID [2018-11-23 12:01:58,146 INFO L273 TraceCheckUtils]: 99: Hoare triple {14636#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14636#false} is VALID [2018-11-23 12:01:58,146 INFO L273 TraceCheckUtils]: 100: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {14636#false} is VALID [2018-11-23 12:01:58,146 INFO L273 TraceCheckUtils]: 101: Hoare triple {14636#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14636#false} is VALID [2018-11-23 12:01:58,146 INFO L273 TraceCheckUtils]: 102: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {14636#false} is VALID [2018-11-23 12:01:58,146 INFO L273 TraceCheckUtils]: 103: Hoare triple {14636#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14636#false} is VALID [2018-11-23 12:01:58,146 INFO L273 TraceCheckUtils]: 104: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {14636#false} is VALID [2018-11-23 12:01:58,146 INFO L273 TraceCheckUtils]: 105: Hoare triple {14636#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14636#false} is VALID [2018-11-23 12:01:58,146 INFO L273 TraceCheckUtils]: 106: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {14636#false} is VALID [2018-11-23 12:01:58,147 INFO L273 TraceCheckUtils]: 107: Hoare triple {14636#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14636#false} is VALID [2018-11-23 12:01:58,147 INFO L273 TraceCheckUtils]: 108: Hoare triple {14636#false} assume !(~i~0 < 100000); {14636#false} is VALID [2018-11-23 12:01:58,147 INFO L273 TraceCheckUtils]: 109: Hoare triple {14636#false} ~i~0 := 0; {14636#false} is VALID [2018-11-23 12:01:58,147 INFO L273 TraceCheckUtils]: 110: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {14636#false} is VALID [2018-11-23 12:01:58,147 INFO L273 TraceCheckUtils]: 111: Hoare triple {14636#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14636#false} is VALID [2018-11-23 12:01:58,147 INFO L273 TraceCheckUtils]: 112: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {14636#false} is VALID [2018-11-23 12:01:58,147 INFO L273 TraceCheckUtils]: 113: Hoare triple {14636#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14636#false} is VALID [2018-11-23 12:01:58,147 INFO L273 TraceCheckUtils]: 114: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {14636#false} is VALID [2018-11-23 12:01:58,147 INFO L273 TraceCheckUtils]: 115: Hoare triple {14636#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14636#false} is VALID [2018-11-23 12:01:58,148 INFO L273 TraceCheckUtils]: 116: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {14636#false} is VALID [2018-11-23 12:01:58,148 INFO L273 TraceCheckUtils]: 117: Hoare triple {14636#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14636#false} is VALID [2018-11-23 12:01:58,148 INFO L273 TraceCheckUtils]: 118: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {14636#false} is VALID [2018-11-23 12:01:58,148 INFO L273 TraceCheckUtils]: 119: Hoare triple {14636#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14636#false} is VALID [2018-11-23 12:01:58,148 INFO L273 TraceCheckUtils]: 120: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {14636#false} is VALID [2018-11-23 12:01:58,148 INFO L273 TraceCheckUtils]: 121: Hoare triple {14636#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14636#false} is VALID [2018-11-23 12:01:58,148 INFO L273 TraceCheckUtils]: 122: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {14636#false} is VALID [2018-11-23 12:01:58,148 INFO L273 TraceCheckUtils]: 123: Hoare triple {14636#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14636#false} is VALID [2018-11-23 12:01:58,148 INFO L273 TraceCheckUtils]: 124: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {14636#false} is VALID [2018-11-23 12:01:58,149 INFO L273 TraceCheckUtils]: 125: Hoare triple {14636#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14636#false} is VALID [2018-11-23 12:01:58,149 INFO L273 TraceCheckUtils]: 126: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {14636#false} is VALID [2018-11-23 12:01:58,149 INFO L273 TraceCheckUtils]: 127: Hoare triple {14636#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14636#false} is VALID [2018-11-23 12:01:58,149 INFO L273 TraceCheckUtils]: 128: Hoare triple {14636#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {14636#false} is VALID [2018-11-23 12:01:58,149 INFO L273 TraceCheckUtils]: 129: Hoare triple {14636#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14636#false} is VALID [2018-11-23 12:01:58,149 INFO L273 TraceCheckUtils]: 130: Hoare triple {14636#false} assume !(~i~0 < 100000); {14636#false} is VALID [2018-11-23 12:01:58,149 INFO L273 TraceCheckUtils]: 131: Hoare triple {14636#false} havoc ~x~0;~x~0 := 0; {14636#false} is VALID [2018-11-23 12:01:58,149 INFO L273 TraceCheckUtils]: 132: Hoare triple {14636#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {14636#false} is VALID [2018-11-23 12:01:58,149 INFO L256 TraceCheckUtils]: 133: Hoare triple {14636#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {14636#false} is VALID [2018-11-23 12:01:58,150 INFO L273 TraceCheckUtils]: 134: Hoare triple {14636#false} ~cond := #in~cond; {14636#false} is VALID [2018-11-23 12:01:58,150 INFO L273 TraceCheckUtils]: 135: Hoare triple {14636#false} assume 0 == ~cond; {14636#false} is VALID [2018-11-23 12:01:58,150 INFO L273 TraceCheckUtils]: 136: Hoare triple {14636#false} assume !false; {14636#false} is VALID [2018-11-23 12:01:58,157 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-11-23 12:01:58,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:58,158 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:58,167 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE