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_copy3_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:58:57,157 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:58:57,159 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:58:57,172 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:58:57,172 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:58:57,173 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:58:57,175 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:58:57,180 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:58:57,183 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:58:57,185 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:58:57,192 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:58:57,192 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:58:57,195 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:58:57,196 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:58:57,198 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:58:57,202 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:58:57,203 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:58:57,205 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:58:57,207 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:58:57,208 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:58:57,209 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:58:57,210 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:58:57,212 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:58:57,213 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:58:57,213 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:58:57,214 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:58:57,215 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:58:57,215 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:58:57,216 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:58:57,217 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:58:57,217 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:58:57,218 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:58:57,218 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:58:57,219 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:58:57,220 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:58:57,220 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:58:57,221 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:57,236 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:58:57,236 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:58:57,237 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:58:57,237 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:58:57,238 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:58:57,238 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:58:57,238 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:58:57,239 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:58:57,239 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:58:57,239 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:58:57,239 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:58:57,239 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:58:57,240 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:58:57,240 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:58:57,240 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:58:57,240 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:58:57,240 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:58:57,241 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:58:57,241 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:58:57,241 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:58:57,241 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:58:57,241 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:58:57,242 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:58:57,242 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:58:57,242 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:58:57,242 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:58:57,242 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:58:57,243 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:58:57,243 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:58:57,243 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:58:57,243 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:58:57,306 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:58:57,325 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:58:57,331 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:58:57,333 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:58:57,333 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:58:57,334 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy3_true-unreach-call_ground.i [2018-11-23 11:58:57,405 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b0e0188e/7229d82c7abb4136b651214288164dca/FLAG72d07d2c7 [2018-11-23 11:58:57,899 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:58:57,901 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy3_true-unreach-call_ground.i [2018-11-23 11:58:57,910 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b0e0188e/7229d82c7abb4136b651214288164dca/FLAG72d07d2c7 [2018-11-23 11:58:58,230 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b0e0188e/7229d82c7abb4136b651214288164dca [2018-11-23 11:58:58,241 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:58:58,242 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:58:58,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:58:58,243 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:58:58,247 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:58:58,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:58:58" (1/1) ... [2018-11-23 11:58:58,252 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71e407d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:58, skipping insertion in model container [2018-11-23 11:58:58,252 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:58:58" (1/1) ... [2018-11-23 11:58:58,263 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:58:58,289 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:58:58,552 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:58:58,557 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:58:58,586 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:58:58,609 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:58:58,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:58 WrapperNode [2018-11-23 11:58:58,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:58:58,610 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:58:58,611 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:58:58,611 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:58:58,619 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:58" (1/1) ... [2018-11-23 11:58:58,629 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:58" (1/1) ... [2018-11-23 11:58:58,637 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:58:58,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:58:58,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:58:58,638 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:58:58,650 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:58" (1/1) ... [2018-11-23 11:58:58,651 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:58" (1/1) ... [2018-11-23 11:58:58,653 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:58" (1/1) ... [2018-11-23 11:58:58,653 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:58" (1/1) ... [2018-11-23 11:58:58,674 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:58" (1/1) ... [2018-11-23 11:58:58,691 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:58" (1/1) ... [2018-11-23 11:58:58,693 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:58" (1/1) ... [2018-11-23 11:58:58,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:58:58,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:58:58,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:58:58,696 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:58:58,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:58" (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:58,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:58:58,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:58:58,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:58:58,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:58:58,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:58:58,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:58:58,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:58:58,842 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:58:58,842 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:58:58,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:58:58,842 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:58:58,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:58:59,522 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:58:59,523 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 11:58:59,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:58:59 BoogieIcfgContainer [2018-11-23 11:58:59,523 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:58:59,524 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:58:59,525 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:58:59,528 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:58:59,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:58:58" (1/3) ... [2018-11-23 11:58:59,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9721571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:58:59, skipping insertion in model container [2018-11-23 11:58:59,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:58" (2/3) ... [2018-11-23 11:58:59,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9721571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:58:59, skipping insertion in model container [2018-11-23 11:58:59,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:58:59" (3/3) ... [2018-11-23 11:58:59,532 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy3_true-unreach-call_ground.i [2018-11-23 11:58:59,542 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:58:59,550 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:58:59,567 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:58:59,599 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:58:59,600 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:58:59,600 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:58:59,601 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:58:59,602 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:58:59,602 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:58:59,602 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:58:59,602 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:58:59,603 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:58:59,622 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-23 11:58:59,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:58:59,629 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:59,630 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:59,632 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:59,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:59,639 INFO L82 PathProgramCache]: Analyzing trace with hash -496428460, now seen corresponding path program 1 times [2018-11-23 11:58:59,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:59,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:59,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:59,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:59,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:59,817 INFO L256 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2018-11-23 11:58:59,820 INFO L273 TraceCheckUtils]: 1: Hoare triple {36#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36#true} is VALID [2018-11-23 11:58:59,821 INFO L273 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-23 11:58:59,821 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #91#return; {36#true} is VALID [2018-11-23 11:58:59,822 INFO L256 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret11 := main(); {36#true} is VALID [2018-11-23 11:58:59,822 INFO L273 TraceCheckUtils]: 5: Hoare triple {36#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);havoc ~a~0;~a~0 := 0; {36#true} is VALID [2018-11-23 11:58:59,824 INFO L273 TraceCheckUtils]: 6: Hoare triple {36#true} assume !true; {37#false} is VALID [2018-11-23 11:58:59,824 INFO L273 TraceCheckUtils]: 7: Hoare triple {37#false} havoc ~i~0;~i~0 := 0; {37#false} is VALID [2018-11-23 11:58:59,825 INFO L273 TraceCheckUtils]: 8: Hoare triple {37#false} assume !(~i~0 < 100000); {37#false} is VALID [2018-11-23 11:58:59,825 INFO L273 TraceCheckUtils]: 9: Hoare triple {37#false} ~i~0 := 0; {37#false} is VALID [2018-11-23 11:58:59,825 INFO L273 TraceCheckUtils]: 10: Hoare triple {37#false} assume !(~i~0 < 100000); {37#false} is VALID [2018-11-23 11:58:59,826 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#false} ~i~0 := 0; {37#false} is VALID [2018-11-23 11:58:59,826 INFO L273 TraceCheckUtils]: 12: Hoare triple {37#false} assume !(~i~0 < 100000); {37#false} is VALID [2018-11-23 11:58:59,826 INFO L273 TraceCheckUtils]: 13: Hoare triple {37#false} havoc ~x~0;~x~0 := 0; {37#false} is VALID [2018-11-23 11:58:59,827 INFO L273 TraceCheckUtils]: 14: Hoare triple {37#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {37#false} is VALID [2018-11-23 11:58:59,827 INFO L256 TraceCheckUtils]: 15: Hoare triple {37#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {37#false} is VALID [2018-11-23 11:58:59,828 INFO L273 TraceCheckUtils]: 16: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2018-11-23 11:58:59,828 INFO L273 TraceCheckUtils]: 17: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2018-11-23 11:58:59,828 INFO L273 TraceCheckUtils]: 18: Hoare triple {37#false} assume !false; {37#false} is VALID [2018-11-23 11:58:59,832 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:58:59,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:58:59,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:58:59,840 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-23 11:58:59,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:59,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:59:00,073 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:00,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:59:00,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:59:00,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:59:00,086 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-11-23 11:59:00,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:00,258 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2018-11-23 11:59:00,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:59:00,259 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-23 11:59:00,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:00,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:59:00,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 77 transitions. [2018-11-23 11:59:00,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:59:00,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 77 transitions. [2018-11-23 11:59:00,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 77 transitions. [2018-11-23 11:59:00,717 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:00,728 INFO L225 Difference]: With dead ends: 58 [2018-11-23 11:59:00,728 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 11:59:00,732 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:00,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 11:59:00,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 11:59:00,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:00,774 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 11:59:00,774 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 11:59:00,774 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 11:59:00,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:00,779 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 11:59:00,779 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 11:59:00,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:00,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:00,780 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 11:59:00,780 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 11:59:00,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:00,785 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 11:59:00,785 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 11:59:00,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:00,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:00,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:00,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:00,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:59:00,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-23 11:59:00,792 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2018-11-23 11:59:00,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:00,793 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-23 11:59:00,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:59:00,793 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 11:59:00,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:59:00,794 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:00,794 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:00,795 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:00,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:00,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1263989582, now seen corresponding path program 1 times [2018-11-23 11:59:00,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:00,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:00,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:00,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:00,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:00,903 INFO L256 TraceCheckUtils]: 0: Hoare triple {210#true} call ULTIMATE.init(); {210#true} is VALID [2018-11-23 11:59:00,903 INFO L273 TraceCheckUtils]: 1: Hoare triple {210#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {210#true} is VALID [2018-11-23 11:59:00,903 INFO L273 TraceCheckUtils]: 2: Hoare triple {210#true} assume true; {210#true} is VALID [2018-11-23 11:59:00,904 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {210#true} {210#true} #91#return; {210#true} is VALID [2018-11-23 11:59:00,904 INFO L256 TraceCheckUtils]: 4: Hoare triple {210#true} call #t~ret11 := main(); {210#true} is VALID [2018-11-23 11:59:00,907 INFO L273 TraceCheckUtils]: 5: Hoare triple {210#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);havoc ~a~0;~a~0 := 0; {212#(= main_~a~0 0)} is VALID [2018-11-23 11:59:00,908 INFO L273 TraceCheckUtils]: 6: Hoare triple {212#(= main_~a~0 0)} assume !(~a~0 < 100000); {211#false} is VALID [2018-11-23 11:59:00,908 INFO L273 TraceCheckUtils]: 7: Hoare triple {211#false} havoc ~i~0;~i~0 := 0; {211#false} is VALID [2018-11-23 11:59:00,908 INFO L273 TraceCheckUtils]: 8: Hoare triple {211#false} assume !(~i~0 < 100000); {211#false} is VALID [2018-11-23 11:59:00,909 INFO L273 TraceCheckUtils]: 9: Hoare triple {211#false} ~i~0 := 0; {211#false} is VALID [2018-11-23 11:59:00,910 INFO L273 TraceCheckUtils]: 10: Hoare triple {211#false} assume !(~i~0 < 100000); {211#false} is VALID [2018-11-23 11:59:00,910 INFO L273 TraceCheckUtils]: 11: Hoare triple {211#false} ~i~0 := 0; {211#false} is VALID [2018-11-23 11:59:00,910 INFO L273 TraceCheckUtils]: 12: Hoare triple {211#false} assume !(~i~0 < 100000); {211#false} is VALID [2018-11-23 11:59:00,911 INFO L273 TraceCheckUtils]: 13: Hoare triple {211#false} havoc ~x~0;~x~0 := 0; {211#false} is VALID [2018-11-23 11:59:00,911 INFO L273 TraceCheckUtils]: 14: Hoare triple {211#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {211#false} is VALID [2018-11-23 11:59:00,911 INFO L256 TraceCheckUtils]: 15: Hoare triple {211#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {211#false} is VALID [2018-11-23 11:59:00,911 INFO L273 TraceCheckUtils]: 16: Hoare triple {211#false} ~cond := #in~cond; {211#false} is VALID [2018-11-23 11:59:00,912 INFO L273 TraceCheckUtils]: 17: Hoare triple {211#false} assume 0 == ~cond; {211#false} is VALID [2018-11-23 11:59:00,912 INFO L273 TraceCheckUtils]: 18: Hoare triple {211#false} assume !false; {211#false} is VALID [2018-11-23 11:59:00,914 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,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:59:00,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:59:00,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 11:59:00,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:00,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:59:00,958 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:00,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:59:00,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:59:00,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:59:00,959 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2018-11-23 11:59:01,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:01,466 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2018-11-23 11:59:01,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:59:01,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 11:59:01,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:01,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:59:01,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-23 11:59:01,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:59:01,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-23 11:59:01,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2018-11-23 11:59:01,638 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:01,640 INFO L225 Difference]: With dead ends: 50 [2018-11-23 11:59:01,641 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 11:59:01,642 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:01,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 11:59:01,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 11:59:01,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:01,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-23 11:59:01,656 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-23 11:59:01,657 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-23 11:59:01,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:01,660 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 11:59:01,660 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 11:59:01,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:01,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:01,661 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-23 11:59:01,661 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-23 11:59:01,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:01,664 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 11:59:01,664 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 11:59:01,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:01,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:01,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:01,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:01,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:59:01,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-23 11:59:01,668 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 19 [2018-11-23 11:59:01,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:01,669 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-23 11:59:01,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:59:01,669 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 11:59:01,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:59:01,670 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:01,670 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,670 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:01,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:01,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1258945684, now seen corresponding path program 1 times [2018-11-23 11:59:01,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:01,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:01,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:01,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:01,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:01,792 INFO L256 TraceCheckUtils]: 0: Hoare triple {384#true} call ULTIMATE.init(); {384#true} is VALID [2018-11-23 11:59:01,792 INFO L273 TraceCheckUtils]: 1: Hoare triple {384#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {384#true} is VALID [2018-11-23 11:59:01,793 INFO L273 TraceCheckUtils]: 2: Hoare triple {384#true} assume true; {384#true} is VALID [2018-11-23 11:59:01,793 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {384#true} {384#true} #91#return; {384#true} is VALID [2018-11-23 11:59:01,793 INFO L256 TraceCheckUtils]: 4: Hoare triple {384#true} call #t~ret11 := main(); {384#true} is VALID [2018-11-23 11:59:01,793 INFO L273 TraceCheckUtils]: 5: Hoare triple {384#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);havoc ~a~0;~a~0 := 0; {384#true} is VALID [2018-11-23 11:59:01,794 INFO L273 TraceCheckUtils]: 6: Hoare triple {384#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; {384#true} is VALID [2018-11-23 11:59:01,794 INFO L273 TraceCheckUtils]: 7: Hoare triple {384#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {384#true} is VALID [2018-11-23 11:59:01,794 INFO L273 TraceCheckUtils]: 8: Hoare triple {384#true} assume !(~a~0 < 100000); {384#true} is VALID [2018-11-23 11:59:01,798 INFO L273 TraceCheckUtils]: 9: Hoare triple {384#true} havoc ~i~0;~i~0 := 0; {386#(= main_~i~0 0)} is VALID [2018-11-23 11:59:01,799 INFO L273 TraceCheckUtils]: 10: Hoare triple {386#(= main_~i~0 0)} assume !(~i~0 < 100000); {385#false} is VALID [2018-11-23 11:59:01,799 INFO L273 TraceCheckUtils]: 11: Hoare triple {385#false} ~i~0 := 0; {385#false} is VALID [2018-11-23 11:59:01,799 INFO L273 TraceCheckUtils]: 12: Hoare triple {385#false} assume !(~i~0 < 100000); {385#false} is VALID [2018-11-23 11:59:01,800 INFO L273 TraceCheckUtils]: 13: Hoare triple {385#false} ~i~0 := 0; {385#false} is VALID [2018-11-23 11:59:01,800 INFO L273 TraceCheckUtils]: 14: Hoare triple {385#false} assume !(~i~0 < 100000); {385#false} is VALID [2018-11-23 11:59:01,800 INFO L273 TraceCheckUtils]: 15: Hoare triple {385#false} havoc ~x~0;~x~0 := 0; {385#false} is VALID [2018-11-23 11:59:01,801 INFO L273 TraceCheckUtils]: 16: Hoare triple {385#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {385#false} is VALID [2018-11-23 11:59:01,801 INFO L256 TraceCheckUtils]: 17: Hoare triple {385#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {385#false} is VALID [2018-11-23 11:59:01,801 INFO L273 TraceCheckUtils]: 18: Hoare triple {385#false} ~cond := #in~cond; {385#false} is VALID [2018-11-23 11:59:01,802 INFO L273 TraceCheckUtils]: 19: Hoare triple {385#false} assume 0 == ~cond; {385#false} is VALID [2018-11-23 11:59:01,802 INFO L273 TraceCheckUtils]: 20: Hoare triple {385#false} assume !false; {385#false} is VALID [2018-11-23 11:59:01,803 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:01,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:59:01,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:59:01,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 11:59:01,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:01,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:59:01,876 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,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:59:01,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:59:01,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:59:01,878 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2018-11-23 11:59:02,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:02,056 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2018-11-23 11:59:02,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:59:02,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 11:59:02,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:02,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:59:02,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-23 11:59:02,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:59:02,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-23 11:59:02,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2018-11-23 11:59:02,205 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 11:59:02,207 INFO L225 Difference]: With dead ends: 52 [2018-11-23 11:59:02,207 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 11:59:02,208 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,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 11:59:02,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-11-23 11:59:02,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:02,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 32 states. [2018-11-23 11:59:02,244 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 32 states. [2018-11-23 11:59:02,244 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 32 states. [2018-11-23 11:59:02,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:02,248 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 11:59:02,248 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 11:59:02,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:02,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:02,249 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 35 states. [2018-11-23 11:59:02,249 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 35 states. [2018-11-23 11:59:02,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:02,252 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 11:59:02,252 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 11:59:02,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:02,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:02,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:02,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:02,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:59:02,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-23 11:59:02,256 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 21 [2018-11-23 11:59:02,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:02,257 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-23 11:59:02,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:59:02,257 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 11:59:02,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 11:59:02,258 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:02,258 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] [2018-11-23 11:59:02,258 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:02,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:02,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1930458438, now seen corresponding path program 1 times [2018-11-23 11:59:02,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:02,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:02,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:02,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:02,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:02,386 INFO L256 TraceCheckUtils]: 0: Hoare triple {578#true} call ULTIMATE.init(); {578#true} is VALID [2018-11-23 11:59:02,386 INFO L273 TraceCheckUtils]: 1: Hoare triple {578#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {578#true} is VALID [2018-11-23 11:59:02,387 INFO L273 TraceCheckUtils]: 2: Hoare triple {578#true} assume true; {578#true} is VALID [2018-11-23 11:59:02,387 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {578#true} {578#true} #91#return; {578#true} is VALID [2018-11-23 11:59:02,387 INFO L256 TraceCheckUtils]: 4: Hoare triple {578#true} call #t~ret11 := main(); {578#true} is VALID [2018-11-23 11:59:02,389 INFO L273 TraceCheckUtils]: 5: Hoare triple {578#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);havoc ~a~0;~a~0 := 0; {580#(= main_~a~0 0)} is VALID [2018-11-23 11:59:02,390 INFO L273 TraceCheckUtils]: 6: Hoare triple {580#(= 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; {580#(= main_~a~0 0)} is VALID [2018-11-23 11:59:02,390 INFO L273 TraceCheckUtils]: 7: Hoare triple {580#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {581#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:02,391 INFO L273 TraceCheckUtils]: 8: Hoare triple {581#(<= main_~a~0 1)} assume !(~a~0 < 100000); {579#false} is VALID [2018-11-23 11:59:02,391 INFO L273 TraceCheckUtils]: 9: Hoare triple {579#false} havoc ~i~0;~i~0 := 0; {579#false} is VALID [2018-11-23 11:59:02,391 INFO L273 TraceCheckUtils]: 10: Hoare triple {579#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; {579#false} is VALID [2018-11-23 11:59:02,392 INFO L273 TraceCheckUtils]: 11: Hoare triple {579#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {579#false} is VALID [2018-11-23 11:59:02,392 INFO L273 TraceCheckUtils]: 12: Hoare triple {579#false} assume !(~i~0 < 100000); {579#false} is VALID [2018-11-23 11:59:02,392 INFO L273 TraceCheckUtils]: 13: Hoare triple {579#false} ~i~0 := 0; {579#false} is VALID [2018-11-23 11:59:02,392 INFO L273 TraceCheckUtils]: 14: Hoare triple {579#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; {579#false} is VALID [2018-11-23 11:59:02,393 INFO L273 TraceCheckUtils]: 15: Hoare triple {579#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {579#false} is VALID [2018-11-23 11:59:02,393 INFO L273 TraceCheckUtils]: 16: Hoare triple {579#false} assume !(~i~0 < 100000); {579#false} is VALID [2018-11-23 11:59:02,393 INFO L273 TraceCheckUtils]: 17: Hoare triple {579#false} ~i~0 := 0; {579#false} is VALID [2018-11-23 11:59:02,394 INFO L273 TraceCheckUtils]: 18: Hoare triple {579#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; {579#false} is VALID [2018-11-23 11:59:02,394 INFO L273 TraceCheckUtils]: 19: Hoare triple {579#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {579#false} is VALID [2018-11-23 11:59:02,394 INFO L273 TraceCheckUtils]: 20: Hoare triple {579#false} assume !(~i~0 < 100000); {579#false} is VALID [2018-11-23 11:59:02,394 INFO L273 TraceCheckUtils]: 21: Hoare triple {579#false} havoc ~x~0;~x~0 := 0; {579#false} is VALID [2018-11-23 11:59:02,395 INFO L273 TraceCheckUtils]: 22: Hoare triple {579#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {579#false} is VALID [2018-11-23 11:59:02,395 INFO L256 TraceCheckUtils]: 23: Hoare triple {579#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {579#false} is VALID [2018-11-23 11:59:02,395 INFO L273 TraceCheckUtils]: 24: Hoare triple {579#false} ~cond := #in~cond; {579#false} is VALID [2018-11-23 11:59:02,395 INFO L273 TraceCheckUtils]: 25: Hoare triple {579#false} assume 0 == ~cond; {579#false} is VALID [2018-11-23 11:59:02,396 INFO L273 TraceCheckUtils]: 26: Hoare triple {579#false} assume !false; {579#false} is VALID [2018-11-23 11:59:02,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 11:59:02,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:02,398 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:02,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:02,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:02,728 INFO L256 TraceCheckUtils]: 0: Hoare triple {578#true} call ULTIMATE.init(); {578#true} is VALID [2018-11-23 11:59:02,729 INFO L273 TraceCheckUtils]: 1: Hoare triple {578#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {578#true} is VALID [2018-11-23 11:59:02,729 INFO L273 TraceCheckUtils]: 2: Hoare triple {578#true} assume true; {578#true} is VALID [2018-11-23 11:59:02,729 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {578#true} {578#true} #91#return; {578#true} is VALID [2018-11-23 11:59:02,729 INFO L256 TraceCheckUtils]: 4: Hoare triple {578#true} call #t~ret11 := main(); {578#true} is VALID [2018-11-23 11:59:02,731 INFO L273 TraceCheckUtils]: 5: Hoare triple {578#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);havoc ~a~0;~a~0 := 0; {600#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:02,732 INFO L273 TraceCheckUtils]: 6: Hoare triple {600#(<= 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; {600#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:02,732 INFO L273 TraceCheckUtils]: 7: Hoare triple {600#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {581#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:02,734 INFO L273 TraceCheckUtils]: 8: Hoare triple {581#(<= main_~a~0 1)} assume !(~a~0 < 100000); {579#false} is VALID [2018-11-23 11:59:02,734 INFO L273 TraceCheckUtils]: 9: Hoare triple {579#false} havoc ~i~0;~i~0 := 0; {579#false} is VALID [2018-11-23 11:59:02,735 INFO L273 TraceCheckUtils]: 10: Hoare triple {579#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; {579#false} is VALID [2018-11-23 11:59:02,735 INFO L273 TraceCheckUtils]: 11: Hoare triple {579#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {579#false} is VALID [2018-11-23 11:59:02,735 INFO L273 TraceCheckUtils]: 12: Hoare triple {579#false} assume !(~i~0 < 100000); {579#false} is VALID [2018-11-23 11:59:02,736 INFO L273 TraceCheckUtils]: 13: Hoare triple {579#false} ~i~0 := 0; {579#false} is VALID [2018-11-23 11:59:02,736 INFO L273 TraceCheckUtils]: 14: Hoare triple {579#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; {579#false} is VALID [2018-11-23 11:59:02,736 INFO L273 TraceCheckUtils]: 15: Hoare triple {579#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {579#false} is VALID [2018-11-23 11:59:02,737 INFO L273 TraceCheckUtils]: 16: Hoare triple {579#false} assume !(~i~0 < 100000); {579#false} is VALID [2018-11-23 11:59:02,737 INFO L273 TraceCheckUtils]: 17: Hoare triple {579#false} ~i~0 := 0; {579#false} is VALID [2018-11-23 11:59:02,737 INFO L273 TraceCheckUtils]: 18: Hoare triple {579#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; {579#false} is VALID [2018-11-23 11:59:02,737 INFO L273 TraceCheckUtils]: 19: Hoare triple {579#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {579#false} is VALID [2018-11-23 11:59:02,738 INFO L273 TraceCheckUtils]: 20: Hoare triple {579#false} assume !(~i~0 < 100000); {579#false} is VALID [2018-11-23 11:59:02,738 INFO L273 TraceCheckUtils]: 21: Hoare triple {579#false} havoc ~x~0;~x~0 := 0; {579#false} is VALID [2018-11-23 11:59:02,738 INFO L273 TraceCheckUtils]: 22: Hoare triple {579#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {579#false} is VALID [2018-11-23 11:59:02,739 INFO L256 TraceCheckUtils]: 23: Hoare triple {579#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {579#false} is VALID [2018-11-23 11:59:02,739 INFO L273 TraceCheckUtils]: 24: Hoare triple {579#false} ~cond := #in~cond; {579#false} is VALID [2018-11-23 11:59:02,739 INFO L273 TraceCheckUtils]: 25: Hoare triple {579#false} assume 0 == ~cond; {579#false} is VALID [2018-11-23 11:59:02,739 INFO L273 TraceCheckUtils]: 26: Hoare triple {579#false} assume !false; {579#false} is VALID [2018-11-23 11:59:02,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 11:59:02,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:02,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 11:59:02,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-23 11:59:02,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:02,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:59:02,827 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:02,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:59:02,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:59:02,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:59:02,828 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 5 states. [2018-11-23 11:59:03,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:03,235 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-11-23 11:59:03,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:59:03,235 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-23 11:59:03,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:03,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:59:03,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2018-11-23 11:59:03,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:59:03,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2018-11-23 11:59:03,241 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 60 transitions. [2018-11-23 11:59:03,343 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 11:59:03,344 INFO L225 Difference]: With dead ends: 58 [2018-11-23 11:59:03,345 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 11:59:03,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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:03,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 11:59:03,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-11-23 11:59:03,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:03,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 34 states. [2018-11-23 11:59:03,368 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 34 states. [2018-11-23 11:59:03,368 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 34 states. [2018-11-23 11:59:03,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:03,370 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 11:59:03,370 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 11:59:03,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:03,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:03,372 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 35 states. [2018-11-23 11:59:03,372 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 35 states. [2018-11-23 11:59:03,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:03,374 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 11:59:03,374 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 11:59:03,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:03,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:03,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:03,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:03,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:59:03,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-23 11:59:03,378 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-11-23 11:59:03,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:03,378 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-23 11:59:03,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:59:03,379 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 11:59:03,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:59:03,380 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:03,380 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] [2018-11-23 11:59:03,380 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:03,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:03,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1956939620, now seen corresponding path program 2 times [2018-11-23 11:59:03,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:03,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:03,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:03,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:03,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:03,490 INFO L256 TraceCheckUtils]: 0: Hoare triple {866#true} call ULTIMATE.init(); {866#true} is VALID [2018-11-23 11:59:03,491 INFO L273 TraceCheckUtils]: 1: Hoare triple {866#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {866#true} is VALID [2018-11-23 11:59:03,491 INFO L273 TraceCheckUtils]: 2: Hoare triple {866#true} assume true; {866#true} is VALID [2018-11-23 11:59:03,491 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {866#true} {866#true} #91#return; {866#true} is VALID [2018-11-23 11:59:03,492 INFO L256 TraceCheckUtils]: 4: Hoare triple {866#true} call #t~ret11 := main(); {866#true} is VALID [2018-11-23 11:59:03,492 INFO L273 TraceCheckUtils]: 5: Hoare triple {866#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);havoc ~a~0;~a~0 := 0; {868#(= main_~a~0 0)} is VALID [2018-11-23 11:59:03,496 INFO L273 TraceCheckUtils]: 6: Hoare triple {868#(= 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; {868#(= main_~a~0 0)} is VALID [2018-11-23 11:59:03,496 INFO L273 TraceCheckUtils]: 7: Hoare triple {868#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {869#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:03,511 INFO L273 TraceCheckUtils]: 8: Hoare triple {869#(<= 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; {869#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:03,513 INFO L273 TraceCheckUtils]: 9: Hoare triple {869#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {870#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:03,513 INFO L273 TraceCheckUtils]: 10: Hoare triple {870#(<= main_~a~0 2)} assume !(~a~0 < 100000); {867#false} is VALID [2018-11-23 11:59:03,513 INFO L273 TraceCheckUtils]: 11: Hoare triple {867#false} havoc ~i~0;~i~0 := 0; {867#false} is VALID [2018-11-23 11:59:03,514 INFO L273 TraceCheckUtils]: 12: Hoare triple {867#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; {867#false} is VALID [2018-11-23 11:59:03,514 INFO L273 TraceCheckUtils]: 13: Hoare triple {867#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {867#false} is VALID [2018-11-23 11:59:03,514 INFO L273 TraceCheckUtils]: 14: Hoare triple {867#false} assume !(~i~0 < 100000); {867#false} is VALID [2018-11-23 11:59:03,515 INFO L273 TraceCheckUtils]: 15: Hoare triple {867#false} ~i~0 := 0; {867#false} is VALID [2018-11-23 11:59:03,515 INFO L273 TraceCheckUtils]: 16: Hoare triple {867#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; {867#false} is VALID [2018-11-23 11:59:03,516 INFO L273 TraceCheckUtils]: 17: Hoare triple {867#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {867#false} is VALID [2018-11-23 11:59:03,516 INFO L273 TraceCheckUtils]: 18: Hoare triple {867#false} assume !(~i~0 < 100000); {867#false} is VALID [2018-11-23 11:59:03,517 INFO L273 TraceCheckUtils]: 19: Hoare triple {867#false} ~i~0 := 0; {867#false} is VALID [2018-11-23 11:59:03,517 INFO L273 TraceCheckUtils]: 20: Hoare triple {867#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; {867#false} is VALID [2018-11-23 11:59:03,517 INFO L273 TraceCheckUtils]: 21: Hoare triple {867#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {867#false} is VALID [2018-11-23 11:59:03,518 INFO L273 TraceCheckUtils]: 22: Hoare triple {867#false} assume !(~i~0 < 100000); {867#false} is VALID [2018-11-23 11:59:03,518 INFO L273 TraceCheckUtils]: 23: Hoare triple {867#false} havoc ~x~0;~x~0 := 0; {867#false} is VALID [2018-11-23 11:59:03,518 INFO L273 TraceCheckUtils]: 24: Hoare triple {867#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {867#false} is VALID [2018-11-23 11:59:03,518 INFO L256 TraceCheckUtils]: 25: Hoare triple {867#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {867#false} is VALID [2018-11-23 11:59:03,519 INFO L273 TraceCheckUtils]: 26: Hoare triple {867#false} ~cond := #in~cond; {867#false} is VALID [2018-11-23 11:59:03,519 INFO L273 TraceCheckUtils]: 27: Hoare triple {867#false} assume 0 == ~cond; {867#false} is VALID [2018-11-23 11:59:03,519 INFO L273 TraceCheckUtils]: 28: Hoare triple {867#false} assume !false; {867#false} is VALID [2018-11-23 11:59:03,521 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 11:59:03,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:03,522 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:03,538 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:59:03,565 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:59:03,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:03,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:03,711 INFO L256 TraceCheckUtils]: 0: Hoare triple {866#true} call ULTIMATE.init(); {866#true} is VALID [2018-11-23 11:59:03,712 INFO L273 TraceCheckUtils]: 1: Hoare triple {866#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {866#true} is VALID [2018-11-23 11:59:03,712 INFO L273 TraceCheckUtils]: 2: Hoare triple {866#true} assume true; {866#true} is VALID [2018-11-23 11:59:03,713 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {866#true} {866#true} #91#return; {866#true} is VALID [2018-11-23 11:59:03,713 INFO L256 TraceCheckUtils]: 4: Hoare triple {866#true} call #t~ret11 := main(); {866#true} is VALID [2018-11-23 11:59:03,713 INFO L273 TraceCheckUtils]: 5: Hoare triple {866#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);havoc ~a~0;~a~0 := 0; {866#true} is VALID [2018-11-23 11:59:03,714 INFO L273 TraceCheckUtils]: 6: Hoare triple {866#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; {866#true} is VALID [2018-11-23 11:59:03,714 INFO L273 TraceCheckUtils]: 7: Hoare triple {866#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {866#true} is VALID [2018-11-23 11:59:03,714 INFO L273 TraceCheckUtils]: 8: Hoare triple {866#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; {866#true} is VALID [2018-11-23 11:59:03,714 INFO L273 TraceCheckUtils]: 9: Hoare triple {866#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {866#true} is VALID [2018-11-23 11:59:03,714 INFO L273 TraceCheckUtils]: 10: Hoare triple {866#true} assume !(~a~0 < 100000); {866#true} is VALID [2018-11-23 11:59:03,715 INFO L273 TraceCheckUtils]: 11: Hoare triple {866#true} havoc ~i~0;~i~0 := 0; {866#true} is VALID [2018-11-23 11:59:03,715 INFO L273 TraceCheckUtils]: 12: Hoare triple {866#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; {866#true} is VALID [2018-11-23 11:59:03,715 INFO L273 TraceCheckUtils]: 13: Hoare triple {866#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {866#true} is VALID [2018-11-23 11:59:03,715 INFO L273 TraceCheckUtils]: 14: Hoare triple {866#true} assume !(~i~0 < 100000); {866#true} is VALID [2018-11-23 11:59:03,716 INFO L273 TraceCheckUtils]: 15: Hoare triple {866#true} ~i~0 := 0; {919#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:03,716 INFO L273 TraceCheckUtils]: 16: Hoare triple {919#(<= 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; {919#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:03,717 INFO L273 TraceCheckUtils]: 17: Hoare triple {919#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {926#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:03,718 INFO L273 TraceCheckUtils]: 18: Hoare triple {926#(<= main_~i~0 1)} assume !(~i~0 < 100000); {867#false} is VALID [2018-11-23 11:59:03,718 INFO L273 TraceCheckUtils]: 19: Hoare triple {867#false} ~i~0 := 0; {867#false} is VALID [2018-11-23 11:59:03,718 INFO L273 TraceCheckUtils]: 20: Hoare triple {867#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; {867#false} is VALID [2018-11-23 11:59:03,718 INFO L273 TraceCheckUtils]: 21: Hoare triple {867#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {867#false} is VALID [2018-11-23 11:59:03,718 INFO L273 TraceCheckUtils]: 22: Hoare triple {867#false} assume !(~i~0 < 100000); {867#false} is VALID [2018-11-23 11:59:03,719 INFO L273 TraceCheckUtils]: 23: Hoare triple {867#false} havoc ~x~0;~x~0 := 0; {867#false} is VALID [2018-11-23 11:59:03,719 INFO L273 TraceCheckUtils]: 24: Hoare triple {867#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {867#false} is VALID [2018-11-23 11:59:03,719 INFO L256 TraceCheckUtils]: 25: Hoare triple {867#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {867#false} is VALID [2018-11-23 11:59:03,719 INFO L273 TraceCheckUtils]: 26: Hoare triple {867#false} ~cond := #in~cond; {867#false} is VALID [2018-11-23 11:59:03,719 INFO L273 TraceCheckUtils]: 27: Hoare triple {867#false} assume 0 == ~cond; {867#false} is VALID [2018-11-23 11:59:03,720 INFO L273 TraceCheckUtils]: 28: Hoare triple {867#false} assume !false; {867#false} is VALID [2018-11-23 11:59:03,721 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 11:59:03,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:03,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-11-23 11:59:03,740 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-11-23 11:59:03,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:03,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:59:03,839 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:03,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:59:03,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:59:03,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:59:03,840 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 7 states. [2018-11-23 11:59:04,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:04,226 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2018-11-23 11:59:04,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:59:04,226 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-11-23 11:59:04,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:04,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:59:04,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2018-11-23 11:59:04,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:59:04,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2018-11-23 11:59:04,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 77 transitions. [2018-11-23 11:59:04,395 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:04,398 INFO L225 Difference]: With dead ends: 69 [2018-11-23 11:59:04,398 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 11:59:04,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 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:04,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 11:59:04,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-11-23 11:59:04,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:04,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 42 states. [2018-11-23 11:59:04,420 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 42 states. [2018-11-23 11:59:04,420 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 42 states. [2018-11-23 11:59:04,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:04,423 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-23 11:59:04,423 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-23 11:59:04,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:04,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:04,424 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 46 states. [2018-11-23 11:59:04,424 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 46 states. [2018-11-23 11:59:04,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:04,427 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-23 11:59:04,427 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-23 11:59:04,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:04,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:04,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:04,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:04,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:59:04,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-11-23 11:59:04,431 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 29 [2018-11-23 11:59:04,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:04,431 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-11-23 11:59:04,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:59:04,431 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-23 11:59:04,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 11:59:04,432 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:04,433 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-11-23 11:59:04,433 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:04,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:04,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1304628388, now seen corresponding path program 3 times [2018-11-23 11:59:04,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:04,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:04,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:04,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:04,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:04,550 INFO L256 TraceCheckUtils]: 0: Hoare triple {1211#true} call ULTIMATE.init(); {1211#true} is VALID [2018-11-23 11:59:04,550 INFO L273 TraceCheckUtils]: 1: Hoare triple {1211#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1211#true} is VALID [2018-11-23 11:59:04,551 INFO L273 TraceCheckUtils]: 2: Hoare triple {1211#true} assume true; {1211#true} is VALID [2018-11-23 11:59:04,551 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1211#true} {1211#true} #91#return; {1211#true} is VALID [2018-11-23 11:59:04,551 INFO L256 TraceCheckUtils]: 4: Hoare triple {1211#true} call #t~ret11 := main(); {1211#true} is VALID [2018-11-23 11:59:04,552 INFO L273 TraceCheckUtils]: 5: Hoare triple {1211#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);havoc ~a~0;~a~0 := 0; {1213#(= main_~a~0 0)} is VALID [2018-11-23 11:59:04,557 INFO L273 TraceCheckUtils]: 6: Hoare triple {1213#(= 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; {1213#(= main_~a~0 0)} is VALID [2018-11-23 11:59:04,560 INFO L273 TraceCheckUtils]: 7: Hoare triple {1213#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1214#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:04,563 INFO L273 TraceCheckUtils]: 8: Hoare triple {1214#(<= 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; {1214#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:04,566 INFO L273 TraceCheckUtils]: 9: Hoare triple {1214#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1215#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:04,566 INFO L273 TraceCheckUtils]: 10: Hoare triple {1215#(<= 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; {1215#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:04,567 INFO L273 TraceCheckUtils]: 11: Hoare triple {1215#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1216#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:04,567 INFO L273 TraceCheckUtils]: 12: Hoare triple {1216#(<= main_~a~0 3)} assume !(~a~0 < 100000); {1212#false} is VALID [2018-11-23 11:59:04,568 INFO L273 TraceCheckUtils]: 13: Hoare triple {1212#false} havoc ~i~0;~i~0 := 0; {1212#false} is VALID [2018-11-23 11:59:04,568 INFO L273 TraceCheckUtils]: 14: Hoare triple {1212#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; {1212#false} is VALID [2018-11-23 11:59:04,568 INFO L273 TraceCheckUtils]: 15: Hoare triple {1212#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1212#false} is VALID [2018-11-23 11:59:04,568 INFO L273 TraceCheckUtils]: 16: Hoare triple {1212#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; {1212#false} is VALID [2018-11-23 11:59:04,569 INFO L273 TraceCheckUtils]: 17: Hoare triple {1212#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1212#false} is VALID [2018-11-23 11:59:04,569 INFO L273 TraceCheckUtils]: 18: Hoare triple {1212#false} assume !(~i~0 < 100000); {1212#false} is VALID [2018-11-23 11:59:04,570 INFO L273 TraceCheckUtils]: 19: Hoare triple {1212#false} ~i~0 := 0; {1212#false} is VALID [2018-11-23 11:59:04,570 INFO L273 TraceCheckUtils]: 20: Hoare triple {1212#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; {1212#false} is VALID [2018-11-23 11:59:04,571 INFO L273 TraceCheckUtils]: 21: Hoare triple {1212#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1212#false} is VALID [2018-11-23 11:59:04,571 INFO L273 TraceCheckUtils]: 22: Hoare triple {1212#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; {1212#false} is VALID [2018-11-23 11:59:04,571 INFO L273 TraceCheckUtils]: 23: Hoare triple {1212#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1212#false} is VALID [2018-11-23 11:59:04,571 INFO L273 TraceCheckUtils]: 24: Hoare triple {1212#false} assume !(~i~0 < 100000); {1212#false} is VALID [2018-11-23 11:59:04,572 INFO L273 TraceCheckUtils]: 25: Hoare triple {1212#false} ~i~0 := 0; {1212#false} is VALID [2018-11-23 11:59:04,572 INFO L273 TraceCheckUtils]: 26: Hoare triple {1212#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; {1212#false} is VALID [2018-11-23 11:59:04,572 INFO L273 TraceCheckUtils]: 27: Hoare triple {1212#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1212#false} is VALID [2018-11-23 11:59:04,572 INFO L273 TraceCheckUtils]: 28: Hoare triple {1212#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; {1212#false} is VALID [2018-11-23 11:59:04,572 INFO L273 TraceCheckUtils]: 29: Hoare triple {1212#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1212#false} is VALID [2018-11-23 11:59:04,573 INFO L273 TraceCheckUtils]: 30: Hoare triple {1212#false} assume !(~i~0 < 100000); {1212#false} is VALID [2018-11-23 11:59:04,573 INFO L273 TraceCheckUtils]: 31: Hoare triple {1212#false} havoc ~x~0;~x~0 := 0; {1212#false} is VALID [2018-11-23 11:59:04,573 INFO L273 TraceCheckUtils]: 32: Hoare triple {1212#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {1212#false} is VALID [2018-11-23 11:59:04,573 INFO L256 TraceCheckUtils]: 33: Hoare triple {1212#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {1212#false} is VALID [2018-11-23 11:59:04,573 INFO L273 TraceCheckUtils]: 34: Hoare triple {1212#false} ~cond := #in~cond; {1212#false} is VALID [2018-11-23 11:59:04,574 INFO L273 TraceCheckUtils]: 35: Hoare triple {1212#false} assume 0 == ~cond; {1212#false} is VALID [2018-11-23 11:59:04,574 INFO L273 TraceCheckUtils]: 36: Hoare triple {1212#false} assume !false; {1212#false} is VALID [2018-11-23 11:59:04,577 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 11:59:04,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:04,577 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:04,597 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:59:04,635 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:59:04,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:04,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:04,902 INFO L256 TraceCheckUtils]: 0: Hoare triple {1211#true} call ULTIMATE.init(); {1211#true} is VALID [2018-11-23 11:59:04,902 INFO L273 TraceCheckUtils]: 1: Hoare triple {1211#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1211#true} is VALID [2018-11-23 11:59:04,903 INFO L273 TraceCheckUtils]: 2: Hoare triple {1211#true} assume true; {1211#true} is VALID [2018-11-23 11:59:04,903 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1211#true} {1211#true} #91#return; {1211#true} is VALID [2018-11-23 11:59:04,903 INFO L256 TraceCheckUtils]: 4: Hoare triple {1211#true} call #t~ret11 := main(); {1211#true} is VALID [2018-11-23 11:59:04,903 INFO L273 TraceCheckUtils]: 5: Hoare triple {1211#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);havoc ~a~0;~a~0 := 0; {1211#true} is VALID [2018-11-23 11:59:04,904 INFO L273 TraceCheckUtils]: 6: Hoare triple {1211#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; {1211#true} is VALID [2018-11-23 11:59:04,904 INFO L273 TraceCheckUtils]: 7: Hoare triple {1211#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1211#true} is VALID [2018-11-23 11:59:04,904 INFO L273 TraceCheckUtils]: 8: Hoare triple {1211#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; {1211#true} is VALID [2018-11-23 11:59:04,904 INFO L273 TraceCheckUtils]: 9: Hoare triple {1211#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1211#true} is VALID [2018-11-23 11:59:04,905 INFO L273 TraceCheckUtils]: 10: Hoare triple {1211#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; {1211#true} is VALID [2018-11-23 11:59:04,905 INFO L273 TraceCheckUtils]: 11: Hoare triple {1211#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1211#true} is VALID [2018-11-23 11:59:04,905 INFO L273 TraceCheckUtils]: 12: Hoare triple {1211#true} assume !(~a~0 < 100000); {1211#true} is VALID [2018-11-23 11:59:04,905 INFO L273 TraceCheckUtils]: 13: Hoare triple {1211#true} havoc ~i~0;~i~0 := 0; {1211#true} is VALID [2018-11-23 11:59:04,906 INFO L273 TraceCheckUtils]: 14: Hoare triple {1211#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; {1211#true} is VALID [2018-11-23 11:59:04,906 INFO L273 TraceCheckUtils]: 15: Hoare triple {1211#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1211#true} is VALID [2018-11-23 11:59:04,906 INFO L273 TraceCheckUtils]: 16: Hoare triple {1211#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; {1211#true} is VALID [2018-11-23 11:59:04,907 INFO L273 TraceCheckUtils]: 17: Hoare triple {1211#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1211#true} is VALID [2018-11-23 11:59:04,907 INFO L273 TraceCheckUtils]: 18: Hoare triple {1211#true} assume !(~i~0 < 100000); {1211#true} is VALID [2018-11-23 11:59:04,909 INFO L273 TraceCheckUtils]: 19: Hoare triple {1211#true} ~i~0 := 0; {1277#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:04,910 INFO L273 TraceCheckUtils]: 20: Hoare triple {1277#(<= 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; {1277#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:04,910 INFO L273 TraceCheckUtils]: 21: Hoare triple {1277#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1284#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:04,912 INFO L273 TraceCheckUtils]: 22: Hoare triple {1284#(<= 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; {1284#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:04,914 INFO L273 TraceCheckUtils]: 23: Hoare triple {1284#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1291#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:04,914 INFO L273 TraceCheckUtils]: 24: Hoare triple {1291#(<= main_~i~0 2)} assume !(~i~0 < 100000); {1212#false} is VALID [2018-11-23 11:59:04,915 INFO L273 TraceCheckUtils]: 25: Hoare triple {1212#false} ~i~0 := 0; {1212#false} is VALID [2018-11-23 11:59:04,915 INFO L273 TraceCheckUtils]: 26: Hoare triple {1212#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; {1212#false} is VALID [2018-11-23 11:59:04,915 INFO L273 TraceCheckUtils]: 27: Hoare triple {1212#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1212#false} is VALID [2018-11-23 11:59:04,915 INFO L273 TraceCheckUtils]: 28: Hoare triple {1212#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; {1212#false} is VALID [2018-11-23 11:59:04,916 INFO L273 TraceCheckUtils]: 29: Hoare triple {1212#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1212#false} is VALID [2018-11-23 11:59:04,916 INFO L273 TraceCheckUtils]: 30: Hoare triple {1212#false} assume !(~i~0 < 100000); {1212#false} is VALID [2018-11-23 11:59:04,916 INFO L273 TraceCheckUtils]: 31: Hoare triple {1212#false} havoc ~x~0;~x~0 := 0; {1212#false} is VALID [2018-11-23 11:59:04,917 INFO L273 TraceCheckUtils]: 32: Hoare triple {1212#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {1212#false} is VALID [2018-11-23 11:59:04,917 INFO L256 TraceCheckUtils]: 33: Hoare triple {1212#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {1212#false} is VALID [2018-11-23 11:59:04,917 INFO L273 TraceCheckUtils]: 34: Hoare triple {1212#false} ~cond := #in~cond; {1212#false} is VALID [2018-11-23 11:59:04,918 INFO L273 TraceCheckUtils]: 35: Hoare triple {1212#false} assume 0 == ~cond; {1212#false} is VALID [2018-11-23 11:59:04,918 INFO L273 TraceCheckUtils]: 36: Hoare triple {1212#false} assume !false; {1212#false} is VALID [2018-11-23 11:59:04,920 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-23 11:59:04,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:04,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-11-23 11:59:04,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-11-23 11:59:04,948 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:04,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:59:05,027 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:05,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:59:05,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:59:05,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:59:05,028 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 9 states. [2018-11-23 11:59:05,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:05,300 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2018-11-23 11:59:05,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:59:05,301 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-11-23 11:59:05,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:05,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:59:05,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 85 transitions. [2018-11-23 11:59:05,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:59:05,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 85 transitions. [2018-11-23 11:59:05,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 85 transitions. [2018-11-23 11:59:05,434 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:05,438 INFO L225 Difference]: With dead ends: 83 [2018-11-23 11:59:05,438 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 11:59:05,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 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:05,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 11:59:05,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-11-23 11:59:05,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:05,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 50 states. [2018-11-23 11:59:05,468 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 50 states. [2018-11-23 11:59:05,468 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 50 states. [2018-11-23 11:59:05,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:05,471 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-11-23 11:59:05,472 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-23 11:59:05,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:05,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:05,473 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 54 states. [2018-11-23 11:59:05,473 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 54 states. [2018-11-23 11:59:05,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:05,475 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-11-23 11:59:05,476 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-23 11:59:05,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:05,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:05,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:05,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:05,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 11:59:05,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-23 11:59:05,479 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 37 [2018-11-23 11:59:05,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:05,480 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-23 11:59:05,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:59:05,480 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 11:59:05,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 11:59:05,481 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:05,481 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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] [2018-11-23 11:59:05,481 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:05,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:05,482 INFO L82 PathProgramCache]: Analyzing trace with hash 849823572, now seen corresponding path program 4 times [2018-11-23 11:59:05,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:05,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:05,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:05,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:05,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:05,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:05,666 INFO L256 TraceCheckUtils]: 0: Hoare triple {1631#true} call ULTIMATE.init(); {1631#true} is VALID [2018-11-23 11:59:05,667 INFO L273 TraceCheckUtils]: 1: Hoare triple {1631#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1631#true} is VALID [2018-11-23 11:59:05,667 INFO L273 TraceCheckUtils]: 2: Hoare triple {1631#true} assume true; {1631#true} is VALID [2018-11-23 11:59:05,667 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1631#true} {1631#true} #91#return; {1631#true} is VALID [2018-11-23 11:59:05,668 INFO L256 TraceCheckUtils]: 4: Hoare triple {1631#true} call #t~ret11 := main(); {1631#true} is VALID [2018-11-23 11:59:05,670 INFO L273 TraceCheckUtils]: 5: Hoare triple {1631#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);havoc ~a~0;~a~0 := 0; {1633#(= main_~a~0 0)} is VALID [2018-11-23 11:59:05,670 INFO L273 TraceCheckUtils]: 6: Hoare triple {1633#(= 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; {1633#(= main_~a~0 0)} is VALID [2018-11-23 11:59:05,671 INFO L273 TraceCheckUtils]: 7: Hoare triple {1633#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1634#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:05,672 INFO L273 TraceCheckUtils]: 8: Hoare triple {1634#(<= 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; {1634#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:05,676 INFO L273 TraceCheckUtils]: 9: Hoare triple {1634#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1635#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:05,680 INFO L273 TraceCheckUtils]: 10: Hoare triple {1635#(<= 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; {1635#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:05,681 INFO L273 TraceCheckUtils]: 11: Hoare triple {1635#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1636#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:05,682 INFO L273 TraceCheckUtils]: 12: Hoare triple {1636#(<= 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; {1636#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:05,682 INFO L273 TraceCheckUtils]: 13: Hoare triple {1636#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1637#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:05,683 INFO L273 TraceCheckUtils]: 14: Hoare triple {1637#(<= main_~a~0 4)} assume !(~a~0 < 100000); {1632#false} is VALID [2018-11-23 11:59:05,683 INFO L273 TraceCheckUtils]: 15: Hoare triple {1632#false} havoc ~i~0;~i~0 := 0; {1632#false} is VALID [2018-11-23 11:59:05,683 INFO L273 TraceCheckUtils]: 16: Hoare triple {1632#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; {1632#false} is VALID [2018-11-23 11:59:05,683 INFO L273 TraceCheckUtils]: 17: Hoare triple {1632#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1632#false} is VALID [2018-11-23 11:59:05,684 INFO L273 TraceCheckUtils]: 18: Hoare triple {1632#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; {1632#false} is VALID [2018-11-23 11:59:05,684 INFO L273 TraceCheckUtils]: 19: Hoare triple {1632#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1632#false} is VALID [2018-11-23 11:59:05,684 INFO L273 TraceCheckUtils]: 20: Hoare triple {1632#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; {1632#false} is VALID [2018-11-23 11:59:05,684 INFO L273 TraceCheckUtils]: 21: Hoare triple {1632#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1632#false} is VALID [2018-11-23 11:59:05,684 INFO L273 TraceCheckUtils]: 22: Hoare triple {1632#false} assume !(~i~0 < 100000); {1632#false} is VALID [2018-11-23 11:59:05,685 INFO L273 TraceCheckUtils]: 23: Hoare triple {1632#false} ~i~0 := 0; {1632#false} is VALID [2018-11-23 11:59:05,685 INFO L273 TraceCheckUtils]: 24: Hoare triple {1632#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; {1632#false} is VALID [2018-11-23 11:59:05,685 INFO L273 TraceCheckUtils]: 25: Hoare triple {1632#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1632#false} is VALID [2018-11-23 11:59:05,685 INFO L273 TraceCheckUtils]: 26: Hoare triple {1632#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; {1632#false} is VALID [2018-11-23 11:59:05,685 INFO L273 TraceCheckUtils]: 27: Hoare triple {1632#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1632#false} is VALID [2018-11-23 11:59:05,686 INFO L273 TraceCheckUtils]: 28: Hoare triple {1632#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; {1632#false} is VALID [2018-11-23 11:59:05,686 INFO L273 TraceCheckUtils]: 29: Hoare triple {1632#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1632#false} is VALID [2018-11-23 11:59:05,686 INFO L273 TraceCheckUtils]: 30: Hoare triple {1632#false} assume !(~i~0 < 100000); {1632#false} is VALID [2018-11-23 11:59:05,686 INFO L273 TraceCheckUtils]: 31: Hoare triple {1632#false} ~i~0 := 0; {1632#false} is VALID [2018-11-23 11:59:05,686 INFO L273 TraceCheckUtils]: 32: Hoare triple {1632#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; {1632#false} is VALID [2018-11-23 11:59:05,687 INFO L273 TraceCheckUtils]: 33: Hoare triple {1632#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1632#false} is VALID [2018-11-23 11:59:05,687 INFO L273 TraceCheckUtils]: 34: Hoare triple {1632#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; {1632#false} is VALID [2018-11-23 11:59:05,687 INFO L273 TraceCheckUtils]: 35: Hoare triple {1632#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1632#false} is VALID [2018-11-23 11:59:05,687 INFO L273 TraceCheckUtils]: 36: Hoare triple {1632#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; {1632#false} is VALID [2018-11-23 11:59:05,687 INFO L273 TraceCheckUtils]: 37: Hoare triple {1632#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1632#false} is VALID [2018-11-23 11:59:05,688 INFO L273 TraceCheckUtils]: 38: Hoare triple {1632#false} assume !(~i~0 < 100000); {1632#false} is VALID [2018-11-23 11:59:05,688 INFO L273 TraceCheckUtils]: 39: Hoare triple {1632#false} havoc ~x~0;~x~0 := 0; {1632#false} is VALID [2018-11-23 11:59:05,688 INFO L273 TraceCheckUtils]: 40: Hoare triple {1632#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {1632#false} is VALID [2018-11-23 11:59:05,688 INFO L256 TraceCheckUtils]: 41: Hoare triple {1632#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {1632#false} is VALID [2018-11-23 11:59:05,688 INFO L273 TraceCheckUtils]: 42: Hoare triple {1632#false} ~cond := #in~cond; {1632#false} is VALID [2018-11-23 11:59:05,689 INFO L273 TraceCheckUtils]: 43: Hoare triple {1632#false} assume 0 == ~cond; {1632#false} is VALID [2018-11-23 11:59:05,689 INFO L273 TraceCheckUtils]: 44: Hoare triple {1632#false} assume !false; {1632#false} is VALID [2018-11-23 11:59:05,691 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-23 11:59:05,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:05,692 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:05,701 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:59:05,754 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:59:05,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:05,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:05,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:06,248 INFO L256 TraceCheckUtils]: 0: Hoare triple {1631#true} call ULTIMATE.init(); {1631#true} is VALID [2018-11-23 11:59:06,249 INFO L273 TraceCheckUtils]: 1: Hoare triple {1631#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1631#true} is VALID [2018-11-23 11:59:06,249 INFO L273 TraceCheckUtils]: 2: Hoare triple {1631#true} assume true; {1631#true} is VALID [2018-11-23 11:59:06,250 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1631#true} {1631#true} #91#return; {1631#true} is VALID [2018-11-23 11:59:06,250 INFO L256 TraceCheckUtils]: 4: Hoare triple {1631#true} call #t~ret11 := main(); {1631#true} is VALID [2018-11-23 11:59:06,251 INFO L273 TraceCheckUtils]: 5: Hoare triple {1631#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);havoc ~a~0;~a~0 := 0; {1656#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:06,252 INFO L273 TraceCheckUtils]: 6: Hoare triple {1656#(<= 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; {1656#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:06,252 INFO L273 TraceCheckUtils]: 7: Hoare triple {1656#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1634#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:06,253 INFO L273 TraceCheckUtils]: 8: Hoare triple {1634#(<= 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; {1634#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:06,255 INFO L273 TraceCheckUtils]: 9: Hoare triple {1634#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1635#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:06,256 INFO L273 TraceCheckUtils]: 10: Hoare triple {1635#(<= 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; {1635#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:06,256 INFO L273 TraceCheckUtils]: 11: Hoare triple {1635#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1636#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:06,257 INFO L273 TraceCheckUtils]: 12: Hoare triple {1636#(<= 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; {1636#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:06,257 INFO L273 TraceCheckUtils]: 13: Hoare triple {1636#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1637#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:06,258 INFO L273 TraceCheckUtils]: 14: Hoare triple {1637#(<= main_~a~0 4)} assume !(~a~0 < 100000); {1632#false} is VALID [2018-11-23 11:59:06,258 INFO L273 TraceCheckUtils]: 15: Hoare triple {1632#false} havoc ~i~0;~i~0 := 0; {1632#false} is VALID [2018-11-23 11:59:06,259 INFO L273 TraceCheckUtils]: 16: Hoare triple {1632#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; {1632#false} is VALID [2018-11-23 11:59:06,259 INFO L273 TraceCheckUtils]: 17: Hoare triple {1632#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1632#false} is VALID [2018-11-23 11:59:06,259 INFO L273 TraceCheckUtils]: 18: Hoare triple {1632#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; {1632#false} is VALID [2018-11-23 11:59:06,259 INFO L273 TraceCheckUtils]: 19: Hoare triple {1632#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1632#false} is VALID [2018-11-23 11:59:06,260 INFO L273 TraceCheckUtils]: 20: Hoare triple {1632#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; {1632#false} is VALID [2018-11-23 11:59:06,260 INFO L273 TraceCheckUtils]: 21: Hoare triple {1632#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1632#false} is VALID [2018-11-23 11:59:06,260 INFO L273 TraceCheckUtils]: 22: Hoare triple {1632#false} assume !(~i~0 < 100000); {1632#false} is VALID [2018-11-23 11:59:06,260 INFO L273 TraceCheckUtils]: 23: Hoare triple {1632#false} ~i~0 := 0; {1632#false} is VALID [2018-11-23 11:59:06,261 INFO L273 TraceCheckUtils]: 24: Hoare triple {1632#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; {1632#false} is VALID [2018-11-23 11:59:06,261 INFO L273 TraceCheckUtils]: 25: Hoare triple {1632#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1632#false} is VALID [2018-11-23 11:59:06,261 INFO L273 TraceCheckUtils]: 26: Hoare triple {1632#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; {1632#false} is VALID [2018-11-23 11:59:06,261 INFO L273 TraceCheckUtils]: 27: Hoare triple {1632#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1632#false} is VALID [2018-11-23 11:59:06,261 INFO L273 TraceCheckUtils]: 28: Hoare triple {1632#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; {1632#false} is VALID [2018-11-23 11:59:06,262 INFO L273 TraceCheckUtils]: 29: Hoare triple {1632#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1632#false} is VALID [2018-11-23 11:59:06,262 INFO L273 TraceCheckUtils]: 30: Hoare triple {1632#false} assume !(~i~0 < 100000); {1632#false} is VALID [2018-11-23 11:59:06,262 INFO L273 TraceCheckUtils]: 31: Hoare triple {1632#false} ~i~0 := 0; {1632#false} is VALID [2018-11-23 11:59:06,262 INFO L273 TraceCheckUtils]: 32: Hoare triple {1632#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; {1632#false} is VALID [2018-11-23 11:59:06,262 INFO L273 TraceCheckUtils]: 33: Hoare triple {1632#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1632#false} is VALID [2018-11-23 11:59:06,262 INFO L273 TraceCheckUtils]: 34: Hoare triple {1632#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; {1632#false} is VALID [2018-11-23 11:59:06,262 INFO L273 TraceCheckUtils]: 35: Hoare triple {1632#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1632#false} is VALID [2018-11-23 11:59:06,263 INFO L273 TraceCheckUtils]: 36: Hoare triple {1632#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; {1632#false} is VALID [2018-11-23 11:59:06,263 INFO L273 TraceCheckUtils]: 37: Hoare triple {1632#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1632#false} is VALID [2018-11-23 11:59:06,263 INFO L273 TraceCheckUtils]: 38: Hoare triple {1632#false} assume !(~i~0 < 100000); {1632#false} is VALID [2018-11-23 11:59:06,263 INFO L273 TraceCheckUtils]: 39: Hoare triple {1632#false} havoc ~x~0;~x~0 := 0; {1632#false} is VALID [2018-11-23 11:59:06,263 INFO L273 TraceCheckUtils]: 40: Hoare triple {1632#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {1632#false} is VALID [2018-11-23 11:59:06,263 INFO L256 TraceCheckUtils]: 41: Hoare triple {1632#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {1632#false} is VALID [2018-11-23 11:59:06,263 INFO L273 TraceCheckUtils]: 42: Hoare triple {1632#false} ~cond := #in~cond; {1632#false} is VALID [2018-11-23 11:59:06,264 INFO L273 TraceCheckUtils]: 43: Hoare triple {1632#false} assume 0 == ~cond; {1632#false} is VALID [2018-11-23 11:59:06,264 INFO L273 TraceCheckUtils]: 44: Hoare triple {1632#false} assume !false; {1632#false} is VALID [2018-11-23 11:59:06,265 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-23 11:59:06,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:06,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 11:59:06,285 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-11-23 11:59:06,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:06,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:59:06,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:06,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:59:06,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:59:06,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:59:06,359 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 8 states. [2018-11-23 11:59:06,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:06,825 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2018-11-23 11:59:06,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:59:06,826 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-11-23 11:59:06,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:06,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:59:06,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2018-11-23 11:59:06,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:59:06,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2018-11-23 11:59:06,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 66 transitions. [2018-11-23 11:59:06,918 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:06,920 INFO L225 Difference]: With dead ends: 88 [2018-11-23 11:59:06,920 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 11:59:06,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 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:06,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 11:59:06,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-11-23 11:59:06,959 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:06,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 52 states. [2018-11-23 11:59:06,960 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 52 states. [2018-11-23 11:59:06,960 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 52 states. [2018-11-23 11:59:06,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:06,963 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-11-23 11:59:06,963 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-11-23 11:59:06,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:06,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:06,964 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 53 states. [2018-11-23 11:59:06,964 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 53 states. [2018-11-23 11:59:06,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:06,966 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-11-23 11:59:06,967 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-11-23 11:59:06,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:06,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:06,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:06,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:06,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 11:59:06,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-11-23 11:59:06,970 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 45 [2018-11-23 11:59:06,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:06,970 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-11-23 11:59:06,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:59:06,970 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 11:59:06,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 11:59:06,972 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:06,972 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 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] [2018-11-23 11:59:06,972 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:06,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:06,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1944957454, now seen corresponding path program 5 times [2018-11-23 11:59:06,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:06,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:06,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:06,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:06,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:07,150 INFO L256 TraceCheckUtils]: 0: Hoare triple {2084#true} call ULTIMATE.init(); {2084#true} is VALID [2018-11-23 11:59:07,150 INFO L273 TraceCheckUtils]: 1: Hoare triple {2084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2084#true} is VALID [2018-11-23 11:59:07,150 INFO L273 TraceCheckUtils]: 2: Hoare triple {2084#true} assume true; {2084#true} is VALID [2018-11-23 11:59:07,150 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2084#true} {2084#true} #91#return; {2084#true} is VALID [2018-11-23 11:59:07,151 INFO L256 TraceCheckUtils]: 4: Hoare triple {2084#true} call #t~ret11 := main(); {2084#true} is VALID [2018-11-23 11:59:07,151 INFO L273 TraceCheckUtils]: 5: Hoare triple {2084#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);havoc ~a~0;~a~0 := 0; {2086#(= main_~a~0 0)} is VALID [2018-11-23 11:59:07,151 INFO L273 TraceCheckUtils]: 6: Hoare triple {2086#(= 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; {2086#(= main_~a~0 0)} is VALID [2018-11-23 11:59:07,152 INFO L273 TraceCheckUtils]: 7: Hoare triple {2086#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2087#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:07,152 INFO L273 TraceCheckUtils]: 8: Hoare triple {2087#(<= 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; {2087#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:07,153 INFO L273 TraceCheckUtils]: 9: Hoare triple {2087#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2088#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:07,154 INFO L273 TraceCheckUtils]: 10: Hoare triple {2088#(<= 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; {2088#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:07,155 INFO L273 TraceCheckUtils]: 11: Hoare triple {2088#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2089#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:07,155 INFO L273 TraceCheckUtils]: 12: Hoare triple {2089#(<= 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; {2089#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:07,156 INFO L273 TraceCheckUtils]: 13: Hoare triple {2089#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2090#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:07,157 INFO L273 TraceCheckUtils]: 14: Hoare triple {2090#(<= 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; {2090#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:07,158 INFO L273 TraceCheckUtils]: 15: Hoare triple {2090#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2091#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:07,159 INFO L273 TraceCheckUtils]: 16: Hoare triple {2091#(<= main_~a~0 5)} assume !(~a~0 < 100000); {2085#false} is VALID [2018-11-23 11:59:07,159 INFO L273 TraceCheckUtils]: 17: Hoare triple {2085#false} havoc ~i~0;~i~0 := 0; {2085#false} is VALID [2018-11-23 11:59:07,159 INFO L273 TraceCheckUtils]: 18: Hoare triple {2085#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; {2085#false} is VALID [2018-11-23 11:59:07,160 INFO L273 TraceCheckUtils]: 19: Hoare triple {2085#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2085#false} is VALID [2018-11-23 11:59:07,160 INFO L273 TraceCheckUtils]: 20: Hoare triple {2085#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; {2085#false} is VALID [2018-11-23 11:59:07,161 INFO L273 TraceCheckUtils]: 21: Hoare triple {2085#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2085#false} is VALID [2018-11-23 11:59:07,161 INFO L273 TraceCheckUtils]: 22: Hoare triple {2085#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; {2085#false} is VALID [2018-11-23 11:59:07,161 INFO L273 TraceCheckUtils]: 23: Hoare triple {2085#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2085#false} is VALID [2018-11-23 11:59:07,162 INFO L273 TraceCheckUtils]: 24: Hoare triple {2085#false} assume !(~i~0 < 100000); {2085#false} is VALID [2018-11-23 11:59:07,162 INFO L273 TraceCheckUtils]: 25: Hoare triple {2085#false} ~i~0 := 0; {2085#false} is VALID [2018-11-23 11:59:07,162 INFO L273 TraceCheckUtils]: 26: Hoare triple {2085#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; {2085#false} is VALID [2018-11-23 11:59:07,163 INFO L273 TraceCheckUtils]: 27: Hoare triple {2085#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2085#false} is VALID [2018-11-23 11:59:07,163 INFO L273 TraceCheckUtils]: 28: Hoare triple {2085#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; {2085#false} is VALID [2018-11-23 11:59:07,164 INFO L273 TraceCheckUtils]: 29: Hoare triple {2085#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2085#false} is VALID [2018-11-23 11:59:07,164 INFO L273 TraceCheckUtils]: 30: Hoare triple {2085#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; {2085#false} is VALID [2018-11-23 11:59:07,164 INFO L273 TraceCheckUtils]: 31: Hoare triple {2085#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2085#false} is VALID [2018-11-23 11:59:07,165 INFO L273 TraceCheckUtils]: 32: Hoare triple {2085#false} assume !(~i~0 < 100000); {2085#false} is VALID [2018-11-23 11:59:07,165 INFO L273 TraceCheckUtils]: 33: Hoare triple {2085#false} ~i~0 := 0; {2085#false} is VALID [2018-11-23 11:59:07,165 INFO L273 TraceCheckUtils]: 34: Hoare triple {2085#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; {2085#false} is VALID [2018-11-23 11:59:07,165 INFO L273 TraceCheckUtils]: 35: Hoare triple {2085#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2085#false} is VALID [2018-11-23 11:59:07,165 INFO L273 TraceCheckUtils]: 36: Hoare triple {2085#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; {2085#false} is VALID [2018-11-23 11:59:07,166 INFO L273 TraceCheckUtils]: 37: Hoare triple {2085#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2085#false} is VALID [2018-11-23 11:59:07,166 INFO L273 TraceCheckUtils]: 38: Hoare triple {2085#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; {2085#false} is VALID [2018-11-23 11:59:07,166 INFO L273 TraceCheckUtils]: 39: Hoare triple {2085#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2085#false} is VALID [2018-11-23 11:59:07,166 INFO L273 TraceCheckUtils]: 40: Hoare triple {2085#false} assume !(~i~0 < 100000); {2085#false} is VALID [2018-11-23 11:59:07,167 INFO L273 TraceCheckUtils]: 41: Hoare triple {2085#false} havoc ~x~0;~x~0 := 0; {2085#false} is VALID [2018-11-23 11:59:07,167 INFO L273 TraceCheckUtils]: 42: Hoare triple {2085#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {2085#false} is VALID [2018-11-23 11:59:07,167 INFO L256 TraceCheckUtils]: 43: Hoare triple {2085#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {2085#false} is VALID [2018-11-23 11:59:07,167 INFO L273 TraceCheckUtils]: 44: Hoare triple {2085#false} ~cond := #in~cond; {2085#false} is VALID [2018-11-23 11:59:07,168 INFO L273 TraceCheckUtils]: 45: Hoare triple {2085#false} assume 0 == ~cond; {2085#false} is VALID [2018-11-23 11:59:07,168 INFO L273 TraceCheckUtils]: 46: Hoare triple {2085#false} assume !false; {2085#false} is VALID [2018-11-23 11:59:07,171 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-23 11:59:07,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:07,171 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:07,182 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:59:07,633 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 11:59:07,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:07,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:07,859 INFO L256 TraceCheckUtils]: 0: Hoare triple {2084#true} call ULTIMATE.init(); {2084#true} is VALID [2018-11-23 11:59:07,860 INFO L273 TraceCheckUtils]: 1: Hoare triple {2084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2084#true} is VALID [2018-11-23 11:59:07,860 INFO L273 TraceCheckUtils]: 2: Hoare triple {2084#true} assume true; {2084#true} is VALID [2018-11-23 11:59:07,860 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2084#true} {2084#true} #91#return; {2084#true} is VALID [2018-11-23 11:59:07,861 INFO L256 TraceCheckUtils]: 4: Hoare triple {2084#true} call #t~ret11 := main(); {2084#true} is VALID [2018-11-23 11:59:07,861 INFO L273 TraceCheckUtils]: 5: Hoare triple {2084#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);havoc ~a~0;~a~0 := 0; {2084#true} is VALID [2018-11-23 11:59:07,862 INFO L273 TraceCheckUtils]: 6: Hoare triple {2084#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; {2084#true} is VALID [2018-11-23 11:59:07,862 INFO L273 TraceCheckUtils]: 7: Hoare triple {2084#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2084#true} is VALID [2018-11-23 11:59:07,862 INFO L273 TraceCheckUtils]: 8: Hoare triple {2084#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; {2084#true} is VALID [2018-11-23 11:59:07,863 INFO L273 TraceCheckUtils]: 9: Hoare triple {2084#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2084#true} is VALID [2018-11-23 11:59:07,863 INFO L273 TraceCheckUtils]: 10: Hoare triple {2084#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; {2084#true} is VALID [2018-11-23 11:59:07,863 INFO L273 TraceCheckUtils]: 11: Hoare triple {2084#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2084#true} is VALID [2018-11-23 11:59:07,864 INFO L273 TraceCheckUtils]: 12: Hoare triple {2084#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; {2084#true} is VALID [2018-11-23 11:59:07,864 INFO L273 TraceCheckUtils]: 13: Hoare triple {2084#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2084#true} is VALID [2018-11-23 11:59:07,864 INFO L273 TraceCheckUtils]: 14: Hoare triple {2084#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; {2084#true} is VALID [2018-11-23 11:59:07,864 INFO L273 TraceCheckUtils]: 15: Hoare triple {2084#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2084#true} is VALID [2018-11-23 11:59:07,864 INFO L273 TraceCheckUtils]: 16: Hoare triple {2084#true} assume !(~a~0 < 100000); {2084#true} is VALID [2018-11-23 11:59:07,880 INFO L273 TraceCheckUtils]: 17: Hoare triple {2084#true} havoc ~i~0;~i~0 := 0; {2146#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:07,883 INFO L273 TraceCheckUtils]: 18: Hoare triple {2146#(<= 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; {2146#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:07,883 INFO L273 TraceCheckUtils]: 19: Hoare triple {2146#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2153#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:07,885 INFO L273 TraceCheckUtils]: 20: Hoare triple {2153#(<= 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; {2153#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:07,885 INFO L273 TraceCheckUtils]: 21: Hoare triple {2153#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2160#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:07,888 INFO L273 TraceCheckUtils]: 22: Hoare triple {2160#(<= 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; {2160#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:07,888 INFO L273 TraceCheckUtils]: 23: Hoare triple {2160#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2167#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:07,891 INFO L273 TraceCheckUtils]: 24: Hoare triple {2167#(<= main_~i~0 3)} assume !(~i~0 < 100000); {2085#false} is VALID [2018-11-23 11:59:07,891 INFO L273 TraceCheckUtils]: 25: Hoare triple {2085#false} ~i~0 := 0; {2085#false} is VALID [2018-11-23 11:59:07,891 INFO L273 TraceCheckUtils]: 26: Hoare triple {2085#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; {2085#false} is VALID [2018-11-23 11:59:07,891 INFO L273 TraceCheckUtils]: 27: Hoare triple {2085#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2085#false} is VALID [2018-11-23 11:59:07,891 INFO L273 TraceCheckUtils]: 28: Hoare triple {2085#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; {2085#false} is VALID [2018-11-23 11:59:07,891 INFO L273 TraceCheckUtils]: 29: Hoare triple {2085#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2085#false} is VALID [2018-11-23 11:59:07,891 INFO L273 TraceCheckUtils]: 30: Hoare triple {2085#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; {2085#false} is VALID [2018-11-23 11:59:07,892 INFO L273 TraceCheckUtils]: 31: Hoare triple {2085#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2085#false} is VALID [2018-11-23 11:59:07,892 INFO L273 TraceCheckUtils]: 32: Hoare triple {2085#false} assume !(~i~0 < 100000); {2085#false} is VALID [2018-11-23 11:59:07,892 INFO L273 TraceCheckUtils]: 33: Hoare triple {2085#false} ~i~0 := 0; {2085#false} is VALID [2018-11-23 11:59:07,892 INFO L273 TraceCheckUtils]: 34: Hoare triple {2085#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; {2085#false} is VALID [2018-11-23 11:59:07,892 INFO L273 TraceCheckUtils]: 35: Hoare triple {2085#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2085#false} is VALID [2018-11-23 11:59:07,892 INFO L273 TraceCheckUtils]: 36: Hoare triple {2085#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; {2085#false} is VALID [2018-11-23 11:59:07,892 INFO L273 TraceCheckUtils]: 37: Hoare triple {2085#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2085#false} is VALID [2018-11-23 11:59:07,893 INFO L273 TraceCheckUtils]: 38: Hoare triple {2085#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; {2085#false} is VALID [2018-11-23 11:59:07,893 INFO L273 TraceCheckUtils]: 39: Hoare triple {2085#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2085#false} is VALID [2018-11-23 11:59:07,893 INFO L273 TraceCheckUtils]: 40: Hoare triple {2085#false} assume !(~i~0 < 100000); {2085#false} is VALID [2018-11-23 11:59:07,893 INFO L273 TraceCheckUtils]: 41: Hoare triple {2085#false} havoc ~x~0;~x~0 := 0; {2085#false} is VALID [2018-11-23 11:59:07,893 INFO L273 TraceCheckUtils]: 42: Hoare triple {2085#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {2085#false} is VALID [2018-11-23 11:59:07,893 INFO L256 TraceCheckUtils]: 43: Hoare triple {2085#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {2085#false} is VALID [2018-11-23 11:59:07,893 INFO L273 TraceCheckUtils]: 44: Hoare triple {2085#false} ~cond := #in~cond; {2085#false} is VALID [2018-11-23 11:59:07,893 INFO L273 TraceCheckUtils]: 45: Hoare triple {2085#false} assume 0 == ~cond; {2085#false} is VALID [2018-11-23 11:59:07,894 INFO L273 TraceCheckUtils]: 46: Hoare triple {2085#false} assume !false; {2085#false} is VALID [2018-11-23 11:59:07,895 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-23 11:59:07,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:07,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-11-23 11:59:07,916 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-11-23 11:59:07,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:07,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:59:07,997 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:07,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:59:07,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:59:07,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:59:07,998 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 12 states. [2018-11-23 11:59:08,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:08,737 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2018-11-23 11:59:08,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:59:08,737 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-11-23 11:59:08,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:08,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:59:08,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 95 transitions. [2018-11-23 11:59:08,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:59:08,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 95 transitions. [2018-11-23 11:59:08,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 95 transitions. [2018-11-23 11:59:08,910 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 11:59:08,912 INFO L225 Difference]: With dead ends: 99 [2018-11-23 11:59:08,913 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 11:59:08,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:59:08,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 11:59:08,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-11-23 11:59:08,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:08,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 60 states. [2018-11-23 11:59:08,971 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 60 states. [2018-11-23 11:59:08,971 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 60 states. [2018-11-23 11:59:08,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:08,974 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-11-23 11:59:08,974 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-23 11:59:08,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:08,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:08,975 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 64 states. [2018-11-23 11:59:08,975 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 64 states. [2018-11-23 11:59:08,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:08,977 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-11-23 11:59:08,977 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-23 11:59:08,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:08,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:08,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:08,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:08,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 11:59:08,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-11-23 11:59:08,980 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 47 [2018-11-23 11:59:08,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:08,980 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-11-23 11:59:08,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:59:08,981 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-23 11:59:08,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 11:59:08,981 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:08,982 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 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] [2018-11-23 11:59:08,982 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:08,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:08,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1609757718, now seen corresponding path program 6 times [2018-11-23 11:59:08,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:08,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:08,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:08,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:08,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:09,214 INFO L256 TraceCheckUtils]: 0: Hoare triple {2596#true} call ULTIMATE.init(); {2596#true} is VALID [2018-11-23 11:59:09,214 INFO L273 TraceCheckUtils]: 1: Hoare triple {2596#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2596#true} is VALID [2018-11-23 11:59:09,214 INFO L273 TraceCheckUtils]: 2: Hoare triple {2596#true} assume true; {2596#true} is VALID [2018-11-23 11:59:09,216 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2596#true} {2596#true} #91#return; {2596#true} is VALID [2018-11-23 11:59:09,216 INFO L256 TraceCheckUtils]: 4: Hoare triple {2596#true} call #t~ret11 := main(); {2596#true} is VALID [2018-11-23 11:59:09,217 INFO L273 TraceCheckUtils]: 5: Hoare triple {2596#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);havoc ~a~0;~a~0 := 0; {2598#(= main_~a~0 0)} is VALID [2018-11-23 11:59:09,218 INFO L273 TraceCheckUtils]: 6: Hoare triple {2598#(= 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; {2598#(= main_~a~0 0)} is VALID [2018-11-23 11:59:09,218 INFO L273 TraceCheckUtils]: 7: Hoare triple {2598#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2599#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:09,218 INFO L273 TraceCheckUtils]: 8: Hoare triple {2599#(<= 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; {2599#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:09,219 INFO L273 TraceCheckUtils]: 9: Hoare triple {2599#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2600#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:09,219 INFO L273 TraceCheckUtils]: 10: Hoare triple {2600#(<= 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; {2600#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:09,220 INFO L273 TraceCheckUtils]: 11: Hoare triple {2600#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2601#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:09,220 INFO L273 TraceCheckUtils]: 12: Hoare triple {2601#(<= 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; {2601#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:09,221 INFO L273 TraceCheckUtils]: 13: Hoare triple {2601#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2602#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:09,222 INFO L273 TraceCheckUtils]: 14: Hoare triple {2602#(<= 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; {2602#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:09,222 INFO L273 TraceCheckUtils]: 15: Hoare triple {2602#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2603#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:09,223 INFO L273 TraceCheckUtils]: 16: Hoare triple {2603#(<= 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; {2603#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:09,224 INFO L273 TraceCheckUtils]: 17: Hoare triple {2603#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2604#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:09,225 INFO L273 TraceCheckUtils]: 18: Hoare triple {2604#(<= main_~a~0 6)} assume !(~a~0 < 100000); {2597#false} is VALID [2018-11-23 11:59:09,225 INFO L273 TraceCheckUtils]: 19: Hoare triple {2597#false} havoc ~i~0;~i~0 := 0; {2597#false} is VALID [2018-11-23 11:59:09,225 INFO L273 TraceCheckUtils]: 20: Hoare triple {2597#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; {2597#false} is VALID [2018-11-23 11:59:09,225 INFO L273 TraceCheckUtils]: 21: Hoare triple {2597#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2597#false} is VALID [2018-11-23 11:59:09,225 INFO L273 TraceCheckUtils]: 22: Hoare triple {2597#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; {2597#false} is VALID [2018-11-23 11:59:09,226 INFO L273 TraceCheckUtils]: 23: Hoare triple {2597#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2597#false} is VALID [2018-11-23 11:59:09,226 INFO L273 TraceCheckUtils]: 24: Hoare triple {2597#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; {2597#false} is VALID [2018-11-23 11:59:09,226 INFO L273 TraceCheckUtils]: 25: Hoare triple {2597#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2597#false} is VALID [2018-11-23 11:59:09,226 INFO L273 TraceCheckUtils]: 26: Hoare triple {2597#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; {2597#false} is VALID [2018-11-23 11:59:09,227 INFO L273 TraceCheckUtils]: 27: Hoare triple {2597#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2597#false} is VALID [2018-11-23 11:59:09,227 INFO L273 TraceCheckUtils]: 28: Hoare triple {2597#false} assume !(~i~0 < 100000); {2597#false} is VALID [2018-11-23 11:59:09,227 INFO L273 TraceCheckUtils]: 29: Hoare triple {2597#false} ~i~0 := 0; {2597#false} is VALID [2018-11-23 11:59:09,227 INFO L273 TraceCheckUtils]: 30: Hoare triple {2597#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; {2597#false} is VALID [2018-11-23 11:59:09,227 INFO L273 TraceCheckUtils]: 31: Hoare triple {2597#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2597#false} is VALID [2018-11-23 11:59:09,228 INFO L273 TraceCheckUtils]: 32: Hoare triple {2597#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; {2597#false} is VALID [2018-11-23 11:59:09,228 INFO L273 TraceCheckUtils]: 33: Hoare triple {2597#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2597#false} is VALID [2018-11-23 11:59:09,228 INFO L273 TraceCheckUtils]: 34: Hoare triple {2597#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; {2597#false} is VALID [2018-11-23 11:59:09,228 INFO L273 TraceCheckUtils]: 35: Hoare triple {2597#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2597#false} is VALID [2018-11-23 11:59:09,228 INFO L273 TraceCheckUtils]: 36: Hoare triple {2597#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; {2597#false} is VALID [2018-11-23 11:59:09,228 INFO L273 TraceCheckUtils]: 37: Hoare triple {2597#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2597#false} is VALID [2018-11-23 11:59:09,228 INFO L273 TraceCheckUtils]: 38: Hoare triple {2597#false} assume !(~i~0 < 100000); {2597#false} is VALID [2018-11-23 11:59:09,229 INFO L273 TraceCheckUtils]: 39: Hoare triple {2597#false} ~i~0 := 0; {2597#false} is VALID [2018-11-23 11:59:09,229 INFO L273 TraceCheckUtils]: 40: Hoare triple {2597#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; {2597#false} is VALID [2018-11-23 11:59:09,229 INFO L273 TraceCheckUtils]: 41: Hoare triple {2597#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2597#false} is VALID [2018-11-23 11:59:09,229 INFO L273 TraceCheckUtils]: 42: Hoare triple {2597#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; {2597#false} is VALID [2018-11-23 11:59:09,229 INFO L273 TraceCheckUtils]: 43: Hoare triple {2597#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2597#false} is VALID [2018-11-23 11:59:09,229 INFO L273 TraceCheckUtils]: 44: Hoare triple {2597#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; {2597#false} is VALID [2018-11-23 11:59:09,229 INFO L273 TraceCheckUtils]: 45: Hoare triple {2597#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2597#false} is VALID [2018-11-23 11:59:09,230 INFO L273 TraceCheckUtils]: 46: Hoare triple {2597#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; {2597#false} is VALID [2018-11-23 11:59:09,230 INFO L273 TraceCheckUtils]: 47: Hoare triple {2597#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2597#false} is VALID [2018-11-23 11:59:09,230 INFO L273 TraceCheckUtils]: 48: Hoare triple {2597#false} assume !(~i~0 < 100000); {2597#false} is VALID [2018-11-23 11:59:09,230 INFO L273 TraceCheckUtils]: 49: Hoare triple {2597#false} havoc ~x~0;~x~0 := 0; {2597#false} is VALID [2018-11-23 11:59:09,230 INFO L273 TraceCheckUtils]: 50: Hoare triple {2597#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {2597#false} is VALID [2018-11-23 11:59:09,230 INFO L256 TraceCheckUtils]: 51: Hoare triple {2597#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {2597#false} is VALID [2018-11-23 11:59:09,231 INFO L273 TraceCheckUtils]: 52: Hoare triple {2597#false} ~cond := #in~cond; {2597#false} is VALID [2018-11-23 11:59:09,231 INFO L273 TraceCheckUtils]: 53: Hoare triple {2597#false} assume 0 == ~cond; {2597#false} is VALID [2018-11-23 11:59:09,231 INFO L273 TraceCheckUtils]: 54: Hoare triple {2597#false} assume !false; {2597#false} is VALID [2018-11-23 11:59:09,233 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-23 11:59:09,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:09,233 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:09,244 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:59:09,357 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 11:59:09,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:09,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:09,537 INFO L256 TraceCheckUtils]: 0: Hoare triple {2596#true} call ULTIMATE.init(); {2596#true} is VALID [2018-11-23 11:59:09,538 INFO L273 TraceCheckUtils]: 1: Hoare triple {2596#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2596#true} is VALID [2018-11-23 11:59:09,538 INFO L273 TraceCheckUtils]: 2: Hoare triple {2596#true} assume true; {2596#true} is VALID [2018-11-23 11:59:09,538 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2596#true} {2596#true} #91#return; {2596#true} is VALID [2018-11-23 11:59:09,538 INFO L256 TraceCheckUtils]: 4: Hoare triple {2596#true} call #t~ret11 := main(); {2596#true} is VALID [2018-11-23 11:59:09,539 INFO L273 TraceCheckUtils]: 5: Hoare triple {2596#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);havoc ~a~0;~a~0 := 0; {2596#true} is VALID [2018-11-23 11:59:09,539 INFO L273 TraceCheckUtils]: 6: Hoare triple {2596#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; {2596#true} is VALID [2018-11-23 11:59:09,539 INFO L273 TraceCheckUtils]: 7: Hoare triple {2596#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2596#true} is VALID [2018-11-23 11:59:09,539 INFO L273 TraceCheckUtils]: 8: Hoare triple {2596#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; {2596#true} is VALID [2018-11-23 11:59:09,539 INFO L273 TraceCheckUtils]: 9: Hoare triple {2596#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2596#true} is VALID [2018-11-23 11:59:09,540 INFO L273 TraceCheckUtils]: 10: Hoare triple {2596#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; {2596#true} is VALID [2018-11-23 11:59:09,540 INFO L273 TraceCheckUtils]: 11: Hoare triple {2596#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2596#true} is VALID [2018-11-23 11:59:09,540 INFO L273 TraceCheckUtils]: 12: Hoare triple {2596#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; {2596#true} is VALID [2018-11-23 11:59:09,540 INFO L273 TraceCheckUtils]: 13: Hoare triple {2596#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2596#true} is VALID [2018-11-23 11:59:09,540 INFO L273 TraceCheckUtils]: 14: Hoare triple {2596#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; {2596#true} is VALID [2018-11-23 11:59:09,541 INFO L273 TraceCheckUtils]: 15: Hoare triple {2596#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2596#true} is VALID [2018-11-23 11:59:09,541 INFO L273 TraceCheckUtils]: 16: Hoare triple {2596#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; {2596#true} is VALID [2018-11-23 11:59:09,541 INFO L273 TraceCheckUtils]: 17: Hoare triple {2596#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2596#true} is VALID [2018-11-23 11:59:09,541 INFO L273 TraceCheckUtils]: 18: Hoare triple {2596#true} assume !(~a~0 < 100000); {2596#true} is VALID [2018-11-23 11:59:09,541 INFO L273 TraceCheckUtils]: 19: Hoare triple {2596#true} havoc ~i~0;~i~0 := 0; {2596#true} is VALID [2018-11-23 11:59:09,541 INFO L273 TraceCheckUtils]: 20: Hoare triple {2596#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; {2596#true} is VALID [2018-11-23 11:59:09,541 INFO L273 TraceCheckUtils]: 21: Hoare triple {2596#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2596#true} is VALID [2018-11-23 11:59:09,542 INFO L273 TraceCheckUtils]: 22: Hoare triple {2596#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; {2596#true} is VALID [2018-11-23 11:59:09,542 INFO L273 TraceCheckUtils]: 23: Hoare triple {2596#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2596#true} is VALID [2018-11-23 11:59:09,542 INFO L273 TraceCheckUtils]: 24: Hoare triple {2596#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; {2596#true} is VALID [2018-11-23 11:59:09,542 INFO L273 TraceCheckUtils]: 25: Hoare triple {2596#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2596#true} is VALID [2018-11-23 11:59:09,542 INFO L273 TraceCheckUtils]: 26: Hoare triple {2596#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; {2596#true} is VALID [2018-11-23 11:59:09,542 INFO L273 TraceCheckUtils]: 27: Hoare triple {2596#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2596#true} is VALID [2018-11-23 11:59:09,543 INFO L273 TraceCheckUtils]: 28: Hoare triple {2596#true} assume !(~i~0 < 100000); {2596#true} is VALID [2018-11-23 11:59:09,544 INFO L273 TraceCheckUtils]: 29: Hoare triple {2596#true} ~i~0 := 0; {2695#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:09,545 INFO L273 TraceCheckUtils]: 30: Hoare triple {2695#(<= 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; {2695#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:09,546 INFO L273 TraceCheckUtils]: 31: Hoare triple {2695#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2702#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:09,547 INFO L273 TraceCheckUtils]: 32: Hoare triple {2702#(<= 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; {2702#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:09,548 INFO L273 TraceCheckUtils]: 33: Hoare triple {2702#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2709#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:09,548 INFO L273 TraceCheckUtils]: 34: Hoare triple {2709#(<= 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; {2709#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:09,549 INFO L273 TraceCheckUtils]: 35: Hoare triple {2709#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2716#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:09,550 INFO L273 TraceCheckUtils]: 36: Hoare triple {2716#(<= 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; {2716#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:09,554 INFO L273 TraceCheckUtils]: 37: Hoare triple {2716#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2723#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:09,555 INFO L273 TraceCheckUtils]: 38: Hoare triple {2723#(<= main_~i~0 4)} assume !(~i~0 < 100000); {2597#false} is VALID [2018-11-23 11:59:09,555 INFO L273 TraceCheckUtils]: 39: Hoare triple {2597#false} ~i~0 := 0; {2597#false} is VALID [2018-11-23 11:59:09,555 INFO L273 TraceCheckUtils]: 40: Hoare triple {2597#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; {2597#false} is VALID [2018-11-23 11:59:09,555 INFO L273 TraceCheckUtils]: 41: Hoare triple {2597#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2597#false} is VALID [2018-11-23 11:59:09,555 INFO L273 TraceCheckUtils]: 42: Hoare triple {2597#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; {2597#false} is VALID [2018-11-23 11:59:09,556 INFO L273 TraceCheckUtils]: 43: Hoare triple {2597#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2597#false} is VALID [2018-11-23 11:59:09,556 INFO L273 TraceCheckUtils]: 44: Hoare triple {2597#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; {2597#false} is VALID [2018-11-23 11:59:09,556 INFO L273 TraceCheckUtils]: 45: Hoare triple {2597#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2597#false} is VALID [2018-11-23 11:59:09,556 INFO L273 TraceCheckUtils]: 46: Hoare triple {2597#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; {2597#false} is VALID [2018-11-23 11:59:09,556 INFO L273 TraceCheckUtils]: 47: Hoare triple {2597#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2597#false} is VALID [2018-11-23 11:59:09,557 INFO L273 TraceCheckUtils]: 48: Hoare triple {2597#false} assume !(~i~0 < 100000); {2597#false} is VALID [2018-11-23 11:59:09,557 INFO L273 TraceCheckUtils]: 49: Hoare triple {2597#false} havoc ~x~0;~x~0 := 0; {2597#false} is VALID [2018-11-23 11:59:09,557 INFO L273 TraceCheckUtils]: 50: Hoare triple {2597#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {2597#false} is VALID [2018-11-23 11:59:09,557 INFO L256 TraceCheckUtils]: 51: Hoare triple {2597#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {2597#false} is VALID [2018-11-23 11:59:09,558 INFO L273 TraceCheckUtils]: 52: Hoare triple {2597#false} ~cond := #in~cond; {2597#false} is VALID [2018-11-23 11:59:09,558 INFO L273 TraceCheckUtils]: 53: Hoare triple {2597#false} assume 0 == ~cond; {2597#false} is VALID [2018-11-23 11:59:09,558 INFO L273 TraceCheckUtils]: 54: Hoare triple {2597#false} assume !false; {2597#false} is VALID [2018-11-23 11:59:09,561 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-23 11:59:09,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:09,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2018-11-23 11:59:09,581 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-11-23 11:59:09,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:09,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:59:09,633 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:09,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:59:09,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:59:09,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:59:09,634 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 14 states. [2018-11-23 11:59:10,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:10,399 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2018-11-23 11:59:10,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:59:10,399 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-11-23 11:59:10,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:10,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:59:10,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 103 transitions. [2018-11-23 11:59:10,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:59:10,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 103 transitions. [2018-11-23 11:59:10,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 103 transitions. [2018-11-23 11:59:10,523 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:10,525 INFO L225 Difference]: With dead ends: 113 [2018-11-23 11:59:10,525 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 11:59:10,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:59:10,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 11:59:10,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2018-11-23 11:59:10,565 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:10,565 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 68 states. [2018-11-23 11:59:10,565 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 68 states. [2018-11-23 11:59:10,565 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 68 states. [2018-11-23 11:59:10,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:10,568 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-23 11:59:10,568 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 11:59:10,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:10,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:10,569 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 72 states. [2018-11-23 11:59:10,569 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 72 states. [2018-11-23 11:59:10,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:10,572 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-23 11:59:10,572 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 11:59:10,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:10,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:10,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:10,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:10,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 11:59:10,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-11-23 11:59:10,575 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 55 [2018-11-23 11:59:10,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:10,575 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-11-23 11:59:10,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:59:10,575 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-23 11:59:10,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 11:59:10,576 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:10,576 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 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] [2018-11-23 11:59:10,576 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:10,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:10,577 INFO L82 PathProgramCache]: Analyzing trace with hash 688370146, now seen corresponding path program 7 times [2018-11-23 11:59:10,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:10,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:10,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:10,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:10,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:10,825 INFO L256 TraceCheckUtils]: 0: Hoare triple {3183#true} call ULTIMATE.init(); {3183#true} is VALID [2018-11-23 11:59:10,825 INFO L273 TraceCheckUtils]: 1: Hoare triple {3183#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3183#true} is VALID [2018-11-23 11:59:10,825 INFO L273 TraceCheckUtils]: 2: Hoare triple {3183#true} assume true; {3183#true} is VALID [2018-11-23 11:59:10,825 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3183#true} {3183#true} #91#return; {3183#true} is VALID [2018-11-23 11:59:10,826 INFO L256 TraceCheckUtils]: 4: Hoare triple {3183#true} call #t~ret11 := main(); {3183#true} is VALID [2018-11-23 11:59:10,826 INFO L273 TraceCheckUtils]: 5: Hoare triple {3183#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);havoc ~a~0;~a~0 := 0; {3185#(= main_~a~0 0)} is VALID [2018-11-23 11:59:10,827 INFO L273 TraceCheckUtils]: 6: Hoare triple {3185#(= 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; {3185#(= main_~a~0 0)} is VALID [2018-11-23 11:59:10,827 INFO L273 TraceCheckUtils]: 7: Hoare triple {3185#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3186#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:10,828 INFO L273 TraceCheckUtils]: 8: Hoare triple {3186#(<= 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; {3186#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:10,828 INFO L273 TraceCheckUtils]: 9: Hoare triple {3186#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3187#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:10,828 INFO L273 TraceCheckUtils]: 10: Hoare triple {3187#(<= 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; {3187#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:10,829 INFO L273 TraceCheckUtils]: 11: Hoare triple {3187#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3188#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:10,829 INFO L273 TraceCheckUtils]: 12: Hoare triple {3188#(<= 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; {3188#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:10,830 INFO L273 TraceCheckUtils]: 13: Hoare triple {3188#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3189#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:10,831 INFO L273 TraceCheckUtils]: 14: Hoare triple {3189#(<= 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; {3189#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:10,831 INFO L273 TraceCheckUtils]: 15: Hoare triple {3189#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3190#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:10,832 INFO L273 TraceCheckUtils]: 16: Hoare triple {3190#(<= 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; {3190#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:10,833 INFO L273 TraceCheckUtils]: 17: Hoare triple {3190#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3191#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:10,833 INFO L273 TraceCheckUtils]: 18: Hoare triple {3191#(<= 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; {3191#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:10,834 INFO L273 TraceCheckUtils]: 19: Hoare triple {3191#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3192#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:10,835 INFO L273 TraceCheckUtils]: 20: Hoare triple {3192#(<= main_~a~0 7)} assume !(~a~0 < 100000); {3184#false} is VALID [2018-11-23 11:59:10,835 INFO L273 TraceCheckUtils]: 21: Hoare triple {3184#false} havoc ~i~0;~i~0 := 0; {3184#false} is VALID [2018-11-23 11:59:10,835 INFO L273 TraceCheckUtils]: 22: Hoare triple {3184#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; {3184#false} is VALID [2018-11-23 11:59:10,835 INFO L273 TraceCheckUtils]: 23: Hoare triple {3184#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3184#false} is VALID [2018-11-23 11:59:10,835 INFO L273 TraceCheckUtils]: 24: Hoare triple {3184#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; {3184#false} is VALID [2018-11-23 11:59:10,836 INFO L273 TraceCheckUtils]: 25: Hoare triple {3184#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3184#false} is VALID [2018-11-23 11:59:10,836 INFO L273 TraceCheckUtils]: 26: Hoare triple {3184#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; {3184#false} is VALID [2018-11-23 11:59:10,836 INFO L273 TraceCheckUtils]: 27: Hoare triple {3184#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3184#false} is VALID [2018-11-23 11:59:10,836 INFO L273 TraceCheckUtils]: 28: Hoare triple {3184#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; {3184#false} is VALID [2018-11-23 11:59:10,836 INFO L273 TraceCheckUtils]: 29: Hoare triple {3184#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3184#false} is VALID [2018-11-23 11:59:10,837 INFO L273 TraceCheckUtils]: 30: Hoare triple {3184#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; {3184#false} is VALID [2018-11-23 11:59:10,837 INFO L273 TraceCheckUtils]: 31: Hoare triple {3184#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3184#false} is VALID [2018-11-23 11:59:10,837 INFO L273 TraceCheckUtils]: 32: Hoare triple {3184#false} assume !(~i~0 < 100000); {3184#false} is VALID [2018-11-23 11:59:10,837 INFO L273 TraceCheckUtils]: 33: Hoare triple {3184#false} ~i~0 := 0; {3184#false} is VALID [2018-11-23 11:59:10,837 INFO L273 TraceCheckUtils]: 34: Hoare triple {3184#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; {3184#false} is VALID [2018-11-23 11:59:10,838 INFO L273 TraceCheckUtils]: 35: Hoare triple {3184#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3184#false} is VALID [2018-11-23 11:59:10,838 INFO L273 TraceCheckUtils]: 36: Hoare triple {3184#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; {3184#false} is VALID [2018-11-23 11:59:10,838 INFO L273 TraceCheckUtils]: 37: Hoare triple {3184#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3184#false} is VALID [2018-11-23 11:59:10,838 INFO L273 TraceCheckUtils]: 38: Hoare triple {3184#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; {3184#false} is VALID [2018-11-23 11:59:10,838 INFO L273 TraceCheckUtils]: 39: Hoare triple {3184#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3184#false} is VALID [2018-11-23 11:59:10,839 INFO L273 TraceCheckUtils]: 40: Hoare triple {3184#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; {3184#false} is VALID [2018-11-23 11:59:10,839 INFO L273 TraceCheckUtils]: 41: Hoare triple {3184#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3184#false} is VALID [2018-11-23 11:59:10,839 INFO L273 TraceCheckUtils]: 42: Hoare triple {3184#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; {3184#false} is VALID [2018-11-23 11:59:10,839 INFO L273 TraceCheckUtils]: 43: Hoare triple {3184#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3184#false} is VALID [2018-11-23 11:59:10,839 INFO L273 TraceCheckUtils]: 44: Hoare triple {3184#false} assume !(~i~0 < 100000); {3184#false} is VALID [2018-11-23 11:59:10,840 INFO L273 TraceCheckUtils]: 45: Hoare triple {3184#false} ~i~0 := 0; {3184#false} is VALID [2018-11-23 11:59:10,840 INFO L273 TraceCheckUtils]: 46: Hoare triple {3184#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; {3184#false} is VALID [2018-11-23 11:59:10,840 INFO L273 TraceCheckUtils]: 47: Hoare triple {3184#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3184#false} is VALID [2018-11-23 11:59:10,840 INFO L273 TraceCheckUtils]: 48: Hoare triple {3184#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; {3184#false} is VALID [2018-11-23 11:59:10,841 INFO L273 TraceCheckUtils]: 49: Hoare triple {3184#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3184#false} is VALID [2018-11-23 11:59:10,841 INFO L273 TraceCheckUtils]: 50: Hoare triple {3184#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; {3184#false} is VALID [2018-11-23 11:59:10,841 INFO L273 TraceCheckUtils]: 51: Hoare triple {3184#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3184#false} is VALID [2018-11-23 11:59:10,841 INFO L273 TraceCheckUtils]: 52: Hoare triple {3184#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; {3184#false} is VALID [2018-11-23 11:59:10,841 INFO L273 TraceCheckUtils]: 53: Hoare triple {3184#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3184#false} is VALID [2018-11-23 11:59:10,841 INFO L273 TraceCheckUtils]: 54: Hoare triple {3184#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; {3184#false} is VALID [2018-11-23 11:59:10,841 INFO L273 TraceCheckUtils]: 55: Hoare triple {3184#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3184#false} is VALID [2018-11-23 11:59:10,842 INFO L273 TraceCheckUtils]: 56: Hoare triple {3184#false} assume !(~i~0 < 100000); {3184#false} is VALID [2018-11-23 11:59:10,842 INFO L273 TraceCheckUtils]: 57: Hoare triple {3184#false} havoc ~x~0;~x~0 := 0; {3184#false} is VALID [2018-11-23 11:59:10,842 INFO L273 TraceCheckUtils]: 58: Hoare triple {3184#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {3184#false} is VALID [2018-11-23 11:59:10,842 INFO L256 TraceCheckUtils]: 59: Hoare triple {3184#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {3184#false} is VALID [2018-11-23 11:59:10,842 INFO L273 TraceCheckUtils]: 60: Hoare triple {3184#false} ~cond := #in~cond; {3184#false} is VALID [2018-11-23 11:59:10,842 INFO L273 TraceCheckUtils]: 61: Hoare triple {3184#false} assume 0 == ~cond; {3184#false} is VALID [2018-11-23 11:59:10,842 INFO L273 TraceCheckUtils]: 62: Hoare triple {3184#false} assume !false; {3184#false} is VALID [2018-11-23 11:59:10,844 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-23 11:59:10,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:10,844 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:10,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:10,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:11,007 INFO L256 TraceCheckUtils]: 0: Hoare triple {3183#true} call ULTIMATE.init(); {3183#true} is VALID [2018-11-23 11:59:11,007 INFO L273 TraceCheckUtils]: 1: Hoare triple {3183#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3183#true} is VALID [2018-11-23 11:59:11,008 INFO L273 TraceCheckUtils]: 2: Hoare triple {3183#true} assume true; {3183#true} is VALID [2018-11-23 11:59:11,008 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3183#true} {3183#true} #91#return; {3183#true} is VALID [2018-11-23 11:59:11,008 INFO L256 TraceCheckUtils]: 4: Hoare triple {3183#true} call #t~ret11 := main(); {3183#true} is VALID [2018-11-23 11:59:11,009 INFO L273 TraceCheckUtils]: 5: Hoare triple {3183#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);havoc ~a~0;~a~0 := 0; {3211#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:11,009 INFO L273 TraceCheckUtils]: 6: Hoare triple {3211#(<= 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; {3211#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:11,010 INFO L273 TraceCheckUtils]: 7: Hoare triple {3211#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3186#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:11,010 INFO L273 TraceCheckUtils]: 8: Hoare triple {3186#(<= 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; {3186#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:11,011 INFO L273 TraceCheckUtils]: 9: Hoare triple {3186#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3187#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:11,011 INFO L273 TraceCheckUtils]: 10: Hoare triple {3187#(<= 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; {3187#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:11,012 INFO L273 TraceCheckUtils]: 11: Hoare triple {3187#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3188#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:11,013 INFO L273 TraceCheckUtils]: 12: Hoare triple {3188#(<= 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; {3188#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:11,013 INFO L273 TraceCheckUtils]: 13: Hoare triple {3188#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3189#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:11,014 INFO L273 TraceCheckUtils]: 14: Hoare triple {3189#(<= 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; {3189#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:11,015 INFO L273 TraceCheckUtils]: 15: Hoare triple {3189#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3190#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:11,015 INFO L273 TraceCheckUtils]: 16: Hoare triple {3190#(<= 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; {3190#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:11,016 INFO L273 TraceCheckUtils]: 17: Hoare triple {3190#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3191#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:11,017 INFO L273 TraceCheckUtils]: 18: Hoare triple {3191#(<= 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; {3191#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:11,017 INFO L273 TraceCheckUtils]: 19: Hoare triple {3191#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3192#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:11,018 INFO L273 TraceCheckUtils]: 20: Hoare triple {3192#(<= main_~a~0 7)} assume !(~a~0 < 100000); {3184#false} is VALID [2018-11-23 11:59:11,018 INFO L273 TraceCheckUtils]: 21: Hoare triple {3184#false} havoc ~i~0;~i~0 := 0; {3184#false} is VALID [2018-11-23 11:59:11,019 INFO L273 TraceCheckUtils]: 22: Hoare triple {3184#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; {3184#false} is VALID [2018-11-23 11:59:11,019 INFO L273 TraceCheckUtils]: 23: Hoare triple {3184#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3184#false} is VALID [2018-11-23 11:59:11,019 INFO L273 TraceCheckUtils]: 24: Hoare triple {3184#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; {3184#false} is VALID [2018-11-23 11:59:11,019 INFO L273 TraceCheckUtils]: 25: Hoare triple {3184#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3184#false} is VALID [2018-11-23 11:59:11,019 INFO L273 TraceCheckUtils]: 26: Hoare triple {3184#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; {3184#false} is VALID [2018-11-23 11:59:11,020 INFO L273 TraceCheckUtils]: 27: Hoare triple {3184#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3184#false} is VALID [2018-11-23 11:59:11,020 INFO L273 TraceCheckUtils]: 28: Hoare triple {3184#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; {3184#false} is VALID [2018-11-23 11:59:11,020 INFO L273 TraceCheckUtils]: 29: Hoare triple {3184#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3184#false} is VALID [2018-11-23 11:59:11,020 INFO L273 TraceCheckUtils]: 30: Hoare triple {3184#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; {3184#false} is VALID [2018-11-23 11:59:11,021 INFO L273 TraceCheckUtils]: 31: Hoare triple {3184#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3184#false} is VALID [2018-11-23 11:59:11,021 INFO L273 TraceCheckUtils]: 32: Hoare triple {3184#false} assume !(~i~0 < 100000); {3184#false} is VALID [2018-11-23 11:59:11,021 INFO L273 TraceCheckUtils]: 33: Hoare triple {3184#false} ~i~0 := 0; {3184#false} is VALID [2018-11-23 11:59:11,021 INFO L273 TraceCheckUtils]: 34: Hoare triple {3184#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; {3184#false} is VALID [2018-11-23 11:59:11,021 INFO L273 TraceCheckUtils]: 35: Hoare triple {3184#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3184#false} is VALID [2018-11-23 11:59:11,022 INFO L273 TraceCheckUtils]: 36: Hoare triple {3184#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; {3184#false} is VALID [2018-11-23 11:59:11,022 INFO L273 TraceCheckUtils]: 37: Hoare triple {3184#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3184#false} is VALID [2018-11-23 11:59:11,022 INFO L273 TraceCheckUtils]: 38: Hoare triple {3184#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; {3184#false} is VALID [2018-11-23 11:59:11,022 INFO L273 TraceCheckUtils]: 39: Hoare triple {3184#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3184#false} is VALID [2018-11-23 11:59:11,022 INFO L273 TraceCheckUtils]: 40: Hoare triple {3184#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; {3184#false} is VALID [2018-11-23 11:59:11,023 INFO L273 TraceCheckUtils]: 41: Hoare triple {3184#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3184#false} is VALID [2018-11-23 11:59:11,023 INFO L273 TraceCheckUtils]: 42: Hoare triple {3184#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; {3184#false} is VALID [2018-11-23 11:59:11,023 INFO L273 TraceCheckUtils]: 43: Hoare triple {3184#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3184#false} is VALID [2018-11-23 11:59:11,023 INFO L273 TraceCheckUtils]: 44: Hoare triple {3184#false} assume !(~i~0 < 100000); {3184#false} is VALID [2018-11-23 11:59:11,023 INFO L273 TraceCheckUtils]: 45: Hoare triple {3184#false} ~i~0 := 0; {3184#false} is VALID [2018-11-23 11:59:11,024 INFO L273 TraceCheckUtils]: 46: Hoare triple {3184#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; {3184#false} is VALID [2018-11-23 11:59:11,024 INFO L273 TraceCheckUtils]: 47: Hoare triple {3184#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3184#false} is VALID [2018-11-23 11:59:11,024 INFO L273 TraceCheckUtils]: 48: Hoare triple {3184#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; {3184#false} is VALID [2018-11-23 11:59:11,024 INFO L273 TraceCheckUtils]: 49: Hoare triple {3184#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3184#false} is VALID [2018-11-23 11:59:11,024 INFO L273 TraceCheckUtils]: 50: Hoare triple {3184#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; {3184#false} is VALID [2018-11-23 11:59:11,024 INFO L273 TraceCheckUtils]: 51: Hoare triple {3184#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3184#false} is VALID [2018-11-23 11:59:11,024 INFO L273 TraceCheckUtils]: 52: Hoare triple {3184#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; {3184#false} is VALID [2018-11-23 11:59:11,024 INFO L273 TraceCheckUtils]: 53: Hoare triple {3184#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3184#false} is VALID [2018-11-23 11:59:11,025 INFO L273 TraceCheckUtils]: 54: Hoare triple {3184#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; {3184#false} is VALID [2018-11-23 11:59:11,025 INFO L273 TraceCheckUtils]: 55: Hoare triple {3184#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3184#false} is VALID [2018-11-23 11:59:11,025 INFO L273 TraceCheckUtils]: 56: Hoare triple {3184#false} assume !(~i~0 < 100000); {3184#false} is VALID [2018-11-23 11:59:11,025 INFO L273 TraceCheckUtils]: 57: Hoare triple {3184#false} havoc ~x~0;~x~0 := 0; {3184#false} is VALID [2018-11-23 11:59:11,025 INFO L273 TraceCheckUtils]: 58: Hoare triple {3184#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {3184#false} is VALID [2018-11-23 11:59:11,025 INFO L256 TraceCheckUtils]: 59: Hoare triple {3184#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {3184#false} is VALID [2018-11-23 11:59:11,025 INFO L273 TraceCheckUtils]: 60: Hoare triple {3184#false} ~cond := #in~cond; {3184#false} is VALID [2018-11-23 11:59:11,025 INFO L273 TraceCheckUtils]: 61: Hoare triple {3184#false} assume 0 == ~cond; {3184#false} is VALID [2018-11-23 11:59:11,026 INFO L273 TraceCheckUtils]: 62: Hoare triple {3184#false} assume !false; {3184#false} is VALID [2018-11-23 11:59:11,028 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-23 11:59:11,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:11,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 11:59:11,053 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2018-11-23 11:59:11,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:11,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:59:11,109 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:11,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:59:11,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:59:11,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:59:11,110 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 11 states. [2018-11-23 11:59:11,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:11,517 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2018-11-23 11:59:11,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:59:11,517 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2018-11-23 11:59:11,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:11,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:59:11,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 72 transitions. [2018-11-23 11:59:11,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:59:11,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 72 transitions. [2018-11-23 11:59:11,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 72 transitions. [2018-11-23 11:59:11,612 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:11,614 INFO L225 Difference]: With dead ends: 118 [2018-11-23 11:59:11,614 INFO L226 Difference]: Without dead ends: 71 [2018-11-23 11:59:11,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:59:11,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-23 11:59:11,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-11-23 11:59:11,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:11,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 70 states. [2018-11-23 11:59:11,645 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 70 states. [2018-11-23 11:59:11,645 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 70 states. [2018-11-23 11:59:11,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:11,647 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-11-23 11:59:11,647 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-23 11:59:11,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:11,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:11,648 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 71 states. [2018-11-23 11:59:11,648 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 71 states. [2018-11-23 11:59:11,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:11,649 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-11-23 11:59:11,649 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-23 11:59:11,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:11,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:11,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:11,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:11,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 11:59:11,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2018-11-23 11:59:11,651 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 63 [2018-11-23 11:59:11,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:11,652 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2018-11-23 11:59:11,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:59:11,652 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-23 11:59:11,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 11:59:11,652 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:11,653 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 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] [2018-11-23 11:59:11,653 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:11,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:11,653 INFO L82 PathProgramCache]: Analyzing trace with hash 187010304, now seen corresponding path program 8 times [2018-11-23 11:59:11,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:11,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:11,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:11,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:11,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:11,951 INFO L256 TraceCheckUtils]: 0: Hoare triple {3801#true} call ULTIMATE.init(); {3801#true} is VALID [2018-11-23 11:59:11,951 INFO L273 TraceCheckUtils]: 1: Hoare triple {3801#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3801#true} is VALID [2018-11-23 11:59:11,952 INFO L273 TraceCheckUtils]: 2: Hoare triple {3801#true} assume true; {3801#true} is VALID [2018-11-23 11:59:11,952 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3801#true} {3801#true} #91#return; {3801#true} is VALID [2018-11-23 11:59:11,952 INFO L256 TraceCheckUtils]: 4: Hoare triple {3801#true} call #t~ret11 := main(); {3801#true} is VALID [2018-11-23 11:59:11,953 INFO L273 TraceCheckUtils]: 5: Hoare triple {3801#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);havoc ~a~0;~a~0 := 0; {3803#(= main_~a~0 0)} is VALID [2018-11-23 11:59:11,953 INFO L273 TraceCheckUtils]: 6: Hoare triple {3803#(= 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; {3803#(= main_~a~0 0)} is VALID [2018-11-23 11:59:11,954 INFO L273 TraceCheckUtils]: 7: Hoare triple {3803#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3804#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:11,954 INFO L273 TraceCheckUtils]: 8: Hoare triple {3804#(<= 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; {3804#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:11,954 INFO L273 TraceCheckUtils]: 9: Hoare triple {3804#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3805#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:11,955 INFO L273 TraceCheckUtils]: 10: Hoare triple {3805#(<= 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; {3805#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:11,955 INFO L273 TraceCheckUtils]: 11: Hoare triple {3805#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3806#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:11,955 INFO L273 TraceCheckUtils]: 12: Hoare triple {3806#(<= 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; {3806#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:11,956 INFO L273 TraceCheckUtils]: 13: Hoare triple {3806#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3807#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:11,957 INFO L273 TraceCheckUtils]: 14: Hoare triple {3807#(<= 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; {3807#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:11,957 INFO L273 TraceCheckUtils]: 15: Hoare triple {3807#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3808#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:11,958 INFO L273 TraceCheckUtils]: 16: Hoare triple {3808#(<= 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; {3808#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:11,959 INFO L273 TraceCheckUtils]: 17: Hoare triple {3808#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3809#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:11,959 INFO L273 TraceCheckUtils]: 18: Hoare triple {3809#(<= 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; {3809#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:11,960 INFO L273 TraceCheckUtils]: 19: Hoare triple {3809#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3810#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:11,961 INFO L273 TraceCheckUtils]: 20: Hoare triple {3810#(<= 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; {3810#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:11,962 INFO L273 TraceCheckUtils]: 21: Hoare triple {3810#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3811#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:11,962 INFO L273 TraceCheckUtils]: 22: Hoare triple {3811#(<= main_~a~0 8)} assume !(~a~0 < 100000); {3802#false} is VALID [2018-11-23 11:59:11,962 INFO L273 TraceCheckUtils]: 23: Hoare triple {3802#false} havoc ~i~0;~i~0 := 0; {3802#false} is VALID [2018-11-23 11:59:11,963 INFO L273 TraceCheckUtils]: 24: Hoare triple {3802#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; {3802#false} is VALID [2018-11-23 11:59:11,963 INFO L273 TraceCheckUtils]: 25: Hoare triple {3802#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3802#false} is VALID [2018-11-23 11:59:11,963 INFO L273 TraceCheckUtils]: 26: Hoare triple {3802#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; {3802#false} is VALID [2018-11-23 11:59:11,963 INFO L273 TraceCheckUtils]: 27: Hoare triple {3802#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3802#false} is VALID [2018-11-23 11:59:11,964 INFO L273 TraceCheckUtils]: 28: Hoare triple {3802#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; {3802#false} is VALID [2018-11-23 11:59:11,964 INFO L273 TraceCheckUtils]: 29: Hoare triple {3802#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3802#false} is VALID [2018-11-23 11:59:11,964 INFO L273 TraceCheckUtils]: 30: Hoare triple {3802#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; {3802#false} is VALID [2018-11-23 11:59:11,964 INFO L273 TraceCheckUtils]: 31: Hoare triple {3802#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3802#false} is VALID [2018-11-23 11:59:11,964 INFO L273 TraceCheckUtils]: 32: Hoare triple {3802#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; {3802#false} is VALID [2018-11-23 11:59:11,965 INFO L273 TraceCheckUtils]: 33: Hoare triple {3802#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3802#false} is VALID [2018-11-23 11:59:11,965 INFO L273 TraceCheckUtils]: 34: Hoare triple {3802#false} assume !(~i~0 < 100000); {3802#false} is VALID [2018-11-23 11:59:11,965 INFO L273 TraceCheckUtils]: 35: Hoare triple {3802#false} ~i~0 := 0; {3802#false} is VALID [2018-11-23 11:59:11,965 INFO L273 TraceCheckUtils]: 36: Hoare triple {3802#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; {3802#false} is VALID [2018-11-23 11:59:11,965 INFO L273 TraceCheckUtils]: 37: Hoare triple {3802#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3802#false} is VALID [2018-11-23 11:59:11,965 INFO L273 TraceCheckUtils]: 38: Hoare triple {3802#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; {3802#false} is VALID [2018-11-23 11:59:11,966 INFO L273 TraceCheckUtils]: 39: Hoare triple {3802#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3802#false} is VALID [2018-11-23 11:59:11,966 INFO L273 TraceCheckUtils]: 40: Hoare triple {3802#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; {3802#false} is VALID [2018-11-23 11:59:11,966 INFO L273 TraceCheckUtils]: 41: Hoare triple {3802#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3802#false} is VALID [2018-11-23 11:59:11,966 INFO L273 TraceCheckUtils]: 42: Hoare triple {3802#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; {3802#false} is VALID [2018-11-23 11:59:11,966 INFO L273 TraceCheckUtils]: 43: Hoare triple {3802#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3802#false} is VALID [2018-11-23 11:59:11,966 INFO L273 TraceCheckUtils]: 44: Hoare triple {3802#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; {3802#false} is VALID [2018-11-23 11:59:11,966 INFO L273 TraceCheckUtils]: 45: Hoare triple {3802#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3802#false} is VALID [2018-11-23 11:59:11,966 INFO L273 TraceCheckUtils]: 46: Hoare triple {3802#false} assume !(~i~0 < 100000); {3802#false} is VALID [2018-11-23 11:59:11,967 INFO L273 TraceCheckUtils]: 47: Hoare triple {3802#false} ~i~0 := 0; {3802#false} is VALID [2018-11-23 11:59:11,967 INFO L273 TraceCheckUtils]: 48: Hoare triple {3802#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; {3802#false} is VALID [2018-11-23 11:59:11,967 INFO L273 TraceCheckUtils]: 49: Hoare triple {3802#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3802#false} is VALID [2018-11-23 11:59:11,967 INFO L273 TraceCheckUtils]: 50: Hoare triple {3802#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; {3802#false} is VALID [2018-11-23 11:59:11,967 INFO L273 TraceCheckUtils]: 51: Hoare triple {3802#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3802#false} is VALID [2018-11-23 11:59:11,967 INFO L273 TraceCheckUtils]: 52: Hoare triple {3802#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; {3802#false} is VALID [2018-11-23 11:59:11,967 INFO L273 TraceCheckUtils]: 53: Hoare triple {3802#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3802#false} is VALID [2018-11-23 11:59:11,967 INFO L273 TraceCheckUtils]: 54: Hoare triple {3802#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; {3802#false} is VALID [2018-11-23 11:59:11,968 INFO L273 TraceCheckUtils]: 55: Hoare triple {3802#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3802#false} is VALID [2018-11-23 11:59:11,968 INFO L273 TraceCheckUtils]: 56: Hoare triple {3802#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; {3802#false} is VALID [2018-11-23 11:59:11,968 INFO L273 TraceCheckUtils]: 57: Hoare triple {3802#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3802#false} is VALID [2018-11-23 11:59:11,968 INFO L273 TraceCheckUtils]: 58: Hoare triple {3802#false} assume !(~i~0 < 100000); {3802#false} is VALID [2018-11-23 11:59:11,968 INFO L273 TraceCheckUtils]: 59: Hoare triple {3802#false} havoc ~x~0;~x~0 := 0; {3802#false} is VALID [2018-11-23 11:59:11,968 INFO L273 TraceCheckUtils]: 60: Hoare triple {3802#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {3802#false} is VALID [2018-11-23 11:59:11,968 INFO L256 TraceCheckUtils]: 61: Hoare triple {3802#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {3802#false} is VALID [2018-11-23 11:59:11,968 INFO L273 TraceCheckUtils]: 62: Hoare triple {3802#false} ~cond := #in~cond; {3802#false} is VALID [2018-11-23 11:59:11,969 INFO L273 TraceCheckUtils]: 63: Hoare triple {3802#false} assume 0 == ~cond; {3802#false} is VALID [2018-11-23 11:59:11,969 INFO L273 TraceCheckUtils]: 64: Hoare triple {3802#false} assume !false; {3802#false} is VALID [2018-11-23 11:59:11,971 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-23 11:59:11,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:11,971 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:11,980 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:59:12,015 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:59:12,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:12,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:12,141 INFO L256 TraceCheckUtils]: 0: Hoare triple {3801#true} call ULTIMATE.init(); {3801#true} is VALID [2018-11-23 11:59:12,141 INFO L273 TraceCheckUtils]: 1: Hoare triple {3801#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3801#true} is VALID [2018-11-23 11:59:12,141 INFO L273 TraceCheckUtils]: 2: Hoare triple {3801#true} assume true; {3801#true} is VALID [2018-11-23 11:59:12,142 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3801#true} {3801#true} #91#return; {3801#true} is VALID [2018-11-23 11:59:12,142 INFO L256 TraceCheckUtils]: 4: Hoare triple {3801#true} call #t~ret11 := main(); {3801#true} is VALID [2018-11-23 11:59:12,143 INFO L273 TraceCheckUtils]: 5: Hoare triple {3801#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);havoc ~a~0;~a~0 := 0; {3830#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:12,143 INFO L273 TraceCheckUtils]: 6: Hoare triple {3830#(<= 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; {3830#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:12,144 INFO L273 TraceCheckUtils]: 7: Hoare triple {3830#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3804#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:12,144 INFO L273 TraceCheckUtils]: 8: Hoare triple {3804#(<= 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; {3804#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:12,145 INFO L273 TraceCheckUtils]: 9: Hoare triple {3804#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3805#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:12,145 INFO L273 TraceCheckUtils]: 10: Hoare triple {3805#(<= 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; {3805#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:12,146 INFO L273 TraceCheckUtils]: 11: Hoare triple {3805#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3806#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:12,151 INFO L273 TraceCheckUtils]: 12: Hoare triple {3806#(<= 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; {3806#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:12,152 INFO L273 TraceCheckUtils]: 13: Hoare triple {3806#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3807#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:12,152 INFO L273 TraceCheckUtils]: 14: Hoare triple {3807#(<= 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; {3807#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:12,152 INFO L273 TraceCheckUtils]: 15: Hoare triple {3807#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3808#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:12,153 INFO L273 TraceCheckUtils]: 16: Hoare triple {3808#(<= 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; {3808#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:12,153 INFO L273 TraceCheckUtils]: 17: Hoare triple {3808#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3809#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:12,154 INFO L273 TraceCheckUtils]: 18: Hoare triple {3809#(<= 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; {3809#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:12,154 INFO L273 TraceCheckUtils]: 19: Hoare triple {3809#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3810#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:12,155 INFO L273 TraceCheckUtils]: 20: Hoare triple {3810#(<= 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; {3810#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:12,155 INFO L273 TraceCheckUtils]: 21: Hoare triple {3810#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3811#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:12,156 INFO L273 TraceCheckUtils]: 22: Hoare triple {3811#(<= main_~a~0 8)} assume !(~a~0 < 100000); {3802#false} is VALID [2018-11-23 11:59:12,156 INFO L273 TraceCheckUtils]: 23: Hoare triple {3802#false} havoc ~i~0;~i~0 := 0; {3802#false} is VALID [2018-11-23 11:59:12,156 INFO L273 TraceCheckUtils]: 24: Hoare triple {3802#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; {3802#false} is VALID [2018-11-23 11:59:12,157 INFO L273 TraceCheckUtils]: 25: Hoare triple {3802#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3802#false} is VALID [2018-11-23 11:59:12,157 INFO L273 TraceCheckUtils]: 26: Hoare triple {3802#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; {3802#false} is VALID [2018-11-23 11:59:12,157 INFO L273 TraceCheckUtils]: 27: Hoare triple {3802#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3802#false} is VALID [2018-11-23 11:59:12,157 INFO L273 TraceCheckUtils]: 28: Hoare triple {3802#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; {3802#false} is VALID [2018-11-23 11:59:12,158 INFO L273 TraceCheckUtils]: 29: Hoare triple {3802#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3802#false} is VALID [2018-11-23 11:59:12,158 INFO L273 TraceCheckUtils]: 30: Hoare triple {3802#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; {3802#false} is VALID [2018-11-23 11:59:12,158 INFO L273 TraceCheckUtils]: 31: Hoare triple {3802#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3802#false} is VALID [2018-11-23 11:59:12,158 INFO L273 TraceCheckUtils]: 32: Hoare triple {3802#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; {3802#false} is VALID [2018-11-23 11:59:12,158 INFO L273 TraceCheckUtils]: 33: Hoare triple {3802#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3802#false} is VALID [2018-11-23 11:59:12,159 INFO L273 TraceCheckUtils]: 34: Hoare triple {3802#false} assume !(~i~0 < 100000); {3802#false} is VALID [2018-11-23 11:59:12,159 INFO L273 TraceCheckUtils]: 35: Hoare triple {3802#false} ~i~0 := 0; {3802#false} is VALID [2018-11-23 11:59:12,159 INFO L273 TraceCheckUtils]: 36: Hoare triple {3802#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; {3802#false} is VALID [2018-11-23 11:59:12,159 INFO L273 TraceCheckUtils]: 37: Hoare triple {3802#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3802#false} is VALID [2018-11-23 11:59:12,159 INFO L273 TraceCheckUtils]: 38: Hoare triple {3802#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; {3802#false} is VALID [2018-11-23 11:59:12,159 INFO L273 TraceCheckUtils]: 39: Hoare triple {3802#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3802#false} is VALID [2018-11-23 11:59:12,160 INFO L273 TraceCheckUtils]: 40: Hoare triple {3802#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; {3802#false} is VALID [2018-11-23 11:59:12,160 INFO L273 TraceCheckUtils]: 41: Hoare triple {3802#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3802#false} is VALID [2018-11-23 11:59:12,160 INFO L273 TraceCheckUtils]: 42: Hoare triple {3802#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; {3802#false} is VALID [2018-11-23 11:59:12,160 INFO L273 TraceCheckUtils]: 43: Hoare triple {3802#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3802#false} is VALID [2018-11-23 11:59:12,160 INFO L273 TraceCheckUtils]: 44: Hoare triple {3802#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; {3802#false} is VALID [2018-11-23 11:59:12,160 INFO L273 TraceCheckUtils]: 45: Hoare triple {3802#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3802#false} is VALID [2018-11-23 11:59:12,161 INFO L273 TraceCheckUtils]: 46: Hoare triple {3802#false} assume !(~i~0 < 100000); {3802#false} is VALID [2018-11-23 11:59:12,161 INFO L273 TraceCheckUtils]: 47: Hoare triple {3802#false} ~i~0 := 0; {3802#false} is VALID [2018-11-23 11:59:12,161 INFO L273 TraceCheckUtils]: 48: Hoare triple {3802#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; {3802#false} is VALID [2018-11-23 11:59:12,161 INFO L273 TraceCheckUtils]: 49: Hoare triple {3802#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3802#false} is VALID [2018-11-23 11:59:12,161 INFO L273 TraceCheckUtils]: 50: Hoare triple {3802#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; {3802#false} is VALID [2018-11-23 11:59:12,161 INFO L273 TraceCheckUtils]: 51: Hoare triple {3802#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3802#false} is VALID [2018-11-23 11:59:12,162 INFO L273 TraceCheckUtils]: 52: Hoare triple {3802#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; {3802#false} is VALID [2018-11-23 11:59:12,162 INFO L273 TraceCheckUtils]: 53: Hoare triple {3802#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3802#false} is VALID [2018-11-23 11:59:12,162 INFO L273 TraceCheckUtils]: 54: Hoare triple {3802#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; {3802#false} is VALID [2018-11-23 11:59:12,162 INFO L273 TraceCheckUtils]: 55: Hoare triple {3802#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3802#false} is VALID [2018-11-23 11:59:12,162 INFO L273 TraceCheckUtils]: 56: Hoare triple {3802#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; {3802#false} is VALID [2018-11-23 11:59:12,162 INFO L273 TraceCheckUtils]: 57: Hoare triple {3802#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3802#false} is VALID [2018-11-23 11:59:12,163 INFO L273 TraceCheckUtils]: 58: Hoare triple {3802#false} assume !(~i~0 < 100000); {3802#false} is VALID [2018-11-23 11:59:12,163 INFO L273 TraceCheckUtils]: 59: Hoare triple {3802#false} havoc ~x~0;~x~0 := 0; {3802#false} is VALID [2018-11-23 11:59:12,163 INFO L273 TraceCheckUtils]: 60: Hoare triple {3802#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {3802#false} is VALID [2018-11-23 11:59:12,163 INFO L256 TraceCheckUtils]: 61: Hoare triple {3802#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {3802#false} is VALID [2018-11-23 11:59:12,163 INFO L273 TraceCheckUtils]: 62: Hoare triple {3802#false} ~cond := #in~cond; {3802#false} is VALID [2018-11-23 11:59:12,164 INFO L273 TraceCheckUtils]: 63: Hoare triple {3802#false} assume 0 == ~cond; {3802#false} is VALID [2018-11-23 11:59:12,164 INFO L273 TraceCheckUtils]: 64: Hoare triple {3802#false} assume !false; {3802#false} is VALID [2018-11-23 11:59:12,167 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-23 11:59:12,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:12,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 11:59:12,197 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2018-11-23 11:59:12,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:12,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:59:12,293 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:12,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:59:12,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:59:12,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:59:12,294 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 12 states. [2018-11-23 11:59:12,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:12,516 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2018-11-23 11:59:12,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:59:12,516 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2018-11-23 11:59:12,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:12,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:59:12,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-23 11:59:12,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:59:12,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-23 11:59:12,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 74 transitions. [2018-11-23 11:59:12,631 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:12,633 INFO L225 Difference]: With dead ends: 120 [2018-11-23 11:59:12,633 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 11:59:12,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:59:12,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 11:59:12,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-11-23 11:59:12,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:12,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 72 states. [2018-11-23 11:59:12,668 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 72 states. [2018-11-23 11:59:12,669 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 72 states. [2018-11-23 11:59:12,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:12,670 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-11-23 11:59:12,670 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-11-23 11:59:12,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:12,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:12,671 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 73 states. [2018-11-23 11:59:12,671 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 73 states. [2018-11-23 11:59:12,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:12,672 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-11-23 11:59:12,672 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-11-23 11:59:12,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:12,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:12,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:12,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:12,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 11:59:12,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-11-23 11:59:12,675 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 65 [2018-11-23 11:59:12,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:12,675 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-11-23 11:59:12,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:59:12,676 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 11:59:12,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 11:59:12,676 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:12,677 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 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] [2018-11-23 11:59:12,677 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:12,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:12,677 INFO L82 PathProgramCache]: Analyzing trace with hash -583460706, now seen corresponding path program 9 times [2018-11-23 11:59:12,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:12,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:12,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:12,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:12,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:12,889 INFO L256 TraceCheckUtils]: 0: Hoare triple {4436#true} call ULTIMATE.init(); {4436#true} is VALID [2018-11-23 11:59:12,889 INFO L273 TraceCheckUtils]: 1: Hoare triple {4436#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4436#true} is VALID [2018-11-23 11:59:12,890 INFO L273 TraceCheckUtils]: 2: Hoare triple {4436#true} assume true; {4436#true} is VALID [2018-11-23 11:59:12,890 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4436#true} {4436#true} #91#return; {4436#true} is VALID [2018-11-23 11:59:12,890 INFO L256 TraceCheckUtils]: 4: Hoare triple {4436#true} call #t~ret11 := main(); {4436#true} is VALID [2018-11-23 11:59:12,891 INFO L273 TraceCheckUtils]: 5: Hoare triple {4436#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);havoc ~a~0;~a~0 := 0; {4438#(= main_~a~0 0)} is VALID [2018-11-23 11:59:12,891 INFO L273 TraceCheckUtils]: 6: Hoare triple {4438#(= 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; {4438#(= main_~a~0 0)} is VALID [2018-11-23 11:59:12,892 INFO L273 TraceCheckUtils]: 7: Hoare triple {4438#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4439#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:12,892 INFO L273 TraceCheckUtils]: 8: Hoare triple {4439#(<= 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; {4439#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:12,893 INFO L273 TraceCheckUtils]: 9: Hoare triple {4439#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4440#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:12,893 INFO L273 TraceCheckUtils]: 10: Hoare triple {4440#(<= 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; {4440#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:12,893 INFO L273 TraceCheckUtils]: 11: Hoare triple {4440#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4441#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:12,894 INFO L273 TraceCheckUtils]: 12: Hoare triple {4441#(<= 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; {4441#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:12,895 INFO L273 TraceCheckUtils]: 13: Hoare triple {4441#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4442#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:12,895 INFO L273 TraceCheckUtils]: 14: Hoare triple {4442#(<= 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; {4442#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:12,896 INFO L273 TraceCheckUtils]: 15: Hoare triple {4442#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4443#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:12,896 INFO L273 TraceCheckUtils]: 16: Hoare triple {4443#(<= 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; {4443#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:12,897 INFO L273 TraceCheckUtils]: 17: Hoare triple {4443#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4444#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:12,898 INFO L273 TraceCheckUtils]: 18: Hoare triple {4444#(<= 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; {4444#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:12,898 INFO L273 TraceCheckUtils]: 19: Hoare triple {4444#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4445#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:12,899 INFO L273 TraceCheckUtils]: 20: Hoare triple {4445#(<= 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; {4445#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:12,900 INFO L273 TraceCheckUtils]: 21: Hoare triple {4445#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4446#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:12,900 INFO L273 TraceCheckUtils]: 22: Hoare triple {4446#(<= 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; {4446#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:12,901 INFO L273 TraceCheckUtils]: 23: Hoare triple {4446#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4447#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:12,902 INFO L273 TraceCheckUtils]: 24: Hoare triple {4447#(<= main_~a~0 9)} assume !(~a~0 < 100000); {4437#false} is VALID [2018-11-23 11:59:12,902 INFO L273 TraceCheckUtils]: 25: Hoare triple {4437#false} havoc ~i~0;~i~0 := 0; {4437#false} is VALID [2018-11-23 11:59:12,902 INFO L273 TraceCheckUtils]: 26: Hoare triple {4437#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; {4437#false} is VALID [2018-11-23 11:59:12,903 INFO L273 TraceCheckUtils]: 27: Hoare triple {4437#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4437#false} is VALID [2018-11-23 11:59:12,903 INFO L273 TraceCheckUtils]: 28: Hoare triple {4437#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; {4437#false} is VALID [2018-11-23 11:59:12,903 INFO L273 TraceCheckUtils]: 29: Hoare triple {4437#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4437#false} is VALID [2018-11-23 11:59:12,904 INFO L273 TraceCheckUtils]: 30: Hoare triple {4437#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; {4437#false} is VALID [2018-11-23 11:59:12,904 INFO L273 TraceCheckUtils]: 31: Hoare triple {4437#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4437#false} is VALID [2018-11-23 11:59:12,904 INFO L273 TraceCheckUtils]: 32: Hoare triple {4437#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; {4437#false} is VALID [2018-11-23 11:59:12,904 INFO L273 TraceCheckUtils]: 33: Hoare triple {4437#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4437#false} is VALID [2018-11-23 11:59:12,905 INFO L273 TraceCheckUtils]: 34: Hoare triple {4437#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; {4437#false} is VALID [2018-11-23 11:59:12,905 INFO L273 TraceCheckUtils]: 35: Hoare triple {4437#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4437#false} is VALID [2018-11-23 11:59:12,906 INFO L273 TraceCheckUtils]: 36: Hoare triple {4437#false} assume !(~i~0 < 100000); {4437#false} is VALID [2018-11-23 11:59:12,906 INFO L273 TraceCheckUtils]: 37: Hoare triple {4437#false} ~i~0 := 0; {4437#false} is VALID [2018-11-23 11:59:12,906 INFO L273 TraceCheckUtils]: 38: Hoare triple {4437#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; {4437#false} is VALID [2018-11-23 11:59:12,906 INFO L273 TraceCheckUtils]: 39: Hoare triple {4437#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4437#false} is VALID [2018-11-23 11:59:12,906 INFO L273 TraceCheckUtils]: 40: Hoare triple {4437#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; {4437#false} is VALID [2018-11-23 11:59:12,907 INFO L273 TraceCheckUtils]: 41: Hoare triple {4437#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4437#false} is VALID [2018-11-23 11:59:12,907 INFO L273 TraceCheckUtils]: 42: Hoare triple {4437#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; {4437#false} is VALID [2018-11-23 11:59:12,907 INFO L273 TraceCheckUtils]: 43: Hoare triple {4437#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4437#false} is VALID [2018-11-23 11:59:12,907 INFO L273 TraceCheckUtils]: 44: Hoare triple {4437#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; {4437#false} is VALID [2018-11-23 11:59:12,908 INFO L273 TraceCheckUtils]: 45: Hoare triple {4437#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4437#false} is VALID [2018-11-23 11:59:12,908 INFO L273 TraceCheckUtils]: 46: Hoare triple {4437#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; {4437#false} is VALID [2018-11-23 11:59:12,908 INFO L273 TraceCheckUtils]: 47: Hoare triple {4437#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4437#false} is VALID [2018-11-23 11:59:12,908 INFO L273 TraceCheckUtils]: 48: Hoare triple {4437#false} assume !(~i~0 < 100000); {4437#false} is VALID [2018-11-23 11:59:12,908 INFO L273 TraceCheckUtils]: 49: Hoare triple {4437#false} ~i~0 := 0; {4437#false} is VALID [2018-11-23 11:59:12,909 INFO L273 TraceCheckUtils]: 50: Hoare triple {4437#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; {4437#false} is VALID [2018-11-23 11:59:12,909 INFO L273 TraceCheckUtils]: 51: Hoare triple {4437#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4437#false} is VALID [2018-11-23 11:59:12,909 INFO L273 TraceCheckUtils]: 52: Hoare triple {4437#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; {4437#false} is VALID [2018-11-23 11:59:12,909 INFO L273 TraceCheckUtils]: 53: Hoare triple {4437#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4437#false} is VALID [2018-11-23 11:59:12,909 INFO L273 TraceCheckUtils]: 54: Hoare triple {4437#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; {4437#false} is VALID [2018-11-23 11:59:12,910 INFO L273 TraceCheckUtils]: 55: Hoare triple {4437#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4437#false} is VALID [2018-11-23 11:59:12,910 INFO L273 TraceCheckUtils]: 56: Hoare triple {4437#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; {4437#false} is VALID [2018-11-23 11:59:12,910 INFO L273 TraceCheckUtils]: 57: Hoare triple {4437#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4437#false} is VALID [2018-11-23 11:59:12,910 INFO L273 TraceCheckUtils]: 58: Hoare triple {4437#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; {4437#false} is VALID [2018-11-23 11:59:12,911 INFO L273 TraceCheckUtils]: 59: Hoare triple {4437#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4437#false} is VALID [2018-11-23 11:59:12,911 INFO L273 TraceCheckUtils]: 60: Hoare triple {4437#false} assume !(~i~0 < 100000); {4437#false} is VALID [2018-11-23 11:59:12,911 INFO L273 TraceCheckUtils]: 61: Hoare triple {4437#false} havoc ~x~0;~x~0 := 0; {4437#false} is VALID [2018-11-23 11:59:12,911 INFO L273 TraceCheckUtils]: 62: Hoare triple {4437#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {4437#false} is VALID [2018-11-23 11:59:12,911 INFO L256 TraceCheckUtils]: 63: Hoare triple {4437#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {4437#false} is VALID [2018-11-23 11:59:12,912 INFO L273 TraceCheckUtils]: 64: Hoare triple {4437#false} ~cond := #in~cond; {4437#false} is VALID [2018-11-23 11:59:12,912 INFO L273 TraceCheckUtils]: 65: Hoare triple {4437#false} assume 0 == ~cond; {4437#false} is VALID [2018-11-23 11:59:12,912 INFO L273 TraceCheckUtils]: 66: Hoare triple {4437#false} assume !false; {4437#false} is VALID [2018-11-23 11:59:12,917 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-23 11:59:12,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:12,918 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:12,929 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:59:13,111 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 11:59:13,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:13,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:13,486 INFO L256 TraceCheckUtils]: 0: Hoare triple {4436#true} call ULTIMATE.init(); {4436#true} is VALID [2018-11-23 11:59:13,486 INFO L273 TraceCheckUtils]: 1: Hoare triple {4436#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4436#true} is VALID [2018-11-23 11:59:13,487 INFO L273 TraceCheckUtils]: 2: Hoare triple {4436#true} assume true; {4436#true} is VALID [2018-11-23 11:59:13,487 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4436#true} {4436#true} #91#return; {4436#true} is VALID [2018-11-23 11:59:13,487 INFO L256 TraceCheckUtils]: 4: Hoare triple {4436#true} call #t~ret11 := main(); {4436#true} is VALID [2018-11-23 11:59:13,488 INFO L273 TraceCheckUtils]: 5: Hoare triple {4436#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);havoc ~a~0;~a~0 := 0; {4436#true} is VALID [2018-11-23 11:59:13,488 INFO L273 TraceCheckUtils]: 6: Hoare triple {4436#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; {4436#true} is VALID [2018-11-23 11:59:13,488 INFO L273 TraceCheckUtils]: 7: Hoare triple {4436#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4436#true} is VALID [2018-11-23 11:59:13,488 INFO L273 TraceCheckUtils]: 8: Hoare triple {4436#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; {4436#true} is VALID [2018-11-23 11:59:13,489 INFO L273 TraceCheckUtils]: 9: Hoare triple {4436#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4436#true} is VALID [2018-11-23 11:59:13,489 INFO L273 TraceCheckUtils]: 10: Hoare triple {4436#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; {4436#true} is VALID [2018-11-23 11:59:13,489 INFO L273 TraceCheckUtils]: 11: Hoare triple {4436#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4436#true} is VALID [2018-11-23 11:59:13,489 INFO L273 TraceCheckUtils]: 12: Hoare triple {4436#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; {4436#true} is VALID [2018-11-23 11:59:13,490 INFO L273 TraceCheckUtils]: 13: Hoare triple {4436#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4436#true} is VALID [2018-11-23 11:59:13,490 INFO L273 TraceCheckUtils]: 14: Hoare triple {4436#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; {4436#true} is VALID [2018-11-23 11:59:13,490 INFO L273 TraceCheckUtils]: 15: Hoare triple {4436#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4436#true} is VALID [2018-11-23 11:59:13,490 INFO L273 TraceCheckUtils]: 16: Hoare triple {4436#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; {4436#true} is VALID [2018-11-23 11:59:13,490 INFO L273 TraceCheckUtils]: 17: Hoare triple {4436#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4436#true} is VALID [2018-11-23 11:59:13,490 INFO L273 TraceCheckUtils]: 18: Hoare triple {4436#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; {4436#true} is VALID [2018-11-23 11:59:13,491 INFO L273 TraceCheckUtils]: 19: Hoare triple {4436#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4436#true} is VALID [2018-11-23 11:59:13,491 INFO L273 TraceCheckUtils]: 20: Hoare triple {4436#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; {4436#true} is VALID [2018-11-23 11:59:13,491 INFO L273 TraceCheckUtils]: 21: Hoare triple {4436#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4436#true} is VALID [2018-11-23 11:59:13,491 INFO L273 TraceCheckUtils]: 22: Hoare triple {4436#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; {4436#true} is VALID [2018-11-23 11:59:13,491 INFO L273 TraceCheckUtils]: 23: Hoare triple {4436#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4436#true} is VALID [2018-11-23 11:59:13,491 INFO L273 TraceCheckUtils]: 24: Hoare triple {4436#true} assume !(~a~0 < 100000); {4436#true} is VALID [2018-11-23 11:59:13,491 INFO L273 TraceCheckUtils]: 25: Hoare triple {4436#true} havoc ~i~0;~i~0 := 0; {4436#true} is VALID [2018-11-23 11:59:13,492 INFO L273 TraceCheckUtils]: 26: Hoare triple {4436#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; {4436#true} is VALID [2018-11-23 11:59:13,492 INFO L273 TraceCheckUtils]: 27: Hoare triple {4436#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4436#true} is VALID [2018-11-23 11:59:13,492 INFO L273 TraceCheckUtils]: 28: Hoare triple {4436#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; {4436#true} is VALID [2018-11-23 11:59:13,492 INFO L273 TraceCheckUtils]: 29: Hoare triple {4436#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4436#true} is VALID [2018-11-23 11:59:13,492 INFO L273 TraceCheckUtils]: 30: Hoare triple {4436#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; {4436#true} is VALID [2018-11-23 11:59:13,492 INFO L273 TraceCheckUtils]: 31: Hoare triple {4436#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4436#true} is VALID [2018-11-23 11:59:13,493 INFO L273 TraceCheckUtils]: 32: Hoare triple {4436#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; {4436#true} is VALID [2018-11-23 11:59:13,493 INFO L273 TraceCheckUtils]: 33: Hoare triple {4436#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4436#true} is VALID [2018-11-23 11:59:13,493 INFO L273 TraceCheckUtils]: 34: Hoare triple {4436#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; {4436#true} is VALID [2018-11-23 11:59:13,493 INFO L273 TraceCheckUtils]: 35: Hoare triple {4436#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4436#true} is VALID [2018-11-23 11:59:13,493 INFO L273 TraceCheckUtils]: 36: Hoare triple {4436#true} assume !(~i~0 < 100000); {4436#true} is VALID [2018-11-23 11:59:13,493 INFO L273 TraceCheckUtils]: 37: Hoare triple {4436#true} ~i~0 := 0; {4436#true} is VALID [2018-11-23 11:59:13,494 INFO L273 TraceCheckUtils]: 38: Hoare triple {4436#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; {4436#true} is VALID [2018-11-23 11:59:13,494 INFO L273 TraceCheckUtils]: 39: Hoare triple {4436#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4436#true} is VALID [2018-11-23 11:59:13,494 INFO L273 TraceCheckUtils]: 40: Hoare triple {4436#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; {4436#true} is VALID [2018-11-23 11:59:13,494 INFO L273 TraceCheckUtils]: 41: Hoare triple {4436#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4436#true} is VALID [2018-11-23 11:59:13,494 INFO L273 TraceCheckUtils]: 42: Hoare triple {4436#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; {4436#true} is VALID [2018-11-23 11:59:13,494 INFO L273 TraceCheckUtils]: 43: Hoare triple {4436#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4436#true} is VALID [2018-11-23 11:59:13,494 INFO L273 TraceCheckUtils]: 44: Hoare triple {4436#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; {4436#true} is VALID [2018-11-23 11:59:13,495 INFO L273 TraceCheckUtils]: 45: Hoare triple {4436#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4436#true} is VALID [2018-11-23 11:59:13,495 INFO L273 TraceCheckUtils]: 46: Hoare triple {4436#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; {4436#true} is VALID [2018-11-23 11:59:13,495 INFO L273 TraceCheckUtils]: 47: Hoare triple {4436#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4436#true} is VALID [2018-11-23 11:59:13,495 INFO L273 TraceCheckUtils]: 48: Hoare triple {4436#true} assume !(~i~0 < 100000); {4436#true} is VALID [2018-11-23 11:59:13,496 INFO L273 TraceCheckUtils]: 49: Hoare triple {4436#true} ~i~0 := 0; {4598#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:13,496 INFO L273 TraceCheckUtils]: 50: Hoare triple {4598#(<= 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; {4598#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:13,496 INFO L273 TraceCheckUtils]: 51: Hoare triple {4598#(<= main_~i~0 0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4605#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:13,497 INFO L273 TraceCheckUtils]: 52: Hoare triple {4605#(<= 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; {4605#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:13,497 INFO L273 TraceCheckUtils]: 53: Hoare triple {4605#(<= main_~i~0 1)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4612#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:13,498 INFO L273 TraceCheckUtils]: 54: Hoare triple {4612#(<= 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; {4612#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:13,501 INFO L273 TraceCheckUtils]: 55: Hoare triple {4612#(<= main_~i~0 2)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4619#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:13,502 INFO L273 TraceCheckUtils]: 56: Hoare triple {4619#(<= 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; {4619#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:13,502 INFO L273 TraceCheckUtils]: 57: Hoare triple {4619#(<= main_~i~0 3)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4626#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:13,503 INFO L273 TraceCheckUtils]: 58: Hoare triple {4626#(<= 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; {4626#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:13,503 INFO L273 TraceCheckUtils]: 59: Hoare triple {4626#(<= main_~i~0 4)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4633#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:13,504 INFO L273 TraceCheckUtils]: 60: Hoare triple {4633#(<= main_~i~0 5)} assume !(~i~0 < 100000); {4437#false} is VALID [2018-11-23 11:59:13,504 INFO L273 TraceCheckUtils]: 61: Hoare triple {4437#false} havoc ~x~0;~x~0 := 0; {4437#false} is VALID [2018-11-23 11:59:13,504 INFO L273 TraceCheckUtils]: 62: Hoare triple {4437#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {4437#false} is VALID [2018-11-23 11:59:13,504 INFO L256 TraceCheckUtils]: 63: Hoare triple {4437#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {4437#false} is VALID [2018-11-23 11:59:13,504 INFO L273 TraceCheckUtils]: 64: Hoare triple {4437#false} ~cond := #in~cond; {4437#false} is VALID [2018-11-23 11:59:13,504 INFO L273 TraceCheckUtils]: 65: Hoare triple {4437#false} assume 0 == ~cond; {4437#false} is VALID [2018-11-23 11:59:13,505 INFO L273 TraceCheckUtils]: 66: Hoare triple {4437#false} assume !false; {4437#false} is VALID [2018-11-23 11:59:13,510 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-11-23 11:59:13,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:13,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2018-11-23 11:59:13,530 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2018-11-23 11:59:13,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:13,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:59:13,600 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:13,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:59:13,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:59:13,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:59:13,601 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 18 states. [2018-11-23 11:59:14,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:14,296 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2018-11-23 11:59:14,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:59:14,296 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2018-11-23 11:59:14,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:14,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:59:14,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 115 transitions. [2018-11-23 11:59:14,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:59:14,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 115 transitions. [2018-11-23 11:59:14,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 115 transitions. [2018-11-23 11:59:14,860 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:14,862 INFO L225 Difference]: With dead ends: 131 [2018-11-23 11:59:14,863 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 11:59:14,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 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:14,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 11:59:15,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2018-11-23 11:59:15,347 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:15,347 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 80 states. [2018-11-23 11:59:15,347 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 80 states. [2018-11-23 11:59:15,347 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 80 states. [2018-11-23 11:59:15,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:15,349 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2018-11-23 11:59:15,349 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-11-23 11:59:15,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:15,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:15,350 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 84 states. [2018-11-23 11:59:15,350 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 84 states. [2018-11-23 11:59:15,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:15,351 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2018-11-23 11:59:15,352 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-11-23 11:59:15,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:15,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:15,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:15,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:15,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 11:59:15,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-11-23 11:59:15,354 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 67 [2018-11-23 11:59:15,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:15,355 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-11-23 11:59:15,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:59:15,355 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-11-23 11:59:15,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 11:59:15,356 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:15,356 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 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] [2018-11-23 11:59:15,356 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:15,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:15,356 INFO L82 PathProgramCache]: Analyzing trace with hash -443077994, now seen corresponding path program 10 times [2018-11-23 11:59:15,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:15,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:15,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:15,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:15,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:15,974 INFO L256 TraceCheckUtils]: 0: Hoare triple {5132#true} call ULTIMATE.init(); {5132#true} is VALID [2018-11-23 11:59:15,974 INFO L273 TraceCheckUtils]: 1: Hoare triple {5132#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5132#true} is VALID [2018-11-23 11:59:15,975 INFO L273 TraceCheckUtils]: 2: Hoare triple {5132#true} assume true; {5132#true} is VALID [2018-11-23 11:59:15,975 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5132#true} {5132#true} #91#return; {5132#true} is VALID [2018-11-23 11:59:15,975 INFO L256 TraceCheckUtils]: 4: Hoare triple {5132#true} call #t~ret11 := main(); {5132#true} is VALID [2018-11-23 11:59:15,976 INFO L273 TraceCheckUtils]: 5: Hoare triple {5132#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);havoc ~a~0;~a~0 := 0; {5134#(= main_~a~0 0)} is VALID [2018-11-23 11:59:15,976 INFO L273 TraceCheckUtils]: 6: Hoare triple {5134#(= 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; {5134#(= main_~a~0 0)} is VALID [2018-11-23 11:59:15,976 INFO L273 TraceCheckUtils]: 7: Hoare triple {5134#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5135#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:15,977 INFO L273 TraceCheckUtils]: 8: Hoare triple {5135#(<= 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; {5135#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:15,979 INFO L273 TraceCheckUtils]: 9: Hoare triple {5135#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5136#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:15,980 INFO L273 TraceCheckUtils]: 10: Hoare triple {5136#(<= 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; {5136#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:15,980 INFO L273 TraceCheckUtils]: 11: Hoare triple {5136#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5137#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:15,981 INFO L273 TraceCheckUtils]: 12: Hoare triple {5137#(<= 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; {5137#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:15,981 INFO L273 TraceCheckUtils]: 13: Hoare triple {5137#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5138#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:15,981 INFO L273 TraceCheckUtils]: 14: Hoare triple {5138#(<= 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; {5138#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:15,982 INFO L273 TraceCheckUtils]: 15: Hoare triple {5138#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5139#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:15,982 INFO L273 TraceCheckUtils]: 16: Hoare triple {5139#(<= 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; {5139#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:15,983 INFO L273 TraceCheckUtils]: 17: Hoare triple {5139#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5140#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:15,984 INFO L273 TraceCheckUtils]: 18: Hoare triple {5140#(<= 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; {5140#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:15,985 INFO L273 TraceCheckUtils]: 19: Hoare triple {5140#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5141#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:15,985 INFO L273 TraceCheckUtils]: 20: Hoare triple {5141#(<= 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; {5141#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:15,986 INFO L273 TraceCheckUtils]: 21: Hoare triple {5141#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5142#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:15,986 INFO L273 TraceCheckUtils]: 22: Hoare triple {5142#(<= 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; {5142#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:15,987 INFO L273 TraceCheckUtils]: 23: Hoare triple {5142#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5143#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:15,988 INFO L273 TraceCheckUtils]: 24: Hoare triple {5143#(<= 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; {5143#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:15,989 INFO L273 TraceCheckUtils]: 25: Hoare triple {5143#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5144#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:16,009 INFO L273 TraceCheckUtils]: 26: Hoare triple {5144#(<= main_~a~0 10)} assume !(~a~0 < 100000); {5133#false} is VALID [2018-11-23 11:59:16,009 INFO L273 TraceCheckUtils]: 27: Hoare triple {5133#false} havoc ~i~0;~i~0 := 0; {5133#false} is VALID [2018-11-23 11:59:16,009 INFO L273 TraceCheckUtils]: 28: Hoare triple {5133#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; {5133#false} is VALID [2018-11-23 11:59:16,009 INFO L273 TraceCheckUtils]: 29: Hoare triple {5133#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5133#false} is VALID [2018-11-23 11:59:16,010 INFO L273 TraceCheckUtils]: 30: Hoare triple {5133#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; {5133#false} is VALID [2018-11-23 11:59:16,010 INFO L273 TraceCheckUtils]: 31: Hoare triple {5133#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5133#false} is VALID [2018-11-23 11:59:16,010 INFO L273 TraceCheckUtils]: 32: Hoare triple {5133#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; {5133#false} is VALID [2018-11-23 11:59:16,010 INFO L273 TraceCheckUtils]: 33: Hoare triple {5133#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5133#false} is VALID [2018-11-23 11:59:16,010 INFO L273 TraceCheckUtils]: 34: Hoare triple {5133#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; {5133#false} is VALID [2018-11-23 11:59:16,011 INFO L273 TraceCheckUtils]: 35: Hoare triple {5133#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5133#false} is VALID [2018-11-23 11:59:16,011 INFO L273 TraceCheckUtils]: 36: Hoare triple {5133#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; {5133#false} is VALID [2018-11-23 11:59:16,011 INFO L273 TraceCheckUtils]: 37: Hoare triple {5133#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5133#false} is VALID [2018-11-23 11:59:16,011 INFO L273 TraceCheckUtils]: 38: Hoare triple {5133#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; {5133#false} is VALID [2018-11-23 11:59:16,011 INFO L273 TraceCheckUtils]: 39: Hoare triple {5133#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5133#false} is VALID [2018-11-23 11:59:16,011 INFO L273 TraceCheckUtils]: 40: Hoare triple {5133#false} assume !(~i~0 < 100000); {5133#false} is VALID [2018-11-23 11:59:16,012 INFO L273 TraceCheckUtils]: 41: Hoare triple {5133#false} ~i~0 := 0; {5133#false} is VALID [2018-11-23 11:59:16,012 INFO L273 TraceCheckUtils]: 42: Hoare triple {5133#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; {5133#false} is VALID [2018-11-23 11:59:16,012 INFO L273 TraceCheckUtils]: 43: Hoare triple {5133#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5133#false} is VALID [2018-11-23 11:59:16,012 INFO L273 TraceCheckUtils]: 44: Hoare triple {5133#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; {5133#false} is VALID [2018-11-23 11:59:16,012 INFO L273 TraceCheckUtils]: 45: Hoare triple {5133#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5133#false} is VALID [2018-11-23 11:59:16,012 INFO L273 TraceCheckUtils]: 46: Hoare triple {5133#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; {5133#false} is VALID [2018-11-23 11:59:16,013 INFO L273 TraceCheckUtils]: 47: Hoare triple {5133#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5133#false} is VALID [2018-11-23 11:59:16,013 INFO L273 TraceCheckUtils]: 48: Hoare triple {5133#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; {5133#false} is VALID [2018-11-23 11:59:16,013 INFO L273 TraceCheckUtils]: 49: Hoare triple {5133#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5133#false} is VALID [2018-11-23 11:59:16,013 INFO L273 TraceCheckUtils]: 50: Hoare triple {5133#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; {5133#false} is VALID [2018-11-23 11:59:16,013 INFO L273 TraceCheckUtils]: 51: Hoare triple {5133#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5133#false} is VALID [2018-11-23 11:59:16,013 INFO L273 TraceCheckUtils]: 52: Hoare triple {5133#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; {5133#false} is VALID [2018-11-23 11:59:16,014 INFO L273 TraceCheckUtils]: 53: Hoare triple {5133#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5133#false} is VALID [2018-11-23 11:59:16,014 INFO L273 TraceCheckUtils]: 54: Hoare triple {5133#false} assume !(~i~0 < 100000); {5133#false} is VALID [2018-11-23 11:59:16,014 INFO L273 TraceCheckUtils]: 55: Hoare triple {5133#false} ~i~0 := 0; {5133#false} is VALID [2018-11-23 11:59:16,014 INFO L273 TraceCheckUtils]: 56: Hoare triple {5133#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; {5133#false} is VALID [2018-11-23 11:59:16,014 INFO L273 TraceCheckUtils]: 57: Hoare triple {5133#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5133#false} is VALID [2018-11-23 11:59:16,014 INFO L273 TraceCheckUtils]: 58: Hoare triple {5133#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; {5133#false} is VALID [2018-11-23 11:59:16,015 INFO L273 TraceCheckUtils]: 59: Hoare triple {5133#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5133#false} is VALID [2018-11-23 11:59:16,015 INFO L273 TraceCheckUtils]: 60: Hoare triple {5133#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; {5133#false} is VALID [2018-11-23 11:59:16,015 INFO L273 TraceCheckUtils]: 61: Hoare triple {5133#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5133#false} is VALID [2018-11-23 11:59:16,015 INFO L273 TraceCheckUtils]: 62: Hoare triple {5133#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; {5133#false} is VALID [2018-11-23 11:59:16,015 INFO L273 TraceCheckUtils]: 63: Hoare triple {5133#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5133#false} is VALID [2018-11-23 11:59:16,015 INFO L273 TraceCheckUtils]: 64: Hoare triple {5133#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; {5133#false} is VALID [2018-11-23 11:59:16,016 INFO L273 TraceCheckUtils]: 65: Hoare triple {5133#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5133#false} is VALID [2018-11-23 11:59:16,016 INFO L273 TraceCheckUtils]: 66: Hoare triple {5133#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; {5133#false} is VALID [2018-11-23 11:59:16,016 INFO L273 TraceCheckUtils]: 67: Hoare triple {5133#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5133#false} is VALID [2018-11-23 11:59:16,016 INFO L273 TraceCheckUtils]: 68: Hoare triple {5133#false} assume !(~i~0 < 100000); {5133#false} is VALID [2018-11-23 11:59:16,016 INFO L273 TraceCheckUtils]: 69: Hoare triple {5133#false} havoc ~x~0;~x~0 := 0; {5133#false} is VALID [2018-11-23 11:59:16,016 INFO L273 TraceCheckUtils]: 70: Hoare triple {5133#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {5133#false} is VALID [2018-11-23 11:59:16,016 INFO L256 TraceCheckUtils]: 71: Hoare triple {5133#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {5133#false} is VALID [2018-11-23 11:59:16,017 INFO L273 TraceCheckUtils]: 72: Hoare triple {5133#false} ~cond := #in~cond; {5133#false} is VALID [2018-11-23 11:59:16,017 INFO L273 TraceCheckUtils]: 73: Hoare triple {5133#false} assume 0 == ~cond; {5133#false} is VALID [2018-11-23 11:59:16,017 INFO L273 TraceCheckUtils]: 74: Hoare triple {5133#false} assume !false; {5133#false} is VALID [2018-11-23 11:59:16,021 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-23 11:59:16,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:16,021 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:16,035 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:59:16,070 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:59:16,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:16,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:16,311 INFO L256 TraceCheckUtils]: 0: Hoare triple {5132#true} call ULTIMATE.init(); {5132#true} is VALID [2018-11-23 11:59:16,311 INFO L273 TraceCheckUtils]: 1: Hoare triple {5132#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5132#true} is VALID [2018-11-23 11:59:16,311 INFO L273 TraceCheckUtils]: 2: Hoare triple {5132#true} assume true; {5132#true} is VALID [2018-11-23 11:59:16,312 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5132#true} {5132#true} #91#return; {5132#true} is VALID [2018-11-23 11:59:16,312 INFO L256 TraceCheckUtils]: 4: Hoare triple {5132#true} call #t~ret11 := main(); {5132#true} is VALID [2018-11-23 11:59:16,312 INFO L273 TraceCheckUtils]: 5: Hoare triple {5132#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);havoc ~a~0;~a~0 := 0; {5132#true} is VALID [2018-11-23 11:59:16,312 INFO L273 TraceCheckUtils]: 6: Hoare triple {5132#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; {5132#true} is VALID [2018-11-23 11:59:16,312 INFO L273 TraceCheckUtils]: 7: Hoare triple {5132#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5132#true} is VALID [2018-11-23 11:59:16,313 INFO L273 TraceCheckUtils]: 8: Hoare triple {5132#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; {5132#true} is VALID [2018-11-23 11:59:16,313 INFO L273 TraceCheckUtils]: 9: Hoare triple {5132#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5132#true} is VALID [2018-11-23 11:59:16,313 INFO L273 TraceCheckUtils]: 10: Hoare triple {5132#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; {5132#true} is VALID [2018-11-23 11:59:16,313 INFO L273 TraceCheckUtils]: 11: Hoare triple {5132#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5132#true} is VALID [2018-11-23 11:59:16,313 INFO L273 TraceCheckUtils]: 12: Hoare triple {5132#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; {5132#true} is VALID [2018-11-23 11:59:16,314 INFO L273 TraceCheckUtils]: 13: Hoare triple {5132#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5132#true} is VALID [2018-11-23 11:59:16,314 INFO L273 TraceCheckUtils]: 14: Hoare triple {5132#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; {5132#true} is VALID [2018-11-23 11:59:16,314 INFO L273 TraceCheckUtils]: 15: Hoare triple {5132#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5132#true} is VALID [2018-11-23 11:59:16,314 INFO L273 TraceCheckUtils]: 16: Hoare triple {5132#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; {5132#true} is VALID [2018-11-23 11:59:16,314 INFO L273 TraceCheckUtils]: 17: Hoare triple {5132#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5132#true} is VALID [2018-11-23 11:59:16,314 INFO L273 TraceCheckUtils]: 18: Hoare triple {5132#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; {5132#true} is VALID [2018-11-23 11:59:16,314 INFO L273 TraceCheckUtils]: 19: Hoare triple {5132#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5132#true} is VALID [2018-11-23 11:59:16,314 INFO L273 TraceCheckUtils]: 20: Hoare triple {5132#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; {5132#true} is VALID [2018-11-23 11:59:16,315 INFO L273 TraceCheckUtils]: 21: Hoare triple {5132#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5132#true} is VALID [2018-11-23 11:59:16,315 INFO L273 TraceCheckUtils]: 22: Hoare triple {5132#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; {5132#true} is VALID [2018-11-23 11:59:16,315 INFO L273 TraceCheckUtils]: 23: Hoare triple {5132#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5132#true} is VALID [2018-11-23 11:59:16,315 INFO L273 TraceCheckUtils]: 24: Hoare triple {5132#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; {5132#true} is VALID [2018-11-23 11:59:16,315 INFO L273 TraceCheckUtils]: 25: Hoare triple {5132#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5132#true} is VALID [2018-11-23 11:59:16,315 INFO L273 TraceCheckUtils]: 26: Hoare triple {5132#true} assume !(~a~0 < 100000); {5132#true} is VALID [2018-11-23 11:59:16,315 INFO L273 TraceCheckUtils]: 27: Hoare triple {5132#true} havoc ~i~0;~i~0 := 0; {5132#true} is VALID [2018-11-23 11:59:16,315 INFO L273 TraceCheckUtils]: 28: Hoare triple {5132#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; {5132#true} is VALID [2018-11-23 11:59:16,316 INFO L273 TraceCheckUtils]: 29: Hoare triple {5132#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5132#true} is VALID [2018-11-23 11:59:16,316 INFO L273 TraceCheckUtils]: 30: Hoare triple {5132#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; {5132#true} is VALID [2018-11-23 11:59:16,316 INFO L273 TraceCheckUtils]: 31: Hoare triple {5132#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5132#true} is VALID [2018-11-23 11:59:16,316 INFO L273 TraceCheckUtils]: 32: Hoare triple {5132#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; {5132#true} is VALID [2018-11-23 11:59:16,316 INFO L273 TraceCheckUtils]: 33: Hoare triple {5132#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5132#true} is VALID [2018-11-23 11:59:16,316 INFO L273 TraceCheckUtils]: 34: Hoare triple {5132#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; {5132#true} is VALID [2018-11-23 11:59:16,316 INFO L273 TraceCheckUtils]: 35: Hoare triple {5132#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5132#true} is VALID [2018-11-23 11:59:16,316 INFO L273 TraceCheckUtils]: 36: Hoare triple {5132#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; {5132#true} is VALID [2018-11-23 11:59:16,317 INFO L273 TraceCheckUtils]: 37: Hoare triple {5132#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5132#true} is VALID [2018-11-23 11:59:16,317 INFO L273 TraceCheckUtils]: 38: Hoare triple {5132#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; {5132#true} is VALID [2018-11-23 11:59:16,317 INFO L273 TraceCheckUtils]: 39: Hoare triple {5132#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5132#true} is VALID [2018-11-23 11:59:16,317 INFO L273 TraceCheckUtils]: 40: Hoare triple {5132#true} assume !(~i~0 < 100000); {5132#true} is VALID [2018-11-23 11:59:16,317 INFO L273 TraceCheckUtils]: 41: Hoare triple {5132#true} ~i~0 := 0; {5132#true} is VALID [2018-11-23 11:59:16,317 INFO L273 TraceCheckUtils]: 42: Hoare triple {5132#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; {5132#true} is VALID [2018-11-23 11:59:16,317 INFO L273 TraceCheckUtils]: 43: Hoare triple {5132#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5132#true} is VALID [2018-11-23 11:59:16,317 INFO L273 TraceCheckUtils]: 44: Hoare triple {5132#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; {5132#true} is VALID [2018-11-23 11:59:16,317 INFO L273 TraceCheckUtils]: 45: Hoare triple {5132#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5132#true} is VALID [2018-11-23 11:59:16,318 INFO L273 TraceCheckUtils]: 46: Hoare triple {5132#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; {5132#true} is VALID [2018-11-23 11:59:16,318 INFO L273 TraceCheckUtils]: 47: Hoare triple {5132#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5132#true} is VALID [2018-11-23 11:59:16,318 INFO L273 TraceCheckUtils]: 48: Hoare triple {5132#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; {5132#true} is VALID [2018-11-23 11:59:16,318 INFO L273 TraceCheckUtils]: 49: Hoare triple {5132#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5132#true} is VALID [2018-11-23 11:59:16,318 INFO L273 TraceCheckUtils]: 50: Hoare triple {5132#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; {5132#true} is VALID [2018-11-23 11:59:16,318 INFO L273 TraceCheckUtils]: 51: Hoare triple {5132#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5132#true} is VALID [2018-11-23 11:59:16,318 INFO L273 TraceCheckUtils]: 52: Hoare triple {5132#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; {5132#true} is VALID [2018-11-23 11:59:16,318 INFO L273 TraceCheckUtils]: 53: Hoare triple {5132#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5132#true} is VALID [2018-11-23 11:59:16,319 INFO L273 TraceCheckUtils]: 54: Hoare triple {5132#true} assume !(~i~0 < 100000); {5132#true} is VALID [2018-11-23 11:59:16,319 INFO L273 TraceCheckUtils]: 55: Hoare triple {5132#true} ~i~0 := 0; {5313#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:16,319 INFO L273 TraceCheckUtils]: 56: Hoare triple {5313#(<= 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; {5313#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:16,320 INFO L273 TraceCheckUtils]: 57: Hoare triple {5313#(<= main_~i~0 0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5320#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:16,320 INFO L273 TraceCheckUtils]: 58: Hoare triple {5320#(<= 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; {5320#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:16,321 INFO L273 TraceCheckUtils]: 59: Hoare triple {5320#(<= main_~i~0 1)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5327#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:16,321 INFO L273 TraceCheckUtils]: 60: Hoare triple {5327#(<= 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; {5327#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:16,321 INFO L273 TraceCheckUtils]: 61: Hoare triple {5327#(<= main_~i~0 2)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5334#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:16,322 INFO L273 TraceCheckUtils]: 62: Hoare triple {5334#(<= 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; {5334#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:16,322 INFO L273 TraceCheckUtils]: 63: Hoare triple {5334#(<= main_~i~0 3)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5341#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:16,323 INFO L273 TraceCheckUtils]: 64: Hoare triple {5341#(<= 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; {5341#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:16,323 INFO L273 TraceCheckUtils]: 65: Hoare triple {5341#(<= main_~i~0 4)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5348#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:16,324 INFO L273 TraceCheckUtils]: 66: Hoare triple {5348#(<= 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; {5348#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:16,325 INFO L273 TraceCheckUtils]: 67: Hoare triple {5348#(<= main_~i~0 5)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5355#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:16,325 INFO L273 TraceCheckUtils]: 68: Hoare triple {5355#(<= main_~i~0 6)} assume !(~i~0 < 100000); {5133#false} is VALID [2018-11-23 11:59:16,326 INFO L273 TraceCheckUtils]: 69: Hoare triple {5133#false} havoc ~x~0;~x~0 := 0; {5133#false} is VALID [2018-11-23 11:59:16,326 INFO L273 TraceCheckUtils]: 70: Hoare triple {5133#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {5133#false} is VALID [2018-11-23 11:59:16,326 INFO L256 TraceCheckUtils]: 71: Hoare triple {5133#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {5133#false} is VALID [2018-11-23 11:59:16,326 INFO L273 TraceCheckUtils]: 72: Hoare triple {5133#false} ~cond := #in~cond; {5133#false} is VALID [2018-11-23 11:59:16,326 INFO L273 TraceCheckUtils]: 73: Hoare triple {5133#false} assume 0 == ~cond; {5133#false} is VALID [2018-11-23 11:59:16,327 INFO L273 TraceCheckUtils]: 74: Hoare triple {5133#false} assume !false; {5133#false} is VALID [2018-11-23 11:59:16,330 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-11-23 11:59:16,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:16,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2018-11-23 11:59:16,351 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 75 [2018-11-23 11:59:16,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:16,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:59:16,415 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:16,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:59:16,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:59:16,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:59:16,416 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 20 states. [2018-11-23 11:59:17,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:17,305 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2018-11-23 11:59:17,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:59:17,305 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 75 [2018-11-23 11:59:17,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:17,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:59:17,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 123 transitions. [2018-11-23 11:59:17,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:59:17,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 123 transitions. [2018-11-23 11:59:17,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 123 transitions. [2018-11-23 11:59:17,861 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:17,863 INFO L225 Difference]: With dead ends: 145 [2018-11-23 11:59:17,863 INFO L226 Difference]: Without dead ends: 92 [2018-11-23 11:59:17,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:59:17,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-23 11:59:17,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2018-11-23 11:59:17,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:17,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 88 states. [2018-11-23 11:59:17,904 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 88 states. [2018-11-23 11:59:17,904 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 88 states. [2018-11-23 11:59:17,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:17,906 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-11-23 11:59:17,906 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-11-23 11:59:17,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:17,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:17,907 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 92 states. [2018-11-23 11:59:17,907 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 92 states. [2018-11-23 11:59:17,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:17,909 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-11-23 11:59:17,909 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-11-23 11:59:17,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:17,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:17,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:17,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:17,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 11:59:17,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-11-23 11:59:17,912 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 75 [2018-11-23 11:59:17,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:17,912 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-11-23 11:59:17,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:59:17,913 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-11-23 11:59:17,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 11:59:17,914 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:17,914 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 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] [2018-11-23 11:59:17,914 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:17,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:17,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1426138254, now seen corresponding path program 11 times [2018-11-23 11:59:17,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:17,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:17,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:17,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:17,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:17,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:18,594 INFO L256 TraceCheckUtils]: 0: Hoare triple {5903#true} call ULTIMATE.init(); {5903#true} is VALID [2018-11-23 11:59:18,594 INFO L273 TraceCheckUtils]: 1: Hoare triple {5903#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5903#true} is VALID [2018-11-23 11:59:18,595 INFO L273 TraceCheckUtils]: 2: Hoare triple {5903#true} assume true; {5903#true} is VALID [2018-11-23 11:59:18,595 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5903#true} {5903#true} #91#return; {5903#true} is VALID [2018-11-23 11:59:18,595 INFO L256 TraceCheckUtils]: 4: Hoare triple {5903#true} call #t~ret11 := main(); {5903#true} is VALID [2018-11-23 11:59:18,597 INFO L273 TraceCheckUtils]: 5: Hoare triple {5903#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);havoc ~a~0;~a~0 := 0; {5905#(= main_~a~0 0)} is VALID [2018-11-23 11:59:18,597 INFO L273 TraceCheckUtils]: 6: Hoare triple {5905#(= 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; {5905#(= main_~a~0 0)} is VALID [2018-11-23 11:59:18,598 INFO L273 TraceCheckUtils]: 7: Hoare triple {5905#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5906#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:18,598 INFO L273 TraceCheckUtils]: 8: Hoare triple {5906#(<= 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; {5906#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:18,598 INFO L273 TraceCheckUtils]: 9: Hoare triple {5906#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5907#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:18,599 INFO L273 TraceCheckUtils]: 10: Hoare triple {5907#(<= 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; {5907#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:18,599 INFO L273 TraceCheckUtils]: 11: Hoare triple {5907#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5908#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:18,600 INFO L273 TraceCheckUtils]: 12: Hoare triple {5908#(<= 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; {5908#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:18,600 INFO L273 TraceCheckUtils]: 13: Hoare triple {5908#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5909#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:18,600 INFO L273 TraceCheckUtils]: 14: Hoare triple {5909#(<= 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; {5909#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:18,601 INFO L273 TraceCheckUtils]: 15: Hoare triple {5909#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5910#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:18,602 INFO L273 TraceCheckUtils]: 16: Hoare triple {5910#(<= 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; {5910#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:18,602 INFO L273 TraceCheckUtils]: 17: Hoare triple {5910#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5911#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:18,603 INFO L273 TraceCheckUtils]: 18: Hoare triple {5911#(<= 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; {5911#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:18,604 INFO L273 TraceCheckUtils]: 19: Hoare triple {5911#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5912#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:18,604 INFO L273 TraceCheckUtils]: 20: Hoare triple {5912#(<= 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; {5912#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:18,605 INFO L273 TraceCheckUtils]: 21: Hoare triple {5912#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5913#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:18,606 INFO L273 TraceCheckUtils]: 22: Hoare triple {5913#(<= 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; {5913#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:18,606 INFO L273 TraceCheckUtils]: 23: Hoare triple {5913#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5914#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:18,607 INFO L273 TraceCheckUtils]: 24: Hoare triple {5914#(<= 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; {5914#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:18,608 INFO L273 TraceCheckUtils]: 25: Hoare triple {5914#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5915#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:18,608 INFO L273 TraceCheckUtils]: 26: Hoare triple {5915#(<= 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; {5915#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:18,609 INFO L273 TraceCheckUtils]: 27: Hoare triple {5915#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5916#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:18,610 INFO L273 TraceCheckUtils]: 28: Hoare triple {5916#(<= main_~a~0 11)} assume !(~a~0 < 100000); {5904#false} is VALID [2018-11-23 11:59:18,610 INFO L273 TraceCheckUtils]: 29: Hoare triple {5904#false} havoc ~i~0;~i~0 := 0; {5904#false} is VALID [2018-11-23 11:59:18,610 INFO L273 TraceCheckUtils]: 30: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:18,610 INFO L273 TraceCheckUtils]: 31: Hoare triple {5904#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5904#false} is VALID [2018-11-23 11:59:18,611 INFO L273 TraceCheckUtils]: 32: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:18,611 INFO L273 TraceCheckUtils]: 33: Hoare triple {5904#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5904#false} is VALID [2018-11-23 11:59:18,611 INFO L273 TraceCheckUtils]: 34: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:18,611 INFO L273 TraceCheckUtils]: 35: Hoare triple {5904#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5904#false} is VALID [2018-11-23 11:59:18,611 INFO L273 TraceCheckUtils]: 36: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:18,612 INFO L273 TraceCheckUtils]: 37: Hoare triple {5904#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5904#false} is VALID [2018-11-23 11:59:18,612 INFO L273 TraceCheckUtils]: 38: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:18,612 INFO L273 TraceCheckUtils]: 39: Hoare triple {5904#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5904#false} is VALID [2018-11-23 11:59:18,612 INFO L273 TraceCheckUtils]: 40: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:18,612 INFO L273 TraceCheckUtils]: 41: Hoare triple {5904#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5904#false} is VALID [2018-11-23 11:59:18,613 INFO L273 TraceCheckUtils]: 42: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:18,613 INFO L273 TraceCheckUtils]: 43: Hoare triple {5904#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5904#false} is VALID [2018-11-23 11:59:18,613 INFO L273 TraceCheckUtils]: 44: Hoare triple {5904#false} assume !(~i~0 < 100000); {5904#false} is VALID [2018-11-23 11:59:18,613 INFO L273 TraceCheckUtils]: 45: Hoare triple {5904#false} ~i~0 := 0; {5904#false} is VALID [2018-11-23 11:59:18,613 INFO L273 TraceCheckUtils]: 46: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:18,613 INFO L273 TraceCheckUtils]: 47: Hoare triple {5904#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5904#false} is VALID [2018-11-23 11:59:18,614 INFO L273 TraceCheckUtils]: 48: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:18,614 INFO L273 TraceCheckUtils]: 49: Hoare triple {5904#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5904#false} is VALID [2018-11-23 11:59:18,614 INFO L273 TraceCheckUtils]: 50: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:18,614 INFO L273 TraceCheckUtils]: 51: Hoare triple {5904#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5904#false} is VALID [2018-11-23 11:59:18,614 INFO L273 TraceCheckUtils]: 52: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:18,614 INFO L273 TraceCheckUtils]: 53: Hoare triple {5904#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5904#false} is VALID [2018-11-23 11:59:18,615 INFO L273 TraceCheckUtils]: 54: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:18,615 INFO L273 TraceCheckUtils]: 55: Hoare triple {5904#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5904#false} is VALID [2018-11-23 11:59:18,615 INFO L273 TraceCheckUtils]: 56: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:18,615 INFO L273 TraceCheckUtils]: 57: Hoare triple {5904#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5904#false} is VALID [2018-11-23 11:59:18,615 INFO L273 TraceCheckUtils]: 58: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:18,616 INFO L273 TraceCheckUtils]: 59: Hoare triple {5904#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5904#false} is VALID [2018-11-23 11:59:18,616 INFO L273 TraceCheckUtils]: 60: Hoare triple {5904#false} assume !(~i~0 < 100000); {5904#false} is VALID [2018-11-23 11:59:18,616 INFO L273 TraceCheckUtils]: 61: Hoare triple {5904#false} ~i~0 := 0; {5904#false} is VALID [2018-11-23 11:59:18,616 INFO L273 TraceCheckUtils]: 62: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:18,616 INFO L273 TraceCheckUtils]: 63: Hoare triple {5904#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5904#false} is VALID [2018-11-23 11:59:18,616 INFO L273 TraceCheckUtils]: 64: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:18,617 INFO L273 TraceCheckUtils]: 65: Hoare triple {5904#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5904#false} is VALID [2018-11-23 11:59:18,617 INFO L273 TraceCheckUtils]: 66: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:18,617 INFO L273 TraceCheckUtils]: 67: Hoare triple {5904#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5904#false} is VALID [2018-11-23 11:59:18,617 INFO L273 TraceCheckUtils]: 68: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:18,617 INFO L273 TraceCheckUtils]: 69: Hoare triple {5904#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5904#false} is VALID [2018-11-23 11:59:18,617 INFO L273 TraceCheckUtils]: 70: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:18,618 INFO L273 TraceCheckUtils]: 71: Hoare triple {5904#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5904#false} is VALID [2018-11-23 11:59:18,618 INFO L273 TraceCheckUtils]: 72: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:18,618 INFO L273 TraceCheckUtils]: 73: Hoare triple {5904#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5904#false} is VALID [2018-11-23 11:59:18,618 INFO L273 TraceCheckUtils]: 74: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:18,618 INFO L273 TraceCheckUtils]: 75: Hoare triple {5904#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5904#false} is VALID [2018-11-23 11:59:18,618 INFO L273 TraceCheckUtils]: 76: Hoare triple {5904#false} assume !(~i~0 < 100000); {5904#false} is VALID [2018-11-23 11:59:18,619 INFO L273 TraceCheckUtils]: 77: Hoare triple {5904#false} havoc ~x~0;~x~0 := 0; {5904#false} is VALID [2018-11-23 11:59:18,619 INFO L273 TraceCheckUtils]: 78: Hoare triple {5904#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {5904#false} is VALID [2018-11-23 11:59:18,619 INFO L256 TraceCheckUtils]: 79: Hoare triple {5904#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {5904#false} is VALID [2018-11-23 11:59:18,619 INFO L273 TraceCheckUtils]: 80: Hoare triple {5904#false} ~cond := #in~cond; {5904#false} is VALID [2018-11-23 11:59:18,619 INFO L273 TraceCheckUtils]: 81: Hoare triple {5904#false} assume 0 == ~cond; {5904#false} is VALID [2018-11-23 11:59:18,620 INFO L273 TraceCheckUtils]: 82: Hoare triple {5904#false} assume !false; {5904#false} is VALID [2018-11-23 11:59:18,624 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-11-23 11:59:18,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:18,624 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:18,641 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:59:49,858 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 11:59:49,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:49,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:49,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:50,024 INFO L256 TraceCheckUtils]: 0: Hoare triple {5903#true} call ULTIMATE.init(); {5903#true} is VALID [2018-11-23 11:59:50,025 INFO L273 TraceCheckUtils]: 1: Hoare triple {5903#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5903#true} is VALID [2018-11-23 11:59:50,025 INFO L273 TraceCheckUtils]: 2: Hoare triple {5903#true} assume true; {5903#true} is VALID [2018-11-23 11:59:50,025 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5903#true} {5903#true} #91#return; {5903#true} is VALID [2018-11-23 11:59:50,026 INFO L256 TraceCheckUtils]: 4: Hoare triple {5903#true} call #t~ret11 := main(); {5903#true} is VALID [2018-11-23 11:59:50,027 INFO L273 TraceCheckUtils]: 5: Hoare triple {5903#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);havoc ~a~0;~a~0 := 0; {5935#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:50,027 INFO L273 TraceCheckUtils]: 6: Hoare triple {5935#(<= 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; {5935#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:50,028 INFO L273 TraceCheckUtils]: 7: Hoare triple {5935#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5906#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:50,028 INFO L273 TraceCheckUtils]: 8: Hoare triple {5906#(<= 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; {5906#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:50,028 INFO L273 TraceCheckUtils]: 9: Hoare triple {5906#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5907#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:50,029 INFO L273 TraceCheckUtils]: 10: Hoare triple {5907#(<= 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; {5907#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:50,029 INFO L273 TraceCheckUtils]: 11: Hoare triple {5907#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5908#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:50,030 INFO L273 TraceCheckUtils]: 12: Hoare triple {5908#(<= 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; {5908#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:50,031 INFO L273 TraceCheckUtils]: 13: Hoare triple {5908#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5909#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:50,031 INFO L273 TraceCheckUtils]: 14: Hoare triple {5909#(<= 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; {5909#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:50,032 INFO L273 TraceCheckUtils]: 15: Hoare triple {5909#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5910#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:50,032 INFO L273 TraceCheckUtils]: 16: Hoare triple {5910#(<= 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; {5910#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:50,033 INFO L273 TraceCheckUtils]: 17: Hoare triple {5910#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5911#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:50,034 INFO L273 TraceCheckUtils]: 18: Hoare triple {5911#(<= 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; {5911#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:50,034 INFO L273 TraceCheckUtils]: 19: Hoare triple {5911#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5912#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:50,035 INFO L273 TraceCheckUtils]: 20: Hoare triple {5912#(<= 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; {5912#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:50,035 INFO L273 TraceCheckUtils]: 21: Hoare triple {5912#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5913#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:50,036 INFO L273 TraceCheckUtils]: 22: Hoare triple {5913#(<= 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; {5913#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:50,037 INFO L273 TraceCheckUtils]: 23: Hoare triple {5913#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5914#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:50,037 INFO L273 TraceCheckUtils]: 24: Hoare triple {5914#(<= 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; {5914#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:50,038 INFO L273 TraceCheckUtils]: 25: Hoare triple {5914#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5915#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:50,038 INFO L273 TraceCheckUtils]: 26: Hoare triple {5915#(<= 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; {5915#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:50,039 INFO L273 TraceCheckUtils]: 27: Hoare triple {5915#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5916#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:50,040 INFO L273 TraceCheckUtils]: 28: Hoare triple {5916#(<= main_~a~0 11)} assume !(~a~0 < 100000); {5904#false} is VALID [2018-11-23 11:59:50,040 INFO L273 TraceCheckUtils]: 29: Hoare triple {5904#false} havoc ~i~0;~i~0 := 0; {5904#false} is VALID [2018-11-23 11:59:50,040 INFO L273 TraceCheckUtils]: 30: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:50,040 INFO L273 TraceCheckUtils]: 31: Hoare triple {5904#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5904#false} is VALID [2018-11-23 11:59:50,041 INFO L273 TraceCheckUtils]: 32: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:50,041 INFO L273 TraceCheckUtils]: 33: Hoare triple {5904#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5904#false} is VALID [2018-11-23 11:59:50,041 INFO L273 TraceCheckUtils]: 34: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:50,041 INFO L273 TraceCheckUtils]: 35: Hoare triple {5904#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5904#false} is VALID [2018-11-23 11:59:50,041 INFO L273 TraceCheckUtils]: 36: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:50,042 INFO L273 TraceCheckUtils]: 37: Hoare triple {5904#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5904#false} is VALID [2018-11-23 11:59:50,042 INFO L273 TraceCheckUtils]: 38: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:50,042 INFO L273 TraceCheckUtils]: 39: Hoare triple {5904#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5904#false} is VALID [2018-11-23 11:59:50,042 INFO L273 TraceCheckUtils]: 40: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:50,042 INFO L273 TraceCheckUtils]: 41: Hoare triple {5904#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5904#false} is VALID [2018-11-23 11:59:50,043 INFO L273 TraceCheckUtils]: 42: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:50,043 INFO L273 TraceCheckUtils]: 43: Hoare triple {5904#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5904#false} is VALID [2018-11-23 11:59:50,043 INFO L273 TraceCheckUtils]: 44: Hoare triple {5904#false} assume !(~i~0 < 100000); {5904#false} is VALID [2018-11-23 11:59:50,043 INFO L273 TraceCheckUtils]: 45: Hoare triple {5904#false} ~i~0 := 0; {5904#false} is VALID [2018-11-23 11:59:50,043 INFO L273 TraceCheckUtils]: 46: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:50,043 INFO L273 TraceCheckUtils]: 47: Hoare triple {5904#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5904#false} is VALID [2018-11-23 11:59:50,044 INFO L273 TraceCheckUtils]: 48: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:50,044 INFO L273 TraceCheckUtils]: 49: Hoare triple {5904#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5904#false} is VALID [2018-11-23 11:59:50,044 INFO L273 TraceCheckUtils]: 50: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:50,044 INFO L273 TraceCheckUtils]: 51: Hoare triple {5904#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5904#false} is VALID [2018-11-23 11:59:50,044 INFO L273 TraceCheckUtils]: 52: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:50,045 INFO L273 TraceCheckUtils]: 53: Hoare triple {5904#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5904#false} is VALID [2018-11-23 11:59:50,045 INFO L273 TraceCheckUtils]: 54: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:50,045 INFO L273 TraceCheckUtils]: 55: Hoare triple {5904#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5904#false} is VALID [2018-11-23 11:59:50,045 INFO L273 TraceCheckUtils]: 56: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:50,045 INFO L273 TraceCheckUtils]: 57: Hoare triple {5904#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5904#false} is VALID [2018-11-23 11:59:50,045 INFO L273 TraceCheckUtils]: 58: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:50,045 INFO L273 TraceCheckUtils]: 59: Hoare triple {5904#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5904#false} is VALID [2018-11-23 11:59:50,046 INFO L273 TraceCheckUtils]: 60: Hoare triple {5904#false} assume !(~i~0 < 100000); {5904#false} is VALID [2018-11-23 11:59:50,046 INFO L273 TraceCheckUtils]: 61: Hoare triple {5904#false} ~i~0 := 0; {5904#false} is VALID [2018-11-23 11:59:50,046 INFO L273 TraceCheckUtils]: 62: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:50,046 INFO L273 TraceCheckUtils]: 63: Hoare triple {5904#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5904#false} is VALID [2018-11-23 11:59:50,046 INFO L273 TraceCheckUtils]: 64: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:50,046 INFO L273 TraceCheckUtils]: 65: Hoare triple {5904#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5904#false} is VALID [2018-11-23 11:59:50,046 INFO L273 TraceCheckUtils]: 66: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:50,046 INFO L273 TraceCheckUtils]: 67: Hoare triple {5904#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5904#false} is VALID [2018-11-23 11:59:50,047 INFO L273 TraceCheckUtils]: 68: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:50,047 INFO L273 TraceCheckUtils]: 69: Hoare triple {5904#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5904#false} is VALID [2018-11-23 11:59:50,047 INFO L273 TraceCheckUtils]: 70: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:50,047 INFO L273 TraceCheckUtils]: 71: Hoare triple {5904#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5904#false} is VALID [2018-11-23 11:59:50,047 INFO L273 TraceCheckUtils]: 72: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:50,047 INFO L273 TraceCheckUtils]: 73: Hoare triple {5904#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5904#false} is VALID [2018-11-23 11:59:50,047 INFO L273 TraceCheckUtils]: 74: Hoare triple {5904#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; {5904#false} is VALID [2018-11-23 11:59:50,047 INFO L273 TraceCheckUtils]: 75: Hoare triple {5904#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5904#false} is VALID [2018-11-23 11:59:50,048 INFO L273 TraceCheckUtils]: 76: Hoare triple {5904#false} assume !(~i~0 < 100000); {5904#false} is VALID [2018-11-23 11:59:50,048 INFO L273 TraceCheckUtils]: 77: Hoare triple {5904#false} havoc ~x~0;~x~0 := 0; {5904#false} is VALID [2018-11-23 11:59:50,048 INFO L273 TraceCheckUtils]: 78: Hoare triple {5904#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {5904#false} is VALID [2018-11-23 11:59:50,048 INFO L256 TraceCheckUtils]: 79: Hoare triple {5904#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {5904#false} is VALID [2018-11-23 11:59:50,048 INFO L273 TraceCheckUtils]: 80: Hoare triple {5904#false} ~cond := #in~cond; {5904#false} is VALID [2018-11-23 11:59:50,048 INFO L273 TraceCheckUtils]: 81: Hoare triple {5904#false} assume 0 == ~cond; {5904#false} is VALID [2018-11-23 11:59:50,048 INFO L273 TraceCheckUtils]: 82: Hoare triple {5904#false} assume !false; {5904#false} is VALID [2018-11-23 11:59:50,051 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-11-23 11:59:50,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:50,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 11:59:50,077 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 83 [2018-11-23 11:59:50,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:50,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:59:50,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:50,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:59:50,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:59:50,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:59:50,123 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 15 states. [2018-11-23 11:59:50,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:50,508 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2018-11-23 11:59:50,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:59:50,509 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 83 [2018-11-23 11:59:50,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:50,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:59:50,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 80 transitions. [2018-11-23 11:59:50,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:59:50,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 80 transitions. [2018-11-23 11:59:50,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 80 transitions. [2018-11-23 11:59:51,022 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:51,024 INFO L225 Difference]: With dead ends: 150 [2018-11-23 11:59:51,025 INFO L226 Difference]: Without dead ends: 91 [2018-11-23 11:59:51,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:59:51,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-23 11:59:51,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-11-23 11:59:51,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:51,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 90 states. [2018-11-23 11:59:51,064 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 90 states. [2018-11-23 11:59:51,064 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 90 states. [2018-11-23 11:59:51,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:51,068 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-11-23 11:59:51,068 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-11-23 11:59:51,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:51,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:51,068 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 91 states. [2018-11-23 11:59:51,068 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 91 states. [2018-11-23 11:59:51,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:51,070 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-11-23 11:59:51,070 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-11-23 11:59:51,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:51,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:51,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:51,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:51,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 11:59:51,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2018-11-23 11:59:51,072 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 83 [2018-11-23 11:59:51,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:51,073 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2018-11-23 11:59:51,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:59:51,073 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-11-23 11:59:51,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 11:59:51,074 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:51,074 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 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] [2018-11-23 11:59:51,074 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:51,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:51,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1519404204, now seen corresponding path program 12 times [2018-11-23 11:59:51,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:51,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:51,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:51,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:51,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:51,710 INFO L256 TraceCheckUtils]: 0: Hoare triple {6703#true} call ULTIMATE.init(); {6703#true} is VALID [2018-11-23 11:59:51,711 INFO L273 TraceCheckUtils]: 1: Hoare triple {6703#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6703#true} is VALID [2018-11-23 11:59:51,711 INFO L273 TraceCheckUtils]: 2: Hoare triple {6703#true} assume true; {6703#true} is VALID [2018-11-23 11:59:51,711 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6703#true} {6703#true} #91#return; {6703#true} is VALID [2018-11-23 11:59:51,711 INFO L256 TraceCheckUtils]: 4: Hoare triple {6703#true} call #t~ret11 := main(); {6703#true} is VALID [2018-11-23 11:59:51,712 INFO L273 TraceCheckUtils]: 5: Hoare triple {6703#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);havoc ~a~0;~a~0 := 0; {6705#(= main_~a~0 0)} is VALID [2018-11-23 11:59:51,712 INFO L273 TraceCheckUtils]: 6: Hoare triple {6705#(= 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; {6705#(= main_~a~0 0)} is VALID [2018-11-23 11:59:51,713 INFO L273 TraceCheckUtils]: 7: Hoare triple {6705#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6706#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:51,714 INFO L273 TraceCheckUtils]: 8: Hoare triple {6706#(<= 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; {6706#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:51,714 INFO L273 TraceCheckUtils]: 9: Hoare triple {6706#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6707#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:51,715 INFO L273 TraceCheckUtils]: 10: Hoare triple {6707#(<= 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; {6707#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:51,715 INFO L273 TraceCheckUtils]: 11: Hoare triple {6707#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6708#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:51,715 INFO L273 TraceCheckUtils]: 12: Hoare triple {6708#(<= 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; {6708#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:51,716 INFO L273 TraceCheckUtils]: 13: Hoare triple {6708#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6709#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:51,716 INFO L273 TraceCheckUtils]: 14: Hoare triple {6709#(<= 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; {6709#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:51,717 INFO L273 TraceCheckUtils]: 15: Hoare triple {6709#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6710#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:51,718 INFO L273 TraceCheckUtils]: 16: Hoare triple {6710#(<= 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; {6710#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:51,718 INFO L273 TraceCheckUtils]: 17: Hoare triple {6710#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6711#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:51,719 INFO L273 TraceCheckUtils]: 18: Hoare triple {6711#(<= 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; {6711#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:51,720 INFO L273 TraceCheckUtils]: 19: Hoare triple {6711#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6712#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:51,720 INFO L273 TraceCheckUtils]: 20: Hoare triple {6712#(<= 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; {6712#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:51,721 INFO L273 TraceCheckUtils]: 21: Hoare triple {6712#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6713#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:51,722 INFO L273 TraceCheckUtils]: 22: Hoare triple {6713#(<= 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; {6713#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:51,722 INFO L273 TraceCheckUtils]: 23: Hoare triple {6713#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6714#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:51,723 INFO L273 TraceCheckUtils]: 24: Hoare triple {6714#(<= 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; {6714#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:51,724 INFO L273 TraceCheckUtils]: 25: Hoare triple {6714#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6715#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:51,724 INFO L273 TraceCheckUtils]: 26: Hoare triple {6715#(<= 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; {6715#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:51,725 INFO L273 TraceCheckUtils]: 27: Hoare triple {6715#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6716#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:51,725 INFO L273 TraceCheckUtils]: 28: Hoare triple {6716#(<= 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; {6716#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:51,726 INFO L273 TraceCheckUtils]: 29: Hoare triple {6716#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6717#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:51,727 INFO L273 TraceCheckUtils]: 30: Hoare triple {6717#(<= main_~a~0 12)} assume !(~a~0 < 100000); {6704#false} is VALID [2018-11-23 11:59:51,727 INFO L273 TraceCheckUtils]: 31: Hoare triple {6704#false} havoc ~i~0;~i~0 := 0; {6704#false} is VALID [2018-11-23 11:59:51,727 INFO L273 TraceCheckUtils]: 32: Hoare triple {6704#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; {6704#false} is VALID [2018-11-23 11:59:51,728 INFO L273 TraceCheckUtils]: 33: Hoare triple {6704#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6704#false} is VALID [2018-11-23 11:59:51,728 INFO L273 TraceCheckUtils]: 34: Hoare triple {6704#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; {6704#false} is VALID [2018-11-23 11:59:51,728 INFO L273 TraceCheckUtils]: 35: Hoare triple {6704#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6704#false} is VALID [2018-11-23 11:59:51,728 INFO L273 TraceCheckUtils]: 36: Hoare triple {6704#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; {6704#false} is VALID [2018-11-23 11:59:51,728 INFO L273 TraceCheckUtils]: 37: Hoare triple {6704#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6704#false} is VALID [2018-11-23 11:59:51,729 INFO L273 TraceCheckUtils]: 38: Hoare triple {6704#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; {6704#false} is VALID [2018-11-23 11:59:51,729 INFO L273 TraceCheckUtils]: 39: Hoare triple {6704#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6704#false} is VALID [2018-11-23 11:59:51,729 INFO L273 TraceCheckUtils]: 40: Hoare triple {6704#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; {6704#false} is VALID [2018-11-23 11:59:51,729 INFO L273 TraceCheckUtils]: 41: Hoare triple {6704#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6704#false} is VALID [2018-11-23 11:59:51,729 INFO L273 TraceCheckUtils]: 42: Hoare triple {6704#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; {6704#false} is VALID [2018-11-23 11:59:51,730 INFO L273 TraceCheckUtils]: 43: Hoare triple {6704#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6704#false} is VALID [2018-11-23 11:59:51,730 INFO L273 TraceCheckUtils]: 44: Hoare triple {6704#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; {6704#false} is VALID [2018-11-23 11:59:51,730 INFO L273 TraceCheckUtils]: 45: Hoare triple {6704#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6704#false} is VALID [2018-11-23 11:59:51,730 INFO L273 TraceCheckUtils]: 46: Hoare triple {6704#false} assume !(~i~0 < 100000); {6704#false} is VALID [2018-11-23 11:59:51,730 INFO L273 TraceCheckUtils]: 47: Hoare triple {6704#false} ~i~0 := 0; {6704#false} is VALID [2018-11-23 11:59:51,730 INFO L273 TraceCheckUtils]: 48: Hoare triple {6704#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; {6704#false} is VALID [2018-11-23 11:59:51,731 INFO L273 TraceCheckUtils]: 49: Hoare triple {6704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6704#false} is VALID [2018-11-23 11:59:51,731 INFO L273 TraceCheckUtils]: 50: Hoare triple {6704#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; {6704#false} is VALID [2018-11-23 11:59:51,731 INFO L273 TraceCheckUtils]: 51: Hoare triple {6704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6704#false} is VALID [2018-11-23 11:59:51,731 INFO L273 TraceCheckUtils]: 52: Hoare triple {6704#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; {6704#false} is VALID [2018-11-23 11:59:51,731 INFO L273 TraceCheckUtils]: 53: Hoare triple {6704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6704#false} is VALID [2018-11-23 11:59:51,731 INFO L273 TraceCheckUtils]: 54: Hoare triple {6704#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; {6704#false} is VALID [2018-11-23 11:59:51,731 INFO L273 TraceCheckUtils]: 55: Hoare triple {6704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6704#false} is VALID [2018-11-23 11:59:51,731 INFO L273 TraceCheckUtils]: 56: Hoare triple {6704#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; {6704#false} is VALID [2018-11-23 11:59:51,732 INFO L273 TraceCheckUtils]: 57: Hoare triple {6704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6704#false} is VALID [2018-11-23 11:59:51,732 INFO L273 TraceCheckUtils]: 58: Hoare triple {6704#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; {6704#false} is VALID [2018-11-23 11:59:51,732 INFO L273 TraceCheckUtils]: 59: Hoare triple {6704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6704#false} is VALID [2018-11-23 11:59:51,732 INFO L273 TraceCheckUtils]: 60: Hoare triple {6704#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; {6704#false} is VALID [2018-11-23 11:59:51,732 INFO L273 TraceCheckUtils]: 61: Hoare triple {6704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6704#false} is VALID [2018-11-23 11:59:51,732 INFO L273 TraceCheckUtils]: 62: Hoare triple {6704#false} assume !(~i~0 < 100000); {6704#false} is VALID [2018-11-23 11:59:51,732 INFO L273 TraceCheckUtils]: 63: Hoare triple {6704#false} ~i~0 := 0; {6704#false} is VALID [2018-11-23 11:59:51,732 INFO L273 TraceCheckUtils]: 64: Hoare triple {6704#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; {6704#false} is VALID [2018-11-23 11:59:51,733 INFO L273 TraceCheckUtils]: 65: Hoare triple {6704#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6704#false} is VALID [2018-11-23 11:59:51,733 INFO L273 TraceCheckUtils]: 66: Hoare triple {6704#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; {6704#false} is VALID [2018-11-23 11:59:51,733 INFO L273 TraceCheckUtils]: 67: Hoare triple {6704#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6704#false} is VALID [2018-11-23 11:59:51,733 INFO L273 TraceCheckUtils]: 68: Hoare triple {6704#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; {6704#false} is VALID [2018-11-23 11:59:51,733 INFO L273 TraceCheckUtils]: 69: Hoare triple {6704#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6704#false} is VALID [2018-11-23 11:59:51,733 INFO L273 TraceCheckUtils]: 70: Hoare triple {6704#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; {6704#false} is VALID [2018-11-23 11:59:51,733 INFO L273 TraceCheckUtils]: 71: Hoare triple {6704#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6704#false} is VALID [2018-11-23 11:59:51,733 INFO L273 TraceCheckUtils]: 72: Hoare triple {6704#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; {6704#false} is VALID [2018-11-23 11:59:51,734 INFO L273 TraceCheckUtils]: 73: Hoare triple {6704#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6704#false} is VALID [2018-11-23 11:59:51,734 INFO L273 TraceCheckUtils]: 74: Hoare triple {6704#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; {6704#false} is VALID [2018-11-23 11:59:51,734 INFO L273 TraceCheckUtils]: 75: Hoare triple {6704#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6704#false} is VALID [2018-11-23 11:59:51,734 INFO L273 TraceCheckUtils]: 76: Hoare triple {6704#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; {6704#false} is VALID [2018-11-23 11:59:51,734 INFO L273 TraceCheckUtils]: 77: Hoare triple {6704#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6704#false} is VALID [2018-11-23 11:59:51,734 INFO L273 TraceCheckUtils]: 78: Hoare triple {6704#false} assume !(~i~0 < 100000); {6704#false} is VALID [2018-11-23 11:59:51,735 INFO L273 TraceCheckUtils]: 79: Hoare triple {6704#false} havoc ~x~0;~x~0 := 0; {6704#false} is VALID [2018-11-23 11:59:51,735 INFO L273 TraceCheckUtils]: 80: Hoare triple {6704#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {6704#false} is VALID [2018-11-23 11:59:51,735 INFO L256 TraceCheckUtils]: 81: Hoare triple {6704#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {6704#false} is VALID [2018-11-23 11:59:51,735 INFO L273 TraceCheckUtils]: 82: Hoare triple {6704#false} ~cond := #in~cond; {6704#false} is VALID [2018-11-23 11:59:51,735 INFO L273 TraceCheckUtils]: 83: Hoare triple {6704#false} assume 0 == ~cond; {6704#false} is VALID [2018-11-23 11:59:51,735 INFO L273 TraceCheckUtils]: 84: Hoare triple {6704#false} assume !false; {6704#false} is VALID [2018-11-23 11:59:51,739 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-11-23 11:59:51,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:51,739 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:59:51,748 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:59:57,817 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 11:59:57,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:57,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:58,069 INFO L256 TraceCheckUtils]: 0: Hoare triple {6703#true} call ULTIMATE.init(); {6703#true} is VALID [2018-11-23 11:59:58,070 INFO L273 TraceCheckUtils]: 1: Hoare triple {6703#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6703#true} is VALID [2018-11-23 11:59:58,070 INFO L273 TraceCheckUtils]: 2: Hoare triple {6703#true} assume true; {6703#true} is VALID [2018-11-23 11:59:58,070 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6703#true} {6703#true} #91#return; {6703#true} is VALID [2018-11-23 11:59:58,071 INFO L256 TraceCheckUtils]: 4: Hoare triple {6703#true} call #t~ret11 := main(); {6703#true} is VALID [2018-11-23 11:59:58,071 INFO L273 TraceCheckUtils]: 5: Hoare triple {6703#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);havoc ~a~0;~a~0 := 0; {6703#true} is VALID [2018-11-23 11:59:58,071 INFO L273 TraceCheckUtils]: 6: Hoare triple {6703#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; {6703#true} is VALID [2018-11-23 11:59:58,071 INFO L273 TraceCheckUtils]: 7: Hoare triple {6703#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6703#true} is VALID [2018-11-23 11:59:58,071 INFO L273 TraceCheckUtils]: 8: Hoare triple {6703#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; {6703#true} is VALID [2018-11-23 11:59:58,071 INFO L273 TraceCheckUtils]: 9: Hoare triple {6703#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6703#true} is VALID [2018-11-23 11:59:58,072 INFO L273 TraceCheckUtils]: 10: Hoare triple {6703#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; {6703#true} is VALID [2018-11-23 11:59:58,072 INFO L273 TraceCheckUtils]: 11: Hoare triple {6703#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6703#true} is VALID [2018-11-23 11:59:58,072 INFO L273 TraceCheckUtils]: 12: Hoare triple {6703#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; {6703#true} is VALID [2018-11-23 11:59:58,072 INFO L273 TraceCheckUtils]: 13: Hoare triple {6703#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6703#true} is VALID [2018-11-23 11:59:58,072 INFO L273 TraceCheckUtils]: 14: Hoare triple {6703#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; {6703#true} is VALID [2018-11-23 11:59:58,072 INFO L273 TraceCheckUtils]: 15: Hoare triple {6703#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6703#true} is VALID [2018-11-23 11:59:58,072 INFO L273 TraceCheckUtils]: 16: Hoare triple {6703#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; {6703#true} is VALID [2018-11-23 11:59:58,073 INFO L273 TraceCheckUtils]: 17: Hoare triple {6703#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6703#true} is VALID [2018-11-23 11:59:58,073 INFO L273 TraceCheckUtils]: 18: Hoare triple {6703#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; {6703#true} is VALID [2018-11-23 11:59:58,073 INFO L273 TraceCheckUtils]: 19: Hoare triple {6703#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6703#true} is VALID [2018-11-23 11:59:58,073 INFO L273 TraceCheckUtils]: 20: Hoare triple {6703#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; {6703#true} is VALID [2018-11-23 11:59:58,073 INFO L273 TraceCheckUtils]: 21: Hoare triple {6703#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6703#true} is VALID [2018-11-23 11:59:58,074 INFO L273 TraceCheckUtils]: 22: Hoare triple {6703#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; {6703#true} is VALID [2018-11-23 11:59:58,074 INFO L273 TraceCheckUtils]: 23: Hoare triple {6703#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6703#true} is VALID [2018-11-23 11:59:58,074 INFO L273 TraceCheckUtils]: 24: Hoare triple {6703#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; {6703#true} is VALID [2018-11-23 11:59:58,074 INFO L273 TraceCheckUtils]: 25: Hoare triple {6703#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6703#true} is VALID [2018-11-23 11:59:58,074 INFO L273 TraceCheckUtils]: 26: Hoare triple {6703#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; {6703#true} is VALID [2018-11-23 11:59:58,074 INFO L273 TraceCheckUtils]: 27: Hoare triple {6703#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6703#true} is VALID [2018-11-23 11:59:58,075 INFO L273 TraceCheckUtils]: 28: Hoare triple {6703#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; {6703#true} is VALID [2018-11-23 11:59:58,075 INFO L273 TraceCheckUtils]: 29: Hoare triple {6703#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6703#true} is VALID [2018-11-23 11:59:58,075 INFO L273 TraceCheckUtils]: 30: Hoare triple {6703#true} assume !(~a~0 < 100000); {6703#true} is VALID [2018-11-23 11:59:58,090 INFO L273 TraceCheckUtils]: 31: Hoare triple {6703#true} havoc ~i~0;~i~0 := 0; {6814#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:58,091 INFO L273 TraceCheckUtils]: 32: Hoare triple {6814#(<= 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; {6814#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:58,091 INFO L273 TraceCheckUtils]: 33: Hoare triple {6814#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6821#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:58,092 INFO L273 TraceCheckUtils]: 34: Hoare triple {6821#(<= 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; {6821#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:58,092 INFO L273 TraceCheckUtils]: 35: Hoare triple {6821#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6828#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:58,092 INFO L273 TraceCheckUtils]: 36: Hoare triple {6828#(<= 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; {6828#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:58,093 INFO L273 TraceCheckUtils]: 37: Hoare triple {6828#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6835#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:58,093 INFO L273 TraceCheckUtils]: 38: Hoare triple {6835#(<= 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; {6835#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:58,094 INFO L273 TraceCheckUtils]: 39: Hoare triple {6835#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6842#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:58,096 INFO L273 TraceCheckUtils]: 40: Hoare triple {6842#(<= 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; {6842#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:58,096 INFO L273 TraceCheckUtils]: 41: Hoare triple {6842#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6849#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:58,097 INFO L273 TraceCheckUtils]: 42: Hoare triple {6849#(<= 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; {6849#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:58,097 INFO L273 TraceCheckUtils]: 43: Hoare triple {6849#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6856#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:58,097 INFO L273 TraceCheckUtils]: 44: Hoare triple {6856#(<= 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; {6856#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:58,098 INFO L273 TraceCheckUtils]: 45: Hoare triple {6856#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6863#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:58,098 INFO L273 TraceCheckUtils]: 46: Hoare triple {6863#(<= main_~i~0 7)} assume !(~i~0 < 100000); {6704#false} is VALID [2018-11-23 11:59:58,098 INFO L273 TraceCheckUtils]: 47: Hoare triple {6704#false} ~i~0 := 0; {6704#false} is VALID [2018-11-23 11:59:58,098 INFO L273 TraceCheckUtils]: 48: Hoare triple {6704#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; {6704#false} is VALID [2018-11-23 11:59:58,099 INFO L273 TraceCheckUtils]: 49: Hoare triple {6704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6704#false} is VALID [2018-11-23 11:59:58,099 INFO L273 TraceCheckUtils]: 50: Hoare triple {6704#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; {6704#false} is VALID [2018-11-23 11:59:58,099 INFO L273 TraceCheckUtils]: 51: Hoare triple {6704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6704#false} is VALID [2018-11-23 11:59:58,099 INFO L273 TraceCheckUtils]: 52: Hoare triple {6704#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; {6704#false} is VALID [2018-11-23 11:59:58,099 INFO L273 TraceCheckUtils]: 53: Hoare triple {6704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6704#false} is VALID [2018-11-23 11:59:58,099 INFO L273 TraceCheckUtils]: 54: Hoare triple {6704#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; {6704#false} is VALID [2018-11-23 11:59:58,099 INFO L273 TraceCheckUtils]: 55: Hoare triple {6704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6704#false} is VALID [2018-11-23 11:59:58,100 INFO L273 TraceCheckUtils]: 56: Hoare triple {6704#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; {6704#false} is VALID [2018-11-23 11:59:58,100 INFO L273 TraceCheckUtils]: 57: Hoare triple {6704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6704#false} is VALID [2018-11-23 11:59:58,100 INFO L273 TraceCheckUtils]: 58: Hoare triple {6704#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; {6704#false} is VALID [2018-11-23 11:59:58,100 INFO L273 TraceCheckUtils]: 59: Hoare triple {6704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6704#false} is VALID [2018-11-23 11:59:58,100 INFO L273 TraceCheckUtils]: 60: Hoare triple {6704#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; {6704#false} is VALID [2018-11-23 11:59:58,101 INFO L273 TraceCheckUtils]: 61: Hoare triple {6704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6704#false} is VALID [2018-11-23 11:59:58,101 INFO L273 TraceCheckUtils]: 62: Hoare triple {6704#false} assume !(~i~0 < 100000); {6704#false} is VALID [2018-11-23 11:59:58,101 INFO L273 TraceCheckUtils]: 63: Hoare triple {6704#false} ~i~0 := 0; {6704#false} is VALID [2018-11-23 11:59:58,101 INFO L273 TraceCheckUtils]: 64: Hoare triple {6704#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; {6704#false} is VALID [2018-11-23 11:59:58,101 INFO L273 TraceCheckUtils]: 65: Hoare triple {6704#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6704#false} is VALID [2018-11-23 11:59:58,101 INFO L273 TraceCheckUtils]: 66: Hoare triple {6704#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; {6704#false} is VALID [2018-11-23 11:59:58,102 INFO L273 TraceCheckUtils]: 67: Hoare triple {6704#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6704#false} is VALID [2018-11-23 11:59:58,102 INFO L273 TraceCheckUtils]: 68: Hoare triple {6704#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; {6704#false} is VALID [2018-11-23 11:59:58,102 INFO L273 TraceCheckUtils]: 69: Hoare triple {6704#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6704#false} is VALID [2018-11-23 11:59:58,102 INFO L273 TraceCheckUtils]: 70: Hoare triple {6704#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; {6704#false} is VALID [2018-11-23 11:59:58,102 INFO L273 TraceCheckUtils]: 71: Hoare triple {6704#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6704#false} is VALID [2018-11-23 11:59:58,102 INFO L273 TraceCheckUtils]: 72: Hoare triple {6704#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; {6704#false} is VALID [2018-11-23 11:59:58,102 INFO L273 TraceCheckUtils]: 73: Hoare triple {6704#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6704#false} is VALID [2018-11-23 11:59:58,102 INFO L273 TraceCheckUtils]: 74: Hoare triple {6704#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; {6704#false} is VALID [2018-11-23 11:59:58,102 INFO L273 TraceCheckUtils]: 75: Hoare triple {6704#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6704#false} is VALID [2018-11-23 11:59:58,103 INFO L273 TraceCheckUtils]: 76: Hoare triple {6704#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; {6704#false} is VALID [2018-11-23 11:59:58,103 INFO L273 TraceCheckUtils]: 77: Hoare triple {6704#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6704#false} is VALID [2018-11-23 11:59:58,103 INFO L273 TraceCheckUtils]: 78: Hoare triple {6704#false} assume !(~i~0 < 100000); {6704#false} is VALID [2018-11-23 11:59:58,103 INFO L273 TraceCheckUtils]: 79: Hoare triple {6704#false} havoc ~x~0;~x~0 := 0; {6704#false} is VALID [2018-11-23 11:59:58,103 INFO L273 TraceCheckUtils]: 80: Hoare triple {6704#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {6704#false} is VALID [2018-11-23 11:59:58,103 INFO L256 TraceCheckUtils]: 81: Hoare triple {6704#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {6704#false} is VALID [2018-11-23 11:59:58,103 INFO L273 TraceCheckUtils]: 82: Hoare triple {6704#false} ~cond := #in~cond; {6704#false} is VALID [2018-11-23 11:59:58,103 INFO L273 TraceCheckUtils]: 83: Hoare triple {6704#false} assume 0 == ~cond; {6704#false} is VALID [2018-11-23 11:59:58,104 INFO L273 TraceCheckUtils]: 84: Hoare triple {6704#false} assume !false; {6704#false} is VALID [2018-11-23 11:59:58,107 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-11-23 11:59:58,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:58,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2018-11-23 11:59:58,128 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 85 [2018-11-23 11:59:58,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:58,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 11:59:58,191 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:58,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 11:59:58,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 11:59:58,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:59:58,192 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 23 states. [2018-11-23 11:59:59,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:59,441 INFO L93 Difference]: Finished difference Result 161 states and 172 transitions. [2018-11-23 11:59:59,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 11:59:59,442 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 85 [2018-11-23 11:59:59,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:59,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:59:59,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 133 transitions. [2018-11-23 11:59:59,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:59:59,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 133 transitions. [2018-11-23 11:59:59,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 133 transitions. [2018-11-23 11:59:59,607 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:59,610 INFO L225 Difference]: With dead ends: 161 [2018-11-23 11:59:59,610 INFO L226 Difference]: Without dead ends: 102 [2018-11-23 11:59:59,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:59:59,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-23 11:59:59,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2018-11-23 11:59:59,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:59,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 98 states. [2018-11-23 11:59:59,660 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 98 states. [2018-11-23 11:59:59,660 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 98 states. [2018-11-23 11:59:59,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:59,662 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2018-11-23 11:59:59,662 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2018-11-23 11:59:59,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:59,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:59,663 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 102 states. [2018-11-23 11:59:59,663 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 102 states. [2018-11-23 11:59:59,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:59,665 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2018-11-23 11:59:59,665 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2018-11-23 11:59:59,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:59,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:59,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:59,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:59,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-23 11:59:59,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2018-11-23 11:59:59,668 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 85 [2018-11-23 11:59:59,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:59,669 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2018-11-23 11:59:59,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 11:59:59,669 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2018-11-23 11:59:59,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-23 11:59:59,670 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:59,670 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 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] [2018-11-23 11:59:59,671 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:59,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:59,671 INFO L82 PathProgramCache]: Analyzing trace with hash -590141276, now seen corresponding path program 13 times [2018-11-23 11:59:59,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:59,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:59,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:59,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:59,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:00,847 INFO L256 TraceCheckUtils]: 0: Hoare triple {7566#true} call ULTIMATE.init(); {7566#true} is VALID [2018-11-23 12:00:00,847 INFO L273 TraceCheckUtils]: 1: Hoare triple {7566#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7566#true} is VALID [2018-11-23 12:00:00,848 INFO L273 TraceCheckUtils]: 2: Hoare triple {7566#true} assume true; {7566#true} is VALID [2018-11-23 12:00:00,848 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7566#true} {7566#true} #91#return; {7566#true} is VALID [2018-11-23 12:00:00,848 INFO L256 TraceCheckUtils]: 4: Hoare triple {7566#true} call #t~ret11 := main(); {7566#true} is VALID [2018-11-23 12:00:00,849 INFO L273 TraceCheckUtils]: 5: Hoare triple {7566#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);havoc ~a~0;~a~0 := 0; {7568#(= main_~a~0 0)} is VALID [2018-11-23 12:00:00,850 INFO L273 TraceCheckUtils]: 6: Hoare triple {7568#(= 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; {7568#(= main_~a~0 0)} is VALID [2018-11-23 12:00:00,850 INFO L273 TraceCheckUtils]: 7: Hoare triple {7568#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7569#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:00,851 INFO L273 TraceCheckUtils]: 8: Hoare triple {7569#(<= 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; {7569#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:00,851 INFO L273 TraceCheckUtils]: 9: Hoare triple {7569#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7570#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:00,851 INFO L273 TraceCheckUtils]: 10: Hoare triple {7570#(<= 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; {7570#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:00,852 INFO L273 TraceCheckUtils]: 11: Hoare triple {7570#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7571#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:00,852 INFO L273 TraceCheckUtils]: 12: Hoare triple {7571#(<= 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; {7571#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:00,853 INFO L273 TraceCheckUtils]: 13: Hoare triple {7571#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7572#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:00,854 INFO L273 TraceCheckUtils]: 14: Hoare triple {7572#(<= 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; {7572#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:00,855 INFO L273 TraceCheckUtils]: 15: Hoare triple {7572#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7573#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:00,855 INFO L273 TraceCheckUtils]: 16: Hoare triple {7573#(<= 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; {7573#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:00,856 INFO L273 TraceCheckUtils]: 17: Hoare triple {7573#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7574#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:00,857 INFO L273 TraceCheckUtils]: 18: Hoare triple {7574#(<= 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; {7574#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:00,857 INFO L273 TraceCheckUtils]: 19: Hoare triple {7574#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7575#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:00,858 INFO L273 TraceCheckUtils]: 20: Hoare triple {7575#(<= 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; {7575#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:00,859 INFO L273 TraceCheckUtils]: 21: Hoare triple {7575#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7576#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:00,859 INFO L273 TraceCheckUtils]: 22: Hoare triple {7576#(<= 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; {7576#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:00,860 INFO L273 TraceCheckUtils]: 23: Hoare triple {7576#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7577#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:00,861 INFO L273 TraceCheckUtils]: 24: Hoare triple {7577#(<= 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; {7577#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:00,862 INFO L273 TraceCheckUtils]: 25: Hoare triple {7577#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7578#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:00,862 INFO L273 TraceCheckUtils]: 26: Hoare triple {7578#(<= 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; {7578#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:00,863 INFO L273 TraceCheckUtils]: 27: Hoare triple {7578#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7579#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:00,864 INFO L273 TraceCheckUtils]: 28: Hoare triple {7579#(<= 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; {7579#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:00,865 INFO L273 TraceCheckUtils]: 29: Hoare triple {7579#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7580#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:00,865 INFO L273 TraceCheckUtils]: 30: Hoare triple {7580#(<= 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; {7580#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:00,866 INFO L273 TraceCheckUtils]: 31: Hoare triple {7580#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7581#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:00,867 INFO L273 TraceCheckUtils]: 32: Hoare triple {7581#(<= main_~a~0 13)} assume !(~a~0 < 100000); {7567#false} is VALID [2018-11-23 12:00:00,867 INFO L273 TraceCheckUtils]: 33: Hoare triple {7567#false} havoc ~i~0;~i~0 := 0; {7567#false} is VALID [2018-11-23 12:00:00,867 INFO L273 TraceCheckUtils]: 34: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:00,868 INFO L273 TraceCheckUtils]: 35: Hoare triple {7567#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7567#false} is VALID [2018-11-23 12:00:00,868 INFO L273 TraceCheckUtils]: 36: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:00,869 INFO L273 TraceCheckUtils]: 37: Hoare triple {7567#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7567#false} is VALID [2018-11-23 12:00:00,869 INFO L273 TraceCheckUtils]: 38: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:00,869 INFO L273 TraceCheckUtils]: 39: Hoare triple {7567#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7567#false} is VALID [2018-11-23 12:00:00,870 INFO L273 TraceCheckUtils]: 40: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:00,870 INFO L273 TraceCheckUtils]: 41: Hoare triple {7567#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7567#false} is VALID [2018-11-23 12:00:00,870 INFO L273 TraceCheckUtils]: 42: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:00,870 INFO L273 TraceCheckUtils]: 43: Hoare triple {7567#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7567#false} is VALID [2018-11-23 12:00:00,870 INFO L273 TraceCheckUtils]: 44: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:00,871 INFO L273 TraceCheckUtils]: 45: Hoare triple {7567#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7567#false} is VALID [2018-11-23 12:00:00,871 INFO L273 TraceCheckUtils]: 46: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:00,871 INFO L273 TraceCheckUtils]: 47: Hoare triple {7567#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7567#false} is VALID [2018-11-23 12:00:00,871 INFO L273 TraceCheckUtils]: 48: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:00,872 INFO L273 TraceCheckUtils]: 49: Hoare triple {7567#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7567#false} is VALID [2018-11-23 12:00:00,872 INFO L273 TraceCheckUtils]: 50: Hoare triple {7567#false} assume !(~i~0 < 100000); {7567#false} is VALID [2018-11-23 12:00:00,872 INFO L273 TraceCheckUtils]: 51: Hoare triple {7567#false} ~i~0 := 0; {7567#false} is VALID [2018-11-23 12:00:00,872 INFO L273 TraceCheckUtils]: 52: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:00,872 INFO L273 TraceCheckUtils]: 53: Hoare triple {7567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7567#false} is VALID [2018-11-23 12:00:00,873 INFO L273 TraceCheckUtils]: 54: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:00,873 INFO L273 TraceCheckUtils]: 55: Hoare triple {7567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7567#false} is VALID [2018-11-23 12:00:00,873 INFO L273 TraceCheckUtils]: 56: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:00,873 INFO L273 TraceCheckUtils]: 57: Hoare triple {7567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7567#false} is VALID [2018-11-23 12:00:00,874 INFO L273 TraceCheckUtils]: 58: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:00,874 INFO L273 TraceCheckUtils]: 59: Hoare triple {7567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7567#false} is VALID [2018-11-23 12:00:00,874 INFO L273 TraceCheckUtils]: 60: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:00,874 INFO L273 TraceCheckUtils]: 61: Hoare triple {7567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7567#false} is VALID [2018-11-23 12:00:00,874 INFO L273 TraceCheckUtils]: 62: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:00,875 INFO L273 TraceCheckUtils]: 63: Hoare triple {7567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7567#false} is VALID [2018-11-23 12:00:00,875 INFO L273 TraceCheckUtils]: 64: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:00,875 INFO L273 TraceCheckUtils]: 65: Hoare triple {7567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7567#false} is VALID [2018-11-23 12:00:00,875 INFO L273 TraceCheckUtils]: 66: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:00,876 INFO L273 TraceCheckUtils]: 67: Hoare triple {7567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7567#false} is VALID [2018-11-23 12:00:00,876 INFO L273 TraceCheckUtils]: 68: Hoare triple {7567#false} assume !(~i~0 < 100000); {7567#false} is VALID [2018-11-23 12:00:00,876 INFO L273 TraceCheckUtils]: 69: Hoare triple {7567#false} ~i~0 := 0; {7567#false} is VALID [2018-11-23 12:00:00,876 INFO L273 TraceCheckUtils]: 70: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:00,876 INFO L273 TraceCheckUtils]: 71: Hoare triple {7567#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7567#false} is VALID [2018-11-23 12:00:00,877 INFO L273 TraceCheckUtils]: 72: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:00,877 INFO L273 TraceCheckUtils]: 73: Hoare triple {7567#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7567#false} is VALID [2018-11-23 12:00:00,877 INFO L273 TraceCheckUtils]: 74: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:00,877 INFO L273 TraceCheckUtils]: 75: Hoare triple {7567#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7567#false} is VALID [2018-11-23 12:00:00,877 INFO L273 TraceCheckUtils]: 76: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:00,878 INFO L273 TraceCheckUtils]: 77: Hoare triple {7567#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7567#false} is VALID [2018-11-23 12:00:00,878 INFO L273 TraceCheckUtils]: 78: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:00,878 INFO L273 TraceCheckUtils]: 79: Hoare triple {7567#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7567#false} is VALID [2018-11-23 12:00:00,878 INFO L273 TraceCheckUtils]: 80: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:00,878 INFO L273 TraceCheckUtils]: 81: Hoare triple {7567#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7567#false} is VALID [2018-11-23 12:00:00,879 INFO L273 TraceCheckUtils]: 82: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:00,879 INFO L273 TraceCheckUtils]: 83: Hoare triple {7567#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7567#false} is VALID [2018-11-23 12:00:00,879 INFO L273 TraceCheckUtils]: 84: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:00,879 INFO L273 TraceCheckUtils]: 85: Hoare triple {7567#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7567#false} is VALID [2018-11-23 12:00:00,879 INFO L273 TraceCheckUtils]: 86: Hoare triple {7567#false} assume !(~i~0 < 100000); {7567#false} is VALID [2018-11-23 12:00:00,880 INFO L273 TraceCheckUtils]: 87: Hoare triple {7567#false} havoc ~x~0;~x~0 := 0; {7567#false} is VALID [2018-11-23 12:00:00,880 INFO L273 TraceCheckUtils]: 88: Hoare triple {7567#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {7567#false} is VALID [2018-11-23 12:00:00,880 INFO L256 TraceCheckUtils]: 89: Hoare triple {7567#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {7567#false} is VALID [2018-11-23 12:00:00,880 INFO L273 TraceCheckUtils]: 90: Hoare triple {7567#false} ~cond := #in~cond; {7567#false} is VALID [2018-11-23 12:00:00,880 INFO L273 TraceCheckUtils]: 91: Hoare triple {7567#false} assume 0 == ~cond; {7567#false} is VALID [2018-11-23 12:00:00,881 INFO L273 TraceCheckUtils]: 92: Hoare triple {7567#false} assume !false; {7567#false} is VALID [2018-11-23 12:00:00,908 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-11-23 12:00:00,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:00,911 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:00,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:00:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:00,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:01,301 INFO L256 TraceCheckUtils]: 0: Hoare triple {7566#true} call ULTIMATE.init(); {7566#true} is VALID [2018-11-23 12:00:01,301 INFO L273 TraceCheckUtils]: 1: Hoare triple {7566#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7566#true} is VALID [2018-11-23 12:00:01,302 INFO L273 TraceCheckUtils]: 2: Hoare triple {7566#true} assume true; {7566#true} is VALID [2018-11-23 12:00:01,302 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7566#true} {7566#true} #91#return; {7566#true} is VALID [2018-11-23 12:00:01,302 INFO L256 TraceCheckUtils]: 4: Hoare triple {7566#true} call #t~ret11 := main(); {7566#true} is VALID [2018-11-23 12:00:01,303 INFO L273 TraceCheckUtils]: 5: Hoare triple {7566#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);havoc ~a~0;~a~0 := 0; {7600#(<= main_~a~0 0)} is VALID [2018-11-23 12:00:01,303 INFO L273 TraceCheckUtils]: 6: Hoare triple {7600#(<= 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; {7600#(<= main_~a~0 0)} is VALID [2018-11-23 12:00:01,304 INFO L273 TraceCheckUtils]: 7: Hoare triple {7600#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7569#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:01,304 INFO L273 TraceCheckUtils]: 8: Hoare triple {7569#(<= 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; {7569#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:01,304 INFO L273 TraceCheckUtils]: 9: Hoare triple {7569#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7570#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:01,305 INFO L273 TraceCheckUtils]: 10: Hoare triple {7570#(<= 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; {7570#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:01,305 INFO L273 TraceCheckUtils]: 11: Hoare triple {7570#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7571#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:01,306 INFO L273 TraceCheckUtils]: 12: Hoare triple {7571#(<= 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; {7571#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:01,306 INFO L273 TraceCheckUtils]: 13: Hoare triple {7571#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7572#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:01,307 INFO L273 TraceCheckUtils]: 14: Hoare triple {7572#(<= 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; {7572#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:01,307 INFO L273 TraceCheckUtils]: 15: Hoare triple {7572#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7573#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:01,308 INFO L273 TraceCheckUtils]: 16: Hoare triple {7573#(<= 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; {7573#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:01,309 INFO L273 TraceCheckUtils]: 17: Hoare triple {7573#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7574#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:01,309 INFO L273 TraceCheckUtils]: 18: Hoare triple {7574#(<= 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; {7574#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:01,310 INFO L273 TraceCheckUtils]: 19: Hoare triple {7574#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7575#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:01,310 INFO L273 TraceCheckUtils]: 20: Hoare triple {7575#(<= 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; {7575#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:01,311 INFO L273 TraceCheckUtils]: 21: Hoare triple {7575#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7576#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:01,312 INFO L273 TraceCheckUtils]: 22: Hoare triple {7576#(<= 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; {7576#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:01,312 INFO L273 TraceCheckUtils]: 23: Hoare triple {7576#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7577#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:01,313 INFO L273 TraceCheckUtils]: 24: Hoare triple {7577#(<= 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; {7577#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:01,314 INFO L273 TraceCheckUtils]: 25: Hoare triple {7577#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7578#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:01,314 INFO L273 TraceCheckUtils]: 26: Hoare triple {7578#(<= 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; {7578#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:01,315 INFO L273 TraceCheckUtils]: 27: Hoare triple {7578#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7579#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:01,315 INFO L273 TraceCheckUtils]: 28: Hoare triple {7579#(<= 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; {7579#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:01,316 INFO L273 TraceCheckUtils]: 29: Hoare triple {7579#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7580#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:01,316 INFO L273 TraceCheckUtils]: 30: Hoare triple {7580#(<= 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; {7580#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:01,317 INFO L273 TraceCheckUtils]: 31: Hoare triple {7580#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7581#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:01,318 INFO L273 TraceCheckUtils]: 32: Hoare triple {7581#(<= main_~a~0 13)} assume !(~a~0 < 100000); {7567#false} is VALID [2018-11-23 12:00:01,318 INFO L273 TraceCheckUtils]: 33: Hoare triple {7567#false} havoc ~i~0;~i~0 := 0; {7567#false} is VALID [2018-11-23 12:00:01,318 INFO L273 TraceCheckUtils]: 34: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:01,318 INFO L273 TraceCheckUtils]: 35: Hoare triple {7567#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7567#false} is VALID [2018-11-23 12:00:01,319 INFO L273 TraceCheckUtils]: 36: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:01,319 INFO L273 TraceCheckUtils]: 37: Hoare triple {7567#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7567#false} is VALID [2018-11-23 12:00:01,319 INFO L273 TraceCheckUtils]: 38: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:01,319 INFO L273 TraceCheckUtils]: 39: Hoare triple {7567#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7567#false} is VALID [2018-11-23 12:00:01,319 INFO L273 TraceCheckUtils]: 40: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:01,320 INFO L273 TraceCheckUtils]: 41: Hoare triple {7567#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7567#false} is VALID [2018-11-23 12:00:01,320 INFO L273 TraceCheckUtils]: 42: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:01,320 INFO L273 TraceCheckUtils]: 43: Hoare triple {7567#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7567#false} is VALID [2018-11-23 12:00:01,320 INFO L273 TraceCheckUtils]: 44: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:01,320 INFO L273 TraceCheckUtils]: 45: Hoare triple {7567#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7567#false} is VALID [2018-11-23 12:00:01,320 INFO L273 TraceCheckUtils]: 46: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:01,321 INFO L273 TraceCheckUtils]: 47: Hoare triple {7567#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7567#false} is VALID [2018-11-23 12:00:01,321 INFO L273 TraceCheckUtils]: 48: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:01,321 INFO L273 TraceCheckUtils]: 49: Hoare triple {7567#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7567#false} is VALID [2018-11-23 12:00:01,321 INFO L273 TraceCheckUtils]: 50: Hoare triple {7567#false} assume !(~i~0 < 100000); {7567#false} is VALID [2018-11-23 12:00:01,321 INFO L273 TraceCheckUtils]: 51: Hoare triple {7567#false} ~i~0 := 0; {7567#false} is VALID [2018-11-23 12:00:01,321 INFO L273 TraceCheckUtils]: 52: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:01,321 INFO L273 TraceCheckUtils]: 53: Hoare triple {7567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7567#false} is VALID [2018-11-23 12:00:01,321 INFO L273 TraceCheckUtils]: 54: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:01,321 INFO L273 TraceCheckUtils]: 55: Hoare triple {7567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7567#false} is VALID [2018-11-23 12:00:01,322 INFO L273 TraceCheckUtils]: 56: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:01,322 INFO L273 TraceCheckUtils]: 57: Hoare triple {7567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7567#false} is VALID [2018-11-23 12:00:01,322 INFO L273 TraceCheckUtils]: 58: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:01,322 INFO L273 TraceCheckUtils]: 59: Hoare triple {7567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7567#false} is VALID [2018-11-23 12:00:01,322 INFO L273 TraceCheckUtils]: 60: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:01,322 INFO L273 TraceCheckUtils]: 61: Hoare triple {7567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7567#false} is VALID [2018-11-23 12:00:01,322 INFO L273 TraceCheckUtils]: 62: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:01,322 INFO L273 TraceCheckUtils]: 63: Hoare triple {7567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7567#false} is VALID [2018-11-23 12:00:01,322 INFO L273 TraceCheckUtils]: 64: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:01,323 INFO L273 TraceCheckUtils]: 65: Hoare triple {7567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7567#false} is VALID [2018-11-23 12:00:01,323 INFO L273 TraceCheckUtils]: 66: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:01,323 INFO L273 TraceCheckUtils]: 67: Hoare triple {7567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7567#false} is VALID [2018-11-23 12:00:01,323 INFO L273 TraceCheckUtils]: 68: Hoare triple {7567#false} assume !(~i~0 < 100000); {7567#false} is VALID [2018-11-23 12:00:01,323 INFO L273 TraceCheckUtils]: 69: Hoare triple {7567#false} ~i~0 := 0; {7567#false} is VALID [2018-11-23 12:00:01,323 INFO L273 TraceCheckUtils]: 70: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:01,323 INFO L273 TraceCheckUtils]: 71: Hoare triple {7567#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7567#false} is VALID [2018-11-23 12:00:01,323 INFO L273 TraceCheckUtils]: 72: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:01,324 INFO L273 TraceCheckUtils]: 73: Hoare triple {7567#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7567#false} is VALID [2018-11-23 12:00:01,324 INFO L273 TraceCheckUtils]: 74: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:01,324 INFO L273 TraceCheckUtils]: 75: Hoare triple {7567#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7567#false} is VALID [2018-11-23 12:00:01,324 INFO L273 TraceCheckUtils]: 76: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:01,324 INFO L273 TraceCheckUtils]: 77: Hoare triple {7567#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7567#false} is VALID [2018-11-23 12:00:01,324 INFO L273 TraceCheckUtils]: 78: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:01,324 INFO L273 TraceCheckUtils]: 79: Hoare triple {7567#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7567#false} is VALID [2018-11-23 12:00:01,324 INFO L273 TraceCheckUtils]: 80: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:01,324 INFO L273 TraceCheckUtils]: 81: Hoare triple {7567#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7567#false} is VALID [2018-11-23 12:00:01,325 INFO L273 TraceCheckUtils]: 82: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:01,325 INFO L273 TraceCheckUtils]: 83: Hoare triple {7567#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7567#false} is VALID [2018-11-23 12:00:01,325 INFO L273 TraceCheckUtils]: 84: Hoare triple {7567#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; {7567#false} is VALID [2018-11-23 12:00:01,325 INFO L273 TraceCheckUtils]: 85: Hoare triple {7567#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7567#false} is VALID [2018-11-23 12:00:01,325 INFO L273 TraceCheckUtils]: 86: Hoare triple {7567#false} assume !(~i~0 < 100000); {7567#false} is VALID [2018-11-23 12:00:01,325 INFO L273 TraceCheckUtils]: 87: Hoare triple {7567#false} havoc ~x~0;~x~0 := 0; {7567#false} is VALID [2018-11-23 12:00:01,325 INFO L273 TraceCheckUtils]: 88: Hoare triple {7567#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {7567#false} is VALID [2018-11-23 12:00:01,325 INFO L256 TraceCheckUtils]: 89: Hoare triple {7567#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {7567#false} is VALID [2018-11-23 12:00:01,326 INFO L273 TraceCheckUtils]: 90: Hoare triple {7567#false} ~cond := #in~cond; {7567#false} is VALID [2018-11-23 12:00:01,326 INFO L273 TraceCheckUtils]: 91: Hoare triple {7567#false} assume 0 == ~cond; {7567#false} is VALID [2018-11-23 12:00:01,326 INFO L273 TraceCheckUtils]: 92: Hoare triple {7567#false} assume !false; {7567#false} is VALID [2018-11-23 12:00:01,330 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-11-23 12:00:01,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:01,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:00:01,350 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 93 [2018-11-23 12:00:01,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:01,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:00:01,401 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:01,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:00:01,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:00:01,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:00:01,402 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand 17 states. [2018-11-23 12:00:01,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:01,816 INFO L93 Difference]: Finished difference Result 166 states and 174 transitions. [2018-11-23 12:00:01,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:00:01,816 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 93 [2018-11-23 12:00:01,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:01,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:00:01,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 84 transitions. [2018-11-23 12:00:01,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:00:01,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 84 transitions. [2018-11-23 12:00:01,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 84 transitions. [2018-11-23 12:00:02,019 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:02,021 INFO L225 Difference]: With dead ends: 166 [2018-11-23 12:00:02,021 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 12:00:02,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:00:02,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 12:00:02,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-11-23 12:00:02,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:02,056 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 100 states. [2018-11-23 12:00:02,056 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 100 states. [2018-11-23 12:00:02,056 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 100 states. [2018-11-23 12:00:02,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:02,058 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-11-23 12:00:02,058 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-23 12:00:02,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:02,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:02,058 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 101 states. [2018-11-23 12:00:02,059 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 101 states. [2018-11-23 12:00:02,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:02,060 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-11-23 12:00:02,061 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-23 12:00:02,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:02,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:02,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:02,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:02,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-23 12:00:02,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2018-11-23 12:00:02,063 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 93 [2018-11-23 12:00:02,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:02,063 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2018-11-23 12:00:02,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:00:02,064 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2018-11-23 12:00:02,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 12:00:02,065 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:02,065 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 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] [2018-11-23 12:00:02,065 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:02,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:02,065 INFO L82 PathProgramCache]: Analyzing trace with hash -2067317950, now seen corresponding path program 14 times [2018-11-23 12:00:02,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:02,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:02,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:02,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:00:02,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:02,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:02,468 INFO L256 TraceCheckUtils]: 0: Hoare triple {8457#true} call ULTIMATE.init(); {8457#true} is VALID [2018-11-23 12:00:02,469 INFO L273 TraceCheckUtils]: 1: Hoare triple {8457#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8457#true} is VALID [2018-11-23 12:00:02,469 INFO L273 TraceCheckUtils]: 2: Hoare triple {8457#true} assume true; {8457#true} is VALID [2018-11-23 12:00:02,469 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8457#true} {8457#true} #91#return; {8457#true} is VALID [2018-11-23 12:00:02,469 INFO L256 TraceCheckUtils]: 4: Hoare triple {8457#true} call #t~ret11 := main(); {8457#true} is VALID [2018-11-23 12:00:02,470 INFO L273 TraceCheckUtils]: 5: Hoare triple {8457#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);havoc ~a~0;~a~0 := 0; {8459#(= main_~a~0 0)} is VALID [2018-11-23 12:00:02,470 INFO L273 TraceCheckUtils]: 6: Hoare triple {8459#(= 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; {8459#(= main_~a~0 0)} is VALID [2018-11-23 12:00:02,471 INFO L273 TraceCheckUtils]: 7: Hoare triple {8459#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8460#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:02,471 INFO L273 TraceCheckUtils]: 8: Hoare triple {8460#(<= 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; {8460#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:02,472 INFO L273 TraceCheckUtils]: 9: Hoare triple {8460#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8461#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:02,472 INFO L273 TraceCheckUtils]: 10: Hoare triple {8461#(<= 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; {8461#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:02,473 INFO L273 TraceCheckUtils]: 11: Hoare triple {8461#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8462#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:02,473 INFO L273 TraceCheckUtils]: 12: Hoare triple {8462#(<= 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; {8462#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:02,473 INFO L273 TraceCheckUtils]: 13: Hoare triple {8462#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8463#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:02,474 INFO L273 TraceCheckUtils]: 14: Hoare triple {8463#(<= 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; {8463#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:02,474 INFO L273 TraceCheckUtils]: 15: Hoare triple {8463#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8464#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:02,475 INFO L273 TraceCheckUtils]: 16: Hoare triple {8464#(<= 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; {8464#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:02,475 INFO L273 TraceCheckUtils]: 17: Hoare triple {8464#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8465#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:02,476 INFO L273 TraceCheckUtils]: 18: Hoare triple {8465#(<= 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; {8465#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:02,476 INFO L273 TraceCheckUtils]: 19: Hoare triple {8465#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8466#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:02,477 INFO L273 TraceCheckUtils]: 20: Hoare triple {8466#(<= 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; {8466#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:02,478 INFO L273 TraceCheckUtils]: 21: Hoare triple {8466#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8467#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:02,478 INFO L273 TraceCheckUtils]: 22: Hoare triple {8467#(<= 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; {8467#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:02,479 INFO L273 TraceCheckUtils]: 23: Hoare triple {8467#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8468#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:02,479 INFO L273 TraceCheckUtils]: 24: Hoare triple {8468#(<= 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; {8468#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:02,480 INFO L273 TraceCheckUtils]: 25: Hoare triple {8468#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8469#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:02,480 INFO L273 TraceCheckUtils]: 26: Hoare triple {8469#(<= 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; {8469#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:02,481 INFO L273 TraceCheckUtils]: 27: Hoare triple {8469#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8470#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:02,482 INFO L273 TraceCheckUtils]: 28: Hoare triple {8470#(<= 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; {8470#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:02,482 INFO L273 TraceCheckUtils]: 29: Hoare triple {8470#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8471#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:02,483 INFO L273 TraceCheckUtils]: 30: Hoare triple {8471#(<= 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; {8471#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:02,484 INFO L273 TraceCheckUtils]: 31: Hoare triple {8471#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8472#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:02,484 INFO L273 TraceCheckUtils]: 32: Hoare triple {8472#(<= 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; {8472#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:02,485 INFO L273 TraceCheckUtils]: 33: Hoare triple {8472#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8473#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:02,485 INFO L273 TraceCheckUtils]: 34: Hoare triple {8473#(<= main_~a~0 14)} assume !(~a~0 < 100000); {8458#false} is VALID [2018-11-23 12:00:02,486 INFO L273 TraceCheckUtils]: 35: Hoare triple {8458#false} havoc ~i~0;~i~0 := 0; {8458#false} is VALID [2018-11-23 12:00:02,486 INFO L273 TraceCheckUtils]: 36: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,486 INFO L273 TraceCheckUtils]: 37: Hoare triple {8458#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8458#false} is VALID [2018-11-23 12:00:02,486 INFO L273 TraceCheckUtils]: 38: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,486 INFO L273 TraceCheckUtils]: 39: Hoare triple {8458#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8458#false} is VALID [2018-11-23 12:00:02,487 INFO L273 TraceCheckUtils]: 40: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,487 INFO L273 TraceCheckUtils]: 41: Hoare triple {8458#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8458#false} is VALID [2018-11-23 12:00:02,487 INFO L273 TraceCheckUtils]: 42: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,487 INFO L273 TraceCheckUtils]: 43: Hoare triple {8458#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8458#false} is VALID [2018-11-23 12:00:02,487 INFO L273 TraceCheckUtils]: 44: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,488 INFO L273 TraceCheckUtils]: 45: Hoare triple {8458#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8458#false} is VALID [2018-11-23 12:00:02,488 INFO L273 TraceCheckUtils]: 46: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,488 INFO L273 TraceCheckUtils]: 47: Hoare triple {8458#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8458#false} is VALID [2018-11-23 12:00:02,488 INFO L273 TraceCheckUtils]: 48: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,488 INFO L273 TraceCheckUtils]: 49: Hoare triple {8458#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8458#false} is VALID [2018-11-23 12:00:02,488 INFO L273 TraceCheckUtils]: 50: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,489 INFO L273 TraceCheckUtils]: 51: Hoare triple {8458#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8458#false} is VALID [2018-11-23 12:00:02,489 INFO L273 TraceCheckUtils]: 52: Hoare triple {8458#false} assume !(~i~0 < 100000); {8458#false} is VALID [2018-11-23 12:00:02,489 INFO L273 TraceCheckUtils]: 53: Hoare triple {8458#false} ~i~0 := 0; {8458#false} is VALID [2018-11-23 12:00:02,489 INFO L273 TraceCheckUtils]: 54: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,489 INFO L273 TraceCheckUtils]: 55: Hoare triple {8458#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8458#false} is VALID [2018-11-23 12:00:02,489 INFO L273 TraceCheckUtils]: 56: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,489 INFO L273 TraceCheckUtils]: 57: Hoare triple {8458#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8458#false} is VALID [2018-11-23 12:00:02,489 INFO L273 TraceCheckUtils]: 58: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,490 INFO L273 TraceCheckUtils]: 59: Hoare triple {8458#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8458#false} is VALID [2018-11-23 12:00:02,490 INFO L273 TraceCheckUtils]: 60: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,490 INFO L273 TraceCheckUtils]: 61: Hoare triple {8458#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8458#false} is VALID [2018-11-23 12:00:02,490 INFO L273 TraceCheckUtils]: 62: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,490 INFO L273 TraceCheckUtils]: 63: Hoare triple {8458#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8458#false} is VALID [2018-11-23 12:00:02,490 INFO L273 TraceCheckUtils]: 64: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,490 INFO L273 TraceCheckUtils]: 65: Hoare triple {8458#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8458#false} is VALID [2018-11-23 12:00:02,490 INFO L273 TraceCheckUtils]: 66: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,490 INFO L273 TraceCheckUtils]: 67: Hoare triple {8458#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8458#false} is VALID [2018-11-23 12:00:02,491 INFO L273 TraceCheckUtils]: 68: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,491 INFO L273 TraceCheckUtils]: 69: Hoare triple {8458#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8458#false} is VALID [2018-11-23 12:00:02,491 INFO L273 TraceCheckUtils]: 70: Hoare triple {8458#false} assume !(~i~0 < 100000); {8458#false} is VALID [2018-11-23 12:00:02,491 INFO L273 TraceCheckUtils]: 71: Hoare triple {8458#false} ~i~0 := 0; {8458#false} is VALID [2018-11-23 12:00:02,491 INFO L273 TraceCheckUtils]: 72: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,491 INFO L273 TraceCheckUtils]: 73: Hoare triple {8458#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8458#false} is VALID [2018-11-23 12:00:02,491 INFO L273 TraceCheckUtils]: 74: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,491 INFO L273 TraceCheckUtils]: 75: Hoare triple {8458#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8458#false} is VALID [2018-11-23 12:00:02,492 INFO L273 TraceCheckUtils]: 76: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,492 INFO L273 TraceCheckUtils]: 77: Hoare triple {8458#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8458#false} is VALID [2018-11-23 12:00:02,492 INFO L273 TraceCheckUtils]: 78: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,492 INFO L273 TraceCheckUtils]: 79: Hoare triple {8458#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8458#false} is VALID [2018-11-23 12:00:02,492 INFO L273 TraceCheckUtils]: 80: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,492 INFO L273 TraceCheckUtils]: 81: Hoare triple {8458#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8458#false} is VALID [2018-11-23 12:00:02,492 INFO L273 TraceCheckUtils]: 82: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,492 INFO L273 TraceCheckUtils]: 83: Hoare triple {8458#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8458#false} is VALID [2018-11-23 12:00:02,492 INFO L273 TraceCheckUtils]: 84: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,493 INFO L273 TraceCheckUtils]: 85: Hoare triple {8458#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8458#false} is VALID [2018-11-23 12:00:02,493 INFO L273 TraceCheckUtils]: 86: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,493 INFO L273 TraceCheckUtils]: 87: Hoare triple {8458#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8458#false} is VALID [2018-11-23 12:00:02,493 INFO L273 TraceCheckUtils]: 88: Hoare triple {8458#false} assume !(~i~0 < 100000); {8458#false} is VALID [2018-11-23 12:00:02,493 INFO L273 TraceCheckUtils]: 89: Hoare triple {8458#false} havoc ~x~0;~x~0 := 0; {8458#false} is VALID [2018-11-23 12:00:02,493 INFO L273 TraceCheckUtils]: 90: Hoare triple {8458#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {8458#false} is VALID [2018-11-23 12:00:02,493 INFO L256 TraceCheckUtils]: 91: Hoare triple {8458#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {8458#false} is VALID [2018-11-23 12:00:02,493 INFO L273 TraceCheckUtils]: 92: Hoare triple {8458#false} ~cond := #in~cond; {8458#false} is VALID [2018-11-23 12:00:02,494 INFO L273 TraceCheckUtils]: 93: Hoare triple {8458#false} assume 0 == ~cond; {8458#false} is VALID [2018-11-23 12:00:02,494 INFO L273 TraceCheckUtils]: 94: Hoare triple {8458#false} assume !false; {8458#false} is VALID [2018-11-23 12:00:02,499 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-11-23 12:00:02,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:02,499 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:02,512 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:00:02,578 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:00:02,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:02,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:02,775 INFO L256 TraceCheckUtils]: 0: Hoare triple {8457#true} call ULTIMATE.init(); {8457#true} is VALID [2018-11-23 12:00:02,776 INFO L273 TraceCheckUtils]: 1: Hoare triple {8457#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8457#true} is VALID [2018-11-23 12:00:02,776 INFO L273 TraceCheckUtils]: 2: Hoare triple {8457#true} assume true; {8457#true} is VALID [2018-11-23 12:00:02,776 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8457#true} {8457#true} #91#return; {8457#true} is VALID [2018-11-23 12:00:02,776 INFO L256 TraceCheckUtils]: 4: Hoare triple {8457#true} call #t~ret11 := main(); {8457#true} is VALID [2018-11-23 12:00:02,777 INFO L273 TraceCheckUtils]: 5: Hoare triple {8457#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);havoc ~a~0;~a~0 := 0; {8492#(<= main_~a~0 0)} is VALID [2018-11-23 12:00:02,778 INFO L273 TraceCheckUtils]: 6: Hoare triple {8492#(<= 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; {8492#(<= main_~a~0 0)} is VALID [2018-11-23 12:00:02,778 INFO L273 TraceCheckUtils]: 7: Hoare triple {8492#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8460#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:02,779 INFO L273 TraceCheckUtils]: 8: Hoare triple {8460#(<= 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; {8460#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:02,779 INFO L273 TraceCheckUtils]: 9: Hoare triple {8460#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8461#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:02,779 INFO L273 TraceCheckUtils]: 10: Hoare triple {8461#(<= 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; {8461#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:02,780 INFO L273 TraceCheckUtils]: 11: Hoare triple {8461#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8462#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:02,780 INFO L273 TraceCheckUtils]: 12: Hoare triple {8462#(<= 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; {8462#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:02,781 INFO L273 TraceCheckUtils]: 13: Hoare triple {8462#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8463#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:02,781 INFO L273 TraceCheckUtils]: 14: Hoare triple {8463#(<= 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; {8463#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:02,782 INFO L273 TraceCheckUtils]: 15: Hoare triple {8463#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8464#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:02,782 INFO L273 TraceCheckUtils]: 16: Hoare triple {8464#(<= 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; {8464#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:02,783 INFO L273 TraceCheckUtils]: 17: Hoare triple {8464#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8465#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:02,783 INFO L273 TraceCheckUtils]: 18: Hoare triple {8465#(<= 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; {8465#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:02,784 INFO L273 TraceCheckUtils]: 19: Hoare triple {8465#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8466#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:02,785 INFO L273 TraceCheckUtils]: 20: Hoare triple {8466#(<= 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; {8466#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:02,785 INFO L273 TraceCheckUtils]: 21: Hoare triple {8466#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8467#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:02,786 INFO L273 TraceCheckUtils]: 22: Hoare triple {8467#(<= 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; {8467#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:02,786 INFO L273 TraceCheckUtils]: 23: Hoare triple {8467#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8468#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:02,787 INFO L273 TraceCheckUtils]: 24: Hoare triple {8468#(<= 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; {8468#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:02,788 INFO L273 TraceCheckUtils]: 25: Hoare triple {8468#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8469#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:02,788 INFO L273 TraceCheckUtils]: 26: Hoare triple {8469#(<= 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; {8469#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:02,789 INFO L273 TraceCheckUtils]: 27: Hoare triple {8469#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8470#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:02,789 INFO L273 TraceCheckUtils]: 28: Hoare triple {8470#(<= 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; {8470#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:02,790 INFO L273 TraceCheckUtils]: 29: Hoare triple {8470#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8471#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:02,791 INFO L273 TraceCheckUtils]: 30: Hoare triple {8471#(<= 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; {8471#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:02,791 INFO L273 TraceCheckUtils]: 31: Hoare triple {8471#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8472#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:02,792 INFO L273 TraceCheckUtils]: 32: Hoare triple {8472#(<= 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; {8472#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:02,792 INFO L273 TraceCheckUtils]: 33: Hoare triple {8472#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8473#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:02,793 INFO L273 TraceCheckUtils]: 34: Hoare triple {8473#(<= main_~a~0 14)} assume !(~a~0 < 100000); {8458#false} is VALID [2018-11-23 12:00:02,793 INFO L273 TraceCheckUtils]: 35: Hoare triple {8458#false} havoc ~i~0;~i~0 := 0; {8458#false} is VALID [2018-11-23 12:00:02,793 INFO L273 TraceCheckUtils]: 36: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,794 INFO L273 TraceCheckUtils]: 37: Hoare triple {8458#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8458#false} is VALID [2018-11-23 12:00:02,794 INFO L273 TraceCheckUtils]: 38: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,794 INFO L273 TraceCheckUtils]: 39: Hoare triple {8458#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8458#false} is VALID [2018-11-23 12:00:02,794 INFO L273 TraceCheckUtils]: 40: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,794 INFO L273 TraceCheckUtils]: 41: Hoare triple {8458#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8458#false} is VALID [2018-11-23 12:00:02,795 INFO L273 TraceCheckUtils]: 42: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,795 INFO L273 TraceCheckUtils]: 43: Hoare triple {8458#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8458#false} is VALID [2018-11-23 12:00:02,795 INFO L273 TraceCheckUtils]: 44: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,795 INFO L273 TraceCheckUtils]: 45: Hoare triple {8458#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8458#false} is VALID [2018-11-23 12:00:02,795 INFO L273 TraceCheckUtils]: 46: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,795 INFO L273 TraceCheckUtils]: 47: Hoare triple {8458#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8458#false} is VALID [2018-11-23 12:00:02,795 INFO L273 TraceCheckUtils]: 48: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,796 INFO L273 TraceCheckUtils]: 49: Hoare triple {8458#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8458#false} is VALID [2018-11-23 12:00:02,796 INFO L273 TraceCheckUtils]: 50: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,796 INFO L273 TraceCheckUtils]: 51: Hoare triple {8458#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8458#false} is VALID [2018-11-23 12:00:02,796 INFO L273 TraceCheckUtils]: 52: Hoare triple {8458#false} assume !(~i~0 < 100000); {8458#false} is VALID [2018-11-23 12:00:02,796 INFO L273 TraceCheckUtils]: 53: Hoare triple {8458#false} ~i~0 := 0; {8458#false} is VALID [2018-11-23 12:00:02,796 INFO L273 TraceCheckUtils]: 54: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,796 INFO L273 TraceCheckUtils]: 55: Hoare triple {8458#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8458#false} is VALID [2018-11-23 12:00:02,796 INFO L273 TraceCheckUtils]: 56: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,796 INFO L273 TraceCheckUtils]: 57: Hoare triple {8458#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8458#false} is VALID [2018-11-23 12:00:02,797 INFO L273 TraceCheckUtils]: 58: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,797 INFO L273 TraceCheckUtils]: 59: Hoare triple {8458#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8458#false} is VALID [2018-11-23 12:00:02,797 INFO L273 TraceCheckUtils]: 60: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,797 INFO L273 TraceCheckUtils]: 61: Hoare triple {8458#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8458#false} is VALID [2018-11-23 12:00:02,797 INFO L273 TraceCheckUtils]: 62: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,797 INFO L273 TraceCheckUtils]: 63: Hoare triple {8458#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8458#false} is VALID [2018-11-23 12:00:02,797 INFO L273 TraceCheckUtils]: 64: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,797 INFO L273 TraceCheckUtils]: 65: Hoare triple {8458#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8458#false} is VALID [2018-11-23 12:00:02,798 INFO L273 TraceCheckUtils]: 66: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,798 INFO L273 TraceCheckUtils]: 67: Hoare triple {8458#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8458#false} is VALID [2018-11-23 12:00:02,798 INFO L273 TraceCheckUtils]: 68: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,798 INFO L273 TraceCheckUtils]: 69: Hoare triple {8458#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8458#false} is VALID [2018-11-23 12:00:02,798 INFO L273 TraceCheckUtils]: 70: Hoare triple {8458#false} assume !(~i~0 < 100000); {8458#false} is VALID [2018-11-23 12:00:02,798 INFO L273 TraceCheckUtils]: 71: Hoare triple {8458#false} ~i~0 := 0; {8458#false} is VALID [2018-11-23 12:00:02,798 INFO L273 TraceCheckUtils]: 72: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,798 INFO L273 TraceCheckUtils]: 73: Hoare triple {8458#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8458#false} is VALID [2018-11-23 12:00:02,798 INFO L273 TraceCheckUtils]: 74: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,799 INFO L273 TraceCheckUtils]: 75: Hoare triple {8458#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8458#false} is VALID [2018-11-23 12:00:02,799 INFO L273 TraceCheckUtils]: 76: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,799 INFO L273 TraceCheckUtils]: 77: Hoare triple {8458#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8458#false} is VALID [2018-11-23 12:00:02,799 INFO L273 TraceCheckUtils]: 78: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,799 INFO L273 TraceCheckUtils]: 79: Hoare triple {8458#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8458#false} is VALID [2018-11-23 12:00:02,799 INFO L273 TraceCheckUtils]: 80: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,799 INFO L273 TraceCheckUtils]: 81: Hoare triple {8458#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8458#false} is VALID [2018-11-23 12:00:02,799 INFO L273 TraceCheckUtils]: 82: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,800 INFO L273 TraceCheckUtils]: 83: Hoare triple {8458#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8458#false} is VALID [2018-11-23 12:00:02,800 INFO L273 TraceCheckUtils]: 84: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,800 INFO L273 TraceCheckUtils]: 85: Hoare triple {8458#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8458#false} is VALID [2018-11-23 12:00:02,800 INFO L273 TraceCheckUtils]: 86: Hoare triple {8458#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; {8458#false} is VALID [2018-11-23 12:00:02,800 INFO L273 TraceCheckUtils]: 87: Hoare triple {8458#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8458#false} is VALID [2018-11-23 12:00:02,800 INFO L273 TraceCheckUtils]: 88: Hoare triple {8458#false} assume !(~i~0 < 100000); {8458#false} is VALID [2018-11-23 12:00:02,800 INFO L273 TraceCheckUtils]: 89: Hoare triple {8458#false} havoc ~x~0;~x~0 := 0; {8458#false} is VALID [2018-11-23 12:00:02,800 INFO L273 TraceCheckUtils]: 90: Hoare triple {8458#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {8458#false} is VALID [2018-11-23 12:00:02,800 INFO L256 TraceCheckUtils]: 91: Hoare triple {8458#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {8458#false} is VALID [2018-11-23 12:00:02,801 INFO L273 TraceCheckUtils]: 92: Hoare triple {8458#false} ~cond := #in~cond; {8458#false} is VALID [2018-11-23 12:00:02,801 INFO L273 TraceCheckUtils]: 93: Hoare triple {8458#false} assume 0 == ~cond; {8458#false} is VALID [2018-11-23 12:00:02,801 INFO L273 TraceCheckUtils]: 94: Hoare triple {8458#false} assume !false; {8458#false} is VALID [2018-11-23 12:00:02,805 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-11-23 12:00:02,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:02,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:00:02,824 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 95 [2018-11-23 12:00:02,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:02,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:00:02,878 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:02,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:00:02,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:00:02,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:00:02,879 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 18 states. [2018-11-23 12:00:03,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:03,302 INFO L93 Difference]: Finished difference Result 168 states and 176 transitions. [2018-11-23 12:00:03,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:00:03,302 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 95 [2018-11-23 12:00:03,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:03,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:00:03,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2018-11-23 12:00:03,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:00:03,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2018-11-23 12:00:03,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 86 transitions. [2018-11-23 12:00:03,418 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:03,420 INFO L225 Difference]: With dead ends: 168 [2018-11-23 12:00:03,420 INFO L226 Difference]: Without dead ends: 103 [2018-11-23 12:00:03,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 95 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:03,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-23 12:00:03,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-11-23 12:00:03,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:03,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 102 states. [2018-11-23 12:00:03,485 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 102 states. [2018-11-23 12:00:03,485 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 102 states. [2018-11-23 12:00:03,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:03,487 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-11-23 12:00:03,487 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-11-23 12:00:03,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:03,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:03,488 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 103 states. [2018-11-23 12:00:03,488 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 103 states. [2018-11-23 12:00:03,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:03,489 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-11-23 12:00:03,489 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-11-23 12:00:03,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:03,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:03,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:03,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:03,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-23 12:00:03,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2018-11-23 12:00:03,494 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 95 [2018-11-23 12:00:03,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:03,494 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2018-11-23 12:00:03,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:00:03,494 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2018-11-23 12:00:03,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-23 12:00:03,495 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:03,496 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 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] [2018-11-23 12:00:03,496 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:03,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:03,496 INFO L82 PathProgramCache]: Analyzing trace with hash 73312, now seen corresponding path program 15 times [2018-11-23 12:00:03,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:03,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:03,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:03,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:03,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:04,618 INFO L256 TraceCheckUtils]: 0: Hoare triple {9365#true} call ULTIMATE.init(); {9365#true} is VALID [2018-11-23 12:00:04,619 INFO L273 TraceCheckUtils]: 1: Hoare triple {9365#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9365#true} is VALID [2018-11-23 12:00:04,619 INFO L273 TraceCheckUtils]: 2: Hoare triple {9365#true} assume true; {9365#true} is VALID [2018-11-23 12:00:04,619 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9365#true} {9365#true} #91#return; {9365#true} is VALID [2018-11-23 12:00:04,619 INFO L256 TraceCheckUtils]: 4: Hoare triple {9365#true} call #t~ret11 := main(); {9365#true} is VALID [2018-11-23 12:00:04,620 INFO L273 TraceCheckUtils]: 5: Hoare triple {9365#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);havoc ~a~0;~a~0 := 0; {9367#(= main_~a~0 0)} is VALID [2018-11-23 12:00:04,620 INFO L273 TraceCheckUtils]: 6: Hoare triple {9367#(= 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; {9367#(= main_~a~0 0)} is VALID [2018-11-23 12:00:04,621 INFO L273 TraceCheckUtils]: 7: Hoare triple {9367#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9368#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:04,621 INFO L273 TraceCheckUtils]: 8: Hoare triple {9368#(<= 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; {9368#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:04,622 INFO L273 TraceCheckUtils]: 9: Hoare triple {9368#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9369#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:04,622 INFO L273 TraceCheckUtils]: 10: Hoare triple {9369#(<= 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; {9369#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:04,622 INFO L273 TraceCheckUtils]: 11: Hoare triple {9369#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9370#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:04,623 INFO L273 TraceCheckUtils]: 12: Hoare triple {9370#(<= 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; {9370#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:04,623 INFO L273 TraceCheckUtils]: 13: Hoare triple {9370#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9371#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:04,623 INFO L273 TraceCheckUtils]: 14: Hoare triple {9371#(<= 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; {9371#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:04,624 INFO L273 TraceCheckUtils]: 15: Hoare triple {9371#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9372#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:04,624 INFO L273 TraceCheckUtils]: 16: Hoare triple {9372#(<= 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; {9372#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:04,625 INFO L273 TraceCheckUtils]: 17: Hoare triple {9372#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9373#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:04,626 INFO L273 TraceCheckUtils]: 18: Hoare triple {9373#(<= 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; {9373#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:04,626 INFO L273 TraceCheckUtils]: 19: Hoare triple {9373#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9374#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:04,627 INFO L273 TraceCheckUtils]: 20: Hoare triple {9374#(<= 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; {9374#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:04,628 INFO L273 TraceCheckUtils]: 21: Hoare triple {9374#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9375#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:04,628 INFO L273 TraceCheckUtils]: 22: Hoare triple {9375#(<= 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; {9375#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:04,629 INFO L273 TraceCheckUtils]: 23: Hoare triple {9375#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9376#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:04,629 INFO L273 TraceCheckUtils]: 24: Hoare triple {9376#(<= 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; {9376#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:04,630 INFO L273 TraceCheckUtils]: 25: Hoare triple {9376#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9377#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:04,630 INFO L273 TraceCheckUtils]: 26: Hoare triple {9377#(<= 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; {9377#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:04,631 INFO L273 TraceCheckUtils]: 27: Hoare triple {9377#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9378#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:04,632 INFO L273 TraceCheckUtils]: 28: Hoare triple {9378#(<= 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; {9378#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:04,632 INFO L273 TraceCheckUtils]: 29: Hoare triple {9378#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9379#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:04,633 INFO L273 TraceCheckUtils]: 30: Hoare triple {9379#(<= 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; {9379#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:04,634 INFO L273 TraceCheckUtils]: 31: Hoare triple {9379#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9380#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:04,634 INFO L273 TraceCheckUtils]: 32: Hoare triple {9380#(<= 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; {9380#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:04,635 INFO L273 TraceCheckUtils]: 33: Hoare triple {9380#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9381#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:04,635 INFO L273 TraceCheckUtils]: 34: Hoare triple {9381#(<= 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; {9381#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:04,636 INFO L273 TraceCheckUtils]: 35: Hoare triple {9381#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9382#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:04,637 INFO L273 TraceCheckUtils]: 36: Hoare triple {9382#(<= main_~a~0 15)} assume !(~a~0 < 100000); {9366#false} is VALID [2018-11-23 12:00:04,637 INFO L273 TraceCheckUtils]: 37: Hoare triple {9366#false} havoc ~i~0;~i~0 := 0; {9366#false} is VALID [2018-11-23 12:00:04,637 INFO L273 TraceCheckUtils]: 38: Hoare triple {9366#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; {9366#false} is VALID [2018-11-23 12:00:04,637 INFO L273 TraceCheckUtils]: 39: Hoare triple {9366#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9366#false} is VALID [2018-11-23 12:00:04,638 INFO L273 TraceCheckUtils]: 40: Hoare triple {9366#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; {9366#false} is VALID [2018-11-23 12:00:04,638 INFO L273 TraceCheckUtils]: 41: Hoare triple {9366#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9366#false} is VALID [2018-11-23 12:00:04,638 INFO L273 TraceCheckUtils]: 42: Hoare triple {9366#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; {9366#false} is VALID [2018-11-23 12:00:04,638 INFO L273 TraceCheckUtils]: 43: Hoare triple {9366#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9366#false} is VALID [2018-11-23 12:00:04,638 INFO L273 TraceCheckUtils]: 44: Hoare triple {9366#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; {9366#false} is VALID [2018-11-23 12:00:04,638 INFO L273 TraceCheckUtils]: 45: Hoare triple {9366#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9366#false} is VALID [2018-11-23 12:00:04,639 INFO L273 TraceCheckUtils]: 46: Hoare triple {9366#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; {9366#false} is VALID [2018-11-23 12:00:04,639 INFO L273 TraceCheckUtils]: 47: Hoare triple {9366#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9366#false} is VALID [2018-11-23 12:00:04,639 INFO L273 TraceCheckUtils]: 48: Hoare triple {9366#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; {9366#false} is VALID [2018-11-23 12:00:04,639 INFO L273 TraceCheckUtils]: 49: Hoare triple {9366#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9366#false} is VALID [2018-11-23 12:00:04,639 INFO L273 TraceCheckUtils]: 50: Hoare triple {9366#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; {9366#false} is VALID [2018-11-23 12:00:04,640 INFO L273 TraceCheckUtils]: 51: Hoare triple {9366#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9366#false} is VALID [2018-11-23 12:00:04,640 INFO L273 TraceCheckUtils]: 52: Hoare triple {9366#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; {9366#false} is VALID [2018-11-23 12:00:04,640 INFO L273 TraceCheckUtils]: 53: Hoare triple {9366#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9366#false} is VALID [2018-11-23 12:00:04,640 INFO L273 TraceCheckUtils]: 54: Hoare triple {9366#false} assume !(~i~0 < 100000); {9366#false} is VALID [2018-11-23 12:00:04,640 INFO L273 TraceCheckUtils]: 55: Hoare triple {9366#false} ~i~0 := 0; {9366#false} is VALID [2018-11-23 12:00:04,640 INFO L273 TraceCheckUtils]: 56: Hoare triple {9366#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; {9366#false} is VALID [2018-11-23 12:00:04,640 INFO L273 TraceCheckUtils]: 57: Hoare triple {9366#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9366#false} is VALID [2018-11-23 12:00:04,640 INFO L273 TraceCheckUtils]: 58: Hoare triple {9366#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; {9366#false} is VALID [2018-11-23 12:00:04,641 INFO L273 TraceCheckUtils]: 59: Hoare triple {9366#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9366#false} is VALID [2018-11-23 12:00:04,641 INFO L273 TraceCheckUtils]: 60: Hoare triple {9366#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; {9366#false} is VALID [2018-11-23 12:00:04,641 INFO L273 TraceCheckUtils]: 61: Hoare triple {9366#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9366#false} is VALID [2018-11-23 12:00:04,641 INFO L273 TraceCheckUtils]: 62: Hoare triple {9366#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; {9366#false} is VALID [2018-11-23 12:00:04,641 INFO L273 TraceCheckUtils]: 63: Hoare triple {9366#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9366#false} is VALID [2018-11-23 12:00:04,641 INFO L273 TraceCheckUtils]: 64: Hoare triple {9366#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; {9366#false} is VALID [2018-11-23 12:00:04,641 INFO L273 TraceCheckUtils]: 65: Hoare triple {9366#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9366#false} is VALID [2018-11-23 12:00:04,641 INFO L273 TraceCheckUtils]: 66: Hoare triple {9366#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; {9366#false} is VALID [2018-11-23 12:00:04,641 INFO L273 TraceCheckUtils]: 67: Hoare triple {9366#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9366#false} is VALID [2018-11-23 12:00:04,642 INFO L273 TraceCheckUtils]: 68: Hoare triple {9366#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; {9366#false} is VALID [2018-11-23 12:00:04,642 INFO L273 TraceCheckUtils]: 69: Hoare triple {9366#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9366#false} is VALID [2018-11-23 12:00:04,642 INFO L273 TraceCheckUtils]: 70: Hoare triple {9366#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; {9366#false} is VALID [2018-11-23 12:00:04,642 INFO L273 TraceCheckUtils]: 71: Hoare triple {9366#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9366#false} is VALID [2018-11-23 12:00:04,642 INFO L273 TraceCheckUtils]: 72: Hoare triple {9366#false} assume !(~i~0 < 100000); {9366#false} is VALID [2018-11-23 12:00:04,642 INFO L273 TraceCheckUtils]: 73: Hoare triple {9366#false} ~i~0 := 0; {9366#false} is VALID [2018-11-23 12:00:04,642 INFO L273 TraceCheckUtils]: 74: Hoare triple {9366#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; {9366#false} is VALID [2018-11-23 12:00:04,642 INFO L273 TraceCheckUtils]: 75: Hoare triple {9366#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9366#false} is VALID [2018-11-23 12:00:04,643 INFO L273 TraceCheckUtils]: 76: Hoare triple {9366#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; {9366#false} is VALID [2018-11-23 12:00:04,643 INFO L273 TraceCheckUtils]: 77: Hoare triple {9366#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9366#false} is VALID [2018-11-23 12:00:04,643 INFO L273 TraceCheckUtils]: 78: Hoare triple {9366#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; {9366#false} is VALID [2018-11-23 12:00:04,643 INFO L273 TraceCheckUtils]: 79: Hoare triple {9366#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9366#false} is VALID [2018-11-23 12:00:04,643 INFO L273 TraceCheckUtils]: 80: Hoare triple {9366#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; {9366#false} is VALID [2018-11-23 12:00:04,643 INFO L273 TraceCheckUtils]: 81: Hoare triple {9366#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9366#false} is VALID [2018-11-23 12:00:04,643 INFO L273 TraceCheckUtils]: 82: Hoare triple {9366#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; {9366#false} is VALID [2018-11-23 12:00:04,643 INFO L273 TraceCheckUtils]: 83: Hoare triple {9366#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9366#false} is VALID [2018-11-23 12:00:04,643 INFO L273 TraceCheckUtils]: 84: Hoare triple {9366#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; {9366#false} is VALID [2018-11-23 12:00:04,644 INFO L273 TraceCheckUtils]: 85: Hoare triple {9366#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9366#false} is VALID [2018-11-23 12:00:04,644 INFO L273 TraceCheckUtils]: 86: Hoare triple {9366#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; {9366#false} is VALID [2018-11-23 12:00:04,644 INFO L273 TraceCheckUtils]: 87: Hoare triple {9366#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9366#false} is VALID [2018-11-23 12:00:04,644 INFO L273 TraceCheckUtils]: 88: Hoare triple {9366#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; {9366#false} is VALID [2018-11-23 12:00:04,644 INFO L273 TraceCheckUtils]: 89: Hoare triple {9366#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9366#false} is VALID [2018-11-23 12:00:04,644 INFO L273 TraceCheckUtils]: 90: Hoare triple {9366#false} assume !(~i~0 < 100000); {9366#false} is VALID [2018-11-23 12:00:04,644 INFO L273 TraceCheckUtils]: 91: Hoare triple {9366#false} havoc ~x~0;~x~0 := 0; {9366#false} is VALID [2018-11-23 12:00:04,644 INFO L273 TraceCheckUtils]: 92: Hoare triple {9366#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {9366#false} is VALID [2018-11-23 12:00:04,644 INFO L256 TraceCheckUtils]: 93: Hoare triple {9366#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {9366#false} is VALID [2018-11-23 12:00:04,645 INFO L273 TraceCheckUtils]: 94: Hoare triple {9366#false} ~cond := #in~cond; {9366#false} is VALID [2018-11-23 12:00:04,645 INFO L273 TraceCheckUtils]: 95: Hoare triple {9366#false} assume 0 == ~cond; {9366#false} is VALID [2018-11-23 12:00:04,645 INFO L273 TraceCheckUtils]: 96: Hoare triple {9366#false} assume !false; {9366#false} is VALID [2018-11-23 12:00:04,649 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-11-23 12:00:04,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:04,649 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:04,659 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:00:07,536 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 12:00:07,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:07,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:07,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:08,104 INFO L256 TraceCheckUtils]: 0: Hoare triple {9365#true} call ULTIMATE.init(); {9365#true} is VALID [2018-11-23 12:00:08,104 INFO L273 TraceCheckUtils]: 1: Hoare triple {9365#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9365#true} is VALID [2018-11-23 12:00:08,104 INFO L273 TraceCheckUtils]: 2: Hoare triple {9365#true} assume true; {9365#true} is VALID [2018-11-23 12:00:08,105 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9365#true} {9365#true} #91#return; {9365#true} is VALID [2018-11-23 12:00:08,105 INFO L256 TraceCheckUtils]: 4: Hoare triple {9365#true} call #t~ret11 := main(); {9365#true} is VALID [2018-11-23 12:00:08,105 INFO L273 TraceCheckUtils]: 5: Hoare triple {9365#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);havoc ~a~0;~a~0 := 0; {9365#true} is VALID [2018-11-23 12:00:08,105 INFO L273 TraceCheckUtils]: 6: Hoare triple {9365#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; {9365#true} is VALID [2018-11-23 12:00:08,105 INFO L273 TraceCheckUtils]: 7: Hoare triple {9365#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9365#true} is VALID [2018-11-23 12:00:08,105 INFO L273 TraceCheckUtils]: 8: Hoare triple {9365#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; {9365#true} is VALID [2018-11-23 12:00:08,106 INFO L273 TraceCheckUtils]: 9: Hoare triple {9365#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9365#true} is VALID [2018-11-23 12:00:08,106 INFO L273 TraceCheckUtils]: 10: Hoare triple {9365#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; {9365#true} is VALID [2018-11-23 12:00:08,106 INFO L273 TraceCheckUtils]: 11: Hoare triple {9365#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9365#true} is VALID [2018-11-23 12:00:08,106 INFO L273 TraceCheckUtils]: 12: Hoare triple {9365#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; {9365#true} is VALID [2018-11-23 12:00:08,106 INFO L273 TraceCheckUtils]: 13: Hoare triple {9365#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9365#true} is VALID [2018-11-23 12:00:08,106 INFO L273 TraceCheckUtils]: 14: Hoare triple {9365#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; {9365#true} is VALID [2018-11-23 12:00:08,106 INFO L273 TraceCheckUtils]: 15: Hoare triple {9365#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9365#true} is VALID [2018-11-23 12:00:08,106 INFO L273 TraceCheckUtils]: 16: Hoare triple {9365#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; {9365#true} is VALID [2018-11-23 12:00:08,107 INFO L273 TraceCheckUtils]: 17: Hoare triple {9365#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9365#true} is VALID [2018-11-23 12:00:08,107 INFO L273 TraceCheckUtils]: 18: Hoare triple {9365#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; {9365#true} is VALID [2018-11-23 12:00:08,107 INFO L273 TraceCheckUtils]: 19: Hoare triple {9365#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9365#true} is VALID [2018-11-23 12:00:08,107 INFO L273 TraceCheckUtils]: 20: Hoare triple {9365#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; {9365#true} is VALID [2018-11-23 12:00:08,107 INFO L273 TraceCheckUtils]: 21: Hoare triple {9365#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9365#true} is VALID [2018-11-23 12:00:08,107 INFO L273 TraceCheckUtils]: 22: Hoare triple {9365#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; {9365#true} is VALID [2018-11-23 12:00:08,107 INFO L273 TraceCheckUtils]: 23: Hoare triple {9365#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9365#true} is VALID [2018-11-23 12:00:08,107 INFO L273 TraceCheckUtils]: 24: Hoare triple {9365#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; {9365#true} is VALID [2018-11-23 12:00:08,107 INFO L273 TraceCheckUtils]: 25: Hoare triple {9365#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9365#true} is VALID [2018-11-23 12:00:08,108 INFO L273 TraceCheckUtils]: 26: Hoare triple {9365#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; {9365#true} is VALID [2018-11-23 12:00:08,108 INFO L273 TraceCheckUtils]: 27: Hoare triple {9365#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9365#true} is VALID [2018-11-23 12:00:08,108 INFO L273 TraceCheckUtils]: 28: Hoare triple {9365#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; {9365#true} is VALID [2018-11-23 12:00:08,108 INFO L273 TraceCheckUtils]: 29: Hoare triple {9365#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9365#true} is VALID [2018-11-23 12:00:08,108 INFO L273 TraceCheckUtils]: 30: Hoare triple {9365#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; {9365#true} is VALID [2018-11-23 12:00:08,108 INFO L273 TraceCheckUtils]: 31: Hoare triple {9365#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9365#true} is VALID [2018-11-23 12:00:08,108 INFO L273 TraceCheckUtils]: 32: Hoare triple {9365#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; {9365#true} is VALID [2018-11-23 12:00:08,108 INFO L273 TraceCheckUtils]: 33: Hoare triple {9365#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9365#true} is VALID [2018-11-23 12:00:08,109 INFO L273 TraceCheckUtils]: 34: Hoare triple {9365#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; {9488#(< main_~a~0 100000)} is VALID [2018-11-23 12:00:08,109 INFO L273 TraceCheckUtils]: 35: Hoare triple {9488#(< main_~a~0 100000)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9492#(<= main_~a~0 100000)} is VALID [2018-11-23 12:00:08,109 INFO L273 TraceCheckUtils]: 36: Hoare triple {9492#(<= main_~a~0 100000)} assume !(~a~0 < 100000); {9365#true} is VALID [2018-11-23 12:00:08,110 INFO L273 TraceCheckUtils]: 37: Hoare triple {9365#true} havoc ~i~0;~i~0 := 0; {9365#true} is VALID [2018-11-23 12:00:08,110 INFO L273 TraceCheckUtils]: 38: Hoare triple {9365#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; {9365#true} is VALID [2018-11-23 12:00:08,110 INFO L273 TraceCheckUtils]: 39: Hoare triple {9365#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9365#true} is VALID [2018-11-23 12:00:08,110 INFO L273 TraceCheckUtils]: 40: Hoare triple {9365#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; {9365#true} is VALID [2018-11-23 12:00:08,110 INFO L273 TraceCheckUtils]: 41: Hoare triple {9365#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9365#true} is VALID [2018-11-23 12:00:08,110 INFO L273 TraceCheckUtils]: 42: Hoare triple {9365#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; {9365#true} is VALID [2018-11-23 12:00:08,110 INFO L273 TraceCheckUtils]: 43: Hoare triple {9365#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9365#true} is VALID [2018-11-23 12:00:08,110 INFO L273 TraceCheckUtils]: 44: Hoare triple {9365#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; {9365#true} is VALID [2018-11-23 12:00:08,111 INFO L273 TraceCheckUtils]: 45: Hoare triple {9365#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9365#true} is VALID [2018-11-23 12:00:08,111 INFO L273 TraceCheckUtils]: 46: Hoare triple {9365#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; {9365#true} is VALID [2018-11-23 12:00:08,111 INFO L273 TraceCheckUtils]: 47: Hoare triple {9365#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9365#true} is VALID [2018-11-23 12:00:08,111 INFO L273 TraceCheckUtils]: 48: Hoare triple {9365#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; {9365#true} is VALID [2018-11-23 12:00:08,111 INFO L273 TraceCheckUtils]: 49: Hoare triple {9365#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9365#true} is VALID [2018-11-23 12:00:08,111 INFO L273 TraceCheckUtils]: 50: Hoare triple {9365#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; {9365#true} is VALID [2018-11-23 12:00:08,111 INFO L273 TraceCheckUtils]: 51: Hoare triple {9365#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9365#true} is VALID [2018-11-23 12:00:08,112 INFO L273 TraceCheckUtils]: 52: Hoare triple {9365#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; {9544#(< main_~i~0 100000)} is VALID [2018-11-23 12:00:08,112 INFO L273 TraceCheckUtils]: 53: Hoare triple {9544#(< main_~i~0 100000)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9548#(<= main_~i~0 100000)} is VALID [2018-11-23 12:00:08,112 INFO L273 TraceCheckUtils]: 54: Hoare triple {9548#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {9365#true} is VALID [2018-11-23 12:00:08,112 INFO L273 TraceCheckUtils]: 55: Hoare triple {9365#true} ~i~0 := 0; {9365#true} is VALID [2018-11-23 12:00:08,112 INFO L273 TraceCheckUtils]: 56: Hoare triple {9365#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; {9365#true} is VALID [2018-11-23 12:00:08,112 INFO L273 TraceCheckUtils]: 57: Hoare triple {9365#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9365#true} is VALID [2018-11-23 12:00:08,113 INFO L273 TraceCheckUtils]: 58: Hoare triple {9365#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; {9365#true} is VALID [2018-11-23 12:00:08,113 INFO L273 TraceCheckUtils]: 59: Hoare triple {9365#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9365#true} is VALID [2018-11-23 12:00:08,113 INFO L273 TraceCheckUtils]: 60: Hoare triple {9365#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; {9365#true} is VALID [2018-11-23 12:00:08,113 INFO L273 TraceCheckUtils]: 61: Hoare triple {9365#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9365#true} is VALID [2018-11-23 12:00:08,113 INFO L273 TraceCheckUtils]: 62: Hoare triple {9365#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; {9365#true} is VALID [2018-11-23 12:00:08,113 INFO L273 TraceCheckUtils]: 63: Hoare triple {9365#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9365#true} is VALID [2018-11-23 12:00:08,113 INFO L273 TraceCheckUtils]: 64: Hoare triple {9365#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; {9365#true} is VALID [2018-11-23 12:00:08,113 INFO L273 TraceCheckUtils]: 65: Hoare triple {9365#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9365#true} is VALID [2018-11-23 12:00:08,114 INFO L273 TraceCheckUtils]: 66: Hoare triple {9365#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; {9365#true} is VALID [2018-11-23 12:00:08,114 INFO L273 TraceCheckUtils]: 67: Hoare triple {9365#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9365#true} is VALID [2018-11-23 12:00:08,114 INFO L273 TraceCheckUtils]: 68: Hoare triple {9365#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; {9365#true} is VALID [2018-11-23 12:00:08,114 INFO L273 TraceCheckUtils]: 69: Hoare triple {9365#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9365#true} is VALID [2018-11-23 12:00:08,114 INFO L273 TraceCheckUtils]: 70: Hoare triple {9365#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; {9544#(< main_~i~0 100000)} is VALID [2018-11-23 12:00:08,115 INFO L273 TraceCheckUtils]: 71: Hoare triple {9544#(< main_~i~0 100000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9548#(<= main_~i~0 100000)} is VALID [2018-11-23 12:00:08,115 INFO L273 TraceCheckUtils]: 72: Hoare triple {9548#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {9365#true} is VALID [2018-11-23 12:00:08,115 INFO L273 TraceCheckUtils]: 73: Hoare triple {9365#true} ~i~0 := 0; {9609#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:08,115 INFO L273 TraceCheckUtils]: 74: Hoare triple {9609#(<= 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; {9609#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:08,116 INFO L273 TraceCheckUtils]: 75: Hoare triple {9609#(<= main_~i~0 0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9616#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:08,116 INFO L273 TraceCheckUtils]: 76: Hoare triple {9616#(<= 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; {9616#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:08,117 INFO L273 TraceCheckUtils]: 77: Hoare triple {9616#(<= main_~i~0 1)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9623#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:08,117 INFO L273 TraceCheckUtils]: 78: Hoare triple {9623#(<= 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; {9623#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:08,118 INFO L273 TraceCheckUtils]: 79: Hoare triple {9623#(<= main_~i~0 2)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9630#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:08,118 INFO L273 TraceCheckUtils]: 80: Hoare triple {9630#(<= 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; {9630#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:08,119 INFO L273 TraceCheckUtils]: 81: Hoare triple {9630#(<= main_~i~0 3)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9637#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:08,119 INFO L273 TraceCheckUtils]: 82: Hoare triple {9637#(<= 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; {9637#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:08,120 INFO L273 TraceCheckUtils]: 83: Hoare triple {9637#(<= main_~i~0 4)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9644#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:08,120 INFO L273 TraceCheckUtils]: 84: Hoare triple {9644#(<= 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; {9644#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:08,121 INFO L273 TraceCheckUtils]: 85: Hoare triple {9644#(<= main_~i~0 5)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9651#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:08,122 INFO L273 TraceCheckUtils]: 86: Hoare triple {9651#(<= 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; {9651#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:08,122 INFO L273 TraceCheckUtils]: 87: Hoare triple {9651#(<= main_~i~0 6)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9658#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:08,123 INFO L273 TraceCheckUtils]: 88: Hoare triple {9658#(<= 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; {9658#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:08,123 INFO L273 TraceCheckUtils]: 89: Hoare triple {9658#(<= main_~i~0 7)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9665#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:08,124 INFO L273 TraceCheckUtils]: 90: Hoare triple {9665#(<= main_~i~0 8)} assume !(~i~0 < 100000); {9366#false} is VALID [2018-11-23 12:00:08,124 INFO L273 TraceCheckUtils]: 91: Hoare triple {9366#false} havoc ~x~0;~x~0 := 0; {9366#false} is VALID [2018-11-23 12:00:08,125 INFO L273 TraceCheckUtils]: 92: Hoare triple {9366#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {9366#false} is VALID [2018-11-23 12:00:08,125 INFO L256 TraceCheckUtils]: 93: Hoare triple {9366#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {9366#false} is VALID [2018-11-23 12:00:08,125 INFO L273 TraceCheckUtils]: 94: Hoare triple {9366#false} ~cond := #in~cond; {9366#false} is VALID [2018-11-23 12:00:08,125 INFO L273 TraceCheckUtils]: 95: Hoare triple {9366#false} assume 0 == ~cond; {9366#false} is VALID [2018-11-23 12:00:08,125 INFO L273 TraceCheckUtils]: 96: Hoare triple {9366#false} assume !false; {9366#false} is VALID [2018-11-23 12:00:08,130 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 59 proven. 64 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2018-11-23 12:00:08,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:08,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2018-11-23 12:00:08,152 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 97 [2018-11-23 12:00:08,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:08,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 12:00:08,233 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:08,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 12:00:08,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 12:00:08,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=663, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:00:08,235 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand 31 states. [2018-11-23 12:00:09,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:09,482 INFO L93 Difference]: Finished difference Result 183 states and 198 transitions. [2018-11-23 12:00:09,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 12:00:09,482 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 97 [2018-11-23 12:00:09,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:09,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:00:09,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 153 transitions. [2018-11-23 12:00:09,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:00:09,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 153 transitions. [2018-11-23 12:00:09,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 153 transitions. [2018-11-23 12:00:09,735 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:09,737 INFO L225 Difference]: With dead ends: 183 [2018-11-23 12:00:09,737 INFO L226 Difference]: Without dead ends: 118 [2018-11-23 12:00:09,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=421, Invalid=1301, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:00:09,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-23 12:00:09,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-11-23 12:00:09,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:09,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 118 states. [2018-11-23 12:00:09,819 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 118 states. [2018-11-23 12:00:09,819 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 118 states. [2018-11-23 12:00:09,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:09,824 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2018-11-23 12:00:09,824 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2018-11-23 12:00:09,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:09,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:09,825 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 118 states. [2018-11-23 12:00:09,825 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 118 states. [2018-11-23 12:00:09,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:09,827 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2018-11-23 12:00:09,828 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2018-11-23 12:00:09,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:09,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:09,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:09,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:09,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-23 12:00:09,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 122 transitions. [2018-11-23 12:00:09,831 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 122 transitions. Word has length 97 [2018-11-23 12:00:09,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:09,831 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 122 transitions. [2018-11-23 12:00:09,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 12:00:09,831 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2018-11-23 12:00:09,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-23 12:00:09,832 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:09,833 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 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] [2018-11-23 12:00:09,833 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:09,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:09,833 INFO L82 PathProgramCache]: Analyzing trace with hash 668051024, now seen corresponding path program 16 times [2018-11-23 12:00:09,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:09,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:09,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:09,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:09,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:10,165 INFO L256 TraceCheckUtils]: 0: Hoare triple {10402#true} call ULTIMATE.init(); {10402#true} is VALID [2018-11-23 12:00:10,166 INFO L273 TraceCheckUtils]: 1: Hoare triple {10402#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10402#true} is VALID [2018-11-23 12:00:10,166 INFO L273 TraceCheckUtils]: 2: Hoare triple {10402#true} assume true; {10402#true} is VALID [2018-11-23 12:00:10,166 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10402#true} {10402#true} #91#return; {10402#true} is VALID [2018-11-23 12:00:10,166 INFO L256 TraceCheckUtils]: 4: Hoare triple {10402#true} call #t~ret11 := main(); {10402#true} is VALID [2018-11-23 12:00:10,166 INFO L273 TraceCheckUtils]: 5: Hoare triple {10402#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);havoc ~a~0;~a~0 := 0; {10404#(= main_~a~0 0)} is VALID [2018-11-23 12:00:10,167 INFO L273 TraceCheckUtils]: 6: Hoare triple {10404#(= 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; {10404#(= main_~a~0 0)} is VALID [2018-11-23 12:00:10,167 INFO L273 TraceCheckUtils]: 7: Hoare triple {10404#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10405#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:10,168 INFO L273 TraceCheckUtils]: 8: Hoare triple {10405#(<= 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; {10405#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:10,169 INFO L273 TraceCheckUtils]: 9: Hoare triple {10405#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10406#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:10,169 INFO L273 TraceCheckUtils]: 10: Hoare triple {10406#(<= 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; {10406#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:10,170 INFO L273 TraceCheckUtils]: 11: Hoare triple {10406#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10407#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:10,170 INFO L273 TraceCheckUtils]: 12: Hoare triple {10407#(<= 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; {10407#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:10,171 INFO L273 TraceCheckUtils]: 13: Hoare triple {10407#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10408#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:10,172 INFO L273 TraceCheckUtils]: 14: Hoare triple {10408#(<= 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; {10408#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:10,172 INFO L273 TraceCheckUtils]: 15: Hoare triple {10408#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10409#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:10,173 INFO L273 TraceCheckUtils]: 16: Hoare triple {10409#(<= 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; {10409#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:10,174 INFO L273 TraceCheckUtils]: 17: Hoare triple {10409#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10410#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:10,174 INFO L273 TraceCheckUtils]: 18: Hoare triple {10410#(<= 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; {10410#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:10,175 INFO L273 TraceCheckUtils]: 19: Hoare triple {10410#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10411#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:10,175 INFO L273 TraceCheckUtils]: 20: Hoare triple {10411#(<= 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; {10411#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:10,176 INFO L273 TraceCheckUtils]: 21: Hoare triple {10411#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10412#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:10,177 INFO L273 TraceCheckUtils]: 22: Hoare triple {10412#(<= 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; {10412#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:10,177 INFO L273 TraceCheckUtils]: 23: Hoare triple {10412#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10413#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:10,178 INFO L273 TraceCheckUtils]: 24: Hoare triple {10413#(<= 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; {10413#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:10,179 INFO L273 TraceCheckUtils]: 25: Hoare triple {10413#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10414#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:10,179 INFO L273 TraceCheckUtils]: 26: Hoare triple {10414#(<= 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; {10414#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:10,180 INFO L273 TraceCheckUtils]: 27: Hoare triple {10414#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10415#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:10,181 INFO L273 TraceCheckUtils]: 28: Hoare triple {10415#(<= 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; {10415#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:10,181 INFO L273 TraceCheckUtils]: 29: Hoare triple {10415#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10416#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:10,182 INFO L273 TraceCheckUtils]: 30: Hoare triple {10416#(<= 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; {10416#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:10,183 INFO L273 TraceCheckUtils]: 31: Hoare triple {10416#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10417#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:10,183 INFO L273 TraceCheckUtils]: 32: Hoare triple {10417#(<= 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; {10417#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:10,184 INFO L273 TraceCheckUtils]: 33: Hoare triple {10417#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10418#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:10,184 INFO L273 TraceCheckUtils]: 34: Hoare triple {10418#(<= 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; {10418#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:10,185 INFO L273 TraceCheckUtils]: 35: Hoare triple {10418#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10419#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:10,186 INFO L273 TraceCheckUtils]: 36: Hoare triple {10419#(<= 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; {10419#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:10,186 INFO L273 TraceCheckUtils]: 37: Hoare triple {10419#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10420#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:10,187 INFO L273 TraceCheckUtils]: 38: Hoare triple {10420#(<= 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; {10420#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:10,188 INFO L273 TraceCheckUtils]: 39: Hoare triple {10420#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10421#(<= main_~a~0 17)} is VALID [2018-11-23 12:00:10,188 INFO L273 TraceCheckUtils]: 40: Hoare triple {10421#(<= main_~a~0 17)} assume !(~a~0 < 100000); {10403#false} is VALID [2018-11-23 12:00:10,189 INFO L273 TraceCheckUtils]: 41: Hoare triple {10403#false} havoc ~i~0;~i~0 := 0; {10403#false} is VALID [2018-11-23 12:00:10,189 INFO L273 TraceCheckUtils]: 42: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,189 INFO L273 TraceCheckUtils]: 43: Hoare triple {10403#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10403#false} is VALID [2018-11-23 12:00:10,189 INFO L273 TraceCheckUtils]: 44: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,189 INFO L273 TraceCheckUtils]: 45: Hoare triple {10403#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10403#false} is VALID [2018-11-23 12:00:10,190 INFO L273 TraceCheckUtils]: 46: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,190 INFO L273 TraceCheckUtils]: 47: Hoare triple {10403#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10403#false} is VALID [2018-11-23 12:00:10,190 INFO L273 TraceCheckUtils]: 48: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,190 INFO L273 TraceCheckUtils]: 49: Hoare triple {10403#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10403#false} is VALID [2018-11-23 12:00:10,190 INFO L273 TraceCheckUtils]: 50: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,191 INFO L273 TraceCheckUtils]: 51: Hoare triple {10403#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10403#false} is VALID [2018-11-23 12:00:10,191 INFO L273 TraceCheckUtils]: 52: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,191 INFO L273 TraceCheckUtils]: 53: Hoare triple {10403#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10403#false} is VALID [2018-11-23 12:00:10,191 INFO L273 TraceCheckUtils]: 54: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,191 INFO L273 TraceCheckUtils]: 55: Hoare triple {10403#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10403#false} is VALID [2018-11-23 12:00:10,192 INFO L273 TraceCheckUtils]: 56: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,192 INFO L273 TraceCheckUtils]: 57: Hoare triple {10403#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10403#false} is VALID [2018-11-23 12:00:10,192 INFO L273 TraceCheckUtils]: 58: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,192 INFO L273 TraceCheckUtils]: 59: Hoare triple {10403#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10403#false} is VALID [2018-11-23 12:00:10,192 INFO L273 TraceCheckUtils]: 60: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,192 INFO L273 TraceCheckUtils]: 61: Hoare triple {10403#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10403#false} is VALID [2018-11-23 12:00:10,193 INFO L273 TraceCheckUtils]: 62: Hoare triple {10403#false} assume !(~i~0 < 100000); {10403#false} is VALID [2018-11-23 12:00:10,193 INFO L273 TraceCheckUtils]: 63: Hoare triple {10403#false} ~i~0 := 0; {10403#false} is VALID [2018-11-23 12:00:10,193 INFO L273 TraceCheckUtils]: 64: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,193 INFO L273 TraceCheckUtils]: 65: Hoare triple {10403#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10403#false} is VALID [2018-11-23 12:00:10,193 INFO L273 TraceCheckUtils]: 66: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,193 INFO L273 TraceCheckUtils]: 67: Hoare triple {10403#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10403#false} is VALID [2018-11-23 12:00:10,193 INFO L273 TraceCheckUtils]: 68: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,193 INFO L273 TraceCheckUtils]: 69: Hoare triple {10403#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10403#false} is VALID [2018-11-23 12:00:10,193 INFO L273 TraceCheckUtils]: 70: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,194 INFO L273 TraceCheckUtils]: 71: Hoare triple {10403#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10403#false} is VALID [2018-11-23 12:00:10,194 INFO L273 TraceCheckUtils]: 72: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,194 INFO L273 TraceCheckUtils]: 73: Hoare triple {10403#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10403#false} is VALID [2018-11-23 12:00:10,194 INFO L273 TraceCheckUtils]: 74: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,194 INFO L273 TraceCheckUtils]: 75: Hoare triple {10403#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10403#false} is VALID [2018-11-23 12:00:10,194 INFO L273 TraceCheckUtils]: 76: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,194 INFO L273 TraceCheckUtils]: 77: Hoare triple {10403#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10403#false} is VALID [2018-11-23 12:00:10,194 INFO L273 TraceCheckUtils]: 78: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,194 INFO L273 TraceCheckUtils]: 79: Hoare triple {10403#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10403#false} is VALID [2018-11-23 12:00:10,195 INFO L273 TraceCheckUtils]: 80: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,195 INFO L273 TraceCheckUtils]: 81: Hoare triple {10403#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10403#false} is VALID [2018-11-23 12:00:10,195 INFO L273 TraceCheckUtils]: 82: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,195 INFO L273 TraceCheckUtils]: 83: Hoare triple {10403#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10403#false} is VALID [2018-11-23 12:00:10,195 INFO L273 TraceCheckUtils]: 84: Hoare triple {10403#false} assume !(~i~0 < 100000); {10403#false} is VALID [2018-11-23 12:00:10,195 INFO L273 TraceCheckUtils]: 85: Hoare triple {10403#false} ~i~0 := 0; {10403#false} is VALID [2018-11-23 12:00:10,195 INFO L273 TraceCheckUtils]: 86: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,195 INFO L273 TraceCheckUtils]: 87: Hoare triple {10403#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10403#false} is VALID [2018-11-23 12:00:10,196 INFO L273 TraceCheckUtils]: 88: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,196 INFO L273 TraceCheckUtils]: 89: Hoare triple {10403#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10403#false} is VALID [2018-11-23 12:00:10,196 INFO L273 TraceCheckUtils]: 90: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,196 INFO L273 TraceCheckUtils]: 91: Hoare triple {10403#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10403#false} is VALID [2018-11-23 12:00:10,196 INFO L273 TraceCheckUtils]: 92: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,196 INFO L273 TraceCheckUtils]: 93: Hoare triple {10403#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10403#false} is VALID [2018-11-23 12:00:10,196 INFO L273 TraceCheckUtils]: 94: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,196 INFO L273 TraceCheckUtils]: 95: Hoare triple {10403#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10403#false} is VALID [2018-11-23 12:00:10,196 INFO L273 TraceCheckUtils]: 96: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,197 INFO L273 TraceCheckUtils]: 97: Hoare triple {10403#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10403#false} is VALID [2018-11-23 12:00:10,197 INFO L273 TraceCheckUtils]: 98: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,197 INFO L273 TraceCheckUtils]: 99: Hoare triple {10403#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10403#false} is VALID [2018-11-23 12:00:10,197 INFO L273 TraceCheckUtils]: 100: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,197 INFO L273 TraceCheckUtils]: 101: Hoare triple {10403#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10403#false} is VALID [2018-11-23 12:00:10,197 INFO L273 TraceCheckUtils]: 102: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,197 INFO L273 TraceCheckUtils]: 103: Hoare triple {10403#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10403#false} is VALID [2018-11-23 12:00:10,197 INFO L273 TraceCheckUtils]: 104: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,197 INFO L273 TraceCheckUtils]: 105: Hoare triple {10403#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10403#false} is VALID [2018-11-23 12:00:10,198 INFO L273 TraceCheckUtils]: 106: Hoare triple {10403#false} assume !(~i~0 < 100000); {10403#false} is VALID [2018-11-23 12:00:10,198 INFO L273 TraceCheckUtils]: 107: Hoare triple {10403#false} havoc ~x~0;~x~0 := 0; {10403#false} is VALID [2018-11-23 12:00:10,198 INFO L273 TraceCheckUtils]: 108: Hoare triple {10403#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {10403#false} is VALID [2018-11-23 12:00:10,198 INFO L256 TraceCheckUtils]: 109: Hoare triple {10403#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {10403#false} is VALID [2018-11-23 12:00:10,198 INFO L273 TraceCheckUtils]: 110: Hoare triple {10403#false} ~cond := #in~cond; {10403#false} is VALID [2018-11-23 12:00:10,198 INFO L273 TraceCheckUtils]: 111: Hoare triple {10403#false} assume 0 == ~cond; {10403#false} is VALID [2018-11-23 12:00:10,198 INFO L273 TraceCheckUtils]: 112: Hoare triple {10403#false} assume !false; {10403#false} is VALID [2018-11-23 12:00:10,204 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-11-23 12:00:10,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:10,204 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:10,213 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:00:10,264 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:00:10,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:10,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:10,596 INFO L256 TraceCheckUtils]: 0: Hoare triple {10402#true} call ULTIMATE.init(); {10402#true} is VALID [2018-11-23 12:00:10,597 INFO L273 TraceCheckUtils]: 1: Hoare triple {10402#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10402#true} is VALID [2018-11-23 12:00:10,597 INFO L273 TraceCheckUtils]: 2: Hoare triple {10402#true} assume true; {10402#true} is VALID [2018-11-23 12:00:10,597 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10402#true} {10402#true} #91#return; {10402#true} is VALID [2018-11-23 12:00:10,597 INFO L256 TraceCheckUtils]: 4: Hoare triple {10402#true} call #t~ret11 := main(); {10402#true} is VALID [2018-11-23 12:00:10,599 INFO L273 TraceCheckUtils]: 5: Hoare triple {10402#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);havoc ~a~0;~a~0 := 0; {10440#(<= main_~a~0 0)} is VALID [2018-11-23 12:00:10,599 INFO L273 TraceCheckUtils]: 6: Hoare triple {10440#(<= 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; {10440#(<= main_~a~0 0)} is VALID [2018-11-23 12:00:10,600 INFO L273 TraceCheckUtils]: 7: Hoare triple {10440#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10405#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:10,600 INFO L273 TraceCheckUtils]: 8: Hoare triple {10405#(<= 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; {10405#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:10,600 INFO L273 TraceCheckUtils]: 9: Hoare triple {10405#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10406#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:10,601 INFO L273 TraceCheckUtils]: 10: Hoare triple {10406#(<= 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; {10406#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:10,601 INFO L273 TraceCheckUtils]: 11: Hoare triple {10406#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10407#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:10,602 INFO L273 TraceCheckUtils]: 12: Hoare triple {10407#(<= 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; {10407#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:10,603 INFO L273 TraceCheckUtils]: 13: Hoare triple {10407#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10408#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:10,603 INFO L273 TraceCheckUtils]: 14: Hoare triple {10408#(<= 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; {10408#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:10,604 INFO L273 TraceCheckUtils]: 15: Hoare triple {10408#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10409#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:10,604 INFO L273 TraceCheckUtils]: 16: Hoare triple {10409#(<= 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; {10409#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:10,605 INFO L273 TraceCheckUtils]: 17: Hoare triple {10409#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10410#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:10,606 INFO L273 TraceCheckUtils]: 18: Hoare triple {10410#(<= 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; {10410#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:10,606 INFO L273 TraceCheckUtils]: 19: Hoare triple {10410#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10411#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:10,607 INFO L273 TraceCheckUtils]: 20: Hoare triple {10411#(<= 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; {10411#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:10,608 INFO L273 TraceCheckUtils]: 21: Hoare triple {10411#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10412#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:10,608 INFO L273 TraceCheckUtils]: 22: Hoare triple {10412#(<= 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; {10412#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:10,609 INFO L273 TraceCheckUtils]: 23: Hoare triple {10412#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10413#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:10,609 INFO L273 TraceCheckUtils]: 24: Hoare triple {10413#(<= 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; {10413#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:10,610 INFO L273 TraceCheckUtils]: 25: Hoare triple {10413#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10414#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:10,611 INFO L273 TraceCheckUtils]: 26: Hoare triple {10414#(<= 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; {10414#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:10,611 INFO L273 TraceCheckUtils]: 27: Hoare triple {10414#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10415#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:10,612 INFO L273 TraceCheckUtils]: 28: Hoare triple {10415#(<= 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; {10415#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:10,613 INFO L273 TraceCheckUtils]: 29: Hoare triple {10415#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10416#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:10,613 INFO L273 TraceCheckUtils]: 30: Hoare triple {10416#(<= 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; {10416#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:10,614 INFO L273 TraceCheckUtils]: 31: Hoare triple {10416#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10417#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:10,614 INFO L273 TraceCheckUtils]: 32: Hoare triple {10417#(<= 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; {10417#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:10,615 INFO L273 TraceCheckUtils]: 33: Hoare triple {10417#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10418#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:10,616 INFO L273 TraceCheckUtils]: 34: Hoare triple {10418#(<= 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; {10418#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:10,616 INFO L273 TraceCheckUtils]: 35: Hoare triple {10418#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10419#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:10,617 INFO L273 TraceCheckUtils]: 36: Hoare triple {10419#(<= 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; {10419#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:10,618 INFO L273 TraceCheckUtils]: 37: Hoare triple {10419#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10420#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:10,618 INFO L273 TraceCheckUtils]: 38: Hoare triple {10420#(<= 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; {10420#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:10,619 INFO L273 TraceCheckUtils]: 39: Hoare triple {10420#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10421#(<= main_~a~0 17)} is VALID [2018-11-23 12:00:10,620 INFO L273 TraceCheckUtils]: 40: Hoare triple {10421#(<= main_~a~0 17)} assume !(~a~0 < 100000); {10403#false} is VALID [2018-11-23 12:00:10,620 INFO L273 TraceCheckUtils]: 41: Hoare triple {10403#false} havoc ~i~0;~i~0 := 0; {10403#false} is VALID [2018-11-23 12:00:10,620 INFO L273 TraceCheckUtils]: 42: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,620 INFO L273 TraceCheckUtils]: 43: Hoare triple {10403#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10403#false} is VALID [2018-11-23 12:00:10,621 INFO L273 TraceCheckUtils]: 44: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,621 INFO L273 TraceCheckUtils]: 45: Hoare triple {10403#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10403#false} is VALID [2018-11-23 12:00:10,621 INFO L273 TraceCheckUtils]: 46: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,621 INFO L273 TraceCheckUtils]: 47: Hoare triple {10403#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10403#false} is VALID [2018-11-23 12:00:10,621 INFO L273 TraceCheckUtils]: 48: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,622 INFO L273 TraceCheckUtils]: 49: Hoare triple {10403#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10403#false} is VALID [2018-11-23 12:00:10,622 INFO L273 TraceCheckUtils]: 50: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,622 INFO L273 TraceCheckUtils]: 51: Hoare triple {10403#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10403#false} is VALID [2018-11-23 12:00:10,622 INFO L273 TraceCheckUtils]: 52: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,622 INFO L273 TraceCheckUtils]: 53: Hoare triple {10403#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10403#false} is VALID [2018-11-23 12:00:10,623 INFO L273 TraceCheckUtils]: 54: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,623 INFO L273 TraceCheckUtils]: 55: Hoare triple {10403#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10403#false} is VALID [2018-11-23 12:00:10,623 INFO L273 TraceCheckUtils]: 56: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,623 INFO L273 TraceCheckUtils]: 57: Hoare triple {10403#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10403#false} is VALID [2018-11-23 12:00:10,623 INFO L273 TraceCheckUtils]: 58: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,624 INFO L273 TraceCheckUtils]: 59: Hoare triple {10403#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10403#false} is VALID [2018-11-23 12:00:10,624 INFO L273 TraceCheckUtils]: 60: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,624 INFO L273 TraceCheckUtils]: 61: Hoare triple {10403#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10403#false} is VALID [2018-11-23 12:00:10,624 INFO L273 TraceCheckUtils]: 62: Hoare triple {10403#false} assume !(~i~0 < 100000); {10403#false} is VALID [2018-11-23 12:00:10,624 INFO L273 TraceCheckUtils]: 63: Hoare triple {10403#false} ~i~0 := 0; {10403#false} is VALID [2018-11-23 12:00:10,625 INFO L273 TraceCheckUtils]: 64: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,625 INFO L273 TraceCheckUtils]: 65: Hoare triple {10403#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10403#false} is VALID [2018-11-23 12:00:10,625 INFO L273 TraceCheckUtils]: 66: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,625 INFO L273 TraceCheckUtils]: 67: Hoare triple {10403#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10403#false} is VALID [2018-11-23 12:00:10,625 INFO L273 TraceCheckUtils]: 68: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,625 INFO L273 TraceCheckUtils]: 69: Hoare triple {10403#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10403#false} is VALID [2018-11-23 12:00:10,625 INFO L273 TraceCheckUtils]: 70: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,625 INFO L273 TraceCheckUtils]: 71: Hoare triple {10403#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10403#false} is VALID [2018-11-23 12:00:10,626 INFO L273 TraceCheckUtils]: 72: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,626 INFO L273 TraceCheckUtils]: 73: Hoare triple {10403#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10403#false} is VALID [2018-11-23 12:00:10,626 INFO L273 TraceCheckUtils]: 74: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,626 INFO L273 TraceCheckUtils]: 75: Hoare triple {10403#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10403#false} is VALID [2018-11-23 12:00:10,626 INFO L273 TraceCheckUtils]: 76: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,626 INFO L273 TraceCheckUtils]: 77: Hoare triple {10403#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10403#false} is VALID [2018-11-23 12:00:10,626 INFO L273 TraceCheckUtils]: 78: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,626 INFO L273 TraceCheckUtils]: 79: Hoare triple {10403#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10403#false} is VALID [2018-11-23 12:00:10,627 INFO L273 TraceCheckUtils]: 80: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,627 INFO L273 TraceCheckUtils]: 81: Hoare triple {10403#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10403#false} is VALID [2018-11-23 12:00:10,627 INFO L273 TraceCheckUtils]: 82: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,627 INFO L273 TraceCheckUtils]: 83: Hoare triple {10403#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10403#false} is VALID [2018-11-23 12:00:10,627 INFO L273 TraceCheckUtils]: 84: Hoare triple {10403#false} assume !(~i~0 < 100000); {10403#false} is VALID [2018-11-23 12:00:10,627 INFO L273 TraceCheckUtils]: 85: Hoare triple {10403#false} ~i~0 := 0; {10403#false} is VALID [2018-11-23 12:00:10,627 INFO L273 TraceCheckUtils]: 86: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,627 INFO L273 TraceCheckUtils]: 87: Hoare triple {10403#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10403#false} is VALID [2018-11-23 12:00:10,627 INFO L273 TraceCheckUtils]: 88: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,628 INFO L273 TraceCheckUtils]: 89: Hoare triple {10403#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10403#false} is VALID [2018-11-23 12:00:10,628 INFO L273 TraceCheckUtils]: 90: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,628 INFO L273 TraceCheckUtils]: 91: Hoare triple {10403#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10403#false} is VALID [2018-11-23 12:00:10,628 INFO L273 TraceCheckUtils]: 92: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,628 INFO L273 TraceCheckUtils]: 93: Hoare triple {10403#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10403#false} is VALID [2018-11-23 12:00:10,628 INFO L273 TraceCheckUtils]: 94: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,628 INFO L273 TraceCheckUtils]: 95: Hoare triple {10403#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10403#false} is VALID [2018-11-23 12:00:10,628 INFO L273 TraceCheckUtils]: 96: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,628 INFO L273 TraceCheckUtils]: 97: Hoare triple {10403#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10403#false} is VALID [2018-11-23 12:00:10,629 INFO L273 TraceCheckUtils]: 98: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,629 INFO L273 TraceCheckUtils]: 99: Hoare triple {10403#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10403#false} is VALID [2018-11-23 12:00:10,629 INFO L273 TraceCheckUtils]: 100: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,629 INFO L273 TraceCheckUtils]: 101: Hoare triple {10403#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10403#false} is VALID [2018-11-23 12:00:10,629 INFO L273 TraceCheckUtils]: 102: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,629 INFO L273 TraceCheckUtils]: 103: Hoare triple {10403#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10403#false} is VALID [2018-11-23 12:00:10,629 INFO L273 TraceCheckUtils]: 104: Hoare triple {10403#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; {10403#false} is VALID [2018-11-23 12:00:10,629 INFO L273 TraceCheckUtils]: 105: Hoare triple {10403#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10403#false} is VALID [2018-11-23 12:00:10,630 INFO L273 TraceCheckUtils]: 106: Hoare triple {10403#false} assume !(~i~0 < 100000); {10403#false} is VALID [2018-11-23 12:00:10,630 INFO L273 TraceCheckUtils]: 107: Hoare triple {10403#false} havoc ~x~0;~x~0 := 0; {10403#false} is VALID [2018-11-23 12:00:10,630 INFO L273 TraceCheckUtils]: 108: Hoare triple {10403#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {10403#false} is VALID [2018-11-23 12:00:10,630 INFO L256 TraceCheckUtils]: 109: Hoare triple {10403#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {10403#false} is VALID [2018-11-23 12:00:10,630 INFO L273 TraceCheckUtils]: 110: Hoare triple {10403#false} ~cond := #in~cond; {10403#false} is VALID [2018-11-23 12:00:10,630 INFO L273 TraceCheckUtils]: 111: Hoare triple {10403#false} assume 0 == ~cond; {10403#false} is VALID [2018-11-23 12:00:10,630 INFO L273 TraceCheckUtils]: 112: Hoare triple {10403#false} assume !false; {10403#false} is VALID [2018-11-23 12:00:10,636 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-11-23 12:00:10,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:10,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 12:00:10,656 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 113 [2018-11-23 12:00:10,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:10,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 12:00:10,717 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:10,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 12:00:10,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 12:00:10,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:00:10,718 INFO L87 Difference]: Start difference. First operand 118 states and 122 transitions. Second operand 21 states. [2018-11-23 12:00:11,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:11,288 INFO L93 Difference]: Finished difference Result 198 states and 206 transitions. [2018-11-23 12:00:11,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 12:00:11,288 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 113 [2018-11-23 12:00:11,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:11,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:00:11,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 92 transitions. [2018-11-23 12:00:11,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:00:11,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 92 transitions. [2018-11-23 12:00:11,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 92 transitions. [2018-11-23 12:00:11,374 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:11,377 INFO L225 Difference]: With dead ends: 198 [2018-11-23 12:00:11,378 INFO L226 Difference]: Without dead ends: 121 [2018-11-23 12:00:11,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:00:11,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-23 12:00:11,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2018-11-23 12:00:11,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:11,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 120 states. [2018-11-23 12:00:11,445 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 120 states. [2018-11-23 12:00:11,445 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 120 states. [2018-11-23 12:00:11,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:11,448 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-11-23 12:00:11,448 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-11-23 12:00:11,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:11,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:11,449 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 121 states. [2018-11-23 12:00:11,449 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 121 states. [2018-11-23 12:00:11,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:11,451 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-11-23 12:00:11,451 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-11-23 12:00:11,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:11,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:11,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:11,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:11,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-23 12:00:11,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2018-11-23 12:00:11,454 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 113 [2018-11-23 12:00:11,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:11,454 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2018-11-23 12:00:11,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 12:00:11,454 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2018-11-23 12:00:11,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-23 12:00:11,455 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:11,455 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 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] [2018-11-23 12:00:11,456 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:11,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:11,456 INFO L82 PathProgramCache]: Analyzing trace with hash -714064402, now seen corresponding path program 17 times [2018-11-23 12:00:11,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:11,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:11,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:11,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:11,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:11,766 INFO L256 TraceCheckUtils]: 0: Hoare triple {11475#true} call ULTIMATE.init(); {11475#true} is VALID [2018-11-23 12:00:11,766 INFO L273 TraceCheckUtils]: 1: Hoare triple {11475#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11475#true} is VALID [2018-11-23 12:00:11,767 INFO L273 TraceCheckUtils]: 2: Hoare triple {11475#true} assume true; {11475#true} is VALID [2018-11-23 12:00:11,767 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11475#true} {11475#true} #91#return; {11475#true} is VALID [2018-11-23 12:00:11,767 INFO L256 TraceCheckUtils]: 4: Hoare triple {11475#true} call #t~ret11 := main(); {11475#true} is VALID [2018-11-23 12:00:11,767 INFO L273 TraceCheckUtils]: 5: Hoare triple {11475#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);havoc ~a~0;~a~0 := 0; {11477#(= main_~a~0 0)} is VALID [2018-11-23 12:00:11,768 INFO L273 TraceCheckUtils]: 6: Hoare triple {11477#(= 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; {11477#(= main_~a~0 0)} is VALID [2018-11-23 12:00:11,768 INFO L273 TraceCheckUtils]: 7: Hoare triple {11477#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11478#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:11,769 INFO L273 TraceCheckUtils]: 8: Hoare triple {11478#(<= 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; {11478#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:11,770 INFO L273 TraceCheckUtils]: 9: Hoare triple {11478#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11479#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:11,770 INFO L273 TraceCheckUtils]: 10: Hoare triple {11479#(<= 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; {11479#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:11,771 INFO L273 TraceCheckUtils]: 11: Hoare triple {11479#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11480#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:11,771 INFO L273 TraceCheckUtils]: 12: Hoare triple {11480#(<= 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; {11480#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:11,772 INFO L273 TraceCheckUtils]: 13: Hoare triple {11480#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11481#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:11,773 INFO L273 TraceCheckUtils]: 14: Hoare triple {11481#(<= 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; {11481#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:11,773 INFO L273 TraceCheckUtils]: 15: Hoare triple {11481#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11482#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:11,774 INFO L273 TraceCheckUtils]: 16: Hoare triple {11482#(<= 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; {11482#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:11,775 INFO L273 TraceCheckUtils]: 17: Hoare triple {11482#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11483#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:11,775 INFO L273 TraceCheckUtils]: 18: Hoare triple {11483#(<= 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; {11483#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:11,776 INFO L273 TraceCheckUtils]: 19: Hoare triple {11483#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11484#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:11,776 INFO L273 TraceCheckUtils]: 20: Hoare triple {11484#(<= 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; {11484#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:11,777 INFO L273 TraceCheckUtils]: 21: Hoare triple {11484#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11485#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:11,778 INFO L273 TraceCheckUtils]: 22: Hoare triple {11485#(<= 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; {11485#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:11,778 INFO L273 TraceCheckUtils]: 23: Hoare triple {11485#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11486#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:11,779 INFO L273 TraceCheckUtils]: 24: Hoare triple {11486#(<= 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; {11486#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:11,780 INFO L273 TraceCheckUtils]: 25: Hoare triple {11486#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11487#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:11,780 INFO L273 TraceCheckUtils]: 26: Hoare triple {11487#(<= 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; {11487#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:11,781 INFO L273 TraceCheckUtils]: 27: Hoare triple {11487#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11488#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:11,781 INFO L273 TraceCheckUtils]: 28: Hoare triple {11488#(<= 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; {11488#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:11,782 INFO L273 TraceCheckUtils]: 29: Hoare triple {11488#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11489#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:11,783 INFO L273 TraceCheckUtils]: 30: Hoare triple {11489#(<= 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; {11489#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:11,783 INFO L273 TraceCheckUtils]: 31: Hoare triple {11489#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11490#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:11,784 INFO L273 TraceCheckUtils]: 32: Hoare triple {11490#(<= 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; {11490#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:11,785 INFO L273 TraceCheckUtils]: 33: Hoare triple {11490#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11491#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:11,785 INFO L273 TraceCheckUtils]: 34: Hoare triple {11491#(<= 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; {11491#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:11,786 INFO L273 TraceCheckUtils]: 35: Hoare triple {11491#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11492#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:11,786 INFO L273 TraceCheckUtils]: 36: Hoare triple {11492#(<= 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; {11492#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:11,787 INFO L273 TraceCheckUtils]: 37: Hoare triple {11492#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11493#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:11,788 INFO L273 TraceCheckUtils]: 38: Hoare triple {11493#(<= 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; {11493#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:11,788 INFO L273 TraceCheckUtils]: 39: Hoare triple {11493#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11494#(<= main_~a~0 17)} is VALID [2018-11-23 12:00:11,789 INFO L273 TraceCheckUtils]: 40: Hoare triple {11494#(<= 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; {11494#(<= main_~a~0 17)} is VALID [2018-11-23 12:00:11,790 INFO L273 TraceCheckUtils]: 41: Hoare triple {11494#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11495#(<= main_~a~0 18)} is VALID [2018-11-23 12:00:11,790 INFO L273 TraceCheckUtils]: 42: Hoare triple {11495#(<= main_~a~0 18)} assume !(~a~0 < 100000); {11476#false} is VALID [2018-11-23 12:00:11,791 INFO L273 TraceCheckUtils]: 43: Hoare triple {11476#false} havoc ~i~0;~i~0 := 0; {11476#false} is VALID [2018-11-23 12:00:11,791 INFO L273 TraceCheckUtils]: 44: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:00:11,791 INFO L273 TraceCheckUtils]: 45: Hoare triple {11476#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11476#false} is VALID [2018-11-23 12:00:11,791 INFO L273 TraceCheckUtils]: 46: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:00:11,791 INFO L273 TraceCheckUtils]: 47: Hoare triple {11476#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11476#false} is VALID [2018-11-23 12:00:11,792 INFO L273 TraceCheckUtils]: 48: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:00:11,792 INFO L273 TraceCheckUtils]: 49: Hoare triple {11476#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11476#false} is VALID [2018-11-23 12:00:11,792 INFO L273 TraceCheckUtils]: 50: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:00:11,792 INFO L273 TraceCheckUtils]: 51: Hoare triple {11476#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11476#false} is VALID [2018-11-23 12:00:11,792 INFO L273 TraceCheckUtils]: 52: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:00:11,793 INFO L273 TraceCheckUtils]: 53: Hoare triple {11476#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11476#false} is VALID [2018-11-23 12:00:11,793 INFO L273 TraceCheckUtils]: 54: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:00:11,793 INFO L273 TraceCheckUtils]: 55: Hoare triple {11476#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11476#false} is VALID [2018-11-23 12:00:11,793 INFO L273 TraceCheckUtils]: 56: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:00:11,793 INFO L273 TraceCheckUtils]: 57: Hoare triple {11476#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11476#false} is VALID [2018-11-23 12:00:11,793 INFO L273 TraceCheckUtils]: 58: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:00:11,793 INFO L273 TraceCheckUtils]: 59: Hoare triple {11476#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11476#false} is VALID [2018-11-23 12:00:11,794 INFO L273 TraceCheckUtils]: 60: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:00:11,794 INFO L273 TraceCheckUtils]: 61: Hoare triple {11476#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11476#false} is VALID [2018-11-23 12:00:11,794 INFO L273 TraceCheckUtils]: 62: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:00:11,794 INFO L273 TraceCheckUtils]: 63: Hoare triple {11476#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11476#false} is VALID [2018-11-23 12:00:11,794 INFO L273 TraceCheckUtils]: 64: Hoare triple {11476#false} assume !(~i~0 < 100000); {11476#false} is VALID [2018-11-23 12:00:11,794 INFO L273 TraceCheckUtils]: 65: Hoare triple {11476#false} ~i~0 := 0; {11476#false} is VALID [2018-11-23 12:00:11,794 INFO L273 TraceCheckUtils]: 66: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:00:11,794 INFO L273 TraceCheckUtils]: 67: Hoare triple {11476#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11476#false} is VALID [2018-11-23 12:00:11,795 INFO L273 TraceCheckUtils]: 68: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:00:11,795 INFO L273 TraceCheckUtils]: 69: Hoare triple {11476#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11476#false} is VALID [2018-11-23 12:00:11,795 INFO L273 TraceCheckUtils]: 70: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:00:11,795 INFO L273 TraceCheckUtils]: 71: Hoare triple {11476#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11476#false} is VALID [2018-11-23 12:00:11,795 INFO L273 TraceCheckUtils]: 72: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:00:11,795 INFO L273 TraceCheckUtils]: 73: Hoare triple {11476#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11476#false} is VALID [2018-11-23 12:00:11,795 INFO L273 TraceCheckUtils]: 74: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:00:11,795 INFO L273 TraceCheckUtils]: 75: Hoare triple {11476#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11476#false} is VALID [2018-11-23 12:00:11,795 INFO L273 TraceCheckUtils]: 76: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:00:11,796 INFO L273 TraceCheckUtils]: 77: Hoare triple {11476#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11476#false} is VALID [2018-11-23 12:00:11,796 INFO L273 TraceCheckUtils]: 78: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:00:11,796 INFO L273 TraceCheckUtils]: 79: Hoare triple {11476#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11476#false} is VALID [2018-11-23 12:00:11,796 INFO L273 TraceCheckUtils]: 80: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:00:11,796 INFO L273 TraceCheckUtils]: 81: Hoare triple {11476#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11476#false} is VALID [2018-11-23 12:00:11,796 INFO L273 TraceCheckUtils]: 82: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:00:11,796 INFO L273 TraceCheckUtils]: 83: Hoare triple {11476#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11476#false} is VALID [2018-11-23 12:00:11,796 INFO L273 TraceCheckUtils]: 84: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:00:11,797 INFO L273 TraceCheckUtils]: 85: Hoare triple {11476#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11476#false} is VALID [2018-11-23 12:00:11,797 INFO L273 TraceCheckUtils]: 86: Hoare triple {11476#false} assume !(~i~0 < 100000); {11476#false} is VALID [2018-11-23 12:00:11,797 INFO L273 TraceCheckUtils]: 87: Hoare triple {11476#false} ~i~0 := 0; {11476#false} is VALID [2018-11-23 12:00:11,797 INFO L273 TraceCheckUtils]: 88: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:00:11,797 INFO L273 TraceCheckUtils]: 89: Hoare triple {11476#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11476#false} is VALID [2018-11-23 12:00:11,797 INFO L273 TraceCheckUtils]: 90: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:00:11,797 INFO L273 TraceCheckUtils]: 91: Hoare triple {11476#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11476#false} is VALID [2018-11-23 12:00:11,797 INFO L273 TraceCheckUtils]: 92: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:00:11,797 INFO L273 TraceCheckUtils]: 93: Hoare triple {11476#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11476#false} is VALID [2018-11-23 12:00:11,798 INFO L273 TraceCheckUtils]: 94: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:00:11,798 INFO L273 TraceCheckUtils]: 95: Hoare triple {11476#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11476#false} is VALID [2018-11-23 12:00:11,798 INFO L273 TraceCheckUtils]: 96: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:00:11,798 INFO L273 TraceCheckUtils]: 97: Hoare triple {11476#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11476#false} is VALID [2018-11-23 12:00:11,798 INFO L273 TraceCheckUtils]: 98: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:00:11,798 INFO L273 TraceCheckUtils]: 99: Hoare triple {11476#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11476#false} is VALID [2018-11-23 12:00:11,798 INFO L273 TraceCheckUtils]: 100: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:00:11,798 INFO L273 TraceCheckUtils]: 101: Hoare triple {11476#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11476#false} is VALID [2018-11-23 12:00:11,798 INFO L273 TraceCheckUtils]: 102: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:00:11,799 INFO L273 TraceCheckUtils]: 103: Hoare triple {11476#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11476#false} is VALID [2018-11-23 12:00:11,799 INFO L273 TraceCheckUtils]: 104: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:00:11,799 INFO L273 TraceCheckUtils]: 105: Hoare triple {11476#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11476#false} is VALID [2018-11-23 12:00:11,799 INFO L273 TraceCheckUtils]: 106: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:00:11,799 INFO L273 TraceCheckUtils]: 107: Hoare triple {11476#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11476#false} is VALID [2018-11-23 12:00:11,799 INFO L273 TraceCheckUtils]: 108: Hoare triple {11476#false} assume !(~i~0 < 100000); {11476#false} is VALID [2018-11-23 12:00:11,799 INFO L273 TraceCheckUtils]: 109: Hoare triple {11476#false} havoc ~x~0;~x~0 := 0; {11476#false} is VALID [2018-11-23 12:00:11,799 INFO L273 TraceCheckUtils]: 110: Hoare triple {11476#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {11476#false} is VALID [2018-11-23 12:00:11,800 INFO L256 TraceCheckUtils]: 111: Hoare triple {11476#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {11476#false} is VALID [2018-11-23 12:00:11,800 INFO L273 TraceCheckUtils]: 112: Hoare triple {11476#false} ~cond := #in~cond; {11476#false} is VALID [2018-11-23 12:00:11,800 INFO L273 TraceCheckUtils]: 113: Hoare triple {11476#false} assume 0 == ~cond; {11476#false} is VALID [2018-11-23 12:00:11,800 INFO L273 TraceCheckUtils]: 114: Hoare triple {11476#false} assume !false; {11476#false} is VALID [2018-11-23 12:00:11,806 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-11-23 12:00:11,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:11,806 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:11,816 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:01:26,411 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-11-23 12:01:26,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:26,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:26,858 INFO L256 TraceCheckUtils]: 0: Hoare triple {11475#true} call ULTIMATE.init(); {11475#true} is VALID [2018-11-23 12:01:26,858 INFO L273 TraceCheckUtils]: 1: Hoare triple {11475#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11475#true} is VALID [2018-11-23 12:01:26,858 INFO L273 TraceCheckUtils]: 2: Hoare triple {11475#true} assume true; {11475#true} is VALID [2018-11-23 12:01:26,858 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11475#true} {11475#true} #91#return; {11475#true} is VALID [2018-11-23 12:01:26,859 INFO L256 TraceCheckUtils]: 4: Hoare triple {11475#true} call #t~ret11 := main(); {11475#true} is VALID [2018-11-23 12:01:26,859 INFO L273 TraceCheckUtils]: 5: Hoare triple {11475#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);havoc ~a~0;~a~0 := 0; {11475#true} is VALID [2018-11-23 12:01:26,859 INFO L273 TraceCheckUtils]: 6: Hoare triple {11475#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; {11475#true} is VALID [2018-11-23 12:01:26,859 INFO L273 TraceCheckUtils]: 7: Hoare triple {11475#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11475#true} is VALID [2018-11-23 12:01:26,859 INFO L273 TraceCheckUtils]: 8: Hoare triple {11475#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; {11475#true} is VALID [2018-11-23 12:01:26,860 INFO L273 TraceCheckUtils]: 9: Hoare triple {11475#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11475#true} is VALID [2018-11-23 12:01:26,860 INFO L273 TraceCheckUtils]: 10: Hoare triple {11475#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; {11475#true} is VALID [2018-11-23 12:01:26,860 INFO L273 TraceCheckUtils]: 11: Hoare triple {11475#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11475#true} is VALID [2018-11-23 12:01:26,860 INFO L273 TraceCheckUtils]: 12: Hoare triple {11475#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; {11475#true} is VALID [2018-11-23 12:01:26,860 INFO L273 TraceCheckUtils]: 13: Hoare triple {11475#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11475#true} is VALID [2018-11-23 12:01:26,860 INFO L273 TraceCheckUtils]: 14: Hoare triple {11475#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; {11475#true} is VALID [2018-11-23 12:01:26,860 INFO L273 TraceCheckUtils]: 15: Hoare triple {11475#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11475#true} is VALID [2018-11-23 12:01:26,861 INFO L273 TraceCheckUtils]: 16: Hoare triple {11475#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; {11475#true} is VALID [2018-11-23 12:01:26,861 INFO L273 TraceCheckUtils]: 17: Hoare triple {11475#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11475#true} is VALID [2018-11-23 12:01:26,861 INFO L273 TraceCheckUtils]: 18: Hoare triple {11475#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; {11475#true} is VALID [2018-11-23 12:01:26,861 INFO L273 TraceCheckUtils]: 19: Hoare triple {11475#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11475#true} is VALID [2018-11-23 12:01:26,861 INFO L273 TraceCheckUtils]: 20: Hoare triple {11475#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; {11475#true} is VALID [2018-11-23 12:01:26,861 INFO L273 TraceCheckUtils]: 21: Hoare triple {11475#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11475#true} is VALID [2018-11-23 12:01:26,861 INFO L273 TraceCheckUtils]: 22: Hoare triple {11475#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; {11475#true} is VALID [2018-11-23 12:01:26,861 INFO L273 TraceCheckUtils]: 23: Hoare triple {11475#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11475#true} is VALID [2018-11-23 12:01:26,861 INFO L273 TraceCheckUtils]: 24: Hoare triple {11475#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; {11475#true} is VALID [2018-11-23 12:01:26,862 INFO L273 TraceCheckUtils]: 25: Hoare triple {11475#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11475#true} is VALID [2018-11-23 12:01:26,862 INFO L273 TraceCheckUtils]: 26: Hoare triple {11475#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; {11475#true} is VALID [2018-11-23 12:01:26,862 INFO L273 TraceCheckUtils]: 27: Hoare triple {11475#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11475#true} is VALID [2018-11-23 12:01:26,862 INFO L273 TraceCheckUtils]: 28: Hoare triple {11475#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; {11475#true} is VALID [2018-11-23 12:01:26,862 INFO L273 TraceCheckUtils]: 29: Hoare triple {11475#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11475#true} is VALID [2018-11-23 12:01:26,862 INFO L273 TraceCheckUtils]: 30: Hoare triple {11475#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; {11475#true} is VALID [2018-11-23 12:01:26,862 INFO L273 TraceCheckUtils]: 31: Hoare triple {11475#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11475#true} is VALID [2018-11-23 12:01:26,862 INFO L273 TraceCheckUtils]: 32: Hoare triple {11475#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; {11475#true} is VALID [2018-11-23 12:01:26,863 INFO L273 TraceCheckUtils]: 33: Hoare triple {11475#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11475#true} is VALID [2018-11-23 12:01:26,863 INFO L273 TraceCheckUtils]: 34: Hoare triple {11475#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; {11475#true} is VALID [2018-11-23 12:01:26,863 INFO L273 TraceCheckUtils]: 35: Hoare triple {11475#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11475#true} is VALID [2018-11-23 12:01:26,863 INFO L273 TraceCheckUtils]: 36: Hoare triple {11475#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; {11475#true} is VALID [2018-11-23 12:01:26,863 INFO L273 TraceCheckUtils]: 37: Hoare triple {11475#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11475#true} is VALID [2018-11-23 12:01:26,863 INFO L273 TraceCheckUtils]: 38: Hoare triple {11475#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; {11475#true} is VALID [2018-11-23 12:01:26,863 INFO L273 TraceCheckUtils]: 39: Hoare triple {11475#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11475#true} is VALID [2018-11-23 12:01:26,863 INFO L273 TraceCheckUtils]: 40: Hoare triple {11475#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; {11475#true} is VALID [2018-11-23 12:01:26,863 INFO L273 TraceCheckUtils]: 41: Hoare triple {11475#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11475#true} is VALID [2018-11-23 12:01:26,864 INFO L273 TraceCheckUtils]: 42: Hoare triple {11475#true} assume !(~a~0 < 100000); {11475#true} is VALID [2018-11-23 12:01:26,864 INFO L273 TraceCheckUtils]: 43: Hoare triple {11475#true} havoc ~i~0;~i~0 := 0; {11475#true} is VALID [2018-11-23 12:01:26,864 INFO L273 TraceCheckUtils]: 44: Hoare triple {11475#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; {11475#true} is VALID [2018-11-23 12:01:26,864 INFO L273 TraceCheckUtils]: 45: Hoare triple {11475#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11475#true} is VALID [2018-11-23 12:01:26,864 INFO L273 TraceCheckUtils]: 46: Hoare triple {11475#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; {11475#true} is VALID [2018-11-23 12:01:26,864 INFO L273 TraceCheckUtils]: 47: Hoare triple {11475#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11475#true} is VALID [2018-11-23 12:01:26,864 INFO L273 TraceCheckUtils]: 48: Hoare triple {11475#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; {11475#true} is VALID [2018-11-23 12:01:26,864 INFO L273 TraceCheckUtils]: 49: Hoare triple {11475#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11475#true} is VALID [2018-11-23 12:01:26,865 INFO L273 TraceCheckUtils]: 50: Hoare triple {11475#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; {11475#true} is VALID [2018-11-23 12:01:26,865 INFO L273 TraceCheckUtils]: 51: Hoare triple {11475#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11475#true} is VALID [2018-11-23 12:01:26,865 INFO L273 TraceCheckUtils]: 52: Hoare triple {11475#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; {11475#true} is VALID [2018-11-23 12:01:26,865 INFO L273 TraceCheckUtils]: 53: Hoare triple {11475#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11475#true} is VALID [2018-11-23 12:01:26,865 INFO L273 TraceCheckUtils]: 54: Hoare triple {11475#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; {11475#true} is VALID [2018-11-23 12:01:26,865 INFO L273 TraceCheckUtils]: 55: Hoare triple {11475#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11475#true} is VALID [2018-11-23 12:01:26,865 INFO L273 TraceCheckUtils]: 56: Hoare triple {11475#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; {11475#true} is VALID [2018-11-23 12:01:26,865 INFO L273 TraceCheckUtils]: 57: Hoare triple {11475#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11475#true} is VALID [2018-11-23 12:01:26,865 INFO L273 TraceCheckUtils]: 58: Hoare triple {11475#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; {11475#true} is VALID [2018-11-23 12:01:26,866 INFO L273 TraceCheckUtils]: 59: Hoare triple {11475#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11475#true} is VALID [2018-11-23 12:01:26,866 INFO L273 TraceCheckUtils]: 60: Hoare triple {11475#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; {11475#true} is VALID [2018-11-23 12:01:26,866 INFO L273 TraceCheckUtils]: 61: Hoare triple {11475#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11475#true} is VALID [2018-11-23 12:01:26,866 INFO L273 TraceCheckUtils]: 62: Hoare triple {11475#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; {11475#true} is VALID [2018-11-23 12:01:26,866 INFO L273 TraceCheckUtils]: 63: Hoare triple {11475#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11475#true} is VALID [2018-11-23 12:01:26,866 INFO L273 TraceCheckUtils]: 64: Hoare triple {11475#true} assume !(~i~0 < 100000); {11475#true} is VALID [2018-11-23 12:01:26,867 INFO L273 TraceCheckUtils]: 65: Hoare triple {11475#true} ~i~0 := 0; {11694#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:26,867 INFO L273 TraceCheckUtils]: 66: Hoare triple {11694#(<= 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; {11694#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:26,867 INFO L273 TraceCheckUtils]: 67: Hoare triple {11694#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11701#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:26,868 INFO L273 TraceCheckUtils]: 68: Hoare triple {11701#(<= 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; {11701#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:26,868 INFO L273 TraceCheckUtils]: 69: Hoare triple {11701#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11708#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:26,868 INFO L273 TraceCheckUtils]: 70: Hoare triple {11708#(<= 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; {11708#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:26,869 INFO L273 TraceCheckUtils]: 71: Hoare triple {11708#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11715#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:26,869 INFO L273 TraceCheckUtils]: 72: Hoare triple {11715#(<= 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; {11715#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:26,870 INFO L273 TraceCheckUtils]: 73: Hoare triple {11715#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11722#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:26,870 INFO L273 TraceCheckUtils]: 74: Hoare triple {11722#(<= main_~i~0 4)} 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; {11722#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:26,871 INFO L273 TraceCheckUtils]: 75: Hoare triple {11722#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11729#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:26,872 INFO L273 TraceCheckUtils]: 76: Hoare triple {11729#(<= main_~i~0 5)} 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; {11729#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:26,872 INFO L273 TraceCheckUtils]: 77: Hoare triple {11729#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11736#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:26,873 INFO L273 TraceCheckUtils]: 78: Hoare triple {11736#(<= main_~i~0 6)} 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; {11736#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:26,873 INFO L273 TraceCheckUtils]: 79: Hoare triple {11736#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11743#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:26,874 INFO L273 TraceCheckUtils]: 80: Hoare triple {11743#(<= main_~i~0 7)} 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; {11743#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:26,875 INFO L273 TraceCheckUtils]: 81: Hoare triple {11743#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11750#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:26,875 INFO L273 TraceCheckUtils]: 82: Hoare triple {11750#(<= main_~i~0 8)} 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; {11750#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:26,876 INFO L273 TraceCheckUtils]: 83: Hoare triple {11750#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11757#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:26,877 INFO L273 TraceCheckUtils]: 84: Hoare triple {11757#(<= main_~i~0 9)} 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; {11757#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:26,877 INFO L273 TraceCheckUtils]: 85: Hoare triple {11757#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11764#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:26,878 INFO L273 TraceCheckUtils]: 86: Hoare triple {11764#(<= main_~i~0 10)} assume !(~i~0 < 100000); {11476#false} is VALID [2018-11-23 12:01:26,878 INFO L273 TraceCheckUtils]: 87: Hoare triple {11476#false} ~i~0 := 0; {11476#false} is VALID [2018-11-23 12:01:26,879 INFO L273 TraceCheckUtils]: 88: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:01:26,879 INFO L273 TraceCheckUtils]: 89: Hoare triple {11476#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11476#false} is VALID [2018-11-23 12:01:26,879 INFO L273 TraceCheckUtils]: 90: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:01:26,879 INFO L273 TraceCheckUtils]: 91: Hoare triple {11476#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11476#false} is VALID [2018-11-23 12:01:26,880 INFO L273 TraceCheckUtils]: 92: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:01:26,880 INFO L273 TraceCheckUtils]: 93: Hoare triple {11476#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11476#false} is VALID [2018-11-23 12:01:26,880 INFO L273 TraceCheckUtils]: 94: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:01:26,881 INFO L273 TraceCheckUtils]: 95: Hoare triple {11476#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11476#false} is VALID [2018-11-23 12:01:26,881 INFO L273 TraceCheckUtils]: 96: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:01:26,881 INFO L273 TraceCheckUtils]: 97: Hoare triple {11476#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11476#false} is VALID [2018-11-23 12:01:26,881 INFO L273 TraceCheckUtils]: 98: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:01:26,882 INFO L273 TraceCheckUtils]: 99: Hoare triple {11476#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11476#false} is VALID [2018-11-23 12:01:26,882 INFO L273 TraceCheckUtils]: 100: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:01:26,882 INFO L273 TraceCheckUtils]: 101: Hoare triple {11476#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11476#false} is VALID [2018-11-23 12:01:26,882 INFO L273 TraceCheckUtils]: 102: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:01:26,882 INFO L273 TraceCheckUtils]: 103: Hoare triple {11476#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11476#false} is VALID [2018-11-23 12:01:26,882 INFO L273 TraceCheckUtils]: 104: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:01:26,883 INFO L273 TraceCheckUtils]: 105: Hoare triple {11476#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11476#false} is VALID [2018-11-23 12:01:26,883 INFO L273 TraceCheckUtils]: 106: Hoare triple {11476#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; {11476#false} is VALID [2018-11-23 12:01:26,883 INFO L273 TraceCheckUtils]: 107: Hoare triple {11476#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11476#false} is VALID [2018-11-23 12:01:26,883 INFO L273 TraceCheckUtils]: 108: Hoare triple {11476#false} assume !(~i~0 < 100000); {11476#false} is VALID [2018-11-23 12:01:26,883 INFO L273 TraceCheckUtils]: 109: Hoare triple {11476#false} havoc ~x~0;~x~0 := 0; {11476#false} is VALID [2018-11-23 12:01:26,883 INFO L273 TraceCheckUtils]: 110: Hoare triple {11476#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {11476#false} is VALID [2018-11-23 12:01:26,884 INFO L256 TraceCheckUtils]: 111: Hoare triple {11476#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {11476#false} is VALID [2018-11-23 12:01:26,884 INFO L273 TraceCheckUtils]: 112: Hoare triple {11476#false} ~cond := #in~cond; {11476#false} is VALID [2018-11-23 12:01:26,884 INFO L273 TraceCheckUtils]: 113: Hoare triple {11476#false} assume 0 == ~cond; {11476#false} is VALID [2018-11-23 12:01:26,884 INFO L273 TraceCheckUtils]: 114: Hoare triple {11476#false} assume !false; {11476#false} is VALID [2018-11-23 12:01:26,891 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2018-11-23 12:01:26,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:26,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13] total 32 [2018-11-23 12:01:26,928 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 115 [2018-11-23 12:01:26,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:26,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 12:01:27,021 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:27,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 12:01:27,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 12:01:27,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=705, Unknown=0, NotChecked=0, Total=992 [2018-11-23 12:01:27,023 INFO L87 Difference]: Start difference. First operand 120 states and 124 transitions. Second operand 32 states. [2018-11-23 12:01:28,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:28,134 INFO L93 Difference]: Finished difference Result 209 states and 220 transitions. [2018-11-23 12:01:28,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 12:01:28,134 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 115 [2018-11-23 12:01:28,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:28,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:01:28,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 163 transitions. [2018-11-23 12:01:28,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:01:28,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 163 transitions. [2018-11-23 12:01:28,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 163 transitions. [2018-11-23 12:01:28,378 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:28,384 INFO L225 Difference]: With dead ends: 209 [2018-11-23 12:01:28,384 INFO L226 Difference]: Without dead ends: 132 [2018-11-23 12:01:28,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=287, Invalid=705, Unknown=0, NotChecked=0, Total=992 [2018-11-23 12:01:28,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-23 12:01:28,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 128. [2018-11-23 12:01:28,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:28,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand 128 states. [2018-11-23 12:01:28,467 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 128 states. [2018-11-23 12:01:28,467 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 128 states. [2018-11-23 12:01:28,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:28,470 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2018-11-23 12:01:28,470 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 136 transitions. [2018-11-23 12:01:28,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:28,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:28,470 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 132 states. [2018-11-23 12:01:28,470 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 132 states. [2018-11-23 12:01:28,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:28,476 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2018-11-23 12:01:28,477 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 136 transitions. [2018-11-23 12:01:28,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:28,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:28,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:28,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:28,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-23 12:01:28,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 132 transitions. [2018-11-23 12:01:28,480 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 132 transitions. Word has length 115 [2018-11-23 12:01:28,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:28,481 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 132 transitions. [2018-11-23 12:01:28,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 12:01:28,481 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2018-11-23 12:01:28,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-23 12:01:28,482 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:28,482 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:28,482 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:28,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:28,483 INFO L82 PathProgramCache]: Analyzing trace with hash 977461222, now seen corresponding path program 18 times [2018-11-23 12:01:28,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:28,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:28,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:28,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:28,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:29,467 INFO L256 TraceCheckUtils]: 0: Hoare triple {12614#true} call ULTIMATE.init(); {12614#true} is VALID [2018-11-23 12:01:29,467 INFO L273 TraceCheckUtils]: 1: Hoare triple {12614#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12614#true} is VALID [2018-11-23 12:01:29,467 INFO L273 TraceCheckUtils]: 2: Hoare triple {12614#true} assume true; {12614#true} is VALID [2018-11-23 12:01:29,467 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12614#true} {12614#true} #91#return; {12614#true} is VALID [2018-11-23 12:01:29,468 INFO L256 TraceCheckUtils]: 4: Hoare triple {12614#true} call #t~ret11 := main(); {12614#true} is VALID [2018-11-23 12:01:29,468 INFO L273 TraceCheckUtils]: 5: Hoare triple {12614#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);havoc ~a~0;~a~0 := 0; {12616#(= main_~a~0 0)} is VALID [2018-11-23 12:01:29,468 INFO L273 TraceCheckUtils]: 6: Hoare triple {12616#(= 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; {12616#(= main_~a~0 0)} is VALID [2018-11-23 12:01:29,469 INFO L273 TraceCheckUtils]: 7: Hoare triple {12616#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12617#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:29,469 INFO L273 TraceCheckUtils]: 8: Hoare triple {12617#(<= 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; {12617#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:29,469 INFO L273 TraceCheckUtils]: 9: Hoare triple {12617#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12618#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:29,470 INFO L273 TraceCheckUtils]: 10: Hoare triple {12618#(<= 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; {12618#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:29,470 INFO L273 TraceCheckUtils]: 11: Hoare triple {12618#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12619#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:29,470 INFO L273 TraceCheckUtils]: 12: Hoare triple {12619#(<= 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; {12619#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:29,471 INFO L273 TraceCheckUtils]: 13: Hoare triple {12619#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12620#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:29,471 INFO L273 TraceCheckUtils]: 14: Hoare triple {12620#(<= 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; {12620#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:29,472 INFO L273 TraceCheckUtils]: 15: Hoare triple {12620#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12621#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:29,472 INFO L273 TraceCheckUtils]: 16: Hoare triple {12621#(<= 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; {12621#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:29,473 INFO L273 TraceCheckUtils]: 17: Hoare triple {12621#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12622#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:29,474 INFO L273 TraceCheckUtils]: 18: Hoare triple {12622#(<= 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; {12622#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:29,474 INFO L273 TraceCheckUtils]: 19: Hoare triple {12622#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12623#(<= main_~a~0 7)} is VALID [2018-11-23 12:01:29,475 INFO L273 TraceCheckUtils]: 20: Hoare triple {12623#(<= 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; {12623#(<= main_~a~0 7)} is VALID [2018-11-23 12:01:29,476 INFO L273 TraceCheckUtils]: 21: Hoare triple {12623#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12624#(<= main_~a~0 8)} is VALID [2018-11-23 12:01:29,476 INFO L273 TraceCheckUtils]: 22: Hoare triple {12624#(<= 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; {12624#(<= main_~a~0 8)} is VALID [2018-11-23 12:01:29,477 INFO L273 TraceCheckUtils]: 23: Hoare triple {12624#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12625#(<= main_~a~0 9)} is VALID [2018-11-23 12:01:29,477 INFO L273 TraceCheckUtils]: 24: Hoare triple {12625#(<= 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; {12625#(<= main_~a~0 9)} is VALID [2018-11-23 12:01:29,478 INFO L273 TraceCheckUtils]: 25: Hoare triple {12625#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12626#(<= main_~a~0 10)} is VALID [2018-11-23 12:01:29,478 INFO L273 TraceCheckUtils]: 26: Hoare triple {12626#(<= 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; {12626#(<= main_~a~0 10)} is VALID [2018-11-23 12:01:29,479 INFO L273 TraceCheckUtils]: 27: Hoare triple {12626#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12627#(<= main_~a~0 11)} is VALID [2018-11-23 12:01:29,480 INFO L273 TraceCheckUtils]: 28: Hoare triple {12627#(<= 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; {12627#(<= main_~a~0 11)} is VALID [2018-11-23 12:01:29,480 INFO L273 TraceCheckUtils]: 29: Hoare triple {12627#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12628#(<= main_~a~0 12)} is VALID [2018-11-23 12:01:29,481 INFO L273 TraceCheckUtils]: 30: Hoare triple {12628#(<= 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; {12628#(<= main_~a~0 12)} is VALID [2018-11-23 12:01:29,481 INFO L273 TraceCheckUtils]: 31: Hoare triple {12628#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12629#(<= main_~a~0 13)} is VALID [2018-11-23 12:01:29,482 INFO L273 TraceCheckUtils]: 32: Hoare triple {12629#(<= 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; {12629#(<= main_~a~0 13)} is VALID [2018-11-23 12:01:29,483 INFO L273 TraceCheckUtils]: 33: Hoare triple {12629#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12630#(<= main_~a~0 14)} is VALID [2018-11-23 12:01:29,483 INFO L273 TraceCheckUtils]: 34: Hoare triple {12630#(<= 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; {12630#(<= main_~a~0 14)} is VALID [2018-11-23 12:01:29,484 INFO L273 TraceCheckUtils]: 35: Hoare triple {12630#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12631#(<= main_~a~0 15)} is VALID [2018-11-23 12:01:29,484 INFO L273 TraceCheckUtils]: 36: Hoare triple {12631#(<= 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; {12631#(<= main_~a~0 15)} is VALID [2018-11-23 12:01:29,485 INFO L273 TraceCheckUtils]: 37: Hoare triple {12631#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12632#(<= main_~a~0 16)} is VALID [2018-11-23 12:01:29,486 INFO L273 TraceCheckUtils]: 38: Hoare triple {12632#(<= 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; {12632#(<= main_~a~0 16)} is VALID [2018-11-23 12:01:29,486 INFO L273 TraceCheckUtils]: 39: Hoare triple {12632#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12633#(<= main_~a~0 17)} is VALID [2018-11-23 12:01:29,487 INFO L273 TraceCheckUtils]: 40: Hoare triple {12633#(<= 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; {12633#(<= main_~a~0 17)} is VALID [2018-11-23 12:01:29,487 INFO L273 TraceCheckUtils]: 41: Hoare triple {12633#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12634#(<= main_~a~0 18)} is VALID [2018-11-23 12:01:29,488 INFO L273 TraceCheckUtils]: 42: Hoare triple {12634#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12634#(<= main_~a~0 18)} is VALID [2018-11-23 12:01:29,489 INFO L273 TraceCheckUtils]: 43: Hoare triple {12634#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12635#(<= main_~a~0 19)} is VALID [2018-11-23 12:01:29,489 INFO L273 TraceCheckUtils]: 44: Hoare triple {12635#(<= main_~a~0 19)} assume !(~a~0 < 100000); {12615#false} is VALID [2018-11-23 12:01:29,490 INFO L273 TraceCheckUtils]: 45: Hoare triple {12615#false} havoc ~i~0;~i~0 := 0; {12615#false} is VALID [2018-11-23 12:01:29,490 INFO L273 TraceCheckUtils]: 46: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:01:29,490 INFO L273 TraceCheckUtils]: 47: Hoare triple {12615#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12615#false} is VALID [2018-11-23 12:01:29,490 INFO L273 TraceCheckUtils]: 48: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:01:29,490 INFO L273 TraceCheckUtils]: 49: Hoare triple {12615#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12615#false} is VALID [2018-11-23 12:01:29,491 INFO L273 TraceCheckUtils]: 50: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:01:29,491 INFO L273 TraceCheckUtils]: 51: Hoare triple {12615#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12615#false} is VALID [2018-11-23 12:01:29,491 INFO L273 TraceCheckUtils]: 52: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:01:29,491 INFO L273 TraceCheckUtils]: 53: Hoare triple {12615#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12615#false} is VALID [2018-11-23 12:01:29,491 INFO L273 TraceCheckUtils]: 54: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:01:29,492 INFO L273 TraceCheckUtils]: 55: Hoare triple {12615#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12615#false} is VALID [2018-11-23 12:01:29,492 INFO L273 TraceCheckUtils]: 56: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:01:29,492 INFO L273 TraceCheckUtils]: 57: Hoare triple {12615#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12615#false} is VALID [2018-11-23 12:01:29,492 INFO L273 TraceCheckUtils]: 58: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:01:29,492 INFO L273 TraceCheckUtils]: 59: Hoare triple {12615#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12615#false} is VALID [2018-11-23 12:01:29,493 INFO L273 TraceCheckUtils]: 60: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:01:29,493 INFO L273 TraceCheckUtils]: 61: Hoare triple {12615#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12615#false} is VALID [2018-11-23 12:01:29,493 INFO L273 TraceCheckUtils]: 62: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:01:29,493 INFO L273 TraceCheckUtils]: 63: Hoare triple {12615#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12615#false} is VALID [2018-11-23 12:01:29,493 INFO L273 TraceCheckUtils]: 64: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:01:29,493 INFO L273 TraceCheckUtils]: 65: Hoare triple {12615#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12615#false} is VALID [2018-11-23 12:01:29,493 INFO L273 TraceCheckUtils]: 66: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:01:29,494 INFO L273 TraceCheckUtils]: 67: Hoare triple {12615#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12615#false} is VALID [2018-11-23 12:01:29,494 INFO L273 TraceCheckUtils]: 68: Hoare triple {12615#false} assume !(~i~0 < 100000); {12615#false} is VALID [2018-11-23 12:01:29,494 INFO L273 TraceCheckUtils]: 69: Hoare triple {12615#false} ~i~0 := 0; {12615#false} is VALID [2018-11-23 12:01:29,494 INFO L273 TraceCheckUtils]: 70: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:01:29,494 INFO L273 TraceCheckUtils]: 71: Hoare triple {12615#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12615#false} is VALID [2018-11-23 12:01:29,494 INFO L273 TraceCheckUtils]: 72: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:01:29,494 INFO L273 TraceCheckUtils]: 73: Hoare triple {12615#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12615#false} is VALID [2018-11-23 12:01:29,494 INFO L273 TraceCheckUtils]: 74: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:01:29,494 INFO L273 TraceCheckUtils]: 75: Hoare triple {12615#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12615#false} is VALID [2018-11-23 12:01:29,495 INFO L273 TraceCheckUtils]: 76: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:01:29,495 INFO L273 TraceCheckUtils]: 77: Hoare triple {12615#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12615#false} is VALID [2018-11-23 12:01:29,495 INFO L273 TraceCheckUtils]: 78: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:01:29,495 INFO L273 TraceCheckUtils]: 79: Hoare triple {12615#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12615#false} is VALID [2018-11-23 12:01:29,495 INFO L273 TraceCheckUtils]: 80: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:01:29,495 INFO L273 TraceCheckUtils]: 81: Hoare triple {12615#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12615#false} is VALID [2018-11-23 12:01:29,495 INFO L273 TraceCheckUtils]: 82: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:01:29,496 INFO L273 TraceCheckUtils]: 83: Hoare triple {12615#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12615#false} is VALID [2018-11-23 12:01:29,496 INFO L273 TraceCheckUtils]: 84: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:01:29,496 INFO L273 TraceCheckUtils]: 85: Hoare triple {12615#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12615#false} is VALID [2018-11-23 12:01:29,496 INFO L273 TraceCheckUtils]: 86: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:01:29,496 INFO L273 TraceCheckUtils]: 87: Hoare triple {12615#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12615#false} is VALID [2018-11-23 12:01:29,496 INFO L273 TraceCheckUtils]: 88: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:01:29,497 INFO L273 TraceCheckUtils]: 89: Hoare triple {12615#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12615#false} is VALID [2018-11-23 12:01:29,497 INFO L273 TraceCheckUtils]: 90: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:01:29,497 INFO L273 TraceCheckUtils]: 91: Hoare triple {12615#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12615#false} is VALID [2018-11-23 12:01:29,497 INFO L273 TraceCheckUtils]: 92: Hoare triple {12615#false} assume !(~i~0 < 100000); {12615#false} is VALID [2018-11-23 12:01:29,497 INFO L273 TraceCheckUtils]: 93: Hoare triple {12615#false} ~i~0 := 0; {12615#false} is VALID [2018-11-23 12:01:29,497 INFO L273 TraceCheckUtils]: 94: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:01:29,498 INFO L273 TraceCheckUtils]: 95: Hoare triple {12615#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12615#false} is VALID [2018-11-23 12:01:29,498 INFO L273 TraceCheckUtils]: 96: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:01:29,498 INFO L273 TraceCheckUtils]: 97: Hoare triple {12615#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12615#false} is VALID [2018-11-23 12:01:29,498 INFO L273 TraceCheckUtils]: 98: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:01:29,498 INFO L273 TraceCheckUtils]: 99: Hoare triple {12615#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12615#false} is VALID [2018-11-23 12:01:29,498 INFO L273 TraceCheckUtils]: 100: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:01:29,499 INFO L273 TraceCheckUtils]: 101: Hoare triple {12615#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12615#false} is VALID [2018-11-23 12:01:29,499 INFO L273 TraceCheckUtils]: 102: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:01:29,499 INFO L273 TraceCheckUtils]: 103: Hoare triple {12615#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12615#false} is VALID [2018-11-23 12:01:29,499 INFO L273 TraceCheckUtils]: 104: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:01:29,499 INFO L273 TraceCheckUtils]: 105: Hoare triple {12615#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12615#false} is VALID [2018-11-23 12:01:29,499 INFO L273 TraceCheckUtils]: 106: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:01:29,500 INFO L273 TraceCheckUtils]: 107: Hoare triple {12615#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12615#false} is VALID [2018-11-23 12:01:29,500 INFO L273 TraceCheckUtils]: 108: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:01:29,500 INFO L273 TraceCheckUtils]: 109: Hoare triple {12615#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12615#false} is VALID [2018-11-23 12:01:29,500 INFO L273 TraceCheckUtils]: 110: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:01:29,500 INFO L273 TraceCheckUtils]: 111: Hoare triple {12615#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12615#false} is VALID [2018-11-23 12:01:29,500 INFO L273 TraceCheckUtils]: 112: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:01:29,501 INFO L273 TraceCheckUtils]: 113: Hoare triple {12615#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12615#false} is VALID [2018-11-23 12:01:29,501 INFO L273 TraceCheckUtils]: 114: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:01:29,501 INFO L273 TraceCheckUtils]: 115: Hoare triple {12615#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12615#false} is VALID [2018-11-23 12:01:29,501 INFO L273 TraceCheckUtils]: 116: Hoare triple {12615#false} assume !(~i~0 < 100000); {12615#false} is VALID [2018-11-23 12:01:29,501 INFO L273 TraceCheckUtils]: 117: Hoare triple {12615#false} havoc ~x~0;~x~0 := 0; {12615#false} is VALID [2018-11-23 12:01:29,501 INFO L273 TraceCheckUtils]: 118: Hoare triple {12615#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {12615#false} is VALID [2018-11-23 12:01:29,502 INFO L256 TraceCheckUtils]: 119: Hoare triple {12615#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {12615#false} is VALID [2018-11-23 12:01:29,502 INFO L273 TraceCheckUtils]: 120: Hoare triple {12615#false} ~cond := #in~cond; {12615#false} is VALID [2018-11-23 12:01:29,502 INFO L273 TraceCheckUtils]: 121: Hoare triple {12615#false} assume 0 == ~cond; {12615#false} is VALID [2018-11-23 12:01:29,502 INFO L273 TraceCheckUtils]: 122: Hoare triple {12615#false} assume !false; {12615#false} is VALID [2018-11-23 12:01:29,511 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2018-11-23 12:01:29,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:29,511 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:29,522 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:02:32,721 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2018-11-23 12:02:32,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:32,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:33,292 INFO L256 TraceCheckUtils]: 0: Hoare triple {12614#true} call ULTIMATE.init(); {12614#true} is VALID [2018-11-23 12:02:33,292 INFO L273 TraceCheckUtils]: 1: Hoare triple {12614#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12614#true} is VALID [2018-11-23 12:02:33,292 INFO L273 TraceCheckUtils]: 2: Hoare triple {12614#true} assume true; {12614#true} is VALID [2018-11-23 12:02:33,292 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12614#true} {12614#true} #91#return; {12614#true} is VALID [2018-11-23 12:02:33,293 INFO L256 TraceCheckUtils]: 4: Hoare triple {12614#true} call #t~ret11 := main(); {12614#true} is VALID [2018-11-23 12:02:33,293 INFO L273 TraceCheckUtils]: 5: Hoare triple {12614#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);havoc ~a~0;~a~0 := 0; {12614#true} is VALID [2018-11-23 12:02:33,293 INFO L273 TraceCheckUtils]: 6: Hoare triple {12614#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; {12614#true} is VALID [2018-11-23 12:02:33,293 INFO L273 TraceCheckUtils]: 7: Hoare triple {12614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12614#true} is VALID [2018-11-23 12:02:33,294 INFO L273 TraceCheckUtils]: 8: Hoare triple {12614#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; {12614#true} is VALID [2018-11-23 12:02:33,294 INFO L273 TraceCheckUtils]: 9: Hoare triple {12614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12614#true} is VALID [2018-11-23 12:02:33,294 INFO L273 TraceCheckUtils]: 10: Hoare triple {12614#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; {12614#true} is VALID [2018-11-23 12:02:33,294 INFO L273 TraceCheckUtils]: 11: Hoare triple {12614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12614#true} is VALID [2018-11-23 12:02:33,294 INFO L273 TraceCheckUtils]: 12: Hoare triple {12614#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; {12614#true} is VALID [2018-11-23 12:02:33,295 INFO L273 TraceCheckUtils]: 13: Hoare triple {12614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12614#true} is VALID [2018-11-23 12:02:33,295 INFO L273 TraceCheckUtils]: 14: Hoare triple {12614#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; {12614#true} is VALID [2018-11-23 12:02:33,295 INFO L273 TraceCheckUtils]: 15: Hoare triple {12614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12614#true} is VALID [2018-11-23 12:02:33,295 INFO L273 TraceCheckUtils]: 16: Hoare triple {12614#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; {12614#true} is VALID [2018-11-23 12:02:33,295 INFO L273 TraceCheckUtils]: 17: Hoare triple {12614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12614#true} is VALID [2018-11-23 12:02:33,295 INFO L273 TraceCheckUtils]: 18: Hoare triple {12614#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; {12614#true} is VALID [2018-11-23 12:02:33,295 INFO L273 TraceCheckUtils]: 19: Hoare triple {12614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12614#true} is VALID [2018-11-23 12:02:33,295 INFO L273 TraceCheckUtils]: 20: Hoare triple {12614#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; {12614#true} is VALID [2018-11-23 12:02:33,296 INFO L273 TraceCheckUtils]: 21: Hoare triple {12614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12614#true} is VALID [2018-11-23 12:02:33,296 INFO L273 TraceCheckUtils]: 22: Hoare triple {12614#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; {12614#true} is VALID [2018-11-23 12:02:33,296 INFO L273 TraceCheckUtils]: 23: Hoare triple {12614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12614#true} is VALID [2018-11-23 12:02:33,296 INFO L273 TraceCheckUtils]: 24: Hoare triple {12614#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; {12614#true} is VALID [2018-11-23 12:02:33,296 INFO L273 TraceCheckUtils]: 25: Hoare triple {12614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12614#true} is VALID [2018-11-23 12:02:33,296 INFO L273 TraceCheckUtils]: 26: Hoare triple {12614#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; {12614#true} is VALID [2018-11-23 12:02:33,296 INFO L273 TraceCheckUtils]: 27: Hoare triple {12614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12614#true} is VALID [2018-11-23 12:02:33,296 INFO L273 TraceCheckUtils]: 28: Hoare triple {12614#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; {12614#true} is VALID [2018-11-23 12:02:33,296 INFO L273 TraceCheckUtils]: 29: Hoare triple {12614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12614#true} is VALID [2018-11-23 12:02:33,297 INFO L273 TraceCheckUtils]: 30: Hoare triple {12614#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; {12614#true} is VALID [2018-11-23 12:02:33,297 INFO L273 TraceCheckUtils]: 31: Hoare triple {12614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12614#true} is VALID [2018-11-23 12:02:33,297 INFO L273 TraceCheckUtils]: 32: Hoare triple {12614#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; {12614#true} is VALID [2018-11-23 12:02:33,297 INFO L273 TraceCheckUtils]: 33: Hoare triple {12614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12614#true} is VALID [2018-11-23 12:02:33,297 INFO L273 TraceCheckUtils]: 34: Hoare triple {12614#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; {12614#true} is VALID [2018-11-23 12:02:33,297 INFO L273 TraceCheckUtils]: 35: Hoare triple {12614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12614#true} is VALID [2018-11-23 12:02:33,297 INFO L273 TraceCheckUtils]: 36: Hoare triple {12614#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; {12614#true} is VALID [2018-11-23 12:02:33,297 INFO L273 TraceCheckUtils]: 37: Hoare triple {12614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12614#true} is VALID [2018-11-23 12:02:33,298 INFO L273 TraceCheckUtils]: 38: Hoare triple {12614#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; {12614#true} is VALID [2018-11-23 12:02:33,298 INFO L273 TraceCheckUtils]: 39: Hoare triple {12614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12614#true} is VALID [2018-11-23 12:02:33,298 INFO L273 TraceCheckUtils]: 40: Hoare triple {12614#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; {12614#true} is VALID [2018-11-23 12:02:33,298 INFO L273 TraceCheckUtils]: 41: Hoare triple {12614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12614#true} is VALID [2018-11-23 12:02:33,298 INFO L273 TraceCheckUtils]: 42: Hoare triple {12614#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; {12614#true} is VALID [2018-11-23 12:02:33,298 INFO L273 TraceCheckUtils]: 43: Hoare triple {12614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12614#true} is VALID [2018-11-23 12:02:33,298 INFO L273 TraceCheckUtils]: 44: Hoare triple {12614#true} assume !(~a~0 < 100000); {12614#true} is VALID [2018-11-23 12:02:33,299 INFO L273 TraceCheckUtils]: 45: Hoare triple {12614#true} havoc ~i~0;~i~0 := 0; {12774#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:33,299 INFO L273 TraceCheckUtils]: 46: Hoare triple {12774#(<= 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; {12774#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:33,300 INFO L273 TraceCheckUtils]: 47: Hoare triple {12774#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12781#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:33,300 INFO L273 TraceCheckUtils]: 48: Hoare triple {12781#(<= 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; {12781#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:33,301 INFO L273 TraceCheckUtils]: 49: Hoare triple {12781#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12788#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:33,301 INFO L273 TraceCheckUtils]: 50: Hoare triple {12788#(<= 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; {12788#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:33,301 INFO L273 TraceCheckUtils]: 51: Hoare triple {12788#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12795#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:33,302 INFO L273 TraceCheckUtils]: 52: Hoare triple {12795#(<= 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; {12795#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:33,302 INFO L273 TraceCheckUtils]: 53: Hoare triple {12795#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12802#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:33,303 INFO L273 TraceCheckUtils]: 54: Hoare triple {12802#(<= 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; {12802#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:33,304 INFO L273 TraceCheckUtils]: 55: Hoare triple {12802#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12809#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:33,304 INFO L273 TraceCheckUtils]: 56: Hoare triple {12809#(<= 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; {12809#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:33,305 INFO L273 TraceCheckUtils]: 57: Hoare triple {12809#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12816#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:33,306 INFO L273 TraceCheckUtils]: 58: Hoare triple {12816#(<= 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; {12816#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:33,306 INFO L273 TraceCheckUtils]: 59: Hoare triple {12816#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12823#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:33,307 INFO L273 TraceCheckUtils]: 60: Hoare triple {12823#(<= main_~i~0 7)} 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; {12823#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:33,308 INFO L273 TraceCheckUtils]: 61: Hoare triple {12823#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12830#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:33,308 INFO L273 TraceCheckUtils]: 62: Hoare triple {12830#(<= main_~i~0 8)} 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; {12830#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:33,309 INFO L273 TraceCheckUtils]: 63: Hoare triple {12830#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12837#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:33,310 INFO L273 TraceCheckUtils]: 64: Hoare triple {12837#(<= main_~i~0 9)} 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; {12837#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:33,310 INFO L273 TraceCheckUtils]: 65: Hoare triple {12837#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12844#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:33,311 INFO L273 TraceCheckUtils]: 66: Hoare triple {12844#(<= main_~i~0 10)} 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; {12844#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:33,312 INFO L273 TraceCheckUtils]: 67: Hoare triple {12844#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12851#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:33,313 INFO L273 TraceCheckUtils]: 68: Hoare triple {12851#(<= main_~i~0 11)} assume !(~i~0 < 100000); {12615#false} is VALID [2018-11-23 12:02:33,313 INFO L273 TraceCheckUtils]: 69: Hoare triple {12615#false} ~i~0 := 0; {12615#false} is VALID [2018-11-23 12:02:33,313 INFO L273 TraceCheckUtils]: 70: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:02:33,313 INFO L273 TraceCheckUtils]: 71: Hoare triple {12615#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12615#false} is VALID [2018-11-23 12:02:33,314 INFO L273 TraceCheckUtils]: 72: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:02:33,314 INFO L273 TraceCheckUtils]: 73: Hoare triple {12615#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12615#false} is VALID [2018-11-23 12:02:33,314 INFO L273 TraceCheckUtils]: 74: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:02:33,314 INFO L273 TraceCheckUtils]: 75: Hoare triple {12615#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12615#false} is VALID [2018-11-23 12:02:33,315 INFO L273 TraceCheckUtils]: 76: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:02:33,315 INFO L273 TraceCheckUtils]: 77: Hoare triple {12615#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12615#false} is VALID [2018-11-23 12:02:33,315 INFO L273 TraceCheckUtils]: 78: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:02:33,316 INFO L273 TraceCheckUtils]: 79: Hoare triple {12615#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12615#false} is VALID [2018-11-23 12:02:33,316 INFO L273 TraceCheckUtils]: 80: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:02:33,316 INFO L273 TraceCheckUtils]: 81: Hoare triple {12615#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12615#false} is VALID [2018-11-23 12:02:33,316 INFO L273 TraceCheckUtils]: 82: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:02:33,317 INFO L273 TraceCheckUtils]: 83: Hoare triple {12615#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12615#false} is VALID [2018-11-23 12:02:33,317 INFO L273 TraceCheckUtils]: 84: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:02:33,317 INFO L273 TraceCheckUtils]: 85: Hoare triple {12615#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12615#false} is VALID [2018-11-23 12:02:33,317 INFO L273 TraceCheckUtils]: 86: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:02:33,317 INFO L273 TraceCheckUtils]: 87: Hoare triple {12615#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12615#false} is VALID [2018-11-23 12:02:33,318 INFO L273 TraceCheckUtils]: 88: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:02:33,318 INFO L273 TraceCheckUtils]: 89: Hoare triple {12615#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12615#false} is VALID [2018-11-23 12:02:33,318 INFO L273 TraceCheckUtils]: 90: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:02:33,318 INFO L273 TraceCheckUtils]: 91: Hoare triple {12615#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12615#false} is VALID [2018-11-23 12:02:33,318 INFO L273 TraceCheckUtils]: 92: Hoare triple {12615#false} assume !(~i~0 < 100000); {12615#false} is VALID [2018-11-23 12:02:33,319 INFO L273 TraceCheckUtils]: 93: Hoare triple {12615#false} ~i~0 := 0; {12615#false} is VALID [2018-11-23 12:02:33,319 INFO L273 TraceCheckUtils]: 94: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:02:33,319 INFO L273 TraceCheckUtils]: 95: Hoare triple {12615#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12615#false} is VALID [2018-11-23 12:02:33,319 INFO L273 TraceCheckUtils]: 96: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:02:33,319 INFO L273 TraceCheckUtils]: 97: Hoare triple {12615#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12615#false} is VALID [2018-11-23 12:02:33,320 INFO L273 TraceCheckUtils]: 98: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:02:33,320 INFO L273 TraceCheckUtils]: 99: Hoare triple {12615#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12615#false} is VALID [2018-11-23 12:02:33,320 INFO L273 TraceCheckUtils]: 100: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:02:33,320 INFO L273 TraceCheckUtils]: 101: Hoare triple {12615#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12615#false} is VALID [2018-11-23 12:02:33,320 INFO L273 TraceCheckUtils]: 102: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:02:33,321 INFO L273 TraceCheckUtils]: 103: Hoare triple {12615#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12615#false} is VALID [2018-11-23 12:02:33,321 INFO L273 TraceCheckUtils]: 104: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:02:33,321 INFO L273 TraceCheckUtils]: 105: Hoare triple {12615#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12615#false} is VALID [2018-11-23 12:02:33,321 INFO L273 TraceCheckUtils]: 106: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:02:33,321 INFO L273 TraceCheckUtils]: 107: Hoare triple {12615#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12615#false} is VALID [2018-11-23 12:02:33,321 INFO L273 TraceCheckUtils]: 108: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:02:33,321 INFO L273 TraceCheckUtils]: 109: Hoare triple {12615#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12615#false} is VALID [2018-11-23 12:02:33,322 INFO L273 TraceCheckUtils]: 110: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:02:33,322 INFO L273 TraceCheckUtils]: 111: Hoare triple {12615#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12615#false} is VALID [2018-11-23 12:02:33,322 INFO L273 TraceCheckUtils]: 112: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:02:33,322 INFO L273 TraceCheckUtils]: 113: Hoare triple {12615#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12615#false} is VALID [2018-11-23 12:02:33,322 INFO L273 TraceCheckUtils]: 114: Hoare triple {12615#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; {12615#false} is VALID [2018-11-23 12:02:33,322 INFO L273 TraceCheckUtils]: 115: Hoare triple {12615#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12615#false} is VALID [2018-11-23 12:02:33,323 INFO L273 TraceCheckUtils]: 116: Hoare triple {12615#false} assume !(~i~0 < 100000); {12615#false} is VALID [2018-11-23 12:02:33,323 INFO L273 TraceCheckUtils]: 117: Hoare triple {12615#false} havoc ~x~0;~x~0 := 0; {12615#false} is VALID [2018-11-23 12:02:33,323 INFO L273 TraceCheckUtils]: 118: Hoare triple {12615#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {12615#false} is VALID [2018-11-23 12:02:33,323 INFO L256 TraceCheckUtils]: 119: Hoare triple {12615#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1 else 0)); {12615#false} is VALID [2018-11-23 12:02:33,323 INFO L273 TraceCheckUtils]: 120: Hoare triple {12615#false} ~cond := #in~cond; {12615#false} is VALID [2018-11-23 12:02:33,323 INFO L273 TraceCheckUtils]: 121: Hoare triple {12615#false} assume 0 == ~cond; {12615#false} is VALID [2018-11-23 12:02:33,324 INFO L273 TraceCheckUtils]: 122: Hoare triple {12615#false} assume !false; {12615#false} is VALID [2018-11-23 12:02:33,337 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 603 trivial. 0 not checked. [2018-11-23 12:02:33,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:33,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14] total 34 [2018-11-23 12:02:33,392 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 123 [2018-11-23 12:02:33,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:33,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 12:02:33,497 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:33,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 12:02:33,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 12:02:33,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:02:33,499 INFO L87 Difference]: Start difference. First operand 128 states and 132 transitions. Second operand 34 states.