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_copyInitSum_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:01:51,396 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:01:51,399 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:01:51,411 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:01:51,412 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:01:51,413 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:01:51,415 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:01:51,417 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:01:51,419 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:01:51,420 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:01:51,421 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:01:51,421 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:01:51,422 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:01:51,423 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:01:51,424 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:01:51,425 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:01:51,426 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:01:51,428 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:01:51,430 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:01:51,432 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:01:51,433 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:01:51,435 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:01:51,437 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:01:51,438 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:01:51,438 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:01:51,439 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:01:51,440 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:01:51,441 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:01:51,442 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:01:51,443 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:01:51,444 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:01:51,445 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:01:51,445 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:01:51,445 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:01:51,446 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:01:51,447 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:01:51,447 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:01:51,463 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:01:51,464 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:01:51,465 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:01:51,465 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:01:51,465 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:01:51,466 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:01:51,466 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:01:51,466 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:01:51,466 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:01:51,466 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:01:51,467 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:01:51,467 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:01:51,467 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:01:51,467 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:01:51,467 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:01:51,468 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:01:51,468 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:01:51,468 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:01:51,468 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:01:51,468 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:01:51,469 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:01:51,469 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:01:51,469 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:01:51,469 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:01:51,469 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:01:51,470 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:01:51,470 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:01:51,470 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:01:51,470 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:01:51,470 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:01:51,471 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:01:51,517 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:01:51,537 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:01:51,542 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:01:51,544 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:01:51,545 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:01:51,545 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copyInitSum_true-unreach-call_ground.i [2018-11-23 12:01:51,618 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5be377336/32f55c1f63364f079f7943c55942b783/FLAG12cc5191a [2018-11-23 12:01:52,110 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:01:52,111 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copyInitSum_true-unreach-call_ground.i [2018-11-23 12:01:52,117 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5be377336/32f55c1f63364f079f7943c55942b783/FLAG12cc5191a [2018-11-23 12:01:52,460 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5be377336/32f55c1f63364f079f7943c55942b783 [2018-11-23 12:01:52,471 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:01:52,472 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:01:52,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:01:52,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:01:52,478 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:01:52,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:01:52" (1/1) ... [2018-11-23 12:01:52,483 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d13d574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:52, skipping insertion in model container [2018-11-23 12:01:52,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:01:52" (1/1) ... [2018-11-23 12:01:52,494 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:01:52,520 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:01:52,807 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:01:52,812 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:01:52,852 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:01:52,881 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:01:52,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:52 WrapperNode [2018-11-23 12:01:52,882 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:01:52,883 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:01:52,883 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:01:52,883 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:01:52,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:52" (1/1) ... [2018-11-23 12:01:52,907 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:52" (1/1) ... [2018-11-23 12:01:52,917 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:01:52,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:01:52,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:01:52,917 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:01:52,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:52" (1/1) ... [2018-11-23 12:01:52,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:52" (1/1) ... [2018-11-23 12:01:52,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:52" (1/1) ... [2018-11-23 12:01:52,931 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:52" (1/1) ... [2018-11-23 12:01:52,951 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:52" (1/1) ... [2018-11-23 12:01:52,962 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:52" (1/1) ... [2018-11-23 12:01:52,964 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:52" (1/1) ... [2018-11-23 12:01:52,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:01:52,975 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:01:52,976 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:01:52,976 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:01:52,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:01:53,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:01:53,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:01:53,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:01:53,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:01:53,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:01:53,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:01:53,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:01:53,105 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:01:53,106 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:01:53,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:01:53,106 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:01:53,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:01:53,673 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:01:53,674 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 12:01:53,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:01:53 BoogieIcfgContainer [2018-11-23 12:01:53,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:01:53,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:01:53,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:01:53,679 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:01:53,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:01:52" (1/3) ... [2018-11-23 12:01:53,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71ad9eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:01:53, skipping insertion in model container [2018-11-23 12:01:53,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:52" (2/3) ... [2018-11-23 12:01:53,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71ad9eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:01:53, skipping insertion in model container [2018-11-23 12:01:53,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:01:53" (3/3) ... [2018-11-23 12:01:53,684 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copyInitSum_true-unreach-call_ground.i [2018-11-23 12:01:53,694 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:01:53,701 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:01:53,719 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:01:53,753 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:01:53,753 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:01:53,753 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:01:53,754 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:01:53,754 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:01:53,754 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:01:53,754 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:01:53,754 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:01:53,755 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:01:53,775 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-23 12:01:53,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:01:53,782 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:53,783 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:53,786 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:53,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:53,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1001985310, now seen corresponding path program 1 times [2018-11-23 12:01:53,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:53,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:53,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:53,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:01:53,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:53,973 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-23 12:01:53,977 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32#true} is VALID [2018-11-23 12:01:53,978 INFO L273 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-23 12:01:53,978 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #76#return; {32#true} is VALID [2018-11-23 12:01:53,979 INFO L256 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret7 := main(); {32#true} is VALID [2018-11-23 12:01:53,979 INFO L273 TraceCheckUtils]: 5: Hoare triple {32#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {32#true} is VALID [2018-11-23 12:01:53,980 INFO L273 TraceCheckUtils]: 6: Hoare triple {32#true} assume !true; {33#false} is VALID [2018-11-23 12:01:53,980 INFO L273 TraceCheckUtils]: 7: Hoare triple {33#false} ~i~0 := 0; {33#false} is VALID [2018-11-23 12:01:53,981 INFO L273 TraceCheckUtils]: 8: Hoare triple {33#false} assume !(~i~0 < 100000); {33#false} is VALID [2018-11-23 12:01:53,981 INFO L273 TraceCheckUtils]: 9: Hoare triple {33#false} ~i~0 := 0; {33#false} is VALID [2018-11-23 12:01:53,981 INFO L273 TraceCheckUtils]: 10: Hoare triple {33#false} assume !(~i~0 < 100000); {33#false} is VALID [2018-11-23 12:01:53,982 INFO L273 TraceCheckUtils]: 11: Hoare triple {33#false} havoc ~x~0;~x~0 := 0; {33#false} is VALID [2018-11-23 12:01:53,982 INFO L273 TraceCheckUtils]: 12: Hoare triple {33#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {33#false} is VALID [2018-11-23 12:01:53,982 INFO L256 TraceCheckUtils]: 13: Hoare triple {33#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {33#false} is VALID [2018-11-23 12:01:53,983 INFO L273 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2018-11-23 12:01:53,983 INFO L273 TraceCheckUtils]: 15: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2018-11-23 12:01:53,984 INFO L273 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-23 12:01:53,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:01:53,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:01:53,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:01:53,996 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 12:01:53,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:54,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:01:54,149 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:54,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:01:54,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:01:54,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:01:54,163 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-23 12:01:54,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:54,461 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2018-11-23 12:01:54,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:01:54,462 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 12:01:54,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:54,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:01:54,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 66 transitions. [2018-11-23 12:01:54,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:01:54,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 66 transitions. [2018-11-23 12:01:54,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 66 transitions. [2018-11-23 12:01:54,658 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:54,671 INFO L225 Difference]: With dead ends: 51 [2018-11-23 12:01:54,671 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 12:01:54,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:01:54,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 12:01:54,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 12:01:54,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:54,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-23 12:01:54,800 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 12:01:54,800 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 12:01:54,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:54,805 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-23 12:01:54,805 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 12:01:54,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:54,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:54,806 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 12:01:54,806 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 12:01:54,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:54,811 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-23 12:01:54,811 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 12:01:54,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:54,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:54,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:54,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:54,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:01:54,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-23 12:01:54,821 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2018-11-23 12:01:54,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:54,822 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-23 12:01:54,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:01:54,822 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 12:01:54,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:01:54,823 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:54,823 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:54,824 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:54,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:54,824 INFO L82 PathProgramCache]: Analyzing trace with hash -400143846, now seen corresponding path program 1 times [2018-11-23 12:01:54,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:54,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:54,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:54,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:01:54,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:54,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:54,924 INFO L256 TraceCheckUtils]: 0: Hoare triple {184#true} call ULTIMATE.init(); {184#true} is VALID [2018-11-23 12:01:54,925 INFO L273 TraceCheckUtils]: 1: Hoare triple {184#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {184#true} is VALID [2018-11-23 12:01:54,925 INFO L273 TraceCheckUtils]: 2: Hoare triple {184#true} assume true; {184#true} is VALID [2018-11-23 12:01:54,925 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {184#true} {184#true} #76#return; {184#true} is VALID [2018-11-23 12:01:54,926 INFO L256 TraceCheckUtils]: 4: Hoare triple {184#true} call #t~ret7 := main(); {184#true} is VALID [2018-11-23 12:01:54,926 INFO L273 TraceCheckUtils]: 5: Hoare triple {184#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {186#(= main_~i~0 0)} is VALID [2018-11-23 12:01:54,930 INFO L273 TraceCheckUtils]: 6: Hoare triple {186#(= main_~i~0 0)} assume !(~i~0 < 100000); {185#false} is VALID [2018-11-23 12:01:54,930 INFO L273 TraceCheckUtils]: 7: Hoare triple {185#false} ~i~0 := 0; {185#false} is VALID [2018-11-23 12:01:54,930 INFO L273 TraceCheckUtils]: 8: Hoare triple {185#false} assume !(~i~0 < 100000); {185#false} is VALID [2018-11-23 12:01:54,931 INFO L273 TraceCheckUtils]: 9: Hoare triple {185#false} ~i~0 := 0; {185#false} is VALID [2018-11-23 12:01:54,931 INFO L273 TraceCheckUtils]: 10: Hoare triple {185#false} assume !(~i~0 < 100000); {185#false} is VALID [2018-11-23 12:01:54,931 INFO L273 TraceCheckUtils]: 11: Hoare triple {185#false} havoc ~x~0;~x~0 := 0; {185#false} is VALID [2018-11-23 12:01:54,932 INFO L273 TraceCheckUtils]: 12: Hoare triple {185#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {185#false} is VALID [2018-11-23 12:01:54,932 INFO L256 TraceCheckUtils]: 13: Hoare triple {185#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {185#false} is VALID [2018-11-23 12:01:54,932 INFO L273 TraceCheckUtils]: 14: Hoare triple {185#false} ~cond := #in~cond; {185#false} is VALID [2018-11-23 12:01:54,933 INFO L273 TraceCheckUtils]: 15: Hoare triple {185#false} assume 0 == ~cond; {185#false} is VALID [2018-11-23 12:01:54,933 INFO L273 TraceCheckUtils]: 16: Hoare triple {185#false} assume !false; {185#false} is VALID [2018-11-23 12:01:54,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:01:54,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:01:54,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:01:54,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 12:01:54,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:54,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:01:55,002 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:55,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:01:55,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:01:55,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:01:55,003 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 3 states. [2018-11-23 12:01:55,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:55,215 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 12:01:55,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:01:55,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 12:01:55,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:55,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:01:55,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 12:01:55,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:01:55,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 12:01:55,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2018-11-23 12:01:55,651 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:01:55,653 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:01:55,653 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:01:55,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:01:55,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:01:55,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-23 12:01:55,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:55,679 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 27 states. [2018-11-23 12:01:55,679 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 27 states. [2018-11-23 12:01:55,679 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 27 states. [2018-11-23 12:01:55,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:55,683 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-23 12:01:55,683 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 12:01:55,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:55,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:55,684 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 29 states. [2018-11-23 12:01:55,684 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 29 states. [2018-11-23 12:01:55,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:55,688 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-23 12:01:55,689 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 12:01:55,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:55,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:55,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:55,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:55,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:01:55,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-23 12:01:55,692 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 17 [2018-11-23 12:01:55,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:55,693 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-23 12:01:55,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:01:55,693 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 12:01:55,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:01:55,694 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:55,694 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] [2018-11-23 12:01:55,694 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:55,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:55,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1150570790, now seen corresponding path program 1 times [2018-11-23 12:01:55,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:55,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:55,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:55,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:01:55,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:55,847 INFO L256 TraceCheckUtils]: 0: Hoare triple {351#true} call ULTIMATE.init(); {351#true} is VALID [2018-11-23 12:01:55,847 INFO L273 TraceCheckUtils]: 1: Hoare triple {351#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {351#true} is VALID [2018-11-23 12:01:55,848 INFO L273 TraceCheckUtils]: 2: Hoare triple {351#true} assume true; {351#true} is VALID [2018-11-23 12:01:55,848 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {351#true} {351#true} #76#return; {351#true} is VALID [2018-11-23 12:01:55,848 INFO L256 TraceCheckUtils]: 4: Hoare triple {351#true} call #t~ret7 := main(); {351#true} is VALID [2018-11-23 12:01:55,849 INFO L273 TraceCheckUtils]: 5: Hoare triple {351#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {353#(= main_~i~0 0)} is VALID [2018-11-23 12:01:55,850 INFO L273 TraceCheckUtils]: 6: Hoare triple {353#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {354#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:55,851 INFO L273 TraceCheckUtils]: 7: Hoare triple {354#(<= main_~i~0 1)} assume !(~i~0 < 100000); {352#false} is VALID [2018-11-23 12:01:55,851 INFO L273 TraceCheckUtils]: 8: Hoare triple {352#false} ~i~0 := 0; {352#false} is VALID [2018-11-23 12:01:55,851 INFO L273 TraceCheckUtils]: 9: Hoare triple {352#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {352#false} is VALID [2018-11-23 12:01:55,852 INFO L273 TraceCheckUtils]: 10: Hoare triple {352#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {352#false} is VALID [2018-11-23 12:01:55,852 INFO L273 TraceCheckUtils]: 11: Hoare triple {352#false} assume !(~i~0 < 100000); {352#false} is VALID [2018-11-23 12:01:55,852 INFO L273 TraceCheckUtils]: 12: Hoare triple {352#false} ~i~0 := 0; {352#false} is VALID [2018-11-23 12:01:55,852 INFO L273 TraceCheckUtils]: 13: Hoare triple {352#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {352#false} is VALID [2018-11-23 12:01:55,853 INFO L273 TraceCheckUtils]: 14: Hoare triple {352#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {352#false} is VALID [2018-11-23 12:01:55,853 INFO L273 TraceCheckUtils]: 15: Hoare triple {352#false} assume !(~i~0 < 100000); {352#false} is VALID [2018-11-23 12:01:55,854 INFO L273 TraceCheckUtils]: 16: Hoare triple {352#false} havoc ~x~0;~x~0 := 0; {352#false} is VALID [2018-11-23 12:01:55,854 INFO L273 TraceCheckUtils]: 17: Hoare triple {352#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {352#false} is VALID [2018-11-23 12:01:55,854 INFO L256 TraceCheckUtils]: 18: Hoare triple {352#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {352#false} is VALID [2018-11-23 12:01:55,855 INFO L273 TraceCheckUtils]: 19: Hoare triple {352#false} ~cond := #in~cond; {352#false} is VALID [2018-11-23 12:01:55,855 INFO L273 TraceCheckUtils]: 20: Hoare triple {352#false} assume 0 == ~cond; {352#false} is VALID [2018-11-23 12:01:55,855 INFO L273 TraceCheckUtils]: 21: Hoare triple {352#false} assume !false; {352#false} is VALID [2018-11-23 12:01:55,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 12:01:55,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:55,857 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:55,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:01:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:55,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:56,270 INFO L256 TraceCheckUtils]: 0: Hoare triple {351#true} call ULTIMATE.init(); {351#true} is VALID [2018-11-23 12:01:56,270 INFO L273 TraceCheckUtils]: 1: Hoare triple {351#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {351#true} is VALID [2018-11-23 12:01:56,271 INFO L273 TraceCheckUtils]: 2: Hoare triple {351#true} assume true; {351#true} is VALID [2018-11-23 12:01:56,271 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {351#true} {351#true} #76#return; {351#true} is VALID [2018-11-23 12:01:56,271 INFO L256 TraceCheckUtils]: 4: Hoare triple {351#true} call #t~ret7 := main(); {351#true} is VALID [2018-11-23 12:01:56,274 INFO L273 TraceCheckUtils]: 5: Hoare triple {351#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {373#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:56,294 INFO L273 TraceCheckUtils]: 6: Hoare triple {373#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {354#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:56,311 INFO L273 TraceCheckUtils]: 7: Hoare triple {354#(<= main_~i~0 1)} assume !(~i~0 < 100000); {352#false} is VALID [2018-11-23 12:01:56,312 INFO L273 TraceCheckUtils]: 8: Hoare triple {352#false} ~i~0 := 0; {352#false} is VALID [2018-11-23 12:01:56,312 INFO L273 TraceCheckUtils]: 9: Hoare triple {352#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {352#false} is VALID [2018-11-23 12:01:56,312 INFO L273 TraceCheckUtils]: 10: Hoare triple {352#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {352#false} is VALID [2018-11-23 12:01:56,313 INFO L273 TraceCheckUtils]: 11: Hoare triple {352#false} assume !(~i~0 < 100000); {352#false} is VALID [2018-11-23 12:01:56,313 INFO L273 TraceCheckUtils]: 12: Hoare triple {352#false} ~i~0 := 0; {352#false} is VALID [2018-11-23 12:01:56,313 INFO L273 TraceCheckUtils]: 13: Hoare triple {352#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {352#false} is VALID [2018-11-23 12:01:56,313 INFO L273 TraceCheckUtils]: 14: Hoare triple {352#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {352#false} is VALID [2018-11-23 12:01:56,314 INFO L273 TraceCheckUtils]: 15: Hoare triple {352#false} assume !(~i~0 < 100000); {352#false} is VALID [2018-11-23 12:01:56,314 INFO L273 TraceCheckUtils]: 16: Hoare triple {352#false} havoc ~x~0;~x~0 := 0; {352#false} is VALID [2018-11-23 12:01:56,314 INFO L273 TraceCheckUtils]: 17: Hoare triple {352#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {352#false} is VALID [2018-11-23 12:01:56,315 INFO L256 TraceCheckUtils]: 18: Hoare triple {352#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {352#false} is VALID [2018-11-23 12:01:56,315 INFO L273 TraceCheckUtils]: 19: Hoare triple {352#false} ~cond := #in~cond; {352#false} is VALID [2018-11-23 12:01:56,315 INFO L273 TraceCheckUtils]: 20: Hoare triple {352#false} assume 0 == ~cond; {352#false} is VALID [2018-11-23 12:01:56,316 INFO L273 TraceCheckUtils]: 21: Hoare triple {352#false} assume !false; {352#false} is VALID [2018-11-23 12:01:56,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 12:01:56,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:56,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:01:56,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-23 12:01:56,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:56,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:01:56,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:56,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:01:56,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:01:56,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:01:56,388 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 5 states. [2018-11-23 12:01:56,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:56,696 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2018-11-23 12:01:56,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:01:56,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-23 12:01:56,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:56,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:01:56,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2018-11-23 12:01:56,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:01:56,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2018-11-23 12:01:56,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 59 transitions. [2018-11-23 12:01:56,884 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:56,886 INFO L225 Difference]: With dead ends: 53 [2018-11-23 12:01:56,887 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:01:56,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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 12:01:56,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:01:56,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-23 12:01:56,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:56,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2018-11-23 12:01:56,914 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2018-11-23 12:01:56,914 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2018-11-23 12:01:56,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:56,919 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-23 12:01:56,919 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-23 12:01:56,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:56,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:56,920 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2018-11-23 12:01:56,920 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2018-11-23 12:01:56,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:56,923 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-23 12:01:56,923 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-23 12:01:56,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:56,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:56,924 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:56,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:56,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:01:56,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-11-23 12:01:56,927 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 22 [2018-11-23 12:01:56,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:56,927 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-11-23 12:01:56,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:01:56,928 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-23 12:01:56,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:01:56,929 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:56,929 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:56,929 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:56,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:56,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1868122094, now seen corresponding path program 2 times [2018-11-23 12:01:56,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:56,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:56,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:56,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:01:56,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:57,096 INFO L256 TraceCheckUtils]: 0: Hoare triple {613#true} call ULTIMATE.init(); {613#true} is VALID [2018-11-23 12:01:57,097 INFO L273 TraceCheckUtils]: 1: Hoare triple {613#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {613#true} is VALID [2018-11-23 12:01:57,097 INFO L273 TraceCheckUtils]: 2: Hoare triple {613#true} assume true; {613#true} is VALID [2018-11-23 12:01:57,098 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {613#true} {613#true} #76#return; {613#true} is VALID [2018-11-23 12:01:57,098 INFO L256 TraceCheckUtils]: 4: Hoare triple {613#true} call #t~ret7 := main(); {613#true} is VALID [2018-11-23 12:01:57,099 INFO L273 TraceCheckUtils]: 5: Hoare triple {613#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {615#(= main_~i~0 0)} is VALID [2018-11-23 12:01:57,101 INFO L273 TraceCheckUtils]: 6: Hoare triple {615#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {616#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:57,102 INFO L273 TraceCheckUtils]: 7: Hoare triple {616#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {617#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:57,102 INFO L273 TraceCheckUtils]: 8: Hoare triple {617#(<= main_~i~0 2)} assume !(~i~0 < 100000); {614#false} is VALID [2018-11-23 12:01:57,103 INFO L273 TraceCheckUtils]: 9: Hoare triple {614#false} ~i~0 := 0; {614#false} is VALID [2018-11-23 12:01:57,103 INFO L273 TraceCheckUtils]: 10: Hoare triple {614#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {614#false} is VALID [2018-11-23 12:01:57,103 INFO L273 TraceCheckUtils]: 11: Hoare triple {614#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {614#false} is VALID [2018-11-23 12:01:57,104 INFO L273 TraceCheckUtils]: 12: Hoare triple {614#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {614#false} is VALID [2018-11-23 12:01:57,104 INFO L273 TraceCheckUtils]: 13: Hoare triple {614#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {614#false} is VALID [2018-11-23 12:01:57,104 INFO L273 TraceCheckUtils]: 14: Hoare triple {614#false} assume !(~i~0 < 100000); {614#false} is VALID [2018-11-23 12:01:57,105 INFO L273 TraceCheckUtils]: 15: Hoare triple {614#false} ~i~0 := 0; {614#false} is VALID [2018-11-23 12:01:57,105 INFO L273 TraceCheckUtils]: 16: Hoare triple {614#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {614#false} is VALID [2018-11-23 12:01:57,106 INFO L273 TraceCheckUtils]: 17: Hoare triple {614#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {614#false} is VALID [2018-11-23 12:01:57,106 INFO L273 TraceCheckUtils]: 18: Hoare triple {614#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {614#false} is VALID [2018-11-23 12:01:57,106 INFO L273 TraceCheckUtils]: 19: Hoare triple {614#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {614#false} is VALID [2018-11-23 12:01:57,106 INFO L273 TraceCheckUtils]: 20: Hoare triple {614#false} assume !(~i~0 < 100000); {614#false} is VALID [2018-11-23 12:01:57,106 INFO L273 TraceCheckUtils]: 21: Hoare triple {614#false} havoc ~x~0;~x~0 := 0; {614#false} is VALID [2018-11-23 12:01:57,107 INFO L273 TraceCheckUtils]: 22: Hoare triple {614#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {614#false} is VALID [2018-11-23 12:01:57,107 INFO L256 TraceCheckUtils]: 23: Hoare triple {614#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {614#false} is VALID [2018-11-23 12:01:57,107 INFO L273 TraceCheckUtils]: 24: Hoare triple {614#false} ~cond := #in~cond; {614#false} is VALID [2018-11-23 12:01:57,107 INFO L273 TraceCheckUtils]: 25: Hoare triple {614#false} assume 0 == ~cond; {614#false} is VALID [2018-11-23 12:01:57,108 INFO L273 TraceCheckUtils]: 26: Hoare triple {614#false} assume !false; {614#false} is VALID [2018-11-23 12:01:57,109 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 12:01:57,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:57,109 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:57,119 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:01:57,141 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:01:57,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:57,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:57,300 INFO L256 TraceCheckUtils]: 0: Hoare triple {613#true} call ULTIMATE.init(); {613#true} is VALID [2018-11-23 12:01:57,301 INFO L273 TraceCheckUtils]: 1: Hoare triple {613#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {613#true} is VALID [2018-11-23 12:01:57,301 INFO L273 TraceCheckUtils]: 2: Hoare triple {613#true} assume true; {613#true} is VALID [2018-11-23 12:01:57,301 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {613#true} {613#true} #76#return; {613#true} is VALID [2018-11-23 12:01:57,301 INFO L256 TraceCheckUtils]: 4: Hoare triple {613#true} call #t~ret7 := main(); {613#true} is VALID [2018-11-23 12:01:57,302 INFO L273 TraceCheckUtils]: 5: Hoare triple {613#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {613#true} is VALID [2018-11-23 12:01:57,302 INFO L273 TraceCheckUtils]: 6: Hoare triple {613#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {613#true} is VALID [2018-11-23 12:01:57,302 INFO L273 TraceCheckUtils]: 7: Hoare triple {613#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {613#true} is VALID [2018-11-23 12:01:57,302 INFO L273 TraceCheckUtils]: 8: Hoare triple {613#true} assume !(~i~0 < 100000); {613#true} is VALID [2018-11-23 12:01:57,303 INFO L273 TraceCheckUtils]: 9: Hoare triple {613#true} ~i~0 := 0; {613#true} is VALID [2018-11-23 12:01:57,303 INFO L273 TraceCheckUtils]: 10: Hoare triple {613#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {613#true} is VALID [2018-11-23 12:01:57,303 INFO L273 TraceCheckUtils]: 11: Hoare triple {613#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {613#true} is VALID [2018-11-23 12:01:57,304 INFO L273 TraceCheckUtils]: 12: Hoare triple {613#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {613#true} is VALID [2018-11-23 12:01:57,304 INFO L273 TraceCheckUtils]: 13: Hoare triple {613#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {613#true} is VALID [2018-11-23 12:01:57,304 INFO L273 TraceCheckUtils]: 14: Hoare triple {613#true} assume !(~i~0 < 100000); {613#true} is VALID [2018-11-23 12:01:57,309 INFO L273 TraceCheckUtils]: 15: Hoare triple {613#true} ~i~0 := 0; {666#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:57,324 INFO L273 TraceCheckUtils]: 16: Hoare triple {666#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {666#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:57,326 INFO L273 TraceCheckUtils]: 17: Hoare triple {666#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {616#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:57,326 INFO L273 TraceCheckUtils]: 18: Hoare triple {616#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {616#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:57,328 INFO L273 TraceCheckUtils]: 19: Hoare triple {616#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {617#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:57,330 INFO L273 TraceCheckUtils]: 20: Hoare triple {617#(<= main_~i~0 2)} assume !(~i~0 < 100000); {614#false} is VALID [2018-11-23 12:01:57,331 INFO L273 TraceCheckUtils]: 21: Hoare triple {614#false} havoc ~x~0;~x~0 := 0; {614#false} is VALID [2018-11-23 12:01:57,332 INFO L273 TraceCheckUtils]: 22: Hoare triple {614#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {614#false} is VALID [2018-11-23 12:01:57,332 INFO L256 TraceCheckUtils]: 23: Hoare triple {614#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {614#false} is VALID [2018-11-23 12:01:57,333 INFO L273 TraceCheckUtils]: 24: Hoare triple {614#false} ~cond := #in~cond; {614#false} is VALID [2018-11-23 12:01:57,333 INFO L273 TraceCheckUtils]: 25: Hoare triple {614#false} assume 0 == ~cond; {614#false} is VALID [2018-11-23 12:01:57,333 INFO L273 TraceCheckUtils]: 26: Hoare triple {614#false} assume !false; {614#false} is VALID [2018-11-23 12:01:57,335 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 12:01:57,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:57,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:01:57,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-23 12:01:57,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:57,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:01:57,413 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:57,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:01:57,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:01:57,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:01:57,414 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 6 states. [2018-11-23 12:01:57,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:57,744 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-23 12:01:57,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:01:57,744 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-23 12:01:57,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:57,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:01:57,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2018-11-23 12:01:57,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:01:57,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2018-11-23 12:01:57,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2018-11-23 12:01:57,843 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:57,846 INFO L225 Difference]: With dead ends: 62 [2018-11-23 12:01:57,846 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:01:57,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:01:57,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:01:57,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-23 12:01:57,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:57,871 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2018-11-23 12:01:57,871 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2018-11-23 12:01:57,871 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2018-11-23 12:01:57,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:57,873 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-23 12:01:57,874 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-23 12:01:57,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:57,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:57,875 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2018-11-23 12:01:57,875 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2018-11-23 12:01:57,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:57,877 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-23 12:01:57,878 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-23 12:01:57,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:57,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:57,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:57,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:57,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:01:57,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-11-23 12:01:57,881 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 27 [2018-11-23 12:01:57,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:57,882 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-11-23 12:01:57,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:01:57,882 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-23 12:01:57,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:01:57,883 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:57,883 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:57,883 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:57,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:57,884 INFO L82 PathProgramCache]: Analyzing trace with hash 150752210, now seen corresponding path program 3 times [2018-11-23 12:01:57,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:57,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:57,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:57,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:57,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:58,037 INFO L256 TraceCheckUtils]: 0: Hoare triple {923#true} call ULTIMATE.init(); {923#true} is VALID [2018-11-23 12:01:58,037 INFO L273 TraceCheckUtils]: 1: Hoare triple {923#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {923#true} is VALID [2018-11-23 12:01:58,038 INFO L273 TraceCheckUtils]: 2: Hoare triple {923#true} assume true; {923#true} is VALID [2018-11-23 12:01:58,038 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {923#true} {923#true} #76#return; {923#true} is VALID [2018-11-23 12:01:58,038 INFO L256 TraceCheckUtils]: 4: Hoare triple {923#true} call #t~ret7 := main(); {923#true} is VALID [2018-11-23 12:01:58,038 INFO L273 TraceCheckUtils]: 5: Hoare triple {923#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {925#(= main_~i~0 0)} is VALID [2018-11-23 12:01:58,039 INFO L273 TraceCheckUtils]: 6: Hoare triple {925#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {926#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:58,040 INFO L273 TraceCheckUtils]: 7: Hoare triple {926#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {927#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:58,041 INFO L273 TraceCheckUtils]: 8: Hoare triple {927#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {928#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:58,041 INFO L273 TraceCheckUtils]: 9: Hoare triple {928#(<= main_~i~0 3)} assume !(~i~0 < 100000); {924#false} is VALID [2018-11-23 12:01:58,042 INFO L273 TraceCheckUtils]: 10: Hoare triple {924#false} ~i~0 := 0; {924#false} is VALID [2018-11-23 12:01:58,042 INFO L273 TraceCheckUtils]: 11: Hoare triple {924#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {924#false} is VALID [2018-11-23 12:01:58,042 INFO L273 TraceCheckUtils]: 12: Hoare triple {924#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {924#false} is VALID [2018-11-23 12:01:58,043 INFO L273 TraceCheckUtils]: 13: Hoare triple {924#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {924#false} is VALID [2018-11-23 12:01:58,043 INFO L273 TraceCheckUtils]: 14: Hoare triple {924#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {924#false} is VALID [2018-11-23 12:01:58,043 INFO L273 TraceCheckUtils]: 15: Hoare triple {924#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {924#false} is VALID [2018-11-23 12:01:58,044 INFO L273 TraceCheckUtils]: 16: Hoare triple {924#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {924#false} is VALID [2018-11-23 12:01:58,044 INFO L273 TraceCheckUtils]: 17: Hoare triple {924#false} assume !(~i~0 < 100000); {924#false} is VALID [2018-11-23 12:01:58,044 INFO L273 TraceCheckUtils]: 18: Hoare triple {924#false} ~i~0 := 0; {924#false} is VALID [2018-11-23 12:01:58,044 INFO L273 TraceCheckUtils]: 19: Hoare triple {924#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {924#false} is VALID [2018-11-23 12:01:58,044 INFO L273 TraceCheckUtils]: 20: Hoare triple {924#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {924#false} is VALID [2018-11-23 12:01:58,045 INFO L273 TraceCheckUtils]: 21: Hoare triple {924#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {924#false} is VALID [2018-11-23 12:01:58,045 INFO L273 TraceCheckUtils]: 22: Hoare triple {924#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {924#false} is VALID [2018-11-23 12:01:58,045 INFO L273 TraceCheckUtils]: 23: Hoare triple {924#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {924#false} is VALID [2018-11-23 12:01:58,045 INFO L273 TraceCheckUtils]: 24: Hoare triple {924#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {924#false} is VALID [2018-11-23 12:01:58,045 INFO L273 TraceCheckUtils]: 25: Hoare triple {924#false} assume !(~i~0 < 100000); {924#false} is VALID [2018-11-23 12:01:58,046 INFO L273 TraceCheckUtils]: 26: Hoare triple {924#false} havoc ~x~0;~x~0 := 0; {924#false} is VALID [2018-11-23 12:01:58,046 INFO L273 TraceCheckUtils]: 27: Hoare triple {924#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {924#false} is VALID [2018-11-23 12:01:58,046 INFO L256 TraceCheckUtils]: 28: Hoare triple {924#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {924#false} is VALID [2018-11-23 12:01:58,046 INFO L273 TraceCheckUtils]: 29: Hoare triple {924#false} ~cond := #in~cond; {924#false} is VALID [2018-11-23 12:01:58,046 INFO L273 TraceCheckUtils]: 30: Hoare triple {924#false} assume 0 == ~cond; {924#false} is VALID [2018-11-23 12:01:58,047 INFO L273 TraceCheckUtils]: 31: Hoare triple {924#false} assume !false; {924#false} is VALID [2018-11-23 12:01:58,048 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 12:01:58,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:58,049 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:58,060 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:01:58,084 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 12:01:58,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:58,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:58,224 INFO L256 TraceCheckUtils]: 0: Hoare triple {923#true} call ULTIMATE.init(); {923#true} is VALID [2018-11-23 12:01:58,224 INFO L273 TraceCheckUtils]: 1: Hoare triple {923#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {923#true} is VALID [2018-11-23 12:01:58,225 INFO L273 TraceCheckUtils]: 2: Hoare triple {923#true} assume true; {923#true} is VALID [2018-11-23 12:01:58,225 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {923#true} {923#true} #76#return; {923#true} is VALID [2018-11-23 12:01:58,226 INFO L256 TraceCheckUtils]: 4: Hoare triple {923#true} call #t~ret7 := main(); {923#true} is VALID [2018-11-23 12:01:58,229 INFO L273 TraceCheckUtils]: 5: Hoare triple {923#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {947#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:58,234 INFO L273 TraceCheckUtils]: 6: Hoare triple {947#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {926#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:58,235 INFO L273 TraceCheckUtils]: 7: Hoare triple {926#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {927#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:58,236 INFO L273 TraceCheckUtils]: 8: Hoare triple {927#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {928#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:58,236 INFO L273 TraceCheckUtils]: 9: Hoare triple {928#(<= main_~i~0 3)} assume !(~i~0 < 100000); {924#false} is VALID [2018-11-23 12:01:58,236 INFO L273 TraceCheckUtils]: 10: Hoare triple {924#false} ~i~0 := 0; {924#false} is VALID [2018-11-23 12:01:58,237 INFO L273 TraceCheckUtils]: 11: Hoare triple {924#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {924#false} is VALID [2018-11-23 12:01:58,237 INFO L273 TraceCheckUtils]: 12: Hoare triple {924#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {924#false} is VALID [2018-11-23 12:01:58,237 INFO L273 TraceCheckUtils]: 13: Hoare triple {924#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {924#false} is VALID [2018-11-23 12:01:58,237 INFO L273 TraceCheckUtils]: 14: Hoare triple {924#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {924#false} is VALID [2018-11-23 12:01:58,237 INFO L273 TraceCheckUtils]: 15: Hoare triple {924#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {924#false} is VALID [2018-11-23 12:01:58,238 INFO L273 TraceCheckUtils]: 16: Hoare triple {924#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {924#false} is VALID [2018-11-23 12:01:58,238 INFO L273 TraceCheckUtils]: 17: Hoare triple {924#false} assume !(~i~0 < 100000); {924#false} is VALID [2018-11-23 12:01:58,238 INFO L273 TraceCheckUtils]: 18: Hoare triple {924#false} ~i~0 := 0; {924#false} is VALID [2018-11-23 12:01:58,239 INFO L273 TraceCheckUtils]: 19: Hoare triple {924#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {924#false} is VALID [2018-11-23 12:01:58,239 INFO L273 TraceCheckUtils]: 20: Hoare triple {924#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {924#false} is VALID [2018-11-23 12:01:58,239 INFO L273 TraceCheckUtils]: 21: Hoare triple {924#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {924#false} is VALID [2018-11-23 12:01:58,240 INFO L273 TraceCheckUtils]: 22: Hoare triple {924#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {924#false} is VALID [2018-11-23 12:01:58,240 INFO L273 TraceCheckUtils]: 23: Hoare triple {924#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {924#false} is VALID [2018-11-23 12:01:58,240 INFO L273 TraceCheckUtils]: 24: Hoare triple {924#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {924#false} is VALID [2018-11-23 12:01:58,240 INFO L273 TraceCheckUtils]: 25: Hoare triple {924#false} assume !(~i~0 < 100000); {924#false} is VALID [2018-11-23 12:01:58,241 INFO L273 TraceCheckUtils]: 26: Hoare triple {924#false} havoc ~x~0;~x~0 := 0; {924#false} is VALID [2018-11-23 12:01:58,241 INFO L273 TraceCheckUtils]: 27: Hoare triple {924#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {924#false} is VALID [2018-11-23 12:01:58,241 INFO L256 TraceCheckUtils]: 28: Hoare triple {924#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {924#false} is VALID [2018-11-23 12:01:58,241 INFO L273 TraceCheckUtils]: 29: Hoare triple {924#false} ~cond := #in~cond; {924#false} is VALID [2018-11-23 12:01:58,242 INFO L273 TraceCheckUtils]: 30: Hoare triple {924#false} assume 0 == ~cond; {924#false} is VALID [2018-11-23 12:01:58,242 INFO L273 TraceCheckUtils]: 31: Hoare triple {924#false} assume !false; {924#false} is VALID [2018-11-23 12:01:58,244 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 12:01:58,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:58,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 12:01:58,269 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-11-23 12:01:58,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:58,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:01:58,298 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:58,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:01:58,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:01:58,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:01:58,300 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 7 states. [2018-11-23 12:01:58,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:58,586 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-11-23 12:01:58,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:01:58,586 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-11-23 12:01:58,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:58,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:01:58,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2018-11-23 12:01:58,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:01:58,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2018-11-23 12:01:58,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2018-11-23 12:01:58,698 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 12:01:58,700 INFO L225 Difference]: With dead ends: 71 [2018-11-23 12:01:58,701 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:01:58,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:01:58,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:01:58,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-11-23 12:01:58,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:58,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2018-11-23 12:01:58,754 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2018-11-23 12:01:58,754 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2018-11-23 12:01:58,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:58,757 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-11-23 12:01:58,757 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-11-23 12:01:58,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:58,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:58,758 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2018-11-23 12:01:58,758 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2018-11-23 12:01:58,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:58,761 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-11-23 12:01:58,761 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-11-23 12:01:58,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:58,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:58,762 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:58,762 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:58,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:01:58,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-11-23 12:01:58,764 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 32 [2018-11-23 12:01:58,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:58,765 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-11-23 12:01:58,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:01:58,765 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-11-23 12:01:58,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 12:01:58,766 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:58,766 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:58,767 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:58,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:58,767 INFO L82 PathProgramCache]: Analyzing trace with hash -125121014, now seen corresponding path program 4 times [2018-11-23 12:01:58,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:58,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:58,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:58,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:58,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:58,959 INFO L256 TraceCheckUtils]: 0: Hoare triple {1281#true} call ULTIMATE.init(); {1281#true} is VALID [2018-11-23 12:01:58,959 INFO L273 TraceCheckUtils]: 1: Hoare triple {1281#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1281#true} is VALID [2018-11-23 12:01:58,960 INFO L273 TraceCheckUtils]: 2: Hoare triple {1281#true} assume true; {1281#true} is VALID [2018-11-23 12:01:58,960 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1281#true} {1281#true} #76#return; {1281#true} is VALID [2018-11-23 12:01:58,961 INFO L256 TraceCheckUtils]: 4: Hoare triple {1281#true} call #t~ret7 := main(); {1281#true} is VALID [2018-11-23 12:01:58,970 INFO L273 TraceCheckUtils]: 5: Hoare triple {1281#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {1283#(= main_~i~0 0)} is VALID [2018-11-23 12:01:58,984 INFO L273 TraceCheckUtils]: 6: Hoare triple {1283#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1284#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:58,993 INFO L273 TraceCheckUtils]: 7: Hoare triple {1284#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1285#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:59,009 INFO L273 TraceCheckUtils]: 8: Hoare triple {1285#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1286#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:59,010 INFO L273 TraceCheckUtils]: 9: Hoare triple {1286#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1287#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:59,012 INFO L273 TraceCheckUtils]: 10: Hoare triple {1287#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1282#false} is VALID [2018-11-23 12:01:59,012 INFO L273 TraceCheckUtils]: 11: Hoare triple {1282#false} ~i~0 := 0; {1282#false} is VALID [2018-11-23 12:01:59,012 INFO L273 TraceCheckUtils]: 12: Hoare triple {1282#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {1282#false} is VALID [2018-11-23 12:01:59,012 INFO L273 TraceCheckUtils]: 13: Hoare triple {1282#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1282#false} is VALID [2018-11-23 12:01:59,013 INFO L273 TraceCheckUtils]: 14: Hoare triple {1282#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {1282#false} is VALID [2018-11-23 12:01:59,013 INFO L273 TraceCheckUtils]: 15: Hoare triple {1282#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1282#false} is VALID [2018-11-23 12:01:59,013 INFO L273 TraceCheckUtils]: 16: Hoare triple {1282#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {1282#false} is VALID [2018-11-23 12:01:59,013 INFO L273 TraceCheckUtils]: 17: Hoare triple {1282#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1282#false} is VALID [2018-11-23 12:01:59,014 INFO L273 TraceCheckUtils]: 18: Hoare triple {1282#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {1282#false} is VALID [2018-11-23 12:01:59,014 INFO L273 TraceCheckUtils]: 19: Hoare triple {1282#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1282#false} is VALID [2018-11-23 12:01:59,014 INFO L273 TraceCheckUtils]: 20: Hoare triple {1282#false} assume !(~i~0 < 100000); {1282#false} is VALID [2018-11-23 12:01:59,014 INFO L273 TraceCheckUtils]: 21: Hoare triple {1282#false} ~i~0 := 0; {1282#false} is VALID [2018-11-23 12:01:59,015 INFO L273 TraceCheckUtils]: 22: Hoare triple {1282#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1282#false} is VALID [2018-11-23 12:01:59,015 INFO L273 TraceCheckUtils]: 23: Hoare triple {1282#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1282#false} is VALID [2018-11-23 12:01:59,015 INFO L273 TraceCheckUtils]: 24: Hoare triple {1282#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1282#false} is VALID [2018-11-23 12:01:59,015 INFO L273 TraceCheckUtils]: 25: Hoare triple {1282#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1282#false} is VALID [2018-11-23 12:01:59,016 INFO L273 TraceCheckUtils]: 26: Hoare triple {1282#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1282#false} is VALID [2018-11-23 12:01:59,016 INFO L273 TraceCheckUtils]: 27: Hoare triple {1282#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1282#false} is VALID [2018-11-23 12:01:59,016 INFO L273 TraceCheckUtils]: 28: Hoare triple {1282#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1282#false} is VALID [2018-11-23 12:01:59,016 INFO L273 TraceCheckUtils]: 29: Hoare triple {1282#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1282#false} is VALID [2018-11-23 12:01:59,017 INFO L273 TraceCheckUtils]: 30: Hoare triple {1282#false} assume !(~i~0 < 100000); {1282#false} is VALID [2018-11-23 12:01:59,017 INFO L273 TraceCheckUtils]: 31: Hoare triple {1282#false} havoc ~x~0;~x~0 := 0; {1282#false} is VALID [2018-11-23 12:01:59,017 INFO L273 TraceCheckUtils]: 32: Hoare triple {1282#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1282#false} is VALID [2018-11-23 12:01:59,017 INFO L256 TraceCheckUtils]: 33: Hoare triple {1282#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {1282#false} is VALID [2018-11-23 12:01:59,018 INFO L273 TraceCheckUtils]: 34: Hoare triple {1282#false} ~cond := #in~cond; {1282#false} is VALID [2018-11-23 12:01:59,018 INFO L273 TraceCheckUtils]: 35: Hoare triple {1282#false} assume 0 == ~cond; {1282#false} is VALID [2018-11-23 12:01:59,018 INFO L273 TraceCheckUtils]: 36: Hoare triple {1282#false} assume !false; {1282#false} is VALID [2018-11-23 12:01:59,020 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-23 12:01:59,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:59,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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:59,030 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:01:59,084 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:01:59,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:59,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:59,303 INFO L256 TraceCheckUtils]: 0: Hoare triple {1281#true} call ULTIMATE.init(); {1281#true} is VALID [2018-11-23 12:01:59,304 INFO L273 TraceCheckUtils]: 1: Hoare triple {1281#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1281#true} is VALID [2018-11-23 12:01:59,304 INFO L273 TraceCheckUtils]: 2: Hoare triple {1281#true} assume true; {1281#true} is VALID [2018-11-23 12:01:59,304 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1281#true} {1281#true} #76#return; {1281#true} is VALID [2018-11-23 12:01:59,305 INFO L256 TraceCheckUtils]: 4: Hoare triple {1281#true} call #t~ret7 := main(); {1281#true} is VALID [2018-11-23 12:01:59,305 INFO L273 TraceCheckUtils]: 5: Hoare triple {1281#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {1281#true} is VALID [2018-11-23 12:01:59,305 INFO L273 TraceCheckUtils]: 6: Hoare triple {1281#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1281#true} is VALID [2018-11-23 12:01:59,306 INFO L273 TraceCheckUtils]: 7: Hoare triple {1281#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1281#true} is VALID [2018-11-23 12:01:59,306 INFO L273 TraceCheckUtils]: 8: Hoare triple {1281#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1281#true} is VALID [2018-11-23 12:01:59,306 INFO L273 TraceCheckUtils]: 9: Hoare triple {1281#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1281#true} is VALID [2018-11-23 12:01:59,306 INFO L273 TraceCheckUtils]: 10: Hoare triple {1281#true} assume !(~i~0 < 100000); {1281#true} is VALID [2018-11-23 12:01:59,307 INFO L273 TraceCheckUtils]: 11: Hoare triple {1281#true} ~i~0 := 0; {1324#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:59,307 INFO L273 TraceCheckUtils]: 12: Hoare triple {1324#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {1324#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:59,308 INFO L273 TraceCheckUtils]: 13: Hoare triple {1324#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1284#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:59,308 INFO L273 TraceCheckUtils]: 14: Hoare triple {1284#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {1284#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:59,309 INFO L273 TraceCheckUtils]: 15: Hoare triple {1284#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1285#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:59,311 INFO L273 TraceCheckUtils]: 16: Hoare triple {1285#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {1285#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:59,312 INFO L273 TraceCheckUtils]: 17: Hoare triple {1285#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1286#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:59,313 INFO L273 TraceCheckUtils]: 18: Hoare triple {1286#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {1286#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:59,314 INFO L273 TraceCheckUtils]: 19: Hoare triple {1286#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1287#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:59,319 INFO L273 TraceCheckUtils]: 20: Hoare triple {1287#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1282#false} is VALID [2018-11-23 12:01:59,319 INFO L273 TraceCheckUtils]: 21: Hoare triple {1282#false} ~i~0 := 0; {1282#false} is VALID [2018-11-23 12:01:59,320 INFO L273 TraceCheckUtils]: 22: Hoare triple {1282#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1282#false} is VALID [2018-11-23 12:01:59,320 INFO L273 TraceCheckUtils]: 23: Hoare triple {1282#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1282#false} is VALID [2018-11-23 12:01:59,320 INFO L273 TraceCheckUtils]: 24: Hoare triple {1282#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1282#false} is VALID [2018-11-23 12:01:59,321 INFO L273 TraceCheckUtils]: 25: Hoare triple {1282#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1282#false} is VALID [2018-11-23 12:01:59,321 INFO L273 TraceCheckUtils]: 26: Hoare triple {1282#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1282#false} is VALID [2018-11-23 12:01:59,321 INFO L273 TraceCheckUtils]: 27: Hoare triple {1282#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1282#false} is VALID [2018-11-23 12:01:59,321 INFO L273 TraceCheckUtils]: 28: Hoare triple {1282#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1282#false} is VALID [2018-11-23 12:01:59,322 INFO L273 TraceCheckUtils]: 29: Hoare triple {1282#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1282#false} is VALID [2018-11-23 12:01:59,322 INFO L273 TraceCheckUtils]: 30: Hoare triple {1282#false} assume !(~i~0 < 100000); {1282#false} is VALID [2018-11-23 12:01:59,322 INFO L273 TraceCheckUtils]: 31: Hoare triple {1282#false} havoc ~x~0;~x~0 := 0; {1282#false} is VALID [2018-11-23 12:01:59,322 INFO L273 TraceCheckUtils]: 32: Hoare triple {1282#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1282#false} is VALID [2018-11-23 12:01:59,323 INFO L256 TraceCheckUtils]: 33: Hoare triple {1282#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {1282#false} is VALID [2018-11-23 12:01:59,323 INFO L273 TraceCheckUtils]: 34: Hoare triple {1282#false} ~cond := #in~cond; {1282#false} is VALID [2018-11-23 12:01:59,323 INFO L273 TraceCheckUtils]: 35: Hoare triple {1282#false} assume 0 == ~cond; {1282#false} is VALID [2018-11-23 12:01:59,323 INFO L273 TraceCheckUtils]: 36: Hoare triple {1282#false} assume !false; {1282#false} is VALID [2018-11-23 12:01:59,325 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 12:01:59,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:59,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:01:59,354 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-11-23 12:01:59,355 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:59,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:01:59,415 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:59,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:01:59,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:01:59,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:01:59,417 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 8 states. [2018-11-23 12:01:59,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:59,709 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-11-23 12:01:59,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:01:59,710 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-11-23 12:01:59,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:59,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:01:59,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2018-11-23 12:01:59,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:01:59,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2018-11-23 12:01:59,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 74 transitions. [2018-11-23 12:01:59,846 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:59,848 INFO L225 Difference]: With dead ends: 80 [2018-11-23 12:01:59,848 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 12:01:59,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:01:59,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 12:01:59,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-23 12:01:59,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:59,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 47 states. [2018-11-23 12:01:59,922 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 47 states. [2018-11-23 12:01:59,923 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 47 states. [2018-11-23 12:01:59,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:59,925 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-11-23 12:01:59,926 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-11-23 12:01:59,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:59,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:59,927 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 49 states. [2018-11-23 12:01:59,927 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 49 states. [2018-11-23 12:01:59,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:59,929 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-11-23 12:01:59,929 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-11-23 12:01:59,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:59,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:59,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:59,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:59,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:01:59,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-11-23 12:01:59,932 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 37 [2018-11-23 12:01:59,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:59,933 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-11-23 12:01:59,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:01:59,933 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-11-23 12:01:59,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 12:01:59,934 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:59,934 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:59,935 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:59,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:59,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1558523702, now seen corresponding path program 5 times [2018-11-23 12:01:59,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:59,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:59,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:59,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:59,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:00,261 INFO L256 TraceCheckUtils]: 0: Hoare triple {1687#true} call ULTIMATE.init(); {1687#true} is VALID [2018-11-23 12:02:00,261 INFO L273 TraceCheckUtils]: 1: Hoare triple {1687#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1687#true} is VALID [2018-11-23 12:02:00,262 INFO L273 TraceCheckUtils]: 2: Hoare triple {1687#true} assume true; {1687#true} is VALID [2018-11-23 12:02:00,262 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1687#true} {1687#true} #76#return; {1687#true} is VALID [2018-11-23 12:02:00,262 INFO L256 TraceCheckUtils]: 4: Hoare triple {1687#true} call #t~ret7 := main(); {1687#true} is VALID [2018-11-23 12:02:00,262 INFO L273 TraceCheckUtils]: 5: Hoare triple {1687#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {1689#(= main_~i~0 0)} is VALID [2018-11-23 12:02:00,263 INFO L273 TraceCheckUtils]: 6: Hoare triple {1689#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1690#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:00,264 INFO L273 TraceCheckUtils]: 7: Hoare triple {1690#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1691#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:00,264 INFO L273 TraceCheckUtils]: 8: Hoare triple {1691#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1692#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:00,265 INFO L273 TraceCheckUtils]: 9: Hoare triple {1692#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1693#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:00,266 INFO L273 TraceCheckUtils]: 10: Hoare triple {1693#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1694#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:00,266 INFO L273 TraceCheckUtils]: 11: Hoare triple {1694#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1688#false} is VALID [2018-11-23 12:02:00,266 INFO L273 TraceCheckUtils]: 12: Hoare triple {1688#false} ~i~0 := 0; {1688#false} is VALID [2018-11-23 12:02:00,266 INFO L273 TraceCheckUtils]: 13: Hoare triple {1688#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {1688#false} is VALID [2018-11-23 12:02:00,267 INFO L273 TraceCheckUtils]: 14: Hoare triple {1688#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1688#false} is VALID [2018-11-23 12:02:00,267 INFO L273 TraceCheckUtils]: 15: Hoare triple {1688#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {1688#false} is VALID [2018-11-23 12:02:00,267 INFO L273 TraceCheckUtils]: 16: Hoare triple {1688#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1688#false} is VALID [2018-11-23 12:02:00,268 INFO L273 TraceCheckUtils]: 17: Hoare triple {1688#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {1688#false} is VALID [2018-11-23 12:02:00,268 INFO L273 TraceCheckUtils]: 18: Hoare triple {1688#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1688#false} is VALID [2018-11-23 12:02:00,268 INFO L273 TraceCheckUtils]: 19: Hoare triple {1688#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {1688#false} is VALID [2018-11-23 12:02:00,269 INFO L273 TraceCheckUtils]: 20: Hoare triple {1688#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1688#false} is VALID [2018-11-23 12:02:00,269 INFO L273 TraceCheckUtils]: 21: Hoare triple {1688#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {1688#false} is VALID [2018-11-23 12:02:00,269 INFO L273 TraceCheckUtils]: 22: Hoare triple {1688#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1688#false} is VALID [2018-11-23 12:02:00,270 INFO L273 TraceCheckUtils]: 23: Hoare triple {1688#false} assume !(~i~0 < 100000); {1688#false} is VALID [2018-11-23 12:02:00,270 INFO L273 TraceCheckUtils]: 24: Hoare triple {1688#false} ~i~0 := 0; {1688#false} is VALID [2018-11-23 12:02:00,270 INFO L273 TraceCheckUtils]: 25: Hoare triple {1688#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1688#false} is VALID [2018-11-23 12:02:00,270 INFO L273 TraceCheckUtils]: 26: Hoare triple {1688#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1688#false} is VALID [2018-11-23 12:02:00,271 INFO L273 TraceCheckUtils]: 27: Hoare triple {1688#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1688#false} is VALID [2018-11-23 12:02:00,271 INFO L273 TraceCheckUtils]: 28: Hoare triple {1688#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1688#false} is VALID [2018-11-23 12:02:00,271 INFO L273 TraceCheckUtils]: 29: Hoare triple {1688#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1688#false} is VALID [2018-11-23 12:02:00,271 INFO L273 TraceCheckUtils]: 30: Hoare triple {1688#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1688#false} is VALID [2018-11-23 12:02:00,271 INFO L273 TraceCheckUtils]: 31: Hoare triple {1688#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1688#false} is VALID [2018-11-23 12:02:00,272 INFO L273 TraceCheckUtils]: 32: Hoare triple {1688#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1688#false} is VALID [2018-11-23 12:02:00,272 INFO L273 TraceCheckUtils]: 33: Hoare triple {1688#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1688#false} is VALID [2018-11-23 12:02:00,272 INFO L273 TraceCheckUtils]: 34: Hoare triple {1688#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1688#false} is VALID [2018-11-23 12:02:00,272 INFO L273 TraceCheckUtils]: 35: Hoare triple {1688#false} assume !(~i~0 < 100000); {1688#false} is VALID [2018-11-23 12:02:00,273 INFO L273 TraceCheckUtils]: 36: Hoare triple {1688#false} havoc ~x~0;~x~0 := 0; {1688#false} is VALID [2018-11-23 12:02:00,273 INFO L273 TraceCheckUtils]: 37: Hoare triple {1688#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1688#false} is VALID [2018-11-23 12:02:00,273 INFO L256 TraceCheckUtils]: 38: Hoare triple {1688#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {1688#false} is VALID [2018-11-23 12:02:00,273 INFO L273 TraceCheckUtils]: 39: Hoare triple {1688#false} ~cond := #in~cond; {1688#false} is VALID [2018-11-23 12:02:00,273 INFO L273 TraceCheckUtils]: 40: Hoare triple {1688#false} assume 0 == ~cond; {1688#false} is VALID [2018-11-23 12:02:00,274 INFO L273 TraceCheckUtils]: 41: Hoare triple {1688#false} assume !false; {1688#false} is VALID [2018-11-23 12:02:00,275 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-23 12:02:00,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:00,275 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:00,290 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:02:00,614 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 12:02:00,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:00,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:00,765 INFO L256 TraceCheckUtils]: 0: Hoare triple {1687#true} call ULTIMATE.init(); {1687#true} is VALID [2018-11-23 12:02:00,766 INFO L273 TraceCheckUtils]: 1: Hoare triple {1687#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1687#true} is VALID [2018-11-23 12:02:00,766 INFO L273 TraceCheckUtils]: 2: Hoare triple {1687#true} assume true; {1687#true} is VALID [2018-11-23 12:02:00,766 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1687#true} {1687#true} #76#return; {1687#true} is VALID [2018-11-23 12:02:00,766 INFO L256 TraceCheckUtils]: 4: Hoare triple {1687#true} call #t~ret7 := main(); {1687#true} is VALID [2018-11-23 12:02:00,766 INFO L273 TraceCheckUtils]: 5: Hoare triple {1687#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {1687#true} is VALID [2018-11-23 12:02:00,767 INFO L273 TraceCheckUtils]: 6: Hoare triple {1687#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1687#true} is VALID [2018-11-23 12:02:00,767 INFO L273 TraceCheckUtils]: 7: Hoare triple {1687#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1687#true} is VALID [2018-11-23 12:02:00,767 INFO L273 TraceCheckUtils]: 8: Hoare triple {1687#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1687#true} is VALID [2018-11-23 12:02:00,767 INFO L273 TraceCheckUtils]: 9: Hoare triple {1687#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1687#true} is VALID [2018-11-23 12:02:00,767 INFO L273 TraceCheckUtils]: 10: Hoare triple {1687#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1687#true} is VALID [2018-11-23 12:02:00,768 INFO L273 TraceCheckUtils]: 11: Hoare triple {1687#true} assume !(~i~0 < 100000); {1687#true} is VALID [2018-11-23 12:02:00,768 INFO L273 TraceCheckUtils]: 12: Hoare triple {1687#true} ~i~0 := 0; {1687#true} is VALID [2018-11-23 12:02:00,768 INFO L273 TraceCheckUtils]: 13: Hoare triple {1687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {1687#true} is VALID [2018-11-23 12:02:00,768 INFO L273 TraceCheckUtils]: 14: Hoare triple {1687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1687#true} is VALID [2018-11-23 12:02:00,768 INFO L273 TraceCheckUtils]: 15: Hoare triple {1687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {1687#true} is VALID [2018-11-23 12:02:00,768 INFO L273 TraceCheckUtils]: 16: Hoare triple {1687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1687#true} is VALID [2018-11-23 12:02:00,769 INFO L273 TraceCheckUtils]: 17: Hoare triple {1687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {1687#true} is VALID [2018-11-23 12:02:00,769 INFO L273 TraceCheckUtils]: 18: Hoare triple {1687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1687#true} is VALID [2018-11-23 12:02:00,769 INFO L273 TraceCheckUtils]: 19: Hoare triple {1687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {1687#true} is VALID [2018-11-23 12:02:00,769 INFO L273 TraceCheckUtils]: 20: Hoare triple {1687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1687#true} is VALID [2018-11-23 12:02:00,769 INFO L273 TraceCheckUtils]: 21: Hoare triple {1687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {1687#true} is VALID [2018-11-23 12:02:00,770 INFO L273 TraceCheckUtils]: 22: Hoare triple {1687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1687#true} is VALID [2018-11-23 12:02:00,770 INFO L273 TraceCheckUtils]: 23: Hoare triple {1687#true} assume !(~i~0 < 100000); {1687#true} is VALID [2018-11-23 12:02:00,771 INFO L273 TraceCheckUtils]: 24: Hoare triple {1687#true} ~i~0 := 0; {1770#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:00,771 INFO L273 TraceCheckUtils]: 25: Hoare triple {1770#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1770#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:00,772 INFO L273 TraceCheckUtils]: 26: Hoare triple {1770#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1690#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:00,772 INFO L273 TraceCheckUtils]: 27: Hoare triple {1690#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1690#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:00,773 INFO L273 TraceCheckUtils]: 28: Hoare triple {1690#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1691#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:00,773 INFO L273 TraceCheckUtils]: 29: Hoare triple {1691#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1691#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:00,774 INFO L273 TraceCheckUtils]: 30: Hoare triple {1691#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1692#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:00,775 INFO L273 TraceCheckUtils]: 31: Hoare triple {1692#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1692#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:00,776 INFO L273 TraceCheckUtils]: 32: Hoare triple {1692#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1693#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:00,777 INFO L273 TraceCheckUtils]: 33: Hoare triple {1693#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1693#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:00,778 INFO L273 TraceCheckUtils]: 34: Hoare triple {1693#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1694#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:00,779 INFO L273 TraceCheckUtils]: 35: Hoare triple {1694#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1688#false} is VALID [2018-11-23 12:02:00,779 INFO L273 TraceCheckUtils]: 36: Hoare triple {1688#false} havoc ~x~0;~x~0 := 0; {1688#false} is VALID [2018-11-23 12:02:00,779 INFO L273 TraceCheckUtils]: 37: Hoare triple {1688#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1688#false} is VALID [2018-11-23 12:02:00,780 INFO L256 TraceCheckUtils]: 38: Hoare triple {1688#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {1688#false} is VALID [2018-11-23 12:02:00,780 INFO L273 TraceCheckUtils]: 39: Hoare triple {1688#false} ~cond := #in~cond; {1688#false} is VALID [2018-11-23 12:02:00,780 INFO L273 TraceCheckUtils]: 40: Hoare triple {1688#false} assume 0 == ~cond; {1688#false} is VALID [2018-11-23 12:02:00,781 INFO L273 TraceCheckUtils]: 41: Hoare triple {1688#false} assume !false; {1688#false} is VALID [2018-11-23 12:02:00,784 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 12:02:00,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:00,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 12:02:00,806 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-11-23 12:02:00,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:00,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:02:00,885 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 12:02:00,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:02:00,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:02:00,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:02:00,887 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 9 states. [2018-11-23 12:02:01,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:01,479 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-11-23 12:02:01,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:02:01,479 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-11-23 12:02:01,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:01,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:02:01,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2018-11-23 12:02:01,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:02:01,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2018-11-23 12:02:01,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 79 transitions. [2018-11-23 12:02:01,638 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:01,639 INFO L225 Difference]: With dead ends: 89 [2018-11-23 12:02:01,639 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 12:02:01,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:02:01,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 12:02:01,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-11-23 12:02:01,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:01,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 52 states. [2018-11-23 12:02:01,683 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 52 states. [2018-11-23 12:02:01,683 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 52 states. [2018-11-23 12:02:01,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:01,685 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-11-23 12:02:01,686 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-11-23 12:02:01,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:01,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:01,686 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 54 states. [2018-11-23 12:02:01,686 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 54 states. [2018-11-23 12:02:01,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:01,688 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-11-23 12:02:01,689 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-11-23 12:02:01,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:01,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:01,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:01,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:01,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:02:01,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-11-23 12:02:01,691 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 42 [2018-11-23 12:02:01,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:01,691 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-11-23 12:02:01,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:02:01,692 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-23 12:02:01,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 12:02:01,693 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:01,693 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:01,693 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:01,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:01,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1349350398, now seen corresponding path program 6 times [2018-11-23 12:02:01,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:01,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:01,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:01,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:01,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:01,837 INFO L256 TraceCheckUtils]: 0: Hoare triple {2141#true} call ULTIMATE.init(); {2141#true} is VALID [2018-11-23 12:02:01,837 INFO L273 TraceCheckUtils]: 1: Hoare triple {2141#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2141#true} is VALID [2018-11-23 12:02:01,837 INFO L273 TraceCheckUtils]: 2: Hoare triple {2141#true} assume true; {2141#true} is VALID [2018-11-23 12:02:01,837 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2141#true} {2141#true} #76#return; {2141#true} is VALID [2018-11-23 12:02:01,838 INFO L256 TraceCheckUtils]: 4: Hoare triple {2141#true} call #t~ret7 := main(); {2141#true} is VALID [2018-11-23 12:02:01,838 INFO L273 TraceCheckUtils]: 5: Hoare triple {2141#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {2143#(= main_~i~0 0)} is VALID [2018-11-23 12:02:01,839 INFO L273 TraceCheckUtils]: 6: Hoare triple {2143#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2144#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:01,840 INFO L273 TraceCheckUtils]: 7: Hoare triple {2144#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2145#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:01,840 INFO L273 TraceCheckUtils]: 8: Hoare triple {2145#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2146#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:01,841 INFO L273 TraceCheckUtils]: 9: Hoare triple {2146#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2147#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:01,842 INFO L273 TraceCheckUtils]: 10: Hoare triple {2147#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2148#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:01,843 INFO L273 TraceCheckUtils]: 11: Hoare triple {2148#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2149#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:01,844 INFO L273 TraceCheckUtils]: 12: Hoare triple {2149#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 12:02:01,844 INFO L273 TraceCheckUtils]: 13: Hoare triple {2142#false} ~i~0 := 0; {2142#false} is VALID [2018-11-23 12:02:01,844 INFO L273 TraceCheckUtils]: 14: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2142#false} is VALID [2018-11-23 12:02:01,845 INFO L273 TraceCheckUtils]: 15: Hoare triple {2142#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2142#false} is VALID [2018-11-23 12:02:01,845 INFO L273 TraceCheckUtils]: 16: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2142#false} is VALID [2018-11-23 12:02:01,845 INFO L273 TraceCheckUtils]: 17: Hoare triple {2142#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2142#false} is VALID [2018-11-23 12:02:01,845 INFO L273 TraceCheckUtils]: 18: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2142#false} is VALID [2018-11-23 12:02:01,846 INFO L273 TraceCheckUtils]: 19: Hoare triple {2142#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2142#false} is VALID [2018-11-23 12:02:01,846 INFO L273 TraceCheckUtils]: 20: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2142#false} is VALID [2018-11-23 12:02:01,846 INFO L273 TraceCheckUtils]: 21: Hoare triple {2142#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2142#false} is VALID [2018-11-23 12:02:01,846 INFO L273 TraceCheckUtils]: 22: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2142#false} is VALID [2018-11-23 12:02:01,847 INFO L273 TraceCheckUtils]: 23: Hoare triple {2142#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2142#false} is VALID [2018-11-23 12:02:01,847 INFO L273 TraceCheckUtils]: 24: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2142#false} is VALID [2018-11-23 12:02:01,847 INFO L273 TraceCheckUtils]: 25: Hoare triple {2142#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2142#false} is VALID [2018-11-23 12:02:01,848 INFO L273 TraceCheckUtils]: 26: Hoare triple {2142#false} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 12:02:01,848 INFO L273 TraceCheckUtils]: 27: Hoare triple {2142#false} ~i~0 := 0; {2142#false} is VALID [2018-11-23 12:02:01,848 INFO L273 TraceCheckUtils]: 28: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2142#false} is VALID [2018-11-23 12:02:01,848 INFO L273 TraceCheckUtils]: 29: Hoare triple {2142#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2142#false} is VALID [2018-11-23 12:02:01,848 INFO L273 TraceCheckUtils]: 30: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2142#false} is VALID [2018-11-23 12:02:01,849 INFO L273 TraceCheckUtils]: 31: Hoare triple {2142#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2142#false} is VALID [2018-11-23 12:02:01,849 INFO L273 TraceCheckUtils]: 32: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2142#false} is VALID [2018-11-23 12:02:01,849 INFO L273 TraceCheckUtils]: 33: Hoare triple {2142#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2142#false} is VALID [2018-11-23 12:02:01,849 INFO L273 TraceCheckUtils]: 34: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2142#false} is VALID [2018-11-23 12:02:01,850 INFO L273 TraceCheckUtils]: 35: Hoare triple {2142#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2142#false} is VALID [2018-11-23 12:02:01,850 INFO L273 TraceCheckUtils]: 36: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2142#false} is VALID [2018-11-23 12:02:01,850 INFO L273 TraceCheckUtils]: 37: Hoare triple {2142#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2142#false} is VALID [2018-11-23 12:02:01,850 INFO L273 TraceCheckUtils]: 38: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2142#false} is VALID [2018-11-23 12:02:01,850 INFO L273 TraceCheckUtils]: 39: Hoare triple {2142#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2142#false} is VALID [2018-11-23 12:02:01,851 INFO L273 TraceCheckUtils]: 40: Hoare triple {2142#false} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 12:02:01,851 INFO L273 TraceCheckUtils]: 41: Hoare triple {2142#false} havoc ~x~0;~x~0 := 0; {2142#false} is VALID [2018-11-23 12:02:01,851 INFO L273 TraceCheckUtils]: 42: Hoare triple {2142#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2142#false} is VALID [2018-11-23 12:02:01,851 INFO L256 TraceCheckUtils]: 43: Hoare triple {2142#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {2142#false} is VALID [2018-11-23 12:02:01,852 INFO L273 TraceCheckUtils]: 44: Hoare triple {2142#false} ~cond := #in~cond; {2142#false} is VALID [2018-11-23 12:02:01,852 INFO L273 TraceCheckUtils]: 45: Hoare triple {2142#false} assume 0 == ~cond; {2142#false} is VALID [2018-11-23 12:02:01,852 INFO L273 TraceCheckUtils]: 46: Hoare triple {2142#false} assume !false; {2142#false} is VALID [2018-11-23 12:02:01,853 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-23 12:02:01,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:01,854 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:01,863 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:02:02,215 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 12:02:02,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:02,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:02,790 INFO L256 TraceCheckUtils]: 0: Hoare triple {2141#true} call ULTIMATE.init(); {2141#true} is VALID [2018-11-23 12:02:02,791 INFO L273 TraceCheckUtils]: 1: Hoare triple {2141#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2141#true} is VALID [2018-11-23 12:02:02,791 INFO L273 TraceCheckUtils]: 2: Hoare triple {2141#true} assume true; {2141#true} is VALID [2018-11-23 12:02:02,791 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2141#true} {2141#true} #76#return; {2141#true} is VALID [2018-11-23 12:02:02,792 INFO L256 TraceCheckUtils]: 4: Hoare triple {2141#true} call #t~ret7 := main(); {2141#true} is VALID [2018-11-23 12:02:02,792 INFO L273 TraceCheckUtils]: 5: Hoare triple {2141#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {2141#true} is VALID [2018-11-23 12:02:02,792 INFO L273 TraceCheckUtils]: 6: Hoare triple {2141#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2141#true} is VALID [2018-11-23 12:02:02,792 INFO L273 TraceCheckUtils]: 7: Hoare triple {2141#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2141#true} is VALID [2018-11-23 12:02:02,792 INFO L273 TraceCheckUtils]: 8: Hoare triple {2141#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2141#true} is VALID [2018-11-23 12:02:02,793 INFO L273 TraceCheckUtils]: 9: Hoare triple {2141#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2141#true} is VALID [2018-11-23 12:02:02,793 INFO L273 TraceCheckUtils]: 10: Hoare triple {2141#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2141#true} is VALID [2018-11-23 12:02:02,793 INFO L273 TraceCheckUtils]: 11: Hoare triple {2141#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2141#true} is VALID [2018-11-23 12:02:02,793 INFO L273 TraceCheckUtils]: 12: Hoare triple {2141#true} assume !(~i~0 < 100000); {2141#true} is VALID [2018-11-23 12:02:02,793 INFO L273 TraceCheckUtils]: 13: Hoare triple {2141#true} ~i~0 := 0; {2141#true} is VALID [2018-11-23 12:02:02,793 INFO L273 TraceCheckUtils]: 14: Hoare triple {2141#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2141#true} is VALID [2018-11-23 12:02:02,793 INFO L273 TraceCheckUtils]: 15: Hoare triple {2141#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2141#true} is VALID [2018-11-23 12:02:02,794 INFO L273 TraceCheckUtils]: 16: Hoare triple {2141#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2141#true} is VALID [2018-11-23 12:02:02,794 INFO L273 TraceCheckUtils]: 17: Hoare triple {2141#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2141#true} is VALID [2018-11-23 12:02:02,794 INFO L273 TraceCheckUtils]: 18: Hoare triple {2141#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2141#true} is VALID [2018-11-23 12:02:02,794 INFO L273 TraceCheckUtils]: 19: Hoare triple {2141#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2141#true} is VALID [2018-11-23 12:02:02,794 INFO L273 TraceCheckUtils]: 20: Hoare triple {2141#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2141#true} is VALID [2018-11-23 12:02:02,794 INFO L273 TraceCheckUtils]: 21: Hoare triple {2141#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2141#true} is VALID [2018-11-23 12:02:02,794 INFO L273 TraceCheckUtils]: 22: Hoare triple {2141#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2141#true} is VALID [2018-11-23 12:02:02,795 INFO L273 TraceCheckUtils]: 23: Hoare triple {2141#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2141#true} is VALID [2018-11-23 12:02:02,795 INFO L273 TraceCheckUtils]: 24: Hoare triple {2141#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2141#true} is VALID [2018-11-23 12:02:02,795 INFO L273 TraceCheckUtils]: 25: Hoare triple {2141#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2141#true} is VALID [2018-11-23 12:02:02,795 INFO L273 TraceCheckUtils]: 26: Hoare triple {2141#true} assume !(~i~0 < 100000); {2141#true} is VALID [2018-11-23 12:02:02,795 INFO L273 TraceCheckUtils]: 27: Hoare triple {2141#true} ~i~0 := 0; {2234#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:02,796 INFO L273 TraceCheckUtils]: 28: Hoare triple {2234#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2234#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:02,796 INFO L273 TraceCheckUtils]: 29: Hoare triple {2234#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2144#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:02,797 INFO L273 TraceCheckUtils]: 30: Hoare triple {2144#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2144#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:02,797 INFO L273 TraceCheckUtils]: 31: Hoare triple {2144#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2145#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:02,798 INFO L273 TraceCheckUtils]: 32: Hoare triple {2145#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2145#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:02,798 INFO L273 TraceCheckUtils]: 33: Hoare triple {2145#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2146#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:02,798 INFO L273 TraceCheckUtils]: 34: Hoare triple {2146#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2146#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:02,799 INFO L273 TraceCheckUtils]: 35: Hoare triple {2146#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2147#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:02,800 INFO L273 TraceCheckUtils]: 36: Hoare triple {2147#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2147#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:02,801 INFO L273 TraceCheckUtils]: 37: Hoare triple {2147#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2148#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:02,801 INFO L273 TraceCheckUtils]: 38: Hoare triple {2148#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2148#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:02,802 INFO L273 TraceCheckUtils]: 39: Hoare triple {2148#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2149#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:02,803 INFO L273 TraceCheckUtils]: 40: Hoare triple {2149#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 12:02:02,803 INFO L273 TraceCheckUtils]: 41: Hoare triple {2142#false} havoc ~x~0;~x~0 := 0; {2142#false} is VALID [2018-11-23 12:02:02,803 INFO L273 TraceCheckUtils]: 42: Hoare triple {2142#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2142#false} is VALID [2018-11-23 12:02:02,803 INFO L256 TraceCheckUtils]: 43: Hoare triple {2142#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {2142#false} is VALID [2018-11-23 12:02:02,804 INFO L273 TraceCheckUtils]: 44: Hoare triple {2142#false} ~cond := #in~cond; {2142#false} is VALID [2018-11-23 12:02:02,804 INFO L273 TraceCheckUtils]: 45: Hoare triple {2142#false} assume 0 == ~cond; {2142#false} is VALID [2018-11-23 12:02:02,804 INFO L273 TraceCheckUtils]: 46: Hoare triple {2142#false} assume !false; {2142#false} is VALID [2018-11-23 12:02:02,806 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-23 12:02:02,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:02,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 12:02:02,827 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-11-23 12:02:02,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:02,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:02:03,106 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:03,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:02:03,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:02:03,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:02:03,107 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 10 states. [2018-11-23 12:02:03,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:03,391 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-11-23 12:02:03,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:02:03,391 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-11-23 12:02:03,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:03,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:02:03,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 84 transitions. [2018-11-23 12:02:03,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:02:03,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 84 transitions. [2018-11-23 12:02:03,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 84 transitions. [2018-11-23 12:02:03,487 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:02:03,489 INFO L225 Difference]: With dead ends: 98 [2018-11-23 12:02:03,489 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 12:02:03,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:02:03,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 12:02:03,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-11-23 12:02:03,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:03,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 57 states. [2018-11-23 12:02:03,517 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 57 states. [2018-11-23 12:02:03,517 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 57 states. [2018-11-23 12:02:03,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:03,520 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2018-11-23 12:02:03,520 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-11-23 12:02:03,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:03,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:03,521 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 59 states. [2018-11-23 12:02:03,521 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 59 states. [2018-11-23 12:02:03,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:03,523 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2018-11-23 12:02:03,523 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-11-23 12:02:03,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:03,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:03,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:03,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:03,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 12:02:03,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-11-23 12:02:03,526 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 47 [2018-11-23 12:02:03,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:03,526 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-11-23 12:02:03,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:02:03,527 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-11-23 12:02:03,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 12:02:03,528 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:03,528 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:03,528 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:03,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:03,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1128841790, now seen corresponding path program 7 times [2018-11-23 12:02:03,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:03,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:03,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:03,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:03,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:03,799 INFO L256 TraceCheckUtils]: 0: Hoare triple {2643#true} call ULTIMATE.init(); {2643#true} is VALID [2018-11-23 12:02:03,800 INFO L273 TraceCheckUtils]: 1: Hoare triple {2643#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2643#true} is VALID [2018-11-23 12:02:03,800 INFO L273 TraceCheckUtils]: 2: Hoare triple {2643#true} assume true; {2643#true} is VALID [2018-11-23 12:02:03,800 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2643#true} {2643#true} #76#return; {2643#true} is VALID [2018-11-23 12:02:03,800 INFO L256 TraceCheckUtils]: 4: Hoare triple {2643#true} call #t~ret7 := main(); {2643#true} is VALID [2018-11-23 12:02:03,801 INFO L273 TraceCheckUtils]: 5: Hoare triple {2643#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {2645#(= main_~i~0 0)} is VALID [2018-11-23 12:02:03,801 INFO L273 TraceCheckUtils]: 6: Hoare triple {2645#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2646#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:03,802 INFO L273 TraceCheckUtils]: 7: Hoare triple {2646#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2647#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:03,803 INFO L273 TraceCheckUtils]: 8: Hoare triple {2647#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2648#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:03,803 INFO L273 TraceCheckUtils]: 9: Hoare triple {2648#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2649#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:03,804 INFO L273 TraceCheckUtils]: 10: Hoare triple {2649#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2650#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:03,804 INFO L273 TraceCheckUtils]: 11: Hoare triple {2650#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2651#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:03,805 INFO L273 TraceCheckUtils]: 12: Hoare triple {2651#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2652#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:03,806 INFO L273 TraceCheckUtils]: 13: Hoare triple {2652#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2644#false} is VALID [2018-11-23 12:02:03,806 INFO L273 TraceCheckUtils]: 14: Hoare triple {2644#false} ~i~0 := 0; {2644#false} is VALID [2018-11-23 12:02:03,807 INFO L273 TraceCheckUtils]: 15: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2644#false} is VALID [2018-11-23 12:02:03,807 INFO L273 TraceCheckUtils]: 16: Hoare triple {2644#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2644#false} is VALID [2018-11-23 12:02:03,807 INFO L273 TraceCheckUtils]: 17: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2644#false} is VALID [2018-11-23 12:02:03,807 INFO L273 TraceCheckUtils]: 18: Hoare triple {2644#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2644#false} is VALID [2018-11-23 12:02:03,808 INFO L273 TraceCheckUtils]: 19: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2644#false} is VALID [2018-11-23 12:02:03,808 INFO L273 TraceCheckUtils]: 20: Hoare triple {2644#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2644#false} is VALID [2018-11-23 12:02:03,808 INFO L273 TraceCheckUtils]: 21: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2644#false} is VALID [2018-11-23 12:02:03,809 INFO L273 TraceCheckUtils]: 22: Hoare triple {2644#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2644#false} is VALID [2018-11-23 12:02:03,809 INFO L273 TraceCheckUtils]: 23: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2644#false} is VALID [2018-11-23 12:02:03,809 INFO L273 TraceCheckUtils]: 24: Hoare triple {2644#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2644#false} is VALID [2018-11-23 12:02:03,810 INFO L273 TraceCheckUtils]: 25: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2644#false} is VALID [2018-11-23 12:02:03,810 INFO L273 TraceCheckUtils]: 26: Hoare triple {2644#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2644#false} is VALID [2018-11-23 12:02:03,810 INFO L273 TraceCheckUtils]: 27: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2644#false} is VALID [2018-11-23 12:02:03,810 INFO L273 TraceCheckUtils]: 28: Hoare triple {2644#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2644#false} is VALID [2018-11-23 12:02:03,811 INFO L273 TraceCheckUtils]: 29: Hoare triple {2644#false} assume !(~i~0 < 100000); {2644#false} is VALID [2018-11-23 12:02:03,811 INFO L273 TraceCheckUtils]: 30: Hoare triple {2644#false} ~i~0 := 0; {2644#false} is VALID [2018-11-23 12:02:03,811 INFO L273 TraceCheckUtils]: 31: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2644#false} is VALID [2018-11-23 12:02:03,811 INFO L273 TraceCheckUtils]: 32: Hoare triple {2644#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2644#false} is VALID [2018-11-23 12:02:03,811 INFO L273 TraceCheckUtils]: 33: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2644#false} is VALID [2018-11-23 12:02:03,812 INFO L273 TraceCheckUtils]: 34: Hoare triple {2644#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2644#false} is VALID [2018-11-23 12:02:03,812 INFO L273 TraceCheckUtils]: 35: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2644#false} is VALID [2018-11-23 12:02:03,812 INFO L273 TraceCheckUtils]: 36: Hoare triple {2644#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2644#false} is VALID [2018-11-23 12:02:03,812 INFO L273 TraceCheckUtils]: 37: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2644#false} is VALID [2018-11-23 12:02:03,812 INFO L273 TraceCheckUtils]: 38: Hoare triple {2644#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2644#false} is VALID [2018-11-23 12:02:03,812 INFO L273 TraceCheckUtils]: 39: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2644#false} is VALID [2018-11-23 12:02:03,813 INFO L273 TraceCheckUtils]: 40: Hoare triple {2644#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2644#false} is VALID [2018-11-23 12:02:03,813 INFO L273 TraceCheckUtils]: 41: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2644#false} is VALID [2018-11-23 12:02:03,813 INFO L273 TraceCheckUtils]: 42: Hoare triple {2644#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2644#false} is VALID [2018-11-23 12:02:03,813 INFO L273 TraceCheckUtils]: 43: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2644#false} is VALID [2018-11-23 12:02:03,813 INFO L273 TraceCheckUtils]: 44: Hoare triple {2644#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2644#false} is VALID [2018-11-23 12:02:03,814 INFO L273 TraceCheckUtils]: 45: Hoare triple {2644#false} assume !(~i~0 < 100000); {2644#false} is VALID [2018-11-23 12:02:03,814 INFO L273 TraceCheckUtils]: 46: Hoare triple {2644#false} havoc ~x~0;~x~0 := 0; {2644#false} is VALID [2018-11-23 12:02:03,814 INFO L273 TraceCheckUtils]: 47: Hoare triple {2644#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2644#false} is VALID [2018-11-23 12:02:03,814 INFO L256 TraceCheckUtils]: 48: Hoare triple {2644#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {2644#false} is VALID [2018-11-23 12:02:03,814 INFO L273 TraceCheckUtils]: 49: Hoare triple {2644#false} ~cond := #in~cond; {2644#false} is VALID [2018-11-23 12:02:03,815 INFO L273 TraceCheckUtils]: 50: Hoare triple {2644#false} assume 0 == ~cond; {2644#false} is VALID [2018-11-23 12:02:03,815 INFO L273 TraceCheckUtils]: 51: Hoare triple {2644#false} assume !false; {2644#false} is VALID [2018-11-23 12:02:03,817 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-23 12:02:03,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:03,817 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:03,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:03,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:04,042 INFO L256 TraceCheckUtils]: 0: Hoare triple {2643#true} call ULTIMATE.init(); {2643#true} is VALID [2018-11-23 12:02:04,043 INFO L273 TraceCheckUtils]: 1: Hoare triple {2643#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2643#true} is VALID [2018-11-23 12:02:04,043 INFO L273 TraceCheckUtils]: 2: Hoare triple {2643#true} assume true; {2643#true} is VALID [2018-11-23 12:02:04,043 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2643#true} {2643#true} #76#return; {2643#true} is VALID [2018-11-23 12:02:04,043 INFO L256 TraceCheckUtils]: 4: Hoare triple {2643#true} call #t~ret7 := main(); {2643#true} is VALID [2018-11-23 12:02:04,044 INFO L273 TraceCheckUtils]: 5: Hoare triple {2643#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {2671#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:04,045 INFO L273 TraceCheckUtils]: 6: Hoare triple {2671#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2646#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:04,045 INFO L273 TraceCheckUtils]: 7: Hoare triple {2646#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2647#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:04,046 INFO L273 TraceCheckUtils]: 8: Hoare triple {2647#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2648#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:04,046 INFO L273 TraceCheckUtils]: 9: Hoare triple {2648#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2649#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:04,047 INFO L273 TraceCheckUtils]: 10: Hoare triple {2649#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2650#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:04,048 INFO L273 TraceCheckUtils]: 11: Hoare triple {2650#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2651#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:04,054 INFO L273 TraceCheckUtils]: 12: Hoare triple {2651#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2652#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:04,054 INFO L273 TraceCheckUtils]: 13: Hoare triple {2652#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2644#false} is VALID [2018-11-23 12:02:04,055 INFO L273 TraceCheckUtils]: 14: Hoare triple {2644#false} ~i~0 := 0; {2644#false} is VALID [2018-11-23 12:02:04,055 INFO L273 TraceCheckUtils]: 15: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2644#false} is VALID [2018-11-23 12:02:04,055 INFO L273 TraceCheckUtils]: 16: Hoare triple {2644#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2644#false} is VALID [2018-11-23 12:02:04,055 INFO L273 TraceCheckUtils]: 17: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2644#false} is VALID [2018-11-23 12:02:04,055 INFO L273 TraceCheckUtils]: 18: Hoare triple {2644#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2644#false} is VALID [2018-11-23 12:02:04,055 INFO L273 TraceCheckUtils]: 19: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2644#false} is VALID [2018-11-23 12:02:04,055 INFO L273 TraceCheckUtils]: 20: Hoare triple {2644#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2644#false} is VALID [2018-11-23 12:02:04,056 INFO L273 TraceCheckUtils]: 21: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2644#false} is VALID [2018-11-23 12:02:04,056 INFO L273 TraceCheckUtils]: 22: Hoare triple {2644#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2644#false} is VALID [2018-11-23 12:02:04,056 INFO L273 TraceCheckUtils]: 23: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2644#false} is VALID [2018-11-23 12:02:04,056 INFO L273 TraceCheckUtils]: 24: Hoare triple {2644#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2644#false} is VALID [2018-11-23 12:02:04,056 INFO L273 TraceCheckUtils]: 25: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2644#false} is VALID [2018-11-23 12:02:04,056 INFO L273 TraceCheckUtils]: 26: Hoare triple {2644#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2644#false} is VALID [2018-11-23 12:02:04,056 INFO L273 TraceCheckUtils]: 27: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2644#false} is VALID [2018-11-23 12:02:04,057 INFO L273 TraceCheckUtils]: 28: Hoare triple {2644#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2644#false} is VALID [2018-11-23 12:02:04,057 INFO L273 TraceCheckUtils]: 29: Hoare triple {2644#false} assume !(~i~0 < 100000); {2644#false} is VALID [2018-11-23 12:02:04,057 INFO L273 TraceCheckUtils]: 30: Hoare triple {2644#false} ~i~0 := 0; {2644#false} is VALID [2018-11-23 12:02:04,057 INFO L273 TraceCheckUtils]: 31: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2644#false} is VALID [2018-11-23 12:02:04,057 INFO L273 TraceCheckUtils]: 32: Hoare triple {2644#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2644#false} is VALID [2018-11-23 12:02:04,057 INFO L273 TraceCheckUtils]: 33: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2644#false} is VALID [2018-11-23 12:02:04,057 INFO L273 TraceCheckUtils]: 34: Hoare triple {2644#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2644#false} is VALID [2018-11-23 12:02:04,057 INFO L273 TraceCheckUtils]: 35: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2644#false} is VALID [2018-11-23 12:02:04,058 INFO L273 TraceCheckUtils]: 36: Hoare triple {2644#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2644#false} is VALID [2018-11-23 12:02:04,058 INFO L273 TraceCheckUtils]: 37: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2644#false} is VALID [2018-11-23 12:02:04,058 INFO L273 TraceCheckUtils]: 38: Hoare triple {2644#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2644#false} is VALID [2018-11-23 12:02:04,058 INFO L273 TraceCheckUtils]: 39: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2644#false} is VALID [2018-11-23 12:02:04,058 INFO L273 TraceCheckUtils]: 40: Hoare triple {2644#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2644#false} is VALID [2018-11-23 12:02:04,058 INFO L273 TraceCheckUtils]: 41: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2644#false} is VALID [2018-11-23 12:02:04,058 INFO L273 TraceCheckUtils]: 42: Hoare triple {2644#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2644#false} is VALID [2018-11-23 12:02:04,058 INFO L273 TraceCheckUtils]: 43: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2644#false} is VALID [2018-11-23 12:02:04,059 INFO L273 TraceCheckUtils]: 44: Hoare triple {2644#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2644#false} is VALID [2018-11-23 12:02:04,059 INFO L273 TraceCheckUtils]: 45: Hoare triple {2644#false} assume !(~i~0 < 100000); {2644#false} is VALID [2018-11-23 12:02:04,059 INFO L273 TraceCheckUtils]: 46: Hoare triple {2644#false} havoc ~x~0;~x~0 := 0; {2644#false} is VALID [2018-11-23 12:02:04,059 INFO L273 TraceCheckUtils]: 47: Hoare triple {2644#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2644#false} is VALID [2018-11-23 12:02:04,059 INFO L256 TraceCheckUtils]: 48: Hoare triple {2644#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {2644#false} is VALID [2018-11-23 12:02:04,059 INFO L273 TraceCheckUtils]: 49: Hoare triple {2644#false} ~cond := #in~cond; {2644#false} is VALID [2018-11-23 12:02:04,059 INFO L273 TraceCheckUtils]: 50: Hoare triple {2644#false} assume 0 == ~cond; {2644#false} is VALID [2018-11-23 12:02:04,060 INFO L273 TraceCheckUtils]: 51: Hoare triple {2644#false} assume !false; {2644#false} is VALID [2018-11-23 12:02:04,061 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-23 12:02:04,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:04,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:02:04,080 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-11-23 12:02:04,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:04,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:02:04,108 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:04,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:02:04,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:02:04,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:02:04,109 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 11 states. [2018-11-23 12:02:04,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:04,694 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2018-11-23 12:02:04,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:02:04,694 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-11-23 12:02:04,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:04,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:02:04,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 89 transitions. [2018-11-23 12:02:04,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:02:04,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 89 transitions. [2018-11-23 12:02:04,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 89 transitions. [2018-11-23 12:02:04,842 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:04,844 INFO L225 Difference]: With dead ends: 107 [2018-11-23 12:02:04,844 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 12:02:04,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:02:04,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 12:02:04,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-11-23 12:02:04,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:04,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 62 states. [2018-11-23 12:02:04,882 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 62 states. [2018-11-23 12:02:04,882 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 62 states. [2018-11-23 12:02:04,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:04,885 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-11-23 12:02:04,885 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-11-23 12:02:04,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:04,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:04,885 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 64 states. [2018-11-23 12:02:04,886 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 64 states. [2018-11-23 12:02:04,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:04,887 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-11-23 12:02:04,888 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-11-23 12:02:04,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:04,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:04,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:04,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:04,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 12:02:04,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2018-11-23 12:02:04,890 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 52 [2018-11-23 12:02:04,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:04,890 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2018-11-23 12:02:04,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:02:04,890 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-11-23 12:02:04,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 12:02:04,891 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:04,891 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:04,892 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:04,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:04,892 INFO L82 PathProgramCache]: Analyzing trace with hash -612503046, now seen corresponding path program 8 times [2018-11-23 12:02:04,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:04,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:04,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:04,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:04,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:05,332 INFO L256 TraceCheckUtils]: 0: Hoare triple {3193#true} call ULTIMATE.init(); {3193#true} is VALID [2018-11-23 12:02:05,332 INFO L273 TraceCheckUtils]: 1: Hoare triple {3193#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3193#true} is VALID [2018-11-23 12:02:05,333 INFO L273 TraceCheckUtils]: 2: Hoare triple {3193#true} assume true; {3193#true} is VALID [2018-11-23 12:02:05,333 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3193#true} {3193#true} #76#return; {3193#true} is VALID [2018-11-23 12:02:05,333 INFO L256 TraceCheckUtils]: 4: Hoare triple {3193#true} call #t~ret7 := main(); {3193#true} is VALID [2018-11-23 12:02:05,334 INFO L273 TraceCheckUtils]: 5: Hoare triple {3193#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {3195#(= main_~i~0 0)} is VALID [2018-11-23 12:02:05,335 INFO L273 TraceCheckUtils]: 6: Hoare triple {3195#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:05,336 INFO L273 TraceCheckUtils]: 7: Hoare triple {3196#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3197#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:05,337 INFO L273 TraceCheckUtils]: 8: Hoare triple {3197#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3198#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:05,338 INFO L273 TraceCheckUtils]: 9: Hoare triple {3198#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3199#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:05,339 INFO L273 TraceCheckUtils]: 10: Hoare triple {3199#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3200#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:05,340 INFO L273 TraceCheckUtils]: 11: Hoare triple {3200#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3201#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:05,341 INFO L273 TraceCheckUtils]: 12: Hoare triple {3201#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3202#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:05,342 INFO L273 TraceCheckUtils]: 13: Hoare triple {3202#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3203#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:05,343 INFO L273 TraceCheckUtils]: 14: Hoare triple {3203#(<= main_~i~0 8)} assume !(~i~0 < 100000); {3194#false} is VALID [2018-11-23 12:02:05,343 INFO L273 TraceCheckUtils]: 15: Hoare triple {3194#false} ~i~0 := 0; {3194#false} is VALID [2018-11-23 12:02:05,343 INFO L273 TraceCheckUtils]: 16: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3194#false} is VALID [2018-11-23 12:02:05,343 INFO L273 TraceCheckUtils]: 17: Hoare triple {3194#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3194#false} is VALID [2018-11-23 12:02:05,344 INFO L273 TraceCheckUtils]: 18: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3194#false} is VALID [2018-11-23 12:02:05,344 INFO L273 TraceCheckUtils]: 19: Hoare triple {3194#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3194#false} is VALID [2018-11-23 12:02:05,344 INFO L273 TraceCheckUtils]: 20: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3194#false} is VALID [2018-11-23 12:02:05,344 INFO L273 TraceCheckUtils]: 21: Hoare triple {3194#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3194#false} is VALID [2018-11-23 12:02:05,344 INFO L273 TraceCheckUtils]: 22: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3194#false} is VALID [2018-11-23 12:02:05,345 INFO L273 TraceCheckUtils]: 23: Hoare triple {3194#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3194#false} is VALID [2018-11-23 12:02:05,345 INFO L273 TraceCheckUtils]: 24: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3194#false} is VALID [2018-11-23 12:02:05,345 INFO L273 TraceCheckUtils]: 25: Hoare triple {3194#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3194#false} is VALID [2018-11-23 12:02:05,345 INFO L273 TraceCheckUtils]: 26: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3194#false} is VALID [2018-11-23 12:02:05,346 INFO L273 TraceCheckUtils]: 27: Hoare triple {3194#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3194#false} is VALID [2018-11-23 12:02:05,346 INFO L273 TraceCheckUtils]: 28: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3194#false} is VALID [2018-11-23 12:02:05,346 INFO L273 TraceCheckUtils]: 29: Hoare triple {3194#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3194#false} is VALID [2018-11-23 12:02:05,346 INFO L273 TraceCheckUtils]: 30: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3194#false} is VALID [2018-11-23 12:02:05,346 INFO L273 TraceCheckUtils]: 31: Hoare triple {3194#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3194#false} is VALID [2018-11-23 12:02:05,346 INFO L273 TraceCheckUtils]: 32: Hoare triple {3194#false} assume !(~i~0 < 100000); {3194#false} is VALID [2018-11-23 12:02:05,347 INFO L273 TraceCheckUtils]: 33: Hoare triple {3194#false} ~i~0 := 0; {3194#false} is VALID [2018-11-23 12:02:05,347 INFO L273 TraceCheckUtils]: 34: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3194#false} is VALID [2018-11-23 12:02:05,347 INFO L273 TraceCheckUtils]: 35: Hoare triple {3194#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3194#false} is VALID [2018-11-23 12:02:05,347 INFO L273 TraceCheckUtils]: 36: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3194#false} is VALID [2018-11-23 12:02:05,347 INFO L273 TraceCheckUtils]: 37: Hoare triple {3194#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3194#false} is VALID [2018-11-23 12:02:05,347 INFO L273 TraceCheckUtils]: 38: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3194#false} is VALID [2018-11-23 12:02:05,347 INFO L273 TraceCheckUtils]: 39: Hoare triple {3194#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3194#false} is VALID [2018-11-23 12:02:05,348 INFO L273 TraceCheckUtils]: 40: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3194#false} is VALID [2018-11-23 12:02:05,348 INFO L273 TraceCheckUtils]: 41: Hoare triple {3194#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3194#false} is VALID [2018-11-23 12:02:05,348 INFO L273 TraceCheckUtils]: 42: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3194#false} is VALID [2018-11-23 12:02:05,348 INFO L273 TraceCheckUtils]: 43: Hoare triple {3194#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3194#false} is VALID [2018-11-23 12:02:05,348 INFO L273 TraceCheckUtils]: 44: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3194#false} is VALID [2018-11-23 12:02:05,348 INFO L273 TraceCheckUtils]: 45: Hoare triple {3194#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3194#false} is VALID [2018-11-23 12:02:05,348 INFO L273 TraceCheckUtils]: 46: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3194#false} is VALID [2018-11-23 12:02:05,348 INFO L273 TraceCheckUtils]: 47: Hoare triple {3194#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3194#false} is VALID [2018-11-23 12:02:05,349 INFO L273 TraceCheckUtils]: 48: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3194#false} is VALID [2018-11-23 12:02:05,349 INFO L273 TraceCheckUtils]: 49: Hoare triple {3194#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3194#false} is VALID [2018-11-23 12:02:05,349 INFO L273 TraceCheckUtils]: 50: Hoare triple {3194#false} assume !(~i~0 < 100000); {3194#false} is VALID [2018-11-23 12:02:05,349 INFO L273 TraceCheckUtils]: 51: Hoare triple {3194#false} havoc ~x~0;~x~0 := 0; {3194#false} is VALID [2018-11-23 12:02:05,349 INFO L273 TraceCheckUtils]: 52: Hoare triple {3194#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3194#false} is VALID [2018-11-23 12:02:05,349 INFO L256 TraceCheckUtils]: 53: Hoare triple {3194#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {3194#false} is VALID [2018-11-23 12:02:05,349 INFO L273 TraceCheckUtils]: 54: Hoare triple {3194#false} ~cond := #in~cond; {3194#false} is VALID [2018-11-23 12:02:05,349 INFO L273 TraceCheckUtils]: 55: Hoare triple {3194#false} assume 0 == ~cond; {3194#false} is VALID [2018-11-23 12:02:05,350 INFO L273 TraceCheckUtils]: 56: Hoare triple {3194#false} assume !false; {3194#false} is VALID [2018-11-23 12:02:05,351 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-11-23 12:02:05,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:05,351 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:05,363 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:02:05,392 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:02:05,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:05,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:05,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:05,540 INFO L256 TraceCheckUtils]: 0: Hoare triple {3193#true} call ULTIMATE.init(); {3193#true} is VALID [2018-11-23 12:02:05,541 INFO L273 TraceCheckUtils]: 1: Hoare triple {3193#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3193#true} is VALID [2018-11-23 12:02:05,541 INFO L273 TraceCheckUtils]: 2: Hoare triple {3193#true} assume true; {3193#true} is VALID [2018-11-23 12:02:05,541 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3193#true} {3193#true} #76#return; {3193#true} is VALID [2018-11-23 12:02:05,542 INFO L256 TraceCheckUtils]: 4: Hoare triple {3193#true} call #t~ret7 := main(); {3193#true} is VALID [2018-11-23 12:02:05,543 INFO L273 TraceCheckUtils]: 5: Hoare triple {3193#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {3222#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:05,543 INFO L273 TraceCheckUtils]: 6: Hoare triple {3222#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:05,544 INFO L273 TraceCheckUtils]: 7: Hoare triple {3196#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3197#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:05,545 INFO L273 TraceCheckUtils]: 8: Hoare triple {3197#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3198#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:05,545 INFO L273 TraceCheckUtils]: 9: Hoare triple {3198#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3199#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:05,546 INFO L273 TraceCheckUtils]: 10: Hoare triple {3199#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3200#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:05,547 INFO L273 TraceCheckUtils]: 11: Hoare triple {3200#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3201#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:05,552 INFO L273 TraceCheckUtils]: 12: Hoare triple {3201#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3202#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:05,554 INFO L273 TraceCheckUtils]: 13: Hoare triple {3202#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3203#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:05,554 INFO L273 TraceCheckUtils]: 14: Hoare triple {3203#(<= main_~i~0 8)} assume !(~i~0 < 100000); {3194#false} is VALID [2018-11-23 12:02:05,554 INFO L273 TraceCheckUtils]: 15: Hoare triple {3194#false} ~i~0 := 0; {3194#false} is VALID [2018-11-23 12:02:05,554 INFO L273 TraceCheckUtils]: 16: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3194#false} is VALID [2018-11-23 12:02:05,555 INFO L273 TraceCheckUtils]: 17: Hoare triple {3194#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3194#false} is VALID [2018-11-23 12:02:05,555 INFO L273 TraceCheckUtils]: 18: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3194#false} is VALID [2018-11-23 12:02:05,555 INFO L273 TraceCheckUtils]: 19: Hoare triple {3194#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3194#false} is VALID [2018-11-23 12:02:05,555 INFO L273 TraceCheckUtils]: 20: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3194#false} is VALID [2018-11-23 12:02:05,555 INFO L273 TraceCheckUtils]: 21: Hoare triple {3194#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3194#false} is VALID [2018-11-23 12:02:05,556 INFO L273 TraceCheckUtils]: 22: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3194#false} is VALID [2018-11-23 12:02:05,556 INFO L273 TraceCheckUtils]: 23: Hoare triple {3194#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3194#false} is VALID [2018-11-23 12:02:05,556 INFO L273 TraceCheckUtils]: 24: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3194#false} is VALID [2018-11-23 12:02:05,556 INFO L273 TraceCheckUtils]: 25: Hoare triple {3194#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3194#false} is VALID [2018-11-23 12:02:05,556 INFO L273 TraceCheckUtils]: 26: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3194#false} is VALID [2018-11-23 12:02:05,557 INFO L273 TraceCheckUtils]: 27: Hoare triple {3194#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3194#false} is VALID [2018-11-23 12:02:05,557 INFO L273 TraceCheckUtils]: 28: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3194#false} is VALID [2018-11-23 12:02:05,557 INFO L273 TraceCheckUtils]: 29: Hoare triple {3194#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3194#false} is VALID [2018-11-23 12:02:05,557 INFO L273 TraceCheckUtils]: 30: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3194#false} is VALID [2018-11-23 12:02:05,557 INFO L273 TraceCheckUtils]: 31: Hoare triple {3194#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3194#false} is VALID [2018-11-23 12:02:05,558 INFO L273 TraceCheckUtils]: 32: Hoare triple {3194#false} assume !(~i~0 < 100000); {3194#false} is VALID [2018-11-23 12:02:05,558 INFO L273 TraceCheckUtils]: 33: Hoare triple {3194#false} ~i~0 := 0; {3194#false} is VALID [2018-11-23 12:02:05,558 INFO L273 TraceCheckUtils]: 34: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3194#false} is VALID [2018-11-23 12:02:05,558 INFO L273 TraceCheckUtils]: 35: Hoare triple {3194#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3194#false} is VALID [2018-11-23 12:02:05,558 INFO L273 TraceCheckUtils]: 36: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3194#false} is VALID [2018-11-23 12:02:05,558 INFO L273 TraceCheckUtils]: 37: Hoare triple {3194#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3194#false} is VALID [2018-11-23 12:02:05,559 INFO L273 TraceCheckUtils]: 38: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3194#false} is VALID [2018-11-23 12:02:05,559 INFO L273 TraceCheckUtils]: 39: Hoare triple {3194#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3194#false} is VALID [2018-11-23 12:02:05,559 INFO L273 TraceCheckUtils]: 40: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3194#false} is VALID [2018-11-23 12:02:05,559 INFO L273 TraceCheckUtils]: 41: Hoare triple {3194#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3194#false} is VALID [2018-11-23 12:02:05,559 INFO L273 TraceCheckUtils]: 42: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3194#false} is VALID [2018-11-23 12:02:05,560 INFO L273 TraceCheckUtils]: 43: Hoare triple {3194#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3194#false} is VALID [2018-11-23 12:02:05,560 INFO L273 TraceCheckUtils]: 44: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3194#false} is VALID [2018-11-23 12:02:05,560 INFO L273 TraceCheckUtils]: 45: Hoare triple {3194#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3194#false} is VALID [2018-11-23 12:02:05,560 INFO L273 TraceCheckUtils]: 46: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3194#false} is VALID [2018-11-23 12:02:05,560 INFO L273 TraceCheckUtils]: 47: Hoare triple {3194#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3194#false} is VALID [2018-11-23 12:02:05,561 INFO L273 TraceCheckUtils]: 48: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3194#false} is VALID [2018-11-23 12:02:05,561 INFO L273 TraceCheckUtils]: 49: Hoare triple {3194#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3194#false} is VALID [2018-11-23 12:02:05,561 INFO L273 TraceCheckUtils]: 50: Hoare triple {3194#false} assume !(~i~0 < 100000); {3194#false} is VALID [2018-11-23 12:02:05,561 INFO L273 TraceCheckUtils]: 51: Hoare triple {3194#false} havoc ~x~0;~x~0 := 0; {3194#false} is VALID [2018-11-23 12:02:05,561 INFO L273 TraceCheckUtils]: 52: Hoare triple {3194#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3194#false} is VALID [2018-11-23 12:02:05,561 INFO L256 TraceCheckUtils]: 53: Hoare triple {3194#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {3194#false} is VALID [2018-11-23 12:02:05,562 INFO L273 TraceCheckUtils]: 54: Hoare triple {3194#false} ~cond := #in~cond; {3194#false} is VALID [2018-11-23 12:02:05,562 INFO L273 TraceCheckUtils]: 55: Hoare triple {3194#false} assume 0 == ~cond; {3194#false} is VALID [2018-11-23 12:02:05,562 INFO L273 TraceCheckUtils]: 56: Hoare triple {3194#false} assume !false; {3194#false} is VALID [2018-11-23 12:02:05,564 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-11-23 12:02:05,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:05,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:02:05,594 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-11-23 12:02:05,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:05,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:02:05,685 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:05,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:02:05,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:02:05,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:02:05,686 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 12 states. [2018-11-23 12:02:05,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:05,987 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2018-11-23 12:02:05,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:02:05,988 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-11-23 12:02:05,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:05,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:02:05,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 94 transitions. [2018-11-23 12:02:05,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:02:05,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 94 transitions. [2018-11-23 12:02:05,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 94 transitions. [2018-11-23 12:02:06,116 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:06,118 INFO L225 Difference]: With dead ends: 116 [2018-11-23 12:02:06,118 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 12:02:06,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:02:06,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 12:02:06,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-23 12:02:06,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:06,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 67 states. [2018-11-23 12:02:06,161 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 67 states. [2018-11-23 12:02:06,161 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 67 states. [2018-11-23 12:02:06,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:06,163 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-11-23 12:02:06,163 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2018-11-23 12:02:06,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:06,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:06,164 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 69 states. [2018-11-23 12:02:06,164 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 69 states. [2018-11-23 12:02:06,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:06,166 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-11-23 12:02:06,166 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2018-11-23 12:02:06,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:06,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:06,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:06,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:06,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 12:02:06,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2018-11-23 12:02:06,168 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 57 [2018-11-23 12:02:06,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:06,169 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2018-11-23 12:02:06,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:02:06,169 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2018-11-23 12:02:06,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 12:02:06,170 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:06,170 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:06,170 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:06,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:06,170 INFO L82 PathProgramCache]: Analyzing trace with hash -490630470, now seen corresponding path program 9 times [2018-11-23 12:02:06,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:06,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:06,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:06,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:06,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:06,451 INFO L256 TraceCheckUtils]: 0: Hoare triple {3791#true} call ULTIMATE.init(); {3791#true} is VALID [2018-11-23 12:02:06,451 INFO L273 TraceCheckUtils]: 1: Hoare triple {3791#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3791#true} is VALID [2018-11-23 12:02:06,451 INFO L273 TraceCheckUtils]: 2: Hoare triple {3791#true} assume true; {3791#true} is VALID [2018-11-23 12:02:06,452 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3791#true} {3791#true} #76#return; {3791#true} is VALID [2018-11-23 12:02:06,452 INFO L256 TraceCheckUtils]: 4: Hoare triple {3791#true} call #t~ret7 := main(); {3791#true} is VALID [2018-11-23 12:02:06,453 INFO L273 TraceCheckUtils]: 5: Hoare triple {3791#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {3793#(= main_~i~0 0)} is VALID [2018-11-23 12:02:06,454 INFO L273 TraceCheckUtils]: 6: Hoare triple {3793#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3794#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:06,455 INFO L273 TraceCheckUtils]: 7: Hoare triple {3794#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3795#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:06,455 INFO L273 TraceCheckUtils]: 8: Hoare triple {3795#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3796#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:06,475 INFO L273 TraceCheckUtils]: 9: Hoare triple {3796#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3797#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:06,476 INFO L273 TraceCheckUtils]: 10: Hoare triple {3797#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3798#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:06,476 INFO L273 TraceCheckUtils]: 11: Hoare triple {3798#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3799#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:06,477 INFO L273 TraceCheckUtils]: 12: Hoare triple {3799#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3800#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:06,478 INFO L273 TraceCheckUtils]: 13: Hoare triple {3800#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3801#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:06,478 INFO L273 TraceCheckUtils]: 14: Hoare triple {3801#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3802#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:06,479 INFO L273 TraceCheckUtils]: 15: Hoare triple {3802#(<= main_~i~0 9)} assume !(~i~0 < 100000); {3792#false} is VALID [2018-11-23 12:02:06,479 INFO L273 TraceCheckUtils]: 16: Hoare triple {3792#false} ~i~0 := 0; {3792#false} is VALID [2018-11-23 12:02:06,479 INFO L273 TraceCheckUtils]: 17: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3792#false} is VALID [2018-11-23 12:02:06,479 INFO L273 TraceCheckUtils]: 18: Hoare triple {3792#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3792#false} is VALID [2018-11-23 12:02:06,480 INFO L273 TraceCheckUtils]: 19: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3792#false} is VALID [2018-11-23 12:02:06,480 INFO L273 TraceCheckUtils]: 20: Hoare triple {3792#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3792#false} is VALID [2018-11-23 12:02:06,480 INFO L273 TraceCheckUtils]: 21: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3792#false} is VALID [2018-11-23 12:02:06,480 INFO L273 TraceCheckUtils]: 22: Hoare triple {3792#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3792#false} is VALID [2018-11-23 12:02:06,480 INFO L273 TraceCheckUtils]: 23: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3792#false} is VALID [2018-11-23 12:02:06,481 INFO L273 TraceCheckUtils]: 24: Hoare triple {3792#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3792#false} is VALID [2018-11-23 12:02:06,481 INFO L273 TraceCheckUtils]: 25: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3792#false} is VALID [2018-11-23 12:02:06,481 INFO L273 TraceCheckUtils]: 26: Hoare triple {3792#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3792#false} is VALID [2018-11-23 12:02:06,481 INFO L273 TraceCheckUtils]: 27: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3792#false} is VALID [2018-11-23 12:02:06,481 INFO L273 TraceCheckUtils]: 28: Hoare triple {3792#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3792#false} is VALID [2018-11-23 12:02:06,482 INFO L273 TraceCheckUtils]: 29: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3792#false} is VALID [2018-11-23 12:02:06,482 INFO L273 TraceCheckUtils]: 30: Hoare triple {3792#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3792#false} is VALID [2018-11-23 12:02:06,482 INFO L273 TraceCheckUtils]: 31: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3792#false} is VALID [2018-11-23 12:02:06,482 INFO L273 TraceCheckUtils]: 32: Hoare triple {3792#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3792#false} is VALID [2018-11-23 12:02:06,482 INFO L273 TraceCheckUtils]: 33: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3792#false} is VALID [2018-11-23 12:02:06,483 INFO L273 TraceCheckUtils]: 34: Hoare triple {3792#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3792#false} is VALID [2018-11-23 12:02:06,483 INFO L273 TraceCheckUtils]: 35: Hoare triple {3792#false} assume !(~i~0 < 100000); {3792#false} is VALID [2018-11-23 12:02:06,483 INFO L273 TraceCheckUtils]: 36: Hoare triple {3792#false} ~i~0 := 0; {3792#false} is VALID [2018-11-23 12:02:06,483 INFO L273 TraceCheckUtils]: 37: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3792#false} is VALID [2018-11-23 12:02:06,483 INFO L273 TraceCheckUtils]: 38: Hoare triple {3792#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3792#false} is VALID [2018-11-23 12:02:06,483 INFO L273 TraceCheckUtils]: 39: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3792#false} is VALID [2018-11-23 12:02:06,483 INFO L273 TraceCheckUtils]: 40: Hoare triple {3792#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3792#false} is VALID [2018-11-23 12:02:06,483 INFO L273 TraceCheckUtils]: 41: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3792#false} is VALID [2018-11-23 12:02:06,484 INFO L273 TraceCheckUtils]: 42: Hoare triple {3792#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3792#false} is VALID [2018-11-23 12:02:06,484 INFO L273 TraceCheckUtils]: 43: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3792#false} is VALID [2018-11-23 12:02:06,484 INFO L273 TraceCheckUtils]: 44: Hoare triple {3792#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3792#false} is VALID [2018-11-23 12:02:06,484 INFO L273 TraceCheckUtils]: 45: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3792#false} is VALID [2018-11-23 12:02:06,484 INFO L273 TraceCheckUtils]: 46: Hoare triple {3792#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3792#false} is VALID [2018-11-23 12:02:06,484 INFO L273 TraceCheckUtils]: 47: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3792#false} is VALID [2018-11-23 12:02:06,484 INFO L273 TraceCheckUtils]: 48: Hoare triple {3792#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3792#false} is VALID [2018-11-23 12:02:06,484 INFO L273 TraceCheckUtils]: 49: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3792#false} is VALID [2018-11-23 12:02:06,485 INFO L273 TraceCheckUtils]: 50: Hoare triple {3792#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3792#false} is VALID [2018-11-23 12:02:06,485 INFO L273 TraceCheckUtils]: 51: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3792#false} is VALID [2018-11-23 12:02:06,485 INFO L273 TraceCheckUtils]: 52: Hoare triple {3792#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3792#false} is VALID [2018-11-23 12:02:06,485 INFO L273 TraceCheckUtils]: 53: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3792#false} is VALID [2018-11-23 12:02:06,485 INFO L273 TraceCheckUtils]: 54: Hoare triple {3792#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3792#false} is VALID [2018-11-23 12:02:06,485 INFO L273 TraceCheckUtils]: 55: Hoare triple {3792#false} assume !(~i~0 < 100000); {3792#false} is VALID [2018-11-23 12:02:06,485 INFO L273 TraceCheckUtils]: 56: Hoare triple {3792#false} havoc ~x~0;~x~0 := 0; {3792#false} is VALID [2018-11-23 12:02:06,485 INFO L273 TraceCheckUtils]: 57: Hoare triple {3792#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3792#false} is VALID [2018-11-23 12:02:06,486 INFO L256 TraceCheckUtils]: 58: Hoare triple {3792#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {3792#false} is VALID [2018-11-23 12:02:06,486 INFO L273 TraceCheckUtils]: 59: Hoare triple {3792#false} ~cond := #in~cond; {3792#false} is VALID [2018-11-23 12:02:06,486 INFO L273 TraceCheckUtils]: 60: Hoare triple {3792#false} assume 0 == ~cond; {3792#false} is VALID [2018-11-23 12:02:06,486 INFO L273 TraceCheckUtils]: 61: Hoare triple {3792#false} assume !false; {3792#false} is VALID [2018-11-23 12:02:06,487 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-11-23 12:02:06,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:06,488 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:06,496 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:02:06,823 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:02:06,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:06,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:06,966 INFO L256 TraceCheckUtils]: 0: Hoare triple {3791#true} call ULTIMATE.init(); {3791#true} is VALID [2018-11-23 12:02:06,967 INFO L273 TraceCheckUtils]: 1: Hoare triple {3791#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3791#true} is VALID [2018-11-23 12:02:06,967 INFO L273 TraceCheckUtils]: 2: Hoare triple {3791#true} assume true; {3791#true} is VALID [2018-11-23 12:02:06,967 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3791#true} {3791#true} #76#return; {3791#true} is VALID [2018-11-23 12:02:06,968 INFO L256 TraceCheckUtils]: 4: Hoare triple {3791#true} call #t~ret7 := main(); {3791#true} is VALID [2018-11-23 12:02:06,971 INFO L273 TraceCheckUtils]: 5: Hoare triple {3791#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {3821#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:06,973 INFO L273 TraceCheckUtils]: 6: Hoare triple {3821#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3794#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:06,974 INFO L273 TraceCheckUtils]: 7: Hoare triple {3794#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3795#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:06,975 INFO L273 TraceCheckUtils]: 8: Hoare triple {3795#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3796#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:06,975 INFO L273 TraceCheckUtils]: 9: Hoare triple {3796#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3797#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:06,976 INFO L273 TraceCheckUtils]: 10: Hoare triple {3797#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3798#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:06,976 INFO L273 TraceCheckUtils]: 11: Hoare triple {3798#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3799#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:06,977 INFO L273 TraceCheckUtils]: 12: Hoare triple {3799#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3800#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:06,978 INFO L273 TraceCheckUtils]: 13: Hoare triple {3800#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3801#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:06,979 INFO L273 TraceCheckUtils]: 14: Hoare triple {3801#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3802#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:06,981 INFO L273 TraceCheckUtils]: 15: Hoare triple {3802#(<= main_~i~0 9)} assume !(~i~0 < 100000); {3792#false} is VALID [2018-11-23 12:02:06,981 INFO L273 TraceCheckUtils]: 16: Hoare triple {3792#false} ~i~0 := 0; {3792#false} is VALID [2018-11-23 12:02:06,981 INFO L273 TraceCheckUtils]: 17: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3792#false} is VALID [2018-11-23 12:02:06,981 INFO L273 TraceCheckUtils]: 18: Hoare triple {3792#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3792#false} is VALID [2018-11-23 12:02:06,982 INFO L273 TraceCheckUtils]: 19: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3792#false} is VALID [2018-11-23 12:02:06,982 INFO L273 TraceCheckUtils]: 20: Hoare triple {3792#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3792#false} is VALID [2018-11-23 12:02:06,982 INFO L273 TraceCheckUtils]: 21: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3792#false} is VALID [2018-11-23 12:02:06,982 INFO L273 TraceCheckUtils]: 22: Hoare triple {3792#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3792#false} is VALID [2018-11-23 12:02:06,982 INFO L273 TraceCheckUtils]: 23: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3792#false} is VALID [2018-11-23 12:02:06,983 INFO L273 TraceCheckUtils]: 24: Hoare triple {3792#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3792#false} is VALID [2018-11-23 12:02:06,983 INFO L273 TraceCheckUtils]: 25: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3792#false} is VALID [2018-11-23 12:02:06,983 INFO L273 TraceCheckUtils]: 26: Hoare triple {3792#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3792#false} is VALID [2018-11-23 12:02:06,983 INFO L273 TraceCheckUtils]: 27: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3792#false} is VALID [2018-11-23 12:02:06,984 INFO L273 TraceCheckUtils]: 28: Hoare triple {3792#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3792#false} is VALID [2018-11-23 12:02:06,984 INFO L273 TraceCheckUtils]: 29: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3792#false} is VALID [2018-11-23 12:02:06,984 INFO L273 TraceCheckUtils]: 30: Hoare triple {3792#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3792#false} is VALID [2018-11-23 12:02:06,984 INFO L273 TraceCheckUtils]: 31: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3792#false} is VALID [2018-11-23 12:02:06,984 INFO L273 TraceCheckUtils]: 32: Hoare triple {3792#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3792#false} is VALID [2018-11-23 12:02:06,984 INFO L273 TraceCheckUtils]: 33: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3792#false} is VALID [2018-11-23 12:02:06,985 INFO L273 TraceCheckUtils]: 34: Hoare triple {3792#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3792#false} is VALID [2018-11-23 12:02:06,985 INFO L273 TraceCheckUtils]: 35: Hoare triple {3792#false} assume !(~i~0 < 100000); {3792#false} is VALID [2018-11-23 12:02:06,985 INFO L273 TraceCheckUtils]: 36: Hoare triple {3792#false} ~i~0 := 0; {3792#false} is VALID [2018-11-23 12:02:06,985 INFO L273 TraceCheckUtils]: 37: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3792#false} is VALID [2018-11-23 12:02:06,985 INFO L273 TraceCheckUtils]: 38: Hoare triple {3792#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3792#false} is VALID [2018-11-23 12:02:06,985 INFO L273 TraceCheckUtils]: 39: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3792#false} is VALID [2018-11-23 12:02:06,985 INFO L273 TraceCheckUtils]: 40: Hoare triple {3792#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3792#false} is VALID [2018-11-23 12:02:06,985 INFO L273 TraceCheckUtils]: 41: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3792#false} is VALID [2018-11-23 12:02:06,986 INFO L273 TraceCheckUtils]: 42: Hoare triple {3792#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3792#false} is VALID [2018-11-23 12:02:06,986 INFO L273 TraceCheckUtils]: 43: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3792#false} is VALID [2018-11-23 12:02:06,986 INFO L273 TraceCheckUtils]: 44: Hoare triple {3792#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3792#false} is VALID [2018-11-23 12:02:06,986 INFO L273 TraceCheckUtils]: 45: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3792#false} is VALID [2018-11-23 12:02:06,986 INFO L273 TraceCheckUtils]: 46: Hoare triple {3792#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3792#false} is VALID [2018-11-23 12:02:06,986 INFO L273 TraceCheckUtils]: 47: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3792#false} is VALID [2018-11-23 12:02:06,986 INFO L273 TraceCheckUtils]: 48: Hoare triple {3792#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3792#false} is VALID [2018-11-23 12:02:06,987 INFO L273 TraceCheckUtils]: 49: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3792#false} is VALID [2018-11-23 12:02:06,987 INFO L273 TraceCheckUtils]: 50: Hoare triple {3792#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3792#false} is VALID [2018-11-23 12:02:06,987 INFO L273 TraceCheckUtils]: 51: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3792#false} is VALID [2018-11-23 12:02:06,987 INFO L273 TraceCheckUtils]: 52: Hoare triple {3792#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3792#false} is VALID [2018-11-23 12:02:06,987 INFO L273 TraceCheckUtils]: 53: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3792#false} is VALID [2018-11-23 12:02:06,987 INFO L273 TraceCheckUtils]: 54: Hoare triple {3792#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3792#false} is VALID [2018-11-23 12:02:06,988 INFO L273 TraceCheckUtils]: 55: Hoare triple {3792#false} assume !(~i~0 < 100000); {3792#false} is VALID [2018-11-23 12:02:06,988 INFO L273 TraceCheckUtils]: 56: Hoare triple {3792#false} havoc ~x~0;~x~0 := 0; {3792#false} is VALID [2018-11-23 12:02:06,988 INFO L273 TraceCheckUtils]: 57: Hoare triple {3792#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3792#false} is VALID [2018-11-23 12:02:06,988 INFO L256 TraceCheckUtils]: 58: Hoare triple {3792#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {3792#false} is VALID [2018-11-23 12:02:06,988 INFO L273 TraceCheckUtils]: 59: Hoare triple {3792#false} ~cond := #in~cond; {3792#false} is VALID [2018-11-23 12:02:06,988 INFO L273 TraceCheckUtils]: 60: Hoare triple {3792#false} assume 0 == ~cond; {3792#false} is VALID [2018-11-23 12:02:06,989 INFO L273 TraceCheckUtils]: 61: Hoare triple {3792#false} assume !false; {3792#false} is VALID [2018-11-23 12:02:06,991 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-11-23 12:02:07,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:07,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 12:02:07,022 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-11-23 12:02:07,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:07,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:02:07,104 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:07,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:02:07,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:02:07,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:02:07,106 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 13 states. [2018-11-23 12:02:07,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:07,614 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-11-23 12:02:07,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:02:07,614 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-11-23 12:02:07,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:07,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:02:07,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 99 transitions. [2018-11-23 12:02:07,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:02:07,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 99 transitions. [2018-11-23 12:02:07,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 99 transitions. [2018-11-23 12:02:07,724 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:07,726 INFO L225 Difference]: With dead ends: 125 [2018-11-23 12:02:07,726 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 12:02:07,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:02:07,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 12:02:07,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-11-23 12:02:07,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:07,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 72 states. [2018-11-23 12:02:07,768 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 72 states. [2018-11-23 12:02:07,769 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 72 states. [2018-11-23 12:02:07,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:07,770 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-11-23 12:02:07,771 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-11-23 12:02:07,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:07,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:07,771 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 74 states. [2018-11-23 12:02:07,772 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 74 states. [2018-11-23 12:02:07,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:07,774 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-11-23 12:02:07,774 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-11-23 12:02:07,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:07,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:07,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:07,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:07,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 12:02:07,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2018-11-23 12:02:07,777 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 62 [2018-11-23 12:02:07,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:07,777 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2018-11-23 12:02:07,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:02:07,777 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2018-11-23 12:02:07,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 12:02:07,778 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:07,779 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:07,779 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:07,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:07,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1207107598, now seen corresponding path program 10 times [2018-11-23 12:02:07,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:07,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:07,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:07,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:07,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:08,062 INFO L256 TraceCheckUtils]: 0: Hoare triple {4437#true} call ULTIMATE.init(); {4437#true} is VALID [2018-11-23 12:02:08,062 INFO L273 TraceCheckUtils]: 1: Hoare triple {4437#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4437#true} is VALID [2018-11-23 12:02:08,063 INFO L273 TraceCheckUtils]: 2: Hoare triple {4437#true} assume true; {4437#true} is VALID [2018-11-23 12:02:08,063 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4437#true} {4437#true} #76#return; {4437#true} is VALID [2018-11-23 12:02:08,063 INFO L256 TraceCheckUtils]: 4: Hoare triple {4437#true} call #t~ret7 := main(); {4437#true} is VALID [2018-11-23 12:02:08,064 INFO L273 TraceCheckUtils]: 5: Hoare triple {4437#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {4439#(= main_~i~0 0)} is VALID [2018-11-23 12:02:08,065 INFO L273 TraceCheckUtils]: 6: Hoare triple {4439#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4440#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:08,066 INFO L273 TraceCheckUtils]: 7: Hoare triple {4440#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4441#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:08,068 INFO L273 TraceCheckUtils]: 8: Hoare triple {4441#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4442#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:08,069 INFO L273 TraceCheckUtils]: 9: Hoare triple {4442#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4443#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:08,070 INFO L273 TraceCheckUtils]: 10: Hoare triple {4443#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4444#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:08,071 INFO L273 TraceCheckUtils]: 11: Hoare triple {4444#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4445#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:08,072 INFO L273 TraceCheckUtils]: 12: Hoare triple {4445#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4446#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:08,073 INFO L273 TraceCheckUtils]: 13: Hoare triple {4446#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4447#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:08,074 INFO L273 TraceCheckUtils]: 14: Hoare triple {4447#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4448#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:08,075 INFO L273 TraceCheckUtils]: 15: Hoare triple {4448#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4449#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:08,096 INFO L273 TraceCheckUtils]: 16: Hoare triple {4449#(<= main_~i~0 10)} assume !(~i~0 < 100000); {4438#false} is VALID [2018-11-23 12:02:08,096 INFO L273 TraceCheckUtils]: 17: Hoare triple {4438#false} ~i~0 := 0; {4438#false} is VALID [2018-11-23 12:02:08,096 INFO L273 TraceCheckUtils]: 18: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {4438#false} is VALID [2018-11-23 12:02:08,097 INFO L273 TraceCheckUtils]: 19: Hoare triple {4438#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4438#false} is VALID [2018-11-23 12:02:08,097 INFO L273 TraceCheckUtils]: 20: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {4438#false} is VALID [2018-11-23 12:02:08,097 INFO L273 TraceCheckUtils]: 21: Hoare triple {4438#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4438#false} is VALID [2018-11-23 12:02:08,097 INFO L273 TraceCheckUtils]: 22: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {4438#false} is VALID [2018-11-23 12:02:08,097 INFO L273 TraceCheckUtils]: 23: Hoare triple {4438#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4438#false} is VALID [2018-11-23 12:02:08,098 INFO L273 TraceCheckUtils]: 24: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {4438#false} is VALID [2018-11-23 12:02:08,098 INFO L273 TraceCheckUtils]: 25: Hoare triple {4438#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4438#false} is VALID [2018-11-23 12:02:08,098 INFO L273 TraceCheckUtils]: 26: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {4438#false} is VALID [2018-11-23 12:02:08,098 INFO L273 TraceCheckUtils]: 27: Hoare triple {4438#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4438#false} is VALID [2018-11-23 12:02:08,098 INFO L273 TraceCheckUtils]: 28: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {4438#false} is VALID [2018-11-23 12:02:08,099 INFO L273 TraceCheckUtils]: 29: Hoare triple {4438#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4438#false} is VALID [2018-11-23 12:02:08,099 INFO L273 TraceCheckUtils]: 30: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {4438#false} is VALID [2018-11-23 12:02:08,099 INFO L273 TraceCheckUtils]: 31: Hoare triple {4438#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4438#false} is VALID [2018-11-23 12:02:08,099 INFO L273 TraceCheckUtils]: 32: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {4438#false} is VALID [2018-11-23 12:02:08,100 INFO L273 TraceCheckUtils]: 33: Hoare triple {4438#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4438#false} is VALID [2018-11-23 12:02:08,100 INFO L273 TraceCheckUtils]: 34: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {4438#false} is VALID [2018-11-23 12:02:08,100 INFO L273 TraceCheckUtils]: 35: Hoare triple {4438#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4438#false} is VALID [2018-11-23 12:02:08,100 INFO L273 TraceCheckUtils]: 36: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {4438#false} is VALID [2018-11-23 12:02:08,100 INFO L273 TraceCheckUtils]: 37: Hoare triple {4438#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4438#false} is VALID [2018-11-23 12:02:08,101 INFO L273 TraceCheckUtils]: 38: Hoare triple {4438#false} assume !(~i~0 < 100000); {4438#false} is VALID [2018-11-23 12:02:08,101 INFO L273 TraceCheckUtils]: 39: Hoare triple {4438#false} ~i~0 := 0; {4438#false} is VALID [2018-11-23 12:02:08,101 INFO L273 TraceCheckUtils]: 40: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4438#false} is VALID [2018-11-23 12:02:08,101 INFO L273 TraceCheckUtils]: 41: Hoare triple {4438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4438#false} is VALID [2018-11-23 12:02:08,101 INFO L273 TraceCheckUtils]: 42: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4438#false} is VALID [2018-11-23 12:02:08,102 INFO L273 TraceCheckUtils]: 43: Hoare triple {4438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4438#false} is VALID [2018-11-23 12:02:08,102 INFO L273 TraceCheckUtils]: 44: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4438#false} is VALID [2018-11-23 12:02:08,102 INFO L273 TraceCheckUtils]: 45: Hoare triple {4438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4438#false} is VALID [2018-11-23 12:02:08,102 INFO L273 TraceCheckUtils]: 46: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4438#false} is VALID [2018-11-23 12:02:08,103 INFO L273 TraceCheckUtils]: 47: Hoare triple {4438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4438#false} is VALID [2018-11-23 12:02:08,103 INFO L273 TraceCheckUtils]: 48: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4438#false} is VALID [2018-11-23 12:02:08,103 INFO L273 TraceCheckUtils]: 49: Hoare triple {4438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4438#false} is VALID [2018-11-23 12:02:08,103 INFO L273 TraceCheckUtils]: 50: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4438#false} is VALID [2018-11-23 12:02:08,103 INFO L273 TraceCheckUtils]: 51: Hoare triple {4438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4438#false} is VALID [2018-11-23 12:02:08,104 INFO L273 TraceCheckUtils]: 52: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4438#false} is VALID [2018-11-23 12:02:08,104 INFO L273 TraceCheckUtils]: 53: Hoare triple {4438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4438#false} is VALID [2018-11-23 12:02:08,104 INFO L273 TraceCheckUtils]: 54: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4438#false} is VALID [2018-11-23 12:02:08,104 INFO L273 TraceCheckUtils]: 55: Hoare triple {4438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4438#false} is VALID [2018-11-23 12:02:08,104 INFO L273 TraceCheckUtils]: 56: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4438#false} is VALID [2018-11-23 12:02:08,105 INFO L273 TraceCheckUtils]: 57: Hoare triple {4438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4438#false} is VALID [2018-11-23 12:02:08,105 INFO L273 TraceCheckUtils]: 58: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4438#false} is VALID [2018-11-23 12:02:08,105 INFO L273 TraceCheckUtils]: 59: Hoare triple {4438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4438#false} is VALID [2018-11-23 12:02:08,105 INFO L273 TraceCheckUtils]: 60: Hoare triple {4438#false} assume !(~i~0 < 100000); {4438#false} is VALID [2018-11-23 12:02:08,105 INFO L273 TraceCheckUtils]: 61: Hoare triple {4438#false} havoc ~x~0;~x~0 := 0; {4438#false} is VALID [2018-11-23 12:02:08,106 INFO L273 TraceCheckUtils]: 62: Hoare triple {4438#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4438#false} is VALID [2018-11-23 12:02:08,106 INFO L256 TraceCheckUtils]: 63: Hoare triple {4438#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {4438#false} is VALID [2018-11-23 12:02:08,106 INFO L273 TraceCheckUtils]: 64: Hoare triple {4438#false} ~cond := #in~cond; {4438#false} is VALID [2018-11-23 12:02:08,106 INFO L273 TraceCheckUtils]: 65: Hoare triple {4438#false} assume 0 == ~cond; {4438#false} is VALID [2018-11-23 12:02:08,107 INFO L273 TraceCheckUtils]: 66: Hoare triple {4438#false} assume !false; {4438#false} is VALID [2018-11-23 12:02:08,112 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-23 12:02:08,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:08,113 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:08,128 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:02:08,168 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:02:08,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:08,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:08,404 INFO L256 TraceCheckUtils]: 0: Hoare triple {4437#true} call ULTIMATE.init(); {4437#true} is VALID [2018-11-23 12:02:08,405 INFO L273 TraceCheckUtils]: 1: Hoare triple {4437#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4437#true} is VALID [2018-11-23 12:02:08,405 INFO L273 TraceCheckUtils]: 2: Hoare triple {4437#true} assume true; {4437#true} is VALID [2018-11-23 12:02:08,405 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4437#true} {4437#true} #76#return; {4437#true} is VALID [2018-11-23 12:02:08,406 INFO L256 TraceCheckUtils]: 4: Hoare triple {4437#true} call #t~ret7 := main(); {4437#true} is VALID [2018-11-23 12:02:08,406 INFO L273 TraceCheckUtils]: 5: Hoare triple {4437#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {4437#true} is VALID [2018-11-23 12:02:08,406 INFO L273 TraceCheckUtils]: 6: Hoare triple {4437#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4437#true} is VALID [2018-11-23 12:02:08,407 INFO L273 TraceCheckUtils]: 7: Hoare triple {4437#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4437#true} is VALID [2018-11-23 12:02:08,407 INFO L273 TraceCheckUtils]: 8: Hoare triple {4437#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4437#true} is VALID [2018-11-23 12:02:08,407 INFO L273 TraceCheckUtils]: 9: Hoare triple {4437#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4437#true} is VALID [2018-11-23 12:02:08,407 INFO L273 TraceCheckUtils]: 10: Hoare triple {4437#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4437#true} is VALID [2018-11-23 12:02:08,408 INFO L273 TraceCheckUtils]: 11: Hoare triple {4437#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4437#true} is VALID [2018-11-23 12:02:08,408 INFO L273 TraceCheckUtils]: 12: Hoare triple {4437#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4437#true} is VALID [2018-11-23 12:02:08,408 INFO L273 TraceCheckUtils]: 13: Hoare triple {4437#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4437#true} is VALID [2018-11-23 12:02:08,408 INFO L273 TraceCheckUtils]: 14: Hoare triple {4437#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4437#true} is VALID [2018-11-23 12:02:08,409 INFO L273 TraceCheckUtils]: 15: Hoare triple {4437#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4437#true} is VALID [2018-11-23 12:02:08,409 INFO L273 TraceCheckUtils]: 16: Hoare triple {4437#true} assume !(~i~0 < 100000); {4437#true} is VALID [2018-11-23 12:02:08,410 INFO L273 TraceCheckUtils]: 17: Hoare triple {4437#true} ~i~0 := 0; {4504#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:08,410 INFO L273 TraceCheckUtils]: 18: Hoare triple {4504#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {4504#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:08,411 INFO L273 TraceCheckUtils]: 19: Hoare triple {4504#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4440#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:08,411 INFO L273 TraceCheckUtils]: 20: Hoare triple {4440#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {4440#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:08,412 INFO L273 TraceCheckUtils]: 21: Hoare triple {4440#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4441#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:08,412 INFO L273 TraceCheckUtils]: 22: Hoare triple {4441#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {4441#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:08,413 INFO L273 TraceCheckUtils]: 23: Hoare triple {4441#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4442#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:08,413 INFO L273 TraceCheckUtils]: 24: Hoare triple {4442#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {4442#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:08,414 INFO L273 TraceCheckUtils]: 25: Hoare triple {4442#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4443#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:08,414 INFO L273 TraceCheckUtils]: 26: Hoare triple {4443#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {4443#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:08,415 INFO L273 TraceCheckUtils]: 27: Hoare triple {4443#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4444#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:08,416 INFO L273 TraceCheckUtils]: 28: Hoare triple {4444#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {4444#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:08,416 INFO L273 TraceCheckUtils]: 29: Hoare triple {4444#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4445#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:08,417 INFO L273 TraceCheckUtils]: 30: Hoare triple {4445#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {4445#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:08,418 INFO L273 TraceCheckUtils]: 31: Hoare triple {4445#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4446#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:08,419 INFO L273 TraceCheckUtils]: 32: Hoare triple {4446#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {4446#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:08,419 INFO L273 TraceCheckUtils]: 33: Hoare triple {4446#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4447#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:08,420 INFO L273 TraceCheckUtils]: 34: Hoare triple {4447#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {4447#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:08,421 INFO L273 TraceCheckUtils]: 35: Hoare triple {4447#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4448#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:08,422 INFO L273 TraceCheckUtils]: 36: Hoare triple {4448#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {4448#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:08,423 INFO L273 TraceCheckUtils]: 37: Hoare triple {4448#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4449#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:08,423 INFO L273 TraceCheckUtils]: 38: Hoare triple {4449#(<= main_~i~0 10)} assume !(~i~0 < 100000); {4438#false} is VALID [2018-11-23 12:02:08,424 INFO L273 TraceCheckUtils]: 39: Hoare triple {4438#false} ~i~0 := 0; {4438#false} is VALID [2018-11-23 12:02:08,424 INFO L273 TraceCheckUtils]: 40: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4438#false} is VALID [2018-11-23 12:02:08,424 INFO L273 TraceCheckUtils]: 41: Hoare triple {4438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4438#false} is VALID [2018-11-23 12:02:08,424 INFO L273 TraceCheckUtils]: 42: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4438#false} is VALID [2018-11-23 12:02:08,425 INFO L273 TraceCheckUtils]: 43: Hoare triple {4438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4438#false} is VALID [2018-11-23 12:02:08,425 INFO L273 TraceCheckUtils]: 44: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4438#false} is VALID [2018-11-23 12:02:08,425 INFO L273 TraceCheckUtils]: 45: Hoare triple {4438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4438#false} is VALID [2018-11-23 12:02:08,426 INFO L273 TraceCheckUtils]: 46: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4438#false} is VALID [2018-11-23 12:02:08,426 INFO L273 TraceCheckUtils]: 47: Hoare triple {4438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4438#false} is VALID [2018-11-23 12:02:08,426 INFO L273 TraceCheckUtils]: 48: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4438#false} is VALID [2018-11-23 12:02:08,426 INFO L273 TraceCheckUtils]: 49: Hoare triple {4438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4438#false} is VALID [2018-11-23 12:02:08,427 INFO L273 TraceCheckUtils]: 50: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4438#false} is VALID [2018-11-23 12:02:08,427 INFO L273 TraceCheckUtils]: 51: Hoare triple {4438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4438#false} is VALID [2018-11-23 12:02:08,427 INFO L273 TraceCheckUtils]: 52: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4438#false} is VALID [2018-11-23 12:02:08,427 INFO L273 TraceCheckUtils]: 53: Hoare triple {4438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4438#false} is VALID [2018-11-23 12:02:08,428 INFO L273 TraceCheckUtils]: 54: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4438#false} is VALID [2018-11-23 12:02:08,428 INFO L273 TraceCheckUtils]: 55: Hoare triple {4438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4438#false} is VALID [2018-11-23 12:02:08,428 INFO L273 TraceCheckUtils]: 56: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4438#false} is VALID [2018-11-23 12:02:08,428 INFO L273 TraceCheckUtils]: 57: Hoare triple {4438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4438#false} is VALID [2018-11-23 12:02:08,429 INFO L273 TraceCheckUtils]: 58: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4438#false} is VALID [2018-11-23 12:02:08,429 INFO L273 TraceCheckUtils]: 59: Hoare triple {4438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4438#false} is VALID [2018-11-23 12:02:08,429 INFO L273 TraceCheckUtils]: 60: Hoare triple {4438#false} assume !(~i~0 < 100000); {4438#false} is VALID [2018-11-23 12:02:08,429 INFO L273 TraceCheckUtils]: 61: Hoare triple {4438#false} havoc ~x~0;~x~0 := 0; {4438#false} is VALID [2018-11-23 12:02:08,429 INFO L273 TraceCheckUtils]: 62: Hoare triple {4438#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4438#false} is VALID [2018-11-23 12:02:08,430 INFO L256 TraceCheckUtils]: 63: Hoare triple {4438#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {4438#false} is VALID [2018-11-23 12:02:08,430 INFO L273 TraceCheckUtils]: 64: Hoare triple {4438#false} ~cond := #in~cond; {4438#false} is VALID [2018-11-23 12:02:08,430 INFO L273 TraceCheckUtils]: 65: Hoare triple {4438#false} assume 0 == ~cond; {4438#false} is VALID [2018-11-23 12:02:08,430 INFO L273 TraceCheckUtils]: 66: Hoare triple {4438#false} assume !false; {4438#false} is VALID [2018-11-23 12:02:08,435 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-23 12:02:08,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:08,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 12:02:08,456 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2018-11-23 12:02:08,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:08,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:02:08,518 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:02:08,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:02:08,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:02:08,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:02:08,520 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 14 states. [2018-11-23 12:02:08,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:08,858 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2018-11-23 12:02:08,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:02:08,859 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2018-11-23 12:02:08,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:08,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:02:08,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 104 transitions. [2018-11-23 12:02:08,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:02:08,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 104 transitions. [2018-11-23 12:02:08,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 104 transitions. [2018-11-23 12:02:09,930 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:09,933 INFO L225 Difference]: With dead ends: 134 [2018-11-23 12:02:09,933 INFO L226 Difference]: Without dead ends: 79 [2018-11-23 12:02:09,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:02:09,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-23 12:02:10,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-11-23 12:02:10,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:10,056 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 77 states. [2018-11-23 12:02:10,056 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 77 states. [2018-11-23 12:02:10,057 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 77 states. [2018-11-23 12:02:10,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:10,058 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-11-23 12:02:10,058 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2018-11-23 12:02:10,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:10,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:10,059 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 79 states. [2018-11-23 12:02:10,059 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 79 states. [2018-11-23 12:02:10,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:10,060 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-11-23 12:02:10,061 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2018-11-23 12:02:10,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:10,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:10,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:10,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:10,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 12:02:10,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2018-11-23 12:02:10,063 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 67 [2018-11-23 12:02:10,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:10,064 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2018-11-23 12:02:10,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:02:10,064 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2018-11-23 12:02:10,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 12:02:10,064 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:10,065 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:10,065 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:10,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:10,065 INFO L82 PathProgramCache]: Analyzing trace with hash 2083114930, now seen corresponding path program 11 times [2018-11-23 12:02:10,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:10,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:10,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:10,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:10,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:10,283 INFO L256 TraceCheckUtils]: 0: Hoare triple {5131#true} call ULTIMATE.init(); {5131#true} is VALID [2018-11-23 12:02:10,283 INFO L273 TraceCheckUtils]: 1: Hoare triple {5131#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5131#true} is VALID [2018-11-23 12:02:10,283 INFO L273 TraceCheckUtils]: 2: Hoare triple {5131#true} assume true; {5131#true} is VALID [2018-11-23 12:02:10,284 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5131#true} {5131#true} #76#return; {5131#true} is VALID [2018-11-23 12:02:10,284 INFO L256 TraceCheckUtils]: 4: Hoare triple {5131#true} call #t~ret7 := main(); {5131#true} is VALID [2018-11-23 12:02:10,284 INFO L273 TraceCheckUtils]: 5: Hoare triple {5131#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {5133#(= main_~i~0 0)} is VALID [2018-11-23 12:02:10,285 INFO L273 TraceCheckUtils]: 6: Hoare triple {5133#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5134#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:10,286 INFO L273 TraceCheckUtils]: 7: Hoare triple {5134#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5135#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:10,286 INFO L273 TraceCheckUtils]: 8: Hoare triple {5135#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5136#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:10,287 INFO L273 TraceCheckUtils]: 9: Hoare triple {5136#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5137#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:10,288 INFO L273 TraceCheckUtils]: 10: Hoare triple {5137#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5138#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:10,289 INFO L273 TraceCheckUtils]: 11: Hoare triple {5138#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5139#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:10,290 INFO L273 TraceCheckUtils]: 12: Hoare triple {5139#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5140#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:10,291 INFO L273 TraceCheckUtils]: 13: Hoare triple {5140#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5141#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:10,291 INFO L273 TraceCheckUtils]: 14: Hoare triple {5141#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5142#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:10,292 INFO L273 TraceCheckUtils]: 15: Hoare triple {5142#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5143#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:10,293 INFO L273 TraceCheckUtils]: 16: Hoare triple {5143#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5144#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:10,294 INFO L273 TraceCheckUtils]: 17: Hoare triple {5144#(<= main_~i~0 11)} assume !(~i~0 < 100000); {5132#false} is VALID [2018-11-23 12:02:10,294 INFO L273 TraceCheckUtils]: 18: Hoare triple {5132#false} ~i~0 := 0; {5132#false} is VALID [2018-11-23 12:02:10,294 INFO L273 TraceCheckUtils]: 19: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5132#false} is VALID [2018-11-23 12:02:10,295 INFO L273 TraceCheckUtils]: 20: Hoare triple {5132#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5132#false} is VALID [2018-11-23 12:02:10,295 INFO L273 TraceCheckUtils]: 21: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5132#false} is VALID [2018-11-23 12:02:10,295 INFO L273 TraceCheckUtils]: 22: Hoare triple {5132#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5132#false} is VALID [2018-11-23 12:02:10,295 INFO L273 TraceCheckUtils]: 23: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5132#false} is VALID [2018-11-23 12:02:10,296 INFO L273 TraceCheckUtils]: 24: Hoare triple {5132#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5132#false} is VALID [2018-11-23 12:02:10,296 INFO L273 TraceCheckUtils]: 25: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5132#false} is VALID [2018-11-23 12:02:10,296 INFO L273 TraceCheckUtils]: 26: Hoare triple {5132#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5132#false} is VALID [2018-11-23 12:02:10,296 INFO L273 TraceCheckUtils]: 27: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5132#false} is VALID [2018-11-23 12:02:10,296 INFO L273 TraceCheckUtils]: 28: Hoare triple {5132#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5132#false} is VALID [2018-11-23 12:02:10,297 INFO L273 TraceCheckUtils]: 29: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5132#false} is VALID [2018-11-23 12:02:10,297 INFO L273 TraceCheckUtils]: 30: Hoare triple {5132#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5132#false} is VALID [2018-11-23 12:02:10,297 INFO L273 TraceCheckUtils]: 31: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5132#false} is VALID [2018-11-23 12:02:10,297 INFO L273 TraceCheckUtils]: 32: Hoare triple {5132#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5132#false} is VALID [2018-11-23 12:02:10,297 INFO L273 TraceCheckUtils]: 33: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5132#false} is VALID [2018-11-23 12:02:10,298 INFO L273 TraceCheckUtils]: 34: Hoare triple {5132#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5132#false} is VALID [2018-11-23 12:02:10,298 INFO L273 TraceCheckUtils]: 35: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5132#false} is VALID [2018-11-23 12:02:10,298 INFO L273 TraceCheckUtils]: 36: Hoare triple {5132#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5132#false} is VALID [2018-11-23 12:02:10,298 INFO L273 TraceCheckUtils]: 37: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5132#false} is VALID [2018-11-23 12:02:10,298 INFO L273 TraceCheckUtils]: 38: Hoare triple {5132#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5132#false} is VALID [2018-11-23 12:02:10,298 INFO L273 TraceCheckUtils]: 39: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5132#false} is VALID [2018-11-23 12:02:10,299 INFO L273 TraceCheckUtils]: 40: Hoare triple {5132#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5132#false} is VALID [2018-11-23 12:02:10,299 INFO L273 TraceCheckUtils]: 41: Hoare triple {5132#false} assume !(~i~0 < 100000); {5132#false} is VALID [2018-11-23 12:02:10,299 INFO L273 TraceCheckUtils]: 42: Hoare triple {5132#false} ~i~0 := 0; {5132#false} is VALID [2018-11-23 12:02:10,299 INFO L273 TraceCheckUtils]: 43: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5132#false} is VALID [2018-11-23 12:02:10,299 INFO L273 TraceCheckUtils]: 44: Hoare triple {5132#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5132#false} is VALID [2018-11-23 12:02:10,299 INFO L273 TraceCheckUtils]: 45: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5132#false} is VALID [2018-11-23 12:02:10,299 INFO L273 TraceCheckUtils]: 46: Hoare triple {5132#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5132#false} is VALID [2018-11-23 12:02:10,299 INFO L273 TraceCheckUtils]: 47: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5132#false} is VALID [2018-11-23 12:02:10,300 INFO L273 TraceCheckUtils]: 48: Hoare triple {5132#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5132#false} is VALID [2018-11-23 12:02:10,300 INFO L273 TraceCheckUtils]: 49: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5132#false} is VALID [2018-11-23 12:02:10,300 INFO L273 TraceCheckUtils]: 50: Hoare triple {5132#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5132#false} is VALID [2018-11-23 12:02:10,300 INFO L273 TraceCheckUtils]: 51: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5132#false} is VALID [2018-11-23 12:02:10,300 INFO L273 TraceCheckUtils]: 52: Hoare triple {5132#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5132#false} is VALID [2018-11-23 12:02:10,300 INFO L273 TraceCheckUtils]: 53: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5132#false} is VALID [2018-11-23 12:02:10,300 INFO L273 TraceCheckUtils]: 54: Hoare triple {5132#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5132#false} is VALID [2018-11-23 12:02:10,300 INFO L273 TraceCheckUtils]: 55: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5132#false} is VALID [2018-11-23 12:02:10,300 INFO L273 TraceCheckUtils]: 56: Hoare triple {5132#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5132#false} is VALID [2018-11-23 12:02:10,301 INFO L273 TraceCheckUtils]: 57: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5132#false} is VALID [2018-11-23 12:02:10,301 INFO L273 TraceCheckUtils]: 58: Hoare triple {5132#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5132#false} is VALID [2018-11-23 12:02:10,301 INFO L273 TraceCheckUtils]: 59: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5132#false} is VALID [2018-11-23 12:02:10,301 INFO L273 TraceCheckUtils]: 60: Hoare triple {5132#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5132#false} is VALID [2018-11-23 12:02:10,301 INFO L273 TraceCheckUtils]: 61: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5132#false} is VALID [2018-11-23 12:02:10,301 INFO L273 TraceCheckUtils]: 62: Hoare triple {5132#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5132#false} is VALID [2018-11-23 12:02:10,301 INFO L273 TraceCheckUtils]: 63: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5132#false} is VALID [2018-11-23 12:02:10,301 INFO L273 TraceCheckUtils]: 64: Hoare triple {5132#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5132#false} is VALID [2018-11-23 12:02:10,302 INFO L273 TraceCheckUtils]: 65: Hoare triple {5132#false} assume !(~i~0 < 100000); {5132#false} is VALID [2018-11-23 12:02:10,302 INFO L273 TraceCheckUtils]: 66: Hoare triple {5132#false} havoc ~x~0;~x~0 := 0; {5132#false} is VALID [2018-11-23 12:02:10,302 INFO L273 TraceCheckUtils]: 67: Hoare triple {5132#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5132#false} is VALID [2018-11-23 12:02:10,302 INFO L256 TraceCheckUtils]: 68: Hoare triple {5132#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {5132#false} is VALID [2018-11-23 12:02:10,302 INFO L273 TraceCheckUtils]: 69: Hoare triple {5132#false} ~cond := #in~cond; {5132#false} is VALID [2018-11-23 12:02:10,302 INFO L273 TraceCheckUtils]: 70: Hoare triple {5132#false} assume 0 == ~cond; {5132#false} is VALID [2018-11-23 12:02:10,302 INFO L273 TraceCheckUtils]: 71: Hoare triple {5132#false} assume !false; {5132#false} is VALID [2018-11-23 12:02:10,305 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-11-23 12:02:10,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:10,306 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:10,318 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:02:38,873 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 12:02:38,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:38,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:39,051 INFO L256 TraceCheckUtils]: 0: Hoare triple {5131#true} call ULTIMATE.init(); {5131#true} is VALID [2018-11-23 12:02:39,051 INFO L273 TraceCheckUtils]: 1: Hoare triple {5131#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5131#true} is VALID [2018-11-23 12:02:39,051 INFO L273 TraceCheckUtils]: 2: Hoare triple {5131#true} assume true; {5131#true} is VALID [2018-11-23 12:02:39,051 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5131#true} {5131#true} #76#return; {5131#true} is VALID [2018-11-23 12:02:39,052 INFO L256 TraceCheckUtils]: 4: Hoare triple {5131#true} call #t~ret7 := main(); {5131#true} is VALID [2018-11-23 12:02:39,052 INFO L273 TraceCheckUtils]: 5: Hoare triple {5131#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {5131#true} is VALID [2018-11-23 12:02:39,052 INFO L273 TraceCheckUtils]: 6: Hoare triple {5131#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5131#true} is VALID [2018-11-23 12:02:39,052 INFO L273 TraceCheckUtils]: 7: Hoare triple {5131#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5131#true} is VALID [2018-11-23 12:02:39,053 INFO L273 TraceCheckUtils]: 8: Hoare triple {5131#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5131#true} is VALID [2018-11-23 12:02:39,053 INFO L273 TraceCheckUtils]: 9: Hoare triple {5131#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5131#true} is VALID [2018-11-23 12:02:39,053 INFO L273 TraceCheckUtils]: 10: Hoare triple {5131#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5131#true} is VALID [2018-11-23 12:02:39,053 INFO L273 TraceCheckUtils]: 11: Hoare triple {5131#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5131#true} is VALID [2018-11-23 12:02:39,053 INFO L273 TraceCheckUtils]: 12: Hoare triple {5131#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5131#true} is VALID [2018-11-23 12:02:39,054 INFO L273 TraceCheckUtils]: 13: Hoare triple {5131#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5131#true} is VALID [2018-11-23 12:02:39,054 INFO L273 TraceCheckUtils]: 14: Hoare triple {5131#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5131#true} is VALID [2018-11-23 12:02:39,054 INFO L273 TraceCheckUtils]: 15: Hoare triple {5131#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5131#true} is VALID [2018-11-23 12:02:39,054 INFO L273 TraceCheckUtils]: 16: Hoare triple {5131#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5131#true} is VALID [2018-11-23 12:02:39,054 INFO L273 TraceCheckUtils]: 17: Hoare triple {5131#true} assume !(~i~0 < 100000); {5131#true} is VALID [2018-11-23 12:02:39,054 INFO L273 TraceCheckUtils]: 18: Hoare triple {5131#true} ~i~0 := 0; {5131#true} is VALID [2018-11-23 12:02:39,054 INFO L273 TraceCheckUtils]: 19: Hoare triple {5131#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5131#true} is VALID [2018-11-23 12:02:39,055 INFO L273 TraceCheckUtils]: 20: Hoare triple {5131#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5131#true} is VALID [2018-11-23 12:02:39,055 INFO L273 TraceCheckUtils]: 21: Hoare triple {5131#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5131#true} is VALID [2018-11-23 12:02:39,055 INFO L273 TraceCheckUtils]: 22: Hoare triple {5131#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5131#true} is VALID [2018-11-23 12:02:39,055 INFO L273 TraceCheckUtils]: 23: Hoare triple {5131#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5131#true} is VALID [2018-11-23 12:02:39,055 INFO L273 TraceCheckUtils]: 24: Hoare triple {5131#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5131#true} is VALID [2018-11-23 12:02:39,055 INFO L273 TraceCheckUtils]: 25: Hoare triple {5131#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5131#true} is VALID [2018-11-23 12:02:39,055 INFO L273 TraceCheckUtils]: 26: Hoare triple {5131#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5131#true} is VALID [2018-11-23 12:02:39,055 INFO L273 TraceCheckUtils]: 27: Hoare triple {5131#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5131#true} is VALID [2018-11-23 12:02:39,056 INFO L273 TraceCheckUtils]: 28: Hoare triple {5131#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5131#true} is VALID [2018-11-23 12:02:39,056 INFO L273 TraceCheckUtils]: 29: Hoare triple {5131#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5131#true} is VALID [2018-11-23 12:02:39,056 INFO L273 TraceCheckUtils]: 30: Hoare triple {5131#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5131#true} is VALID [2018-11-23 12:02:39,056 INFO L273 TraceCheckUtils]: 31: Hoare triple {5131#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5131#true} is VALID [2018-11-23 12:02:39,056 INFO L273 TraceCheckUtils]: 32: Hoare triple {5131#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5131#true} is VALID [2018-11-23 12:02:39,056 INFO L273 TraceCheckUtils]: 33: Hoare triple {5131#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5131#true} is VALID [2018-11-23 12:02:39,056 INFO L273 TraceCheckUtils]: 34: Hoare triple {5131#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5131#true} is VALID [2018-11-23 12:02:39,056 INFO L273 TraceCheckUtils]: 35: Hoare triple {5131#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5131#true} is VALID [2018-11-23 12:02:39,056 INFO L273 TraceCheckUtils]: 36: Hoare triple {5131#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5131#true} is VALID [2018-11-23 12:02:39,057 INFO L273 TraceCheckUtils]: 37: Hoare triple {5131#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5131#true} is VALID [2018-11-23 12:02:39,057 INFO L273 TraceCheckUtils]: 38: Hoare triple {5131#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5131#true} is VALID [2018-11-23 12:02:39,057 INFO L273 TraceCheckUtils]: 39: Hoare triple {5131#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5131#true} is VALID [2018-11-23 12:02:39,057 INFO L273 TraceCheckUtils]: 40: Hoare triple {5131#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5131#true} is VALID [2018-11-23 12:02:39,057 INFO L273 TraceCheckUtils]: 41: Hoare triple {5131#true} assume !(~i~0 < 100000); {5131#true} is VALID [2018-11-23 12:02:39,058 INFO L273 TraceCheckUtils]: 42: Hoare triple {5131#true} ~i~0 := 0; {5274#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:39,058 INFO L273 TraceCheckUtils]: 43: Hoare triple {5274#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5274#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:39,058 INFO L273 TraceCheckUtils]: 44: Hoare triple {5274#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5134#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:39,059 INFO L273 TraceCheckUtils]: 45: Hoare triple {5134#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5134#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:39,059 INFO L273 TraceCheckUtils]: 46: Hoare triple {5134#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5135#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:39,060 INFO L273 TraceCheckUtils]: 47: Hoare triple {5135#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5135#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:39,060 INFO L273 TraceCheckUtils]: 48: Hoare triple {5135#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5136#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:39,060 INFO L273 TraceCheckUtils]: 49: Hoare triple {5136#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5136#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:39,061 INFO L273 TraceCheckUtils]: 50: Hoare triple {5136#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5137#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:39,061 INFO L273 TraceCheckUtils]: 51: Hoare triple {5137#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5137#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:39,062 INFO L273 TraceCheckUtils]: 52: Hoare triple {5137#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5138#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:39,062 INFO L273 TraceCheckUtils]: 53: Hoare triple {5138#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5138#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:39,063 INFO L273 TraceCheckUtils]: 54: Hoare triple {5138#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5139#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:39,063 INFO L273 TraceCheckUtils]: 55: Hoare triple {5139#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5139#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:39,064 INFO L273 TraceCheckUtils]: 56: Hoare triple {5139#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5140#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:39,065 INFO L273 TraceCheckUtils]: 57: Hoare triple {5140#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5140#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:39,065 INFO L273 TraceCheckUtils]: 58: Hoare triple {5140#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5141#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:39,066 INFO L273 TraceCheckUtils]: 59: Hoare triple {5141#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5141#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:39,067 INFO L273 TraceCheckUtils]: 60: Hoare triple {5141#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5142#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:39,067 INFO L273 TraceCheckUtils]: 61: Hoare triple {5142#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5142#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:39,068 INFO L273 TraceCheckUtils]: 62: Hoare triple {5142#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5143#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:39,068 INFO L273 TraceCheckUtils]: 63: Hoare triple {5143#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5143#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:39,069 INFO L273 TraceCheckUtils]: 64: Hoare triple {5143#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5144#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:39,070 INFO L273 TraceCheckUtils]: 65: Hoare triple {5144#(<= main_~i~0 11)} assume !(~i~0 < 100000); {5132#false} is VALID [2018-11-23 12:02:39,070 INFO L273 TraceCheckUtils]: 66: Hoare triple {5132#false} havoc ~x~0;~x~0 := 0; {5132#false} is VALID [2018-11-23 12:02:39,070 INFO L273 TraceCheckUtils]: 67: Hoare triple {5132#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5132#false} is VALID [2018-11-23 12:02:39,071 INFO L256 TraceCheckUtils]: 68: Hoare triple {5132#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {5132#false} is VALID [2018-11-23 12:02:39,071 INFO L273 TraceCheckUtils]: 69: Hoare triple {5132#false} ~cond := #in~cond; {5132#false} is VALID [2018-11-23 12:02:39,071 INFO L273 TraceCheckUtils]: 70: Hoare triple {5132#false} assume 0 == ~cond; {5132#false} is VALID [2018-11-23 12:02:39,071 INFO L273 TraceCheckUtils]: 71: Hoare triple {5132#false} assume !false; {5132#false} is VALID [2018-11-23 12:02:39,075 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-23 12:02:39,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:39,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 12:02:39,105 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-11-23 12:02:39,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:39,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:02:39,169 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:39,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:02:39,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:02:39,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:02:39,171 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 15 states. [2018-11-23 12:02:39,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:39,876 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2018-11-23 12:02:39,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:02:39,877 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-11-23 12:02:39,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:39,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:02:39,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 109 transitions. [2018-11-23 12:02:39,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:02:39,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 109 transitions. [2018-11-23 12:02:39,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 109 transitions. [2018-11-23 12:02:40,396 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:40,398 INFO L225 Difference]: With dead ends: 143 [2018-11-23 12:02:40,398 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 12:02:40,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:02:40,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 12:02:40,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-11-23 12:02:40,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:40,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 82 states. [2018-11-23 12:02:40,454 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 82 states. [2018-11-23 12:02:40,454 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 82 states. [2018-11-23 12:02:40,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:40,456 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2018-11-23 12:02:40,457 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2018-11-23 12:02:40,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:40,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:40,457 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 84 states. [2018-11-23 12:02:40,457 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 84 states. [2018-11-23 12:02:40,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:40,459 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2018-11-23 12:02:40,459 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2018-11-23 12:02:40,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:40,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:40,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:40,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:40,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 12:02:40,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2018-11-23 12:02:40,462 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 72 [2018-11-23 12:02:40,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:40,462 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2018-11-23 12:02:40,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:02:40,463 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-11-23 12:02:40,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 12:02:40,463 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:40,464 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:40,464 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:40,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:40,464 INFO L82 PathProgramCache]: Analyzing trace with hash 385857002, now seen corresponding path program 12 times [2018-11-23 12:02:40,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:40,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:40,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:40,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:40,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:41,195 INFO L256 TraceCheckUtils]: 0: Hoare triple {5873#true} call ULTIMATE.init(); {5873#true} is VALID [2018-11-23 12:02:41,195 INFO L273 TraceCheckUtils]: 1: Hoare triple {5873#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5873#true} is VALID [2018-11-23 12:02:41,195 INFO L273 TraceCheckUtils]: 2: Hoare triple {5873#true} assume true; {5873#true} is VALID [2018-11-23 12:02:41,195 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5873#true} {5873#true} #76#return; {5873#true} is VALID [2018-11-23 12:02:41,196 INFO L256 TraceCheckUtils]: 4: Hoare triple {5873#true} call #t~ret7 := main(); {5873#true} is VALID [2018-11-23 12:02:41,196 INFO L273 TraceCheckUtils]: 5: Hoare triple {5873#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {5875#(= main_~i~0 0)} is VALID [2018-11-23 12:02:41,197 INFO L273 TraceCheckUtils]: 6: Hoare triple {5875#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5876#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:41,198 INFO L273 TraceCheckUtils]: 7: Hoare triple {5876#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5877#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:41,199 INFO L273 TraceCheckUtils]: 8: Hoare triple {5877#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5878#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:41,200 INFO L273 TraceCheckUtils]: 9: Hoare triple {5878#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5879#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:41,201 INFO L273 TraceCheckUtils]: 10: Hoare triple {5879#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5880#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:41,202 INFO L273 TraceCheckUtils]: 11: Hoare triple {5880#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5881#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:41,203 INFO L273 TraceCheckUtils]: 12: Hoare triple {5881#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5882#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:41,204 INFO L273 TraceCheckUtils]: 13: Hoare triple {5882#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5883#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:41,204 INFO L273 TraceCheckUtils]: 14: Hoare triple {5883#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5884#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:41,205 INFO L273 TraceCheckUtils]: 15: Hoare triple {5884#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5885#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:41,206 INFO L273 TraceCheckUtils]: 16: Hoare triple {5885#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5886#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:41,207 INFO L273 TraceCheckUtils]: 17: Hoare triple {5886#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5887#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:41,208 INFO L273 TraceCheckUtils]: 18: Hoare triple {5887#(<= main_~i~0 12)} assume !(~i~0 < 100000); {5874#false} is VALID [2018-11-23 12:02:41,208 INFO L273 TraceCheckUtils]: 19: Hoare triple {5874#false} ~i~0 := 0; {5874#false} is VALID [2018-11-23 12:02:41,209 INFO L273 TraceCheckUtils]: 20: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5874#false} is VALID [2018-11-23 12:02:41,209 INFO L273 TraceCheckUtils]: 21: Hoare triple {5874#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5874#false} is VALID [2018-11-23 12:02:41,209 INFO L273 TraceCheckUtils]: 22: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5874#false} is VALID [2018-11-23 12:02:41,209 INFO L273 TraceCheckUtils]: 23: Hoare triple {5874#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5874#false} is VALID [2018-11-23 12:02:41,209 INFO L273 TraceCheckUtils]: 24: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5874#false} is VALID [2018-11-23 12:02:41,210 INFO L273 TraceCheckUtils]: 25: Hoare triple {5874#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5874#false} is VALID [2018-11-23 12:02:41,210 INFO L273 TraceCheckUtils]: 26: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5874#false} is VALID [2018-11-23 12:02:41,210 INFO L273 TraceCheckUtils]: 27: Hoare triple {5874#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5874#false} is VALID [2018-11-23 12:02:41,210 INFO L273 TraceCheckUtils]: 28: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5874#false} is VALID [2018-11-23 12:02:41,210 INFO L273 TraceCheckUtils]: 29: Hoare triple {5874#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5874#false} is VALID [2018-11-23 12:02:41,211 INFO L273 TraceCheckUtils]: 30: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5874#false} is VALID [2018-11-23 12:02:41,211 INFO L273 TraceCheckUtils]: 31: Hoare triple {5874#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5874#false} is VALID [2018-11-23 12:02:41,211 INFO L273 TraceCheckUtils]: 32: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5874#false} is VALID [2018-11-23 12:02:41,211 INFO L273 TraceCheckUtils]: 33: Hoare triple {5874#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5874#false} is VALID [2018-11-23 12:02:41,211 INFO L273 TraceCheckUtils]: 34: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5874#false} is VALID [2018-11-23 12:02:41,211 INFO L273 TraceCheckUtils]: 35: Hoare triple {5874#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5874#false} is VALID [2018-11-23 12:02:41,211 INFO L273 TraceCheckUtils]: 36: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5874#false} is VALID [2018-11-23 12:02:41,212 INFO L273 TraceCheckUtils]: 37: Hoare triple {5874#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5874#false} is VALID [2018-11-23 12:02:41,212 INFO L273 TraceCheckUtils]: 38: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5874#false} is VALID [2018-11-23 12:02:41,212 INFO L273 TraceCheckUtils]: 39: Hoare triple {5874#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5874#false} is VALID [2018-11-23 12:02:41,212 INFO L273 TraceCheckUtils]: 40: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5874#false} is VALID [2018-11-23 12:02:41,212 INFO L273 TraceCheckUtils]: 41: Hoare triple {5874#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5874#false} is VALID [2018-11-23 12:02:41,212 INFO L273 TraceCheckUtils]: 42: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5874#false} is VALID [2018-11-23 12:02:41,212 INFO L273 TraceCheckUtils]: 43: Hoare triple {5874#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5874#false} is VALID [2018-11-23 12:02:41,212 INFO L273 TraceCheckUtils]: 44: Hoare triple {5874#false} assume !(~i~0 < 100000); {5874#false} is VALID [2018-11-23 12:02:41,213 INFO L273 TraceCheckUtils]: 45: Hoare triple {5874#false} ~i~0 := 0; {5874#false} is VALID [2018-11-23 12:02:41,213 INFO L273 TraceCheckUtils]: 46: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5874#false} is VALID [2018-11-23 12:02:41,213 INFO L273 TraceCheckUtils]: 47: Hoare triple {5874#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5874#false} is VALID [2018-11-23 12:02:41,213 INFO L273 TraceCheckUtils]: 48: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5874#false} is VALID [2018-11-23 12:02:41,213 INFO L273 TraceCheckUtils]: 49: Hoare triple {5874#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5874#false} is VALID [2018-11-23 12:02:41,213 INFO L273 TraceCheckUtils]: 50: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5874#false} is VALID [2018-11-23 12:02:41,213 INFO L273 TraceCheckUtils]: 51: Hoare triple {5874#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5874#false} is VALID [2018-11-23 12:02:41,213 INFO L273 TraceCheckUtils]: 52: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5874#false} is VALID [2018-11-23 12:02:41,213 INFO L273 TraceCheckUtils]: 53: Hoare triple {5874#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5874#false} is VALID [2018-11-23 12:02:41,214 INFO L273 TraceCheckUtils]: 54: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5874#false} is VALID [2018-11-23 12:02:41,214 INFO L273 TraceCheckUtils]: 55: Hoare triple {5874#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5874#false} is VALID [2018-11-23 12:02:41,214 INFO L273 TraceCheckUtils]: 56: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5874#false} is VALID [2018-11-23 12:02:41,214 INFO L273 TraceCheckUtils]: 57: Hoare triple {5874#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5874#false} is VALID [2018-11-23 12:02:41,214 INFO L273 TraceCheckUtils]: 58: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5874#false} is VALID [2018-11-23 12:02:41,214 INFO L273 TraceCheckUtils]: 59: Hoare triple {5874#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5874#false} is VALID [2018-11-23 12:02:41,214 INFO L273 TraceCheckUtils]: 60: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5874#false} is VALID [2018-11-23 12:02:41,214 INFO L273 TraceCheckUtils]: 61: Hoare triple {5874#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5874#false} is VALID [2018-11-23 12:02:41,215 INFO L273 TraceCheckUtils]: 62: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5874#false} is VALID [2018-11-23 12:02:41,215 INFO L273 TraceCheckUtils]: 63: Hoare triple {5874#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5874#false} is VALID [2018-11-23 12:02:41,215 INFO L273 TraceCheckUtils]: 64: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5874#false} is VALID [2018-11-23 12:02:41,215 INFO L273 TraceCheckUtils]: 65: Hoare triple {5874#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5874#false} is VALID [2018-11-23 12:02:41,215 INFO L273 TraceCheckUtils]: 66: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5874#false} is VALID [2018-11-23 12:02:41,215 INFO L273 TraceCheckUtils]: 67: Hoare triple {5874#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5874#false} is VALID [2018-11-23 12:02:41,215 INFO L273 TraceCheckUtils]: 68: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5874#false} is VALID [2018-11-23 12:02:41,215 INFO L273 TraceCheckUtils]: 69: Hoare triple {5874#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5874#false} is VALID [2018-11-23 12:02:41,216 INFO L273 TraceCheckUtils]: 70: Hoare triple {5874#false} assume !(~i~0 < 100000); {5874#false} is VALID [2018-11-23 12:02:41,216 INFO L273 TraceCheckUtils]: 71: Hoare triple {5874#false} havoc ~x~0;~x~0 := 0; {5874#false} is VALID [2018-11-23 12:02:41,216 INFO L273 TraceCheckUtils]: 72: Hoare triple {5874#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5874#false} is VALID [2018-11-23 12:02:41,216 INFO L256 TraceCheckUtils]: 73: Hoare triple {5874#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {5874#false} is VALID [2018-11-23 12:02:41,216 INFO L273 TraceCheckUtils]: 74: Hoare triple {5874#false} ~cond := #in~cond; {5874#false} is VALID [2018-11-23 12:02:41,216 INFO L273 TraceCheckUtils]: 75: Hoare triple {5874#false} assume 0 == ~cond; {5874#false} is VALID [2018-11-23 12:02:41,216 INFO L273 TraceCheckUtils]: 76: Hoare triple {5874#false} assume !false; {5874#false} is VALID [2018-11-23 12:02:41,219 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-11-23 12:02:41,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:41,219 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:41,227 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:02:58,303 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 12:02:58,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:58,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:58,855 INFO L256 TraceCheckUtils]: 0: Hoare triple {5873#true} call ULTIMATE.init(); {5873#true} is VALID [2018-11-23 12:02:58,856 INFO L273 TraceCheckUtils]: 1: Hoare triple {5873#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5873#true} is VALID [2018-11-23 12:02:58,856 INFO L273 TraceCheckUtils]: 2: Hoare triple {5873#true} assume true; {5873#true} is VALID [2018-11-23 12:02:58,856 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5873#true} {5873#true} #76#return; {5873#true} is VALID [2018-11-23 12:02:58,857 INFO L256 TraceCheckUtils]: 4: Hoare triple {5873#true} call #t~ret7 := main(); {5873#true} is VALID [2018-11-23 12:02:58,857 INFO L273 TraceCheckUtils]: 5: Hoare triple {5873#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {5873#true} is VALID [2018-11-23 12:02:58,857 INFO L273 TraceCheckUtils]: 6: Hoare triple {5873#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5873#true} is VALID [2018-11-23 12:02:58,857 INFO L273 TraceCheckUtils]: 7: Hoare triple {5873#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5873#true} is VALID [2018-11-23 12:02:58,857 INFO L273 TraceCheckUtils]: 8: Hoare triple {5873#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5873#true} is VALID [2018-11-23 12:02:58,857 INFO L273 TraceCheckUtils]: 9: Hoare triple {5873#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5873#true} is VALID [2018-11-23 12:02:58,858 INFO L273 TraceCheckUtils]: 10: Hoare triple {5873#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5873#true} is VALID [2018-11-23 12:02:58,858 INFO L273 TraceCheckUtils]: 11: Hoare triple {5873#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5873#true} is VALID [2018-11-23 12:02:58,858 INFO L273 TraceCheckUtils]: 12: Hoare triple {5873#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5873#true} is VALID [2018-11-23 12:02:58,858 INFO L273 TraceCheckUtils]: 13: Hoare triple {5873#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5873#true} is VALID [2018-11-23 12:02:58,858 INFO L273 TraceCheckUtils]: 14: Hoare triple {5873#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5873#true} is VALID [2018-11-23 12:02:58,858 INFO L273 TraceCheckUtils]: 15: Hoare triple {5873#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5873#true} is VALID [2018-11-23 12:02:58,858 INFO L273 TraceCheckUtils]: 16: Hoare triple {5873#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5873#true} is VALID [2018-11-23 12:02:58,859 INFO L273 TraceCheckUtils]: 17: Hoare triple {5873#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5942#(<= main_~i~0 100000)} is VALID [2018-11-23 12:02:58,859 INFO L273 TraceCheckUtils]: 18: Hoare triple {5942#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {5873#true} is VALID [2018-11-23 12:02:58,859 INFO L273 TraceCheckUtils]: 19: Hoare triple {5873#true} ~i~0 := 0; {5873#true} is VALID [2018-11-23 12:02:58,860 INFO L273 TraceCheckUtils]: 20: Hoare triple {5873#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5873#true} is VALID [2018-11-23 12:02:58,860 INFO L273 TraceCheckUtils]: 21: Hoare triple {5873#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5873#true} is VALID [2018-11-23 12:02:58,860 INFO L273 TraceCheckUtils]: 22: Hoare triple {5873#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5873#true} is VALID [2018-11-23 12:02:58,860 INFO L273 TraceCheckUtils]: 23: Hoare triple {5873#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5873#true} is VALID [2018-11-23 12:02:58,860 INFO L273 TraceCheckUtils]: 24: Hoare triple {5873#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5873#true} is VALID [2018-11-23 12:02:58,860 INFO L273 TraceCheckUtils]: 25: Hoare triple {5873#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5873#true} is VALID [2018-11-23 12:02:58,860 INFO L273 TraceCheckUtils]: 26: Hoare triple {5873#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5873#true} is VALID [2018-11-23 12:02:58,860 INFO L273 TraceCheckUtils]: 27: Hoare triple {5873#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5873#true} is VALID [2018-11-23 12:02:58,861 INFO L273 TraceCheckUtils]: 28: Hoare triple {5873#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5873#true} is VALID [2018-11-23 12:02:58,861 INFO L273 TraceCheckUtils]: 29: Hoare triple {5873#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5873#true} is VALID [2018-11-23 12:02:58,861 INFO L273 TraceCheckUtils]: 30: Hoare triple {5873#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5873#true} is VALID [2018-11-23 12:02:58,861 INFO L273 TraceCheckUtils]: 31: Hoare triple {5873#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5873#true} is VALID [2018-11-23 12:02:58,861 INFO L273 TraceCheckUtils]: 32: Hoare triple {5873#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5873#true} is VALID [2018-11-23 12:02:58,861 INFO L273 TraceCheckUtils]: 33: Hoare triple {5873#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5873#true} is VALID [2018-11-23 12:02:58,861 INFO L273 TraceCheckUtils]: 34: Hoare triple {5873#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5873#true} is VALID [2018-11-23 12:02:58,861 INFO L273 TraceCheckUtils]: 35: Hoare triple {5873#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5873#true} is VALID [2018-11-23 12:02:58,861 INFO L273 TraceCheckUtils]: 36: Hoare triple {5873#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5873#true} is VALID [2018-11-23 12:02:58,862 INFO L273 TraceCheckUtils]: 37: Hoare triple {5873#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5873#true} is VALID [2018-11-23 12:02:58,862 INFO L273 TraceCheckUtils]: 38: Hoare triple {5873#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5873#true} is VALID [2018-11-23 12:02:58,862 INFO L273 TraceCheckUtils]: 39: Hoare triple {5873#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5873#true} is VALID [2018-11-23 12:02:58,862 INFO L273 TraceCheckUtils]: 40: Hoare triple {5873#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5873#true} is VALID [2018-11-23 12:02:58,862 INFO L273 TraceCheckUtils]: 41: Hoare triple {5873#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5873#true} is VALID [2018-11-23 12:02:58,862 INFO L273 TraceCheckUtils]: 42: Hoare triple {5873#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6018#(< main_~i~0 100000)} is VALID [2018-11-23 12:02:58,863 INFO L273 TraceCheckUtils]: 43: Hoare triple {6018#(< main_~i~0 100000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5942#(<= main_~i~0 100000)} is VALID [2018-11-23 12:02:58,863 INFO L273 TraceCheckUtils]: 44: Hoare triple {5942#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {5873#true} is VALID [2018-11-23 12:02:58,863 INFO L273 TraceCheckUtils]: 45: Hoare triple {5873#true} ~i~0 := 0; {6028#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:58,864 INFO L273 TraceCheckUtils]: 46: Hoare triple {6028#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6028#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:58,864 INFO L273 TraceCheckUtils]: 47: Hoare triple {6028#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5876#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:58,865 INFO L273 TraceCheckUtils]: 48: Hoare triple {5876#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5876#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:58,865 INFO L273 TraceCheckUtils]: 49: Hoare triple {5876#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5877#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:58,865 INFO L273 TraceCheckUtils]: 50: Hoare triple {5877#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5877#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:58,866 INFO L273 TraceCheckUtils]: 51: Hoare triple {5877#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5878#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:58,866 INFO L273 TraceCheckUtils]: 52: Hoare triple {5878#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5878#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:58,867 INFO L273 TraceCheckUtils]: 53: Hoare triple {5878#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5879#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:58,867 INFO L273 TraceCheckUtils]: 54: Hoare triple {5879#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5879#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:58,868 INFO L273 TraceCheckUtils]: 55: Hoare triple {5879#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5880#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:58,869 INFO L273 TraceCheckUtils]: 56: Hoare triple {5880#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5880#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:58,869 INFO L273 TraceCheckUtils]: 57: Hoare triple {5880#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5881#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:58,870 INFO L273 TraceCheckUtils]: 58: Hoare triple {5881#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5881#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:58,871 INFO L273 TraceCheckUtils]: 59: Hoare triple {5881#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5882#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:58,871 INFO L273 TraceCheckUtils]: 60: Hoare triple {5882#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5882#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:58,872 INFO L273 TraceCheckUtils]: 61: Hoare triple {5882#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5883#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:58,873 INFO L273 TraceCheckUtils]: 62: Hoare triple {5883#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5883#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:58,873 INFO L273 TraceCheckUtils]: 63: Hoare triple {5883#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5884#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:58,874 INFO L273 TraceCheckUtils]: 64: Hoare triple {5884#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5884#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:58,875 INFO L273 TraceCheckUtils]: 65: Hoare triple {5884#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5885#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:58,875 INFO L273 TraceCheckUtils]: 66: Hoare triple {5885#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5885#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:58,876 INFO L273 TraceCheckUtils]: 67: Hoare triple {5885#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5886#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:58,876 INFO L273 TraceCheckUtils]: 68: Hoare triple {5886#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5886#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:58,877 INFO L273 TraceCheckUtils]: 69: Hoare triple {5886#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5887#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:58,878 INFO L273 TraceCheckUtils]: 70: Hoare triple {5887#(<= main_~i~0 12)} assume !(~i~0 < 100000); {5874#false} is VALID [2018-11-23 12:02:58,878 INFO L273 TraceCheckUtils]: 71: Hoare triple {5874#false} havoc ~x~0;~x~0 := 0; {5874#false} is VALID [2018-11-23 12:02:58,878 INFO L273 TraceCheckUtils]: 72: Hoare triple {5874#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5874#false} is VALID [2018-11-23 12:02:58,879 INFO L256 TraceCheckUtils]: 73: Hoare triple {5874#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {5874#false} is VALID [2018-11-23 12:02:58,879 INFO L273 TraceCheckUtils]: 74: Hoare triple {5874#false} ~cond := #in~cond; {5874#false} is VALID [2018-11-23 12:02:58,879 INFO L273 TraceCheckUtils]: 75: Hoare triple {5874#false} assume 0 == ~cond; {5874#false} is VALID [2018-11-23 12:02:58,879 INFO L273 TraceCheckUtils]: 76: Hoare triple {5874#false} assume !false; {5874#false} is VALID [2018-11-23 12:02:58,883 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 35 proven. 144 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-23 12:02:58,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:58,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 18 [2018-11-23 12:02:58,909 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-11-23 12:02:58,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:58,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:02:58,976 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 12:02:58,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:02:58,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:02:58,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:02:58,978 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 18 states. [2018-11-23 12:02:59,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:59,384 INFO L93 Difference]: Finished difference Result 155 states and 166 transitions. [2018-11-23 12:02:59,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:02:59,385 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-11-23 12:02:59,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:59,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:02:59,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 120 transitions. [2018-11-23 12:02:59,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:02:59,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 120 transitions. [2018-11-23 12:02:59,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 120 transitions. [2018-11-23 12:02:59,934 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:59,936 INFO L225 Difference]: With dead ends: 155 [2018-11-23 12:02:59,936 INFO L226 Difference]: Without dead ends: 92 [2018-11-23 12:02:59,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:02:59,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-23 12:02:59,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-11-23 12:02:59,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:59,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 92 states. [2018-11-23 12:02:59,975 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2018-11-23 12:02:59,975 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2018-11-23 12:02:59,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:59,978 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2018-11-23 12:02:59,978 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-11-23 12:02:59,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:59,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:59,979 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2018-11-23 12:02:59,979 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2018-11-23 12:02:59,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:59,981 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2018-11-23 12:02:59,981 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-11-23 12:02:59,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:59,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:59,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:59,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:59,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-23 12:02:59,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2018-11-23 12:02:59,984 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 77 [2018-11-23 12:02:59,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:59,985 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2018-11-23 12:02:59,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:02:59,985 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-11-23 12:02:59,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-23 12:02:59,986 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:59,986 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:59,986 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:59,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:59,987 INFO L82 PathProgramCache]: Analyzing trace with hash -535424030, now seen corresponding path program 13 times [2018-11-23 12:02:59,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:59,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:59,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:59,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:59,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:00,808 INFO L256 TraceCheckUtils]: 0: Hoare triple {6685#true} call ULTIMATE.init(); {6685#true} is VALID [2018-11-23 12:03:00,808 INFO L273 TraceCheckUtils]: 1: Hoare triple {6685#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6685#true} is VALID [2018-11-23 12:03:00,810 INFO L273 TraceCheckUtils]: 2: Hoare triple {6685#true} assume true; {6685#true} is VALID [2018-11-23 12:03:00,810 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6685#true} {6685#true} #76#return; {6685#true} is VALID [2018-11-23 12:03:00,811 INFO L256 TraceCheckUtils]: 4: Hoare triple {6685#true} call #t~ret7 := main(); {6685#true} is VALID [2018-11-23 12:03:00,811 INFO L273 TraceCheckUtils]: 5: Hoare triple {6685#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {6687#(= main_~i~0 0)} is VALID [2018-11-23 12:03:00,812 INFO L273 TraceCheckUtils]: 6: Hoare triple {6687#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6688#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:00,813 INFO L273 TraceCheckUtils]: 7: Hoare triple {6688#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6689#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:00,814 INFO L273 TraceCheckUtils]: 8: Hoare triple {6689#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6690#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:00,814 INFO L273 TraceCheckUtils]: 9: Hoare triple {6690#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6691#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:00,815 INFO L273 TraceCheckUtils]: 10: Hoare triple {6691#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6692#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:00,816 INFO L273 TraceCheckUtils]: 11: Hoare triple {6692#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6693#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:00,817 INFO L273 TraceCheckUtils]: 12: Hoare triple {6693#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6694#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:00,818 INFO L273 TraceCheckUtils]: 13: Hoare triple {6694#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6695#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:00,819 INFO L273 TraceCheckUtils]: 14: Hoare triple {6695#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6696#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:00,820 INFO L273 TraceCheckUtils]: 15: Hoare triple {6696#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6697#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:00,821 INFO L273 TraceCheckUtils]: 16: Hoare triple {6697#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6698#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:00,822 INFO L273 TraceCheckUtils]: 17: Hoare triple {6698#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6699#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:00,823 INFO L273 TraceCheckUtils]: 18: Hoare triple {6699#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6700#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:00,823 INFO L273 TraceCheckUtils]: 19: Hoare triple {6700#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6701#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:00,824 INFO L273 TraceCheckUtils]: 20: Hoare triple {6701#(<= main_~i~0 14)} assume !(~i~0 < 100000); {6686#false} is VALID [2018-11-23 12:03:00,824 INFO L273 TraceCheckUtils]: 21: Hoare triple {6686#false} ~i~0 := 0; {6686#false} is VALID [2018-11-23 12:03:00,825 INFO L273 TraceCheckUtils]: 22: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6686#false} is VALID [2018-11-23 12:03:00,825 INFO L273 TraceCheckUtils]: 23: Hoare triple {6686#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6686#false} is VALID [2018-11-23 12:03:00,825 INFO L273 TraceCheckUtils]: 24: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6686#false} is VALID [2018-11-23 12:03:00,825 INFO L273 TraceCheckUtils]: 25: Hoare triple {6686#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6686#false} is VALID [2018-11-23 12:03:00,825 INFO L273 TraceCheckUtils]: 26: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6686#false} is VALID [2018-11-23 12:03:00,826 INFO L273 TraceCheckUtils]: 27: Hoare triple {6686#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6686#false} is VALID [2018-11-23 12:03:00,826 INFO L273 TraceCheckUtils]: 28: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6686#false} is VALID [2018-11-23 12:03:00,826 INFO L273 TraceCheckUtils]: 29: Hoare triple {6686#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6686#false} is VALID [2018-11-23 12:03:00,826 INFO L273 TraceCheckUtils]: 30: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6686#false} is VALID [2018-11-23 12:03:00,827 INFO L273 TraceCheckUtils]: 31: Hoare triple {6686#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6686#false} is VALID [2018-11-23 12:03:00,827 INFO L273 TraceCheckUtils]: 32: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6686#false} is VALID [2018-11-23 12:03:00,827 INFO L273 TraceCheckUtils]: 33: Hoare triple {6686#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6686#false} is VALID [2018-11-23 12:03:00,827 INFO L273 TraceCheckUtils]: 34: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6686#false} is VALID [2018-11-23 12:03:00,827 INFO L273 TraceCheckUtils]: 35: Hoare triple {6686#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6686#false} is VALID [2018-11-23 12:03:00,828 INFO L273 TraceCheckUtils]: 36: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6686#false} is VALID [2018-11-23 12:03:00,828 INFO L273 TraceCheckUtils]: 37: Hoare triple {6686#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6686#false} is VALID [2018-11-23 12:03:00,828 INFO L273 TraceCheckUtils]: 38: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6686#false} is VALID [2018-11-23 12:03:00,828 INFO L273 TraceCheckUtils]: 39: Hoare triple {6686#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6686#false} is VALID [2018-11-23 12:03:00,828 INFO L273 TraceCheckUtils]: 40: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6686#false} is VALID [2018-11-23 12:03:00,829 INFO L273 TraceCheckUtils]: 41: Hoare triple {6686#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6686#false} is VALID [2018-11-23 12:03:00,829 INFO L273 TraceCheckUtils]: 42: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6686#false} is VALID [2018-11-23 12:03:00,829 INFO L273 TraceCheckUtils]: 43: Hoare triple {6686#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6686#false} is VALID [2018-11-23 12:03:00,829 INFO L273 TraceCheckUtils]: 44: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6686#false} is VALID [2018-11-23 12:03:00,829 INFO L273 TraceCheckUtils]: 45: Hoare triple {6686#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6686#false} is VALID [2018-11-23 12:03:00,830 INFO L273 TraceCheckUtils]: 46: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6686#false} is VALID [2018-11-23 12:03:00,830 INFO L273 TraceCheckUtils]: 47: Hoare triple {6686#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6686#false} is VALID [2018-11-23 12:03:00,830 INFO L273 TraceCheckUtils]: 48: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6686#false} is VALID [2018-11-23 12:03:00,830 INFO L273 TraceCheckUtils]: 49: Hoare triple {6686#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6686#false} is VALID [2018-11-23 12:03:00,830 INFO L273 TraceCheckUtils]: 50: Hoare triple {6686#false} assume !(~i~0 < 100000); {6686#false} is VALID [2018-11-23 12:03:00,830 INFO L273 TraceCheckUtils]: 51: Hoare triple {6686#false} ~i~0 := 0; {6686#false} is VALID [2018-11-23 12:03:00,830 INFO L273 TraceCheckUtils]: 52: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6686#false} is VALID [2018-11-23 12:03:00,831 INFO L273 TraceCheckUtils]: 53: Hoare triple {6686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6686#false} is VALID [2018-11-23 12:03:00,831 INFO L273 TraceCheckUtils]: 54: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6686#false} is VALID [2018-11-23 12:03:00,831 INFO L273 TraceCheckUtils]: 55: Hoare triple {6686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6686#false} is VALID [2018-11-23 12:03:00,831 INFO L273 TraceCheckUtils]: 56: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6686#false} is VALID [2018-11-23 12:03:00,831 INFO L273 TraceCheckUtils]: 57: Hoare triple {6686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6686#false} is VALID [2018-11-23 12:03:00,831 INFO L273 TraceCheckUtils]: 58: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6686#false} is VALID [2018-11-23 12:03:00,831 INFO L273 TraceCheckUtils]: 59: Hoare triple {6686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6686#false} is VALID [2018-11-23 12:03:00,831 INFO L273 TraceCheckUtils]: 60: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6686#false} is VALID [2018-11-23 12:03:00,832 INFO L273 TraceCheckUtils]: 61: Hoare triple {6686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6686#false} is VALID [2018-11-23 12:03:00,832 INFO L273 TraceCheckUtils]: 62: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6686#false} is VALID [2018-11-23 12:03:00,832 INFO L273 TraceCheckUtils]: 63: Hoare triple {6686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6686#false} is VALID [2018-11-23 12:03:00,832 INFO L273 TraceCheckUtils]: 64: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6686#false} is VALID [2018-11-23 12:03:00,832 INFO L273 TraceCheckUtils]: 65: Hoare triple {6686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6686#false} is VALID [2018-11-23 12:03:00,832 INFO L273 TraceCheckUtils]: 66: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6686#false} is VALID [2018-11-23 12:03:00,832 INFO L273 TraceCheckUtils]: 67: Hoare triple {6686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6686#false} is VALID [2018-11-23 12:03:00,832 INFO L273 TraceCheckUtils]: 68: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6686#false} is VALID [2018-11-23 12:03:00,833 INFO L273 TraceCheckUtils]: 69: Hoare triple {6686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6686#false} is VALID [2018-11-23 12:03:00,833 INFO L273 TraceCheckUtils]: 70: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6686#false} is VALID [2018-11-23 12:03:00,833 INFO L273 TraceCheckUtils]: 71: Hoare triple {6686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6686#false} is VALID [2018-11-23 12:03:00,833 INFO L273 TraceCheckUtils]: 72: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6686#false} is VALID [2018-11-23 12:03:00,833 INFO L273 TraceCheckUtils]: 73: Hoare triple {6686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6686#false} is VALID [2018-11-23 12:03:00,833 INFO L273 TraceCheckUtils]: 74: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6686#false} is VALID [2018-11-23 12:03:00,833 INFO L273 TraceCheckUtils]: 75: Hoare triple {6686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6686#false} is VALID [2018-11-23 12:03:00,833 INFO L273 TraceCheckUtils]: 76: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6686#false} is VALID [2018-11-23 12:03:00,833 INFO L273 TraceCheckUtils]: 77: Hoare triple {6686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6686#false} is VALID [2018-11-23 12:03:00,834 INFO L273 TraceCheckUtils]: 78: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6686#false} is VALID [2018-11-23 12:03:00,834 INFO L273 TraceCheckUtils]: 79: Hoare triple {6686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6686#false} is VALID [2018-11-23 12:03:00,834 INFO L273 TraceCheckUtils]: 80: Hoare triple {6686#false} assume !(~i~0 < 100000); {6686#false} is VALID [2018-11-23 12:03:00,834 INFO L273 TraceCheckUtils]: 81: Hoare triple {6686#false} havoc ~x~0;~x~0 := 0; {6686#false} is VALID [2018-11-23 12:03:00,834 INFO L273 TraceCheckUtils]: 82: Hoare triple {6686#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {6686#false} is VALID [2018-11-23 12:03:00,834 INFO L256 TraceCheckUtils]: 83: Hoare triple {6686#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {6686#false} is VALID [2018-11-23 12:03:00,834 INFO L273 TraceCheckUtils]: 84: Hoare triple {6686#false} ~cond := #in~cond; {6686#false} is VALID [2018-11-23 12:03:00,834 INFO L273 TraceCheckUtils]: 85: Hoare triple {6686#false} assume 0 == ~cond; {6686#false} is VALID [2018-11-23 12:03:00,835 INFO L273 TraceCheckUtils]: 86: Hoare triple {6686#false} assume !false; {6686#false} is VALID [2018-11-23 12:03:00,838 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-23 12:03:00,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:00,838 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:03:00,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:03:00,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:00,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:01,109 INFO L256 TraceCheckUtils]: 0: Hoare triple {6685#true} call ULTIMATE.init(); {6685#true} is VALID [2018-11-23 12:03:01,110 INFO L273 TraceCheckUtils]: 1: Hoare triple {6685#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6685#true} is VALID [2018-11-23 12:03:01,110 INFO L273 TraceCheckUtils]: 2: Hoare triple {6685#true} assume true; {6685#true} is VALID [2018-11-23 12:03:01,110 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6685#true} {6685#true} #76#return; {6685#true} is VALID [2018-11-23 12:03:01,111 INFO L256 TraceCheckUtils]: 4: Hoare triple {6685#true} call #t~ret7 := main(); {6685#true} is VALID [2018-11-23 12:03:01,112 INFO L273 TraceCheckUtils]: 5: Hoare triple {6685#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {6720#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:01,112 INFO L273 TraceCheckUtils]: 6: Hoare triple {6720#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6688#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:01,113 INFO L273 TraceCheckUtils]: 7: Hoare triple {6688#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6689#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:01,113 INFO L273 TraceCheckUtils]: 8: Hoare triple {6689#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6690#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:01,114 INFO L273 TraceCheckUtils]: 9: Hoare triple {6690#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6691#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:01,115 INFO L273 TraceCheckUtils]: 10: Hoare triple {6691#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6692#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:01,116 INFO L273 TraceCheckUtils]: 11: Hoare triple {6692#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6693#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:01,117 INFO L273 TraceCheckUtils]: 12: Hoare triple {6693#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6694#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:01,118 INFO L273 TraceCheckUtils]: 13: Hoare triple {6694#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6695#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:01,119 INFO L273 TraceCheckUtils]: 14: Hoare triple {6695#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6696#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:01,120 INFO L273 TraceCheckUtils]: 15: Hoare triple {6696#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6697#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:01,121 INFO L273 TraceCheckUtils]: 16: Hoare triple {6697#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6698#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:01,122 INFO L273 TraceCheckUtils]: 17: Hoare triple {6698#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6699#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:01,123 INFO L273 TraceCheckUtils]: 18: Hoare triple {6699#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6700#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:01,124 INFO L273 TraceCheckUtils]: 19: Hoare triple {6700#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6701#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:01,124 INFO L273 TraceCheckUtils]: 20: Hoare triple {6701#(<= main_~i~0 14)} assume !(~i~0 < 100000); {6686#false} is VALID [2018-11-23 12:03:01,125 INFO L273 TraceCheckUtils]: 21: Hoare triple {6686#false} ~i~0 := 0; {6686#false} is VALID [2018-11-23 12:03:01,125 INFO L273 TraceCheckUtils]: 22: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6686#false} is VALID [2018-11-23 12:03:01,125 INFO L273 TraceCheckUtils]: 23: Hoare triple {6686#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6686#false} is VALID [2018-11-23 12:03:01,125 INFO L273 TraceCheckUtils]: 24: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6686#false} is VALID [2018-11-23 12:03:01,125 INFO L273 TraceCheckUtils]: 25: Hoare triple {6686#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6686#false} is VALID [2018-11-23 12:03:01,126 INFO L273 TraceCheckUtils]: 26: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6686#false} is VALID [2018-11-23 12:03:01,126 INFO L273 TraceCheckUtils]: 27: Hoare triple {6686#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6686#false} is VALID [2018-11-23 12:03:01,126 INFO L273 TraceCheckUtils]: 28: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6686#false} is VALID [2018-11-23 12:03:01,126 INFO L273 TraceCheckUtils]: 29: Hoare triple {6686#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6686#false} is VALID [2018-11-23 12:03:01,127 INFO L273 TraceCheckUtils]: 30: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6686#false} is VALID [2018-11-23 12:03:01,127 INFO L273 TraceCheckUtils]: 31: Hoare triple {6686#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6686#false} is VALID [2018-11-23 12:03:01,127 INFO L273 TraceCheckUtils]: 32: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6686#false} is VALID [2018-11-23 12:03:01,127 INFO L273 TraceCheckUtils]: 33: Hoare triple {6686#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6686#false} is VALID [2018-11-23 12:03:01,127 INFO L273 TraceCheckUtils]: 34: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6686#false} is VALID [2018-11-23 12:03:01,128 INFO L273 TraceCheckUtils]: 35: Hoare triple {6686#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6686#false} is VALID [2018-11-23 12:03:01,128 INFO L273 TraceCheckUtils]: 36: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6686#false} is VALID [2018-11-23 12:03:01,128 INFO L273 TraceCheckUtils]: 37: Hoare triple {6686#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6686#false} is VALID [2018-11-23 12:03:01,129 INFO L273 TraceCheckUtils]: 38: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6686#false} is VALID [2018-11-23 12:03:01,129 INFO L273 TraceCheckUtils]: 39: Hoare triple {6686#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6686#false} is VALID [2018-11-23 12:03:01,129 INFO L273 TraceCheckUtils]: 40: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6686#false} is VALID [2018-11-23 12:03:01,129 INFO L273 TraceCheckUtils]: 41: Hoare triple {6686#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6686#false} is VALID [2018-11-23 12:03:01,129 INFO L273 TraceCheckUtils]: 42: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6686#false} is VALID [2018-11-23 12:03:01,130 INFO L273 TraceCheckUtils]: 43: Hoare triple {6686#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6686#false} is VALID [2018-11-23 12:03:01,130 INFO L273 TraceCheckUtils]: 44: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6686#false} is VALID [2018-11-23 12:03:01,130 INFO L273 TraceCheckUtils]: 45: Hoare triple {6686#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6686#false} is VALID [2018-11-23 12:03:01,130 INFO L273 TraceCheckUtils]: 46: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6686#false} is VALID [2018-11-23 12:03:01,130 INFO L273 TraceCheckUtils]: 47: Hoare triple {6686#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6686#false} is VALID [2018-11-23 12:03:01,130 INFO L273 TraceCheckUtils]: 48: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6686#false} is VALID [2018-11-23 12:03:01,131 INFO L273 TraceCheckUtils]: 49: Hoare triple {6686#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6686#false} is VALID [2018-11-23 12:03:01,131 INFO L273 TraceCheckUtils]: 50: Hoare triple {6686#false} assume !(~i~0 < 100000); {6686#false} is VALID [2018-11-23 12:03:01,131 INFO L273 TraceCheckUtils]: 51: Hoare triple {6686#false} ~i~0 := 0; {6686#false} is VALID [2018-11-23 12:03:01,131 INFO L273 TraceCheckUtils]: 52: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6686#false} is VALID [2018-11-23 12:03:01,131 INFO L273 TraceCheckUtils]: 53: Hoare triple {6686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6686#false} is VALID [2018-11-23 12:03:01,131 INFO L273 TraceCheckUtils]: 54: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6686#false} is VALID [2018-11-23 12:03:01,132 INFO L273 TraceCheckUtils]: 55: Hoare triple {6686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6686#false} is VALID [2018-11-23 12:03:01,132 INFO L273 TraceCheckUtils]: 56: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6686#false} is VALID [2018-11-23 12:03:01,132 INFO L273 TraceCheckUtils]: 57: Hoare triple {6686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6686#false} is VALID [2018-11-23 12:03:01,132 INFO L273 TraceCheckUtils]: 58: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6686#false} is VALID [2018-11-23 12:03:01,132 INFO L273 TraceCheckUtils]: 59: Hoare triple {6686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6686#false} is VALID [2018-11-23 12:03:01,132 INFO L273 TraceCheckUtils]: 60: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6686#false} is VALID [2018-11-23 12:03:01,132 INFO L273 TraceCheckUtils]: 61: Hoare triple {6686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6686#false} is VALID [2018-11-23 12:03:01,133 INFO L273 TraceCheckUtils]: 62: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6686#false} is VALID [2018-11-23 12:03:01,133 INFO L273 TraceCheckUtils]: 63: Hoare triple {6686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6686#false} is VALID [2018-11-23 12:03:01,133 INFO L273 TraceCheckUtils]: 64: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6686#false} is VALID [2018-11-23 12:03:01,133 INFO L273 TraceCheckUtils]: 65: Hoare triple {6686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6686#false} is VALID [2018-11-23 12:03:01,133 INFO L273 TraceCheckUtils]: 66: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6686#false} is VALID [2018-11-23 12:03:01,133 INFO L273 TraceCheckUtils]: 67: Hoare triple {6686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6686#false} is VALID [2018-11-23 12:03:01,134 INFO L273 TraceCheckUtils]: 68: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6686#false} is VALID [2018-11-23 12:03:01,134 INFO L273 TraceCheckUtils]: 69: Hoare triple {6686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6686#false} is VALID [2018-11-23 12:03:01,134 INFO L273 TraceCheckUtils]: 70: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6686#false} is VALID [2018-11-23 12:03:01,134 INFO L273 TraceCheckUtils]: 71: Hoare triple {6686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6686#false} is VALID [2018-11-23 12:03:01,134 INFO L273 TraceCheckUtils]: 72: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6686#false} is VALID [2018-11-23 12:03:01,134 INFO L273 TraceCheckUtils]: 73: Hoare triple {6686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6686#false} is VALID [2018-11-23 12:03:01,135 INFO L273 TraceCheckUtils]: 74: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6686#false} is VALID [2018-11-23 12:03:01,135 INFO L273 TraceCheckUtils]: 75: Hoare triple {6686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6686#false} is VALID [2018-11-23 12:03:01,135 INFO L273 TraceCheckUtils]: 76: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6686#false} is VALID [2018-11-23 12:03:01,135 INFO L273 TraceCheckUtils]: 77: Hoare triple {6686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6686#false} is VALID [2018-11-23 12:03:01,135 INFO L273 TraceCheckUtils]: 78: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6686#false} is VALID [2018-11-23 12:03:01,135 INFO L273 TraceCheckUtils]: 79: Hoare triple {6686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6686#false} is VALID [2018-11-23 12:03:01,136 INFO L273 TraceCheckUtils]: 80: Hoare triple {6686#false} assume !(~i~0 < 100000); {6686#false} is VALID [2018-11-23 12:03:01,136 INFO L273 TraceCheckUtils]: 81: Hoare triple {6686#false} havoc ~x~0;~x~0 := 0; {6686#false} is VALID [2018-11-23 12:03:01,136 INFO L273 TraceCheckUtils]: 82: Hoare triple {6686#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {6686#false} is VALID [2018-11-23 12:03:01,136 INFO L256 TraceCheckUtils]: 83: Hoare triple {6686#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {6686#false} is VALID [2018-11-23 12:03:01,136 INFO L273 TraceCheckUtils]: 84: Hoare triple {6686#false} ~cond := #in~cond; {6686#false} is VALID [2018-11-23 12:03:01,136 INFO L273 TraceCheckUtils]: 85: Hoare triple {6686#false} assume 0 == ~cond; {6686#false} is VALID [2018-11-23 12:03:01,137 INFO L273 TraceCheckUtils]: 86: Hoare triple {6686#false} assume !false; {6686#false} is VALID [2018-11-23 12:03:01,141 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-23 12:03:01,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:01,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:03:01,165 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-11-23 12:03:01,165 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:01,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:03:01,213 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:01,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:03:01,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:03:01,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:03:01,215 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 18 states. [2018-11-23 12:03:01,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:01,846 INFO L93 Difference]: Finished difference Result 170 states and 178 transitions. [2018-11-23 12:03:01,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:03:01,846 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-11-23 12:03:01,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:01,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:03:01,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 124 transitions. [2018-11-23 12:03:01,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:03:01,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 124 transitions. [2018-11-23 12:03:01,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 124 transitions. [2018-11-23 12:03:02,396 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:02,398 INFO L225 Difference]: With dead ends: 170 [2018-11-23 12:03:02,399 INFO L226 Difference]: Without dead ends: 99 [2018-11-23 12:03:02,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:03:02,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-23 12:03:02,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2018-11-23 12:03:02,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:02,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 97 states. [2018-11-23 12:03:02,628 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 97 states. [2018-11-23 12:03:02,628 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 97 states. [2018-11-23 12:03:02,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:02,631 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2018-11-23 12:03:02,631 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2018-11-23 12:03:02,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:02,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:02,632 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 99 states. [2018-11-23 12:03:02,632 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 99 states. [2018-11-23 12:03:02,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:02,634 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2018-11-23 12:03:02,635 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2018-11-23 12:03:02,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:02,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:02,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:02,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:02,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-23 12:03:02,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2018-11-23 12:03:02,638 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 87 [2018-11-23 12:03:02,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:02,639 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2018-11-23 12:03:02,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:03:02,639 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2018-11-23 12:03:02,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-23 12:03:02,640 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:02,640 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:02,640 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:02,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:02,641 INFO L82 PathProgramCache]: Analyzing trace with hash -422313566, now seen corresponding path program 14 times [2018-11-23 12:03:02,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:02,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:02,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:02,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:03:02,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:03,856 INFO L256 TraceCheckUtils]: 0: Hoare triple {7571#true} call ULTIMATE.init(); {7571#true} is VALID [2018-11-23 12:03:03,857 INFO L273 TraceCheckUtils]: 1: Hoare triple {7571#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7571#true} is VALID [2018-11-23 12:03:03,857 INFO L273 TraceCheckUtils]: 2: Hoare triple {7571#true} assume true; {7571#true} is VALID [2018-11-23 12:03:03,857 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7571#true} {7571#true} #76#return; {7571#true} is VALID [2018-11-23 12:03:03,857 INFO L256 TraceCheckUtils]: 4: Hoare triple {7571#true} call #t~ret7 := main(); {7571#true} is VALID [2018-11-23 12:03:03,858 INFO L273 TraceCheckUtils]: 5: Hoare triple {7571#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {7573#(= main_~i~0 0)} is VALID [2018-11-23 12:03:03,858 INFO L273 TraceCheckUtils]: 6: Hoare triple {7573#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7574#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:03,859 INFO L273 TraceCheckUtils]: 7: Hoare triple {7574#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7575#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:03,860 INFO L273 TraceCheckUtils]: 8: Hoare triple {7575#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7576#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:03,861 INFO L273 TraceCheckUtils]: 9: Hoare triple {7576#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7577#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:03,862 INFO L273 TraceCheckUtils]: 10: Hoare triple {7577#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7578#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:03,863 INFO L273 TraceCheckUtils]: 11: Hoare triple {7578#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7579#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:03,864 INFO L273 TraceCheckUtils]: 12: Hoare triple {7579#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7580#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:03,865 INFO L273 TraceCheckUtils]: 13: Hoare triple {7580#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7581#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:03,866 INFO L273 TraceCheckUtils]: 14: Hoare triple {7581#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7582#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:03,867 INFO L273 TraceCheckUtils]: 15: Hoare triple {7582#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7583#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:03,868 INFO L273 TraceCheckUtils]: 16: Hoare triple {7583#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7584#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:03,869 INFO L273 TraceCheckUtils]: 17: Hoare triple {7584#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7585#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:03,870 INFO L273 TraceCheckUtils]: 18: Hoare triple {7585#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7586#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:03,871 INFO L273 TraceCheckUtils]: 19: Hoare triple {7586#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7587#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:03,872 INFO L273 TraceCheckUtils]: 20: Hoare triple {7587#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7588#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:03,873 INFO L273 TraceCheckUtils]: 21: Hoare triple {7588#(<= main_~i~0 15)} assume !(~i~0 < 100000); {7572#false} is VALID [2018-11-23 12:03:03,874 INFO L273 TraceCheckUtils]: 22: Hoare triple {7572#false} ~i~0 := 0; {7572#false} is VALID [2018-11-23 12:03:03,874 INFO L273 TraceCheckUtils]: 23: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7572#false} is VALID [2018-11-23 12:03:03,874 INFO L273 TraceCheckUtils]: 24: Hoare triple {7572#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7572#false} is VALID [2018-11-23 12:03:03,874 INFO L273 TraceCheckUtils]: 25: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7572#false} is VALID [2018-11-23 12:03:03,875 INFO L273 TraceCheckUtils]: 26: Hoare triple {7572#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7572#false} is VALID [2018-11-23 12:03:03,875 INFO L273 TraceCheckUtils]: 27: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7572#false} is VALID [2018-11-23 12:03:03,875 INFO L273 TraceCheckUtils]: 28: Hoare triple {7572#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7572#false} is VALID [2018-11-23 12:03:03,875 INFO L273 TraceCheckUtils]: 29: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7572#false} is VALID [2018-11-23 12:03:03,876 INFO L273 TraceCheckUtils]: 30: Hoare triple {7572#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7572#false} is VALID [2018-11-23 12:03:03,876 INFO L273 TraceCheckUtils]: 31: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7572#false} is VALID [2018-11-23 12:03:03,876 INFO L273 TraceCheckUtils]: 32: Hoare triple {7572#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7572#false} is VALID [2018-11-23 12:03:03,876 INFO L273 TraceCheckUtils]: 33: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7572#false} is VALID [2018-11-23 12:03:03,876 INFO L273 TraceCheckUtils]: 34: Hoare triple {7572#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7572#false} is VALID [2018-11-23 12:03:03,876 INFO L273 TraceCheckUtils]: 35: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7572#false} is VALID [2018-11-23 12:03:03,877 INFO L273 TraceCheckUtils]: 36: Hoare triple {7572#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7572#false} is VALID [2018-11-23 12:03:03,877 INFO L273 TraceCheckUtils]: 37: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7572#false} is VALID [2018-11-23 12:03:03,877 INFO L273 TraceCheckUtils]: 38: Hoare triple {7572#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7572#false} is VALID [2018-11-23 12:03:03,877 INFO L273 TraceCheckUtils]: 39: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7572#false} is VALID [2018-11-23 12:03:03,877 INFO L273 TraceCheckUtils]: 40: Hoare triple {7572#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7572#false} is VALID [2018-11-23 12:03:03,877 INFO L273 TraceCheckUtils]: 41: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7572#false} is VALID [2018-11-23 12:03:03,878 INFO L273 TraceCheckUtils]: 42: Hoare triple {7572#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7572#false} is VALID [2018-11-23 12:03:03,878 INFO L273 TraceCheckUtils]: 43: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7572#false} is VALID [2018-11-23 12:03:03,878 INFO L273 TraceCheckUtils]: 44: Hoare triple {7572#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7572#false} is VALID [2018-11-23 12:03:03,878 INFO L273 TraceCheckUtils]: 45: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7572#false} is VALID [2018-11-23 12:03:03,878 INFO L273 TraceCheckUtils]: 46: Hoare triple {7572#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7572#false} is VALID [2018-11-23 12:03:03,878 INFO L273 TraceCheckUtils]: 47: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7572#false} is VALID [2018-11-23 12:03:03,878 INFO L273 TraceCheckUtils]: 48: Hoare triple {7572#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7572#false} is VALID [2018-11-23 12:03:03,879 INFO L273 TraceCheckUtils]: 49: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7572#false} is VALID [2018-11-23 12:03:03,879 INFO L273 TraceCheckUtils]: 50: Hoare triple {7572#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7572#false} is VALID [2018-11-23 12:03:03,879 INFO L273 TraceCheckUtils]: 51: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7572#false} is VALID [2018-11-23 12:03:03,879 INFO L273 TraceCheckUtils]: 52: Hoare triple {7572#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7572#false} is VALID [2018-11-23 12:03:03,879 INFO L273 TraceCheckUtils]: 53: Hoare triple {7572#false} assume !(~i~0 < 100000); {7572#false} is VALID [2018-11-23 12:03:03,879 INFO L273 TraceCheckUtils]: 54: Hoare triple {7572#false} ~i~0 := 0; {7572#false} is VALID [2018-11-23 12:03:03,879 INFO L273 TraceCheckUtils]: 55: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7572#false} is VALID [2018-11-23 12:03:03,880 INFO L273 TraceCheckUtils]: 56: Hoare triple {7572#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7572#false} is VALID [2018-11-23 12:03:03,880 INFO L273 TraceCheckUtils]: 57: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7572#false} is VALID [2018-11-23 12:03:03,880 INFO L273 TraceCheckUtils]: 58: Hoare triple {7572#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7572#false} is VALID [2018-11-23 12:03:03,880 INFO L273 TraceCheckUtils]: 59: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7572#false} is VALID [2018-11-23 12:03:03,880 INFO L273 TraceCheckUtils]: 60: Hoare triple {7572#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7572#false} is VALID [2018-11-23 12:03:03,880 INFO L273 TraceCheckUtils]: 61: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7572#false} is VALID [2018-11-23 12:03:03,881 INFO L273 TraceCheckUtils]: 62: Hoare triple {7572#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7572#false} is VALID [2018-11-23 12:03:03,881 INFO L273 TraceCheckUtils]: 63: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7572#false} is VALID [2018-11-23 12:03:03,881 INFO L273 TraceCheckUtils]: 64: Hoare triple {7572#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7572#false} is VALID [2018-11-23 12:03:03,881 INFO L273 TraceCheckUtils]: 65: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7572#false} is VALID [2018-11-23 12:03:03,881 INFO L273 TraceCheckUtils]: 66: Hoare triple {7572#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7572#false} is VALID [2018-11-23 12:03:03,881 INFO L273 TraceCheckUtils]: 67: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7572#false} is VALID [2018-11-23 12:03:03,881 INFO L273 TraceCheckUtils]: 68: Hoare triple {7572#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7572#false} is VALID [2018-11-23 12:03:03,882 INFO L273 TraceCheckUtils]: 69: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7572#false} is VALID [2018-11-23 12:03:03,882 INFO L273 TraceCheckUtils]: 70: Hoare triple {7572#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7572#false} is VALID [2018-11-23 12:03:03,882 INFO L273 TraceCheckUtils]: 71: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7572#false} is VALID [2018-11-23 12:03:03,882 INFO L273 TraceCheckUtils]: 72: Hoare triple {7572#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7572#false} is VALID [2018-11-23 12:03:03,882 INFO L273 TraceCheckUtils]: 73: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7572#false} is VALID [2018-11-23 12:03:03,882 INFO L273 TraceCheckUtils]: 74: Hoare triple {7572#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7572#false} is VALID [2018-11-23 12:03:03,882 INFO L273 TraceCheckUtils]: 75: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7572#false} is VALID [2018-11-23 12:03:03,883 INFO L273 TraceCheckUtils]: 76: Hoare triple {7572#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7572#false} is VALID [2018-11-23 12:03:03,883 INFO L273 TraceCheckUtils]: 77: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7572#false} is VALID [2018-11-23 12:03:03,883 INFO L273 TraceCheckUtils]: 78: Hoare triple {7572#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7572#false} is VALID [2018-11-23 12:03:03,883 INFO L273 TraceCheckUtils]: 79: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7572#false} is VALID [2018-11-23 12:03:03,883 INFO L273 TraceCheckUtils]: 80: Hoare triple {7572#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7572#false} is VALID [2018-11-23 12:03:03,883 INFO L273 TraceCheckUtils]: 81: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7572#false} is VALID [2018-11-23 12:03:03,884 INFO L273 TraceCheckUtils]: 82: Hoare triple {7572#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7572#false} is VALID [2018-11-23 12:03:03,884 INFO L273 TraceCheckUtils]: 83: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7572#false} is VALID [2018-11-23 12:03:03,884 INFO L273 TraceCheckUtils]: 84: Hoare triple {7572#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7572#false} is VALID [2018-11-23 12:03:03,884 INFO L273 TraceCheckUtils]: 85: Hoare triple {7572#false} assume !(~i~0 < 100000); {7572#false} is VALID [2018-11-23 12:03:03,884 INFO L273 TraceCheckUtils]: 86: Hoare triple {7572#false} havoc ~x~0;~x~0 := 0; {7572#false} is VALID [2018-11-23 12:03:03,884 INFO L273 TraceCheckUtils]: 87: Hoare triple {7572#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {7572#false} is VALID [2018-11-23 12:03:03,884 INFO L256 TraceCheckUtils]: 88: Hoare triple {7572#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {7572#false} is VALID [2018-11-23 12:03:03,885 INFO L273 TraceCheckUtils]: 89: Hoare triple {7572#false} ~cond := #in~cond; {7572#false} is VALID [2018-11-23 12:03:03,885 INFO L273 TraceCheckUtils]: 90: Hoare triple {7572#false} assume 0 == ~cond; {7572#false} is VALID [2018-11-23 12:03:03,885 INFO L273 TraceCheckUtils]: 91: Hoare triple {7572#false} assume !false; {7572#false} is VALID [2018-11-23 12:03:03,892 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-11-23 12:03:03,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:03,893 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:03:03,919 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:03:03,964 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:03:03,964 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:03,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:04,234 INFO L256 TraceCheckUtils]: 0: Hoare triple {7571#true} call ULTIMATE.init(); {7571#true} is VALID [2018-11-23 12:03:04,234 INFO L273 TraceCheckUtils]: 1: Hoare triple {7571#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7571#true} is VALID [2018-11-23 12:03:04,234 INFO L273 TraceCheckUtils]: 2: Hoare triple {7571#true} assume true; {7571#true} is VALID [2018-11-23 12:03:04,234 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7571#true} {7571#true} #76#return; {7571#true} is VALID [2018-11-23 12:03:04,235 INFO L256 TraceCheckUtils]: 4: Hoare triple {7571#true} call #t~ret7 := main(); {7571#true} is VALID [2018-11-23 12:03:04,236 INFO L273 TraceCheckUtils]: 5: Hoare triple {7571#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {7607#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:04,236 INFO L273 TraceCheckUtils]: 6: Hoare triple {7607#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7574#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:04,253 INFO L273 TraceCheckUtils]: 7: Hoare triple {7574#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7575#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:04,267 INFO L273 TraceCheckUtils]: 8: Hoare triple {7575#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7576#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:04,283 INFO L273 TraceCheckUtils]: 9: Hoare triple {7576#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7577#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:04,285 INFO L273 TraceCheckUtils]: 10: Hoare triple {7577#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7578#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:04,285 INFO L273 TraceCheckUtils]: 11: Hoare triple {7578#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7579#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:04,286 INFO L273 TraceCheckUtils]: 12: Hoare triple {7579#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7580#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:04,287 INFO L273 TraceCheckUtils]: 13: Hoare triple {7580#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7581#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:04,287 INFO L273 TraceCheckUtils]: 14: Hoare triple {7581#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7582#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:04,288 INFO L273 TraceCheckUtils]: 15: Hoare triple {7582#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7583#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:04,288 INFO L273 TraceCheckUtils]: 16: Hoare triple {7583#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7584#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:04,289 INFO L273 TraceCheckUtils]: 17: Hoare triple {7584#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7585#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:04,289 INFO L273 TraceCheckUtils]: 18: Hoare triple {7585#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7586#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:04,290 INFO L273 TraceCheckUtils]: 19: Hoare triple {7586#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7587#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:04,291 INFO L273 TraceCheckUtils]: 20: Hoare triple {7587#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7588#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:04,292 INFO L273 TraceCheckUtils]: 21: Hoare triple {7588#(<= main_~i~0 15)} assume !(~i~0 < 100000); {7572#false} is VALID [2018-11-23 12:03:04,292 INFO L273 TraceCheckUtils]: 22: Hoare triple {7572#false} ~i~0 := 0; {7572#false} is VALID [2018-11-23 12:03:04,292 INFO L273 TraceCheckUtils]: 23: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7572#false} is VALID [2018-11-23 12:03:04,292 INFO L273 TraceCheckUtils]: 24: Hoare triple {7572#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7572#false} is VALID [2018-11-23 12:03:04,293 INFO L273 TraceCheckUtils]: 25: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7572#false} is VALID [2018-11-23 12:03:04,293 INFO L273 TraceCheckUtils]: 26: Hoare triple {7572#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7572#false} is VALID [2018-11-23 12:03:04,293 INFO L273 TraceCheckUtils]: 27: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7572#false} is VALID [2018-11-23 12:03:04,293 INFO L273 TraceCheckUtils]: 28: Hoare triple {7572#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7572#false} is VALID [2018-11-23 12:03:04,293 INFO L273 TraceCheckUtils]: 29: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7572#false} is VALID [2018-11-23 12:03:04,294 INFO L273 TraceCheckUtils]: 30: Hoare triple {7572#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7572#false} is VALID [2018-11-23 12:03:04,294 INFO L273 TraceCheckUtils]: 31: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7572#false} is VALID [2018-11-23 12:03:04,294 INFO L273 TraceCheckUtils]: 32: Hoare triple {7572#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7572#false} is VALID [2018-11-23 12:03:04,294 INFO L273 TraceCheckUtils]: 33: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7572#false} is VALID [2018-11-23 12:03:04,294 INFO L273 TraceCheckUtils]: 34: Hoare triple {7572#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7572#false} is VALID [2018-11-23 12:03:04,295 INFO L273 TraceCheckUtils]: 35: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7572#false} is VALID [2018-11-23 12:03:04,295 INFO L273 TraceCheckUtils]: 36: Hoare triple {7572#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7572#false} is VALID [2018-11-23 12:03:04,295 INFO L273 TraceCheckUtils]: 37: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7572#false} is VALID [2018-11-23 12:03:04,295 INFO L273 TraceCheckUtils]: 38: Hoare triple {7572#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7572#false} is VALID [2018-11-23 12:03:04,295 INFO L273 TraceCheckUtils]: 39: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7572#false} is VALID [2018-11-23 12:03:04,295 INFO L273 TraceCheckUtils]: 40: Hoare triple {7572#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7572#false} is VALID [2018-11-23 12:03:04,295 INFO L273 TraceCheckUtils]: 41: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7572#false} is VALID [2018-11-23 12:03:04,295 INFO L273 TraceCheckUtils]: 42: Hoare triple {7572#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7572#false} is VALID [2018-11-23 12:03:04,295 INFO L273 TraceCheckUtils]: 43: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7572#false} is VALID [2018-11-23 12:03:04,296 INFO L273 TraceCheckUtils]: 44: Hoare triple {7572#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7572#false} is VALID [2018-11-23 12:03:04,296 INFO L273 TraceCheckUtils]: 45: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7572#false} is VALID [2018-11-23 12:03:04,296 INFO L273 TraceCheckUtils]: 46: Hoare triple {7572#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7572#false} is VALID [2018-11-23 12:03:04,296 INFO L273 TraceCheckUtils]: 47: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7572#false} is VALID [2018-11-23 12:03:04,296 INFO L273 TraceCheckUtils]: 48: Hoare triple {7572#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7572#false} is VALID [2018-11-23 12:03:04,296 INFO L273 TraceCheckUtils]: 49: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7572#false} is VALID [2018-11-23 12:03:04,296 INFO L273 TraceCheckUtils]: 50: Hoare triple {7572#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7572#false} is VALID [2018-11-23 12:03:04,297 INFO L273 TraceCheckUtils]: 51: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7572#false} is VALID [2018-11-23 12:03:04,297 INFO L273 TraceCheckUtils]: 52: Hoare triple {7572#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7572#false} is VALID [2018-11-23 12:03:04,297 INFO L273 TraceCheckUtils]: 53: Hoare triple {7572#false} assume !(~i~0 < 100000); {7572#false} is VALID [2018-11-23 12:03:04,297 INFO L273 TraceCheckUtils]: 54: Hoare triple {7572#false} ~i~0 := 0; {7572#false} is VALID [2018-11-23 12:03:04,297 INFO L273 TraceCheckUtils]: 55: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7572#false} is VALID [2018-11-23 12:03:04,297 INFO L273 TraceCheckUtils]: 56: Hoare triple {7572#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7572#false} is VALID [2018-11-23 12:03:04,297 INFO L273 TraceCheckUtils]: 57: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7572#false} is VALID [2018-11-23 12:03:04,297 INFO L273 TraceCheckUtils]: 58: Hoare triple {7572#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7572#false} is VALID [2018-11-23 12:03:04,298 INFO L273 TraceCheckUtils]: 59: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7572#false} is VALID [2018-11-23 12:03:04,298 INFO L273 TraceCheckUtils]: 60: Hoare triple {7572#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7572#false} is VALID [2018-11-23 12:03:04,298 INFO L273 TraceCheckUtils]: 61: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7572#false} is VALID [2018-11-23 12:03:04,298 INFO L273 TraceCheckUtils]: 62: Hoare triple {7572#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7572#false} is VALID [2018-11-23 12:03:04,298 INFO L273 TraceCheckUtils]: 63: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7572#false} is VALID [2018-11-23 12:03:04,298 INFO L273 TraceCheckUtils]: 64: Hoare triple {7572#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7572#false} is VALID [2018-11-23 12:03:04,298 INFO L273 TraceCheckUtils]: 65: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7572#false} is VALID [2018-11-23 12:03:04,298 INFO L273 TraceCheckUtils]: 66: Hoare triple {7572#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7572#false} is VALID [2018-11-23 12:03:04,298 INFO L273 TraceCheckUtils]: 67: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7572#false} is VALID [2018-11-23 12:03:04,299 INFO L273 TraceCheckUtils]: 68: Hoare triple {7572#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7572#false} is VALID [2018-11-23 12:03:04,299 INFO L273 TraceCheckUtils]: 69: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7572#false} is VALID [2018-11-23 12:03:04,299 INFO L273 TraceCheckUtils]: 70: Hoare triple {7572#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7572#false} is VALID [2018-11-23 12:03:04,299 INFO L273 TraceCheckUtils]: 71: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7572#false} is VALID [2018-11-23 12:03:04,299 INFO L273 TraceCheckUtils]: 72: Hoare triple {7572#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7572#false} is VALID [2018-11-23 12:03:04,299 INFO L273 TraceCheckUtils]: 73: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7572#false} is VALID [2018-11-23 12:03:04,299 INFO L273 TraceCheckUtils]: 74: Hoare triple {7572#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7572#false} is VALID [2018-11-23 12:03:04,299 INFO L273 TraceCheckUtils]: 75: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7572#false} is VALID [2018-11-23 12:03:04,299 INFO L273 TraceCheckUtils]: 76: Hoare triple {7572#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7572#false} is VALID [2018-11-23 12:03:04,300 INFO L273 TraceCheckUtils]: 77: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7572#false} is VALID [2018-11-23 12:03:04,300 INFO L273 TraceCheckUtils]: 78: Hoare triple {7572#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7572#false} is VALID [2018-11-23 12:03:04,300 INFO L273 TraceCheckUtils]: 79: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7572#false} is VALID [2018-11-23 12:03:04,300 INFO L273 TraceCheckUtils]: 80: Hoare triple {7572#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7572#false} is VALID [2018-11-23 12:03:04,300 INFO L273 TraceCheckUtils]: 81: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7572#false} is VALID [2018-11-23 12:03:04,300 INFO L273 TraceCheckUtils]: 82: Hoare triple {7572#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7572#false} is VALID [2018-11-23 12:03:04,300 INFO L273 TraceCheckUtils]: 83: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7572#false} is VALID [2018-11-23 12:03:04,300 INFO L273 TraceCheckUtils]: 84: Hoare triple {7572#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7572#false} is VALID [2018-11-23 12:03:04,301 INFO L273 TraceCheckUtils]: 85: Hoare triple {7572#false} assume !(~i~0 < 100000); {7572#false} is VALID [2018-11-23 12:03:04,301 INFO L273 TraceCheckUtils]: 86: Hoare triple {7572#false} havoc ~x~0;~x~0 := 0; {7572#false} is VALID [2018-11-23 12:03:04,301 INFO L273 TraceCheckUtils]: 87: Hoare triple {7572#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {7572#false} is VALID [2018-11-23 12:03:04,301 INFO L256 TraceCheckUtils]: 88: Hoare triple {7572#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {7572#false} is VALID [2018-11-23 12:03:04,301 INFO L273 TraceCheckUtils]: 89: Hoare triple {7572#false} ~cond := #in~cond; {7572#false} is VALID [2018-11-23 12:03:04,301 INFO L273 TraceCheckUtils]: 90: Hoare triple {7572#false} assume 0 == ~cond; {7572#false} is VALID [2018-11-23 12:03:04,301 INFO L273 TraceCheckUtils]: 91: Hoare triple {7572#false} assume !false; {7572#false} is VALID [2018-11-23 12:03:04,305 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-11-23 12:03:04,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:04,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 12:03:04,324 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-11-23 12:03:04,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:04,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:03:04,353 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:04,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:03:04,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:03:04,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:03:04,355 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand 19 states. [2018-11-23 12:03:04,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:04,856 INFO L93 Difference]: Finished difference Result 179 states and 187 transitions. [2018-11-23 12:03:04,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 12:03:04,857 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-11-23 12:03:04,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:04,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:03:04,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 129 transitions. [2018-11-23 12:03:04,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:03:04,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 129 transitions. [2018-11-23 12:03:04,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 129 transitions. [2018-11-23 12:03:05,601 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:05,603 INFO L225 Difference]: With dead ends: 179 [2018-11-23 12:03:05,603 INFO L226 Difference]: Without dead ends: 104 [2018-11-23 12:03:05,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:03:05,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-23 12:03:05,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2018-11-23 12:03:05,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:05,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 102 states. [2018-11-23 12:03:05,655 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 102 states. [2018-11-23 12:03:05,655 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 102 states. [2018-11-23 12:03:05,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:05,659 INFO L93 Difference]: Finished difference Result 104 states and 107 transitions. [2018-11-23 12:03:05,659 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 107 transitions. [2018-11-23 12:03:05,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:05,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:05,660 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 104 states. [2018-11-23 12:03:05,660 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 104 states. [2018-11-23 12:03:05,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:05,662 INFO L93 Difference]: Finished difference Result 104 states and 107 transitions. [2018-11-23 12:03:05,662 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 107 transitions. [2018-11-23 12:03:05,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:05,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:05,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:05,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:05,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-23 12:03:05,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2018-11-23 12:03:05,665 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 92 [2018-11-23 12:03:05,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:05,665 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2018-11-23 12:03:05,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:03:05,666 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2018-11-23 12:03:05,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-23 12:03:05,666 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:05,667 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:05,667 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:05,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:05,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1861215782, now seen corresponding path program 15 times [2018-11-23 12:03:05,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:05,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:05,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:05,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:05,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:06,324 INFO L256 TraceCheckUtils]: 0: Hoare triple {8505#true} call ULTIMATE.init(); {8505#true} is VALID [2018-11-23 12:03:06,324 INFO L273 TraceCheckUtils]: 1: Hoare triple {8505#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8505#true} is VALID [2018-11-23 12:03:06,325 INFO L273 TraceCheckUtils]: 2: Hoare triple {8505#true} assume true; {8505#true} is VALID [2018-11-23 12:03:06,325 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8505#true} {8505#true} #76#return; {8505#true} is VALID [2018-11-23 12:03:06,325 INFO L256 TraceCheckUtils]: 4: Hoare triple {8505#true} call #t~ret7 := main(); {8505#true} is VALID [2018-11-23 12:03:06,326 INFO L273 TraceCheckUtils]: 5: Hoare triple {8505#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {8507#(= main_~i~0 0)} is VALID [2018-11-23 12:03:06,327 INFO L273 TraceCheckUtils]: 6: Hoare triple {8507#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8508#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:06,327 INFO L273 TraceCheckUtils]: 7: Hoare triple {8508#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8509#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:06,328 INFO L273 TraceCheckUtils]: 8: Hoare triple {8509#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8510#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:06,328 INFO L273 TraceCheckUtils]: 9: Hoare triple {8510#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8511#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:06,329 INFO L273 TraceCheckUtils]: 10: Hoare triple {8511#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8512#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:06,330 INFO L273 TraceCheckUtils]: 11: Hoare triple {8512#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8513#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:06,331 INFO L273 TraceCheckUtils]: 12: Hoare triple {8513#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8514#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:06,332 INFO L273 TraceCheckUtils]: 13: Hoare triple {8514#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8515#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:06,333 INFO L273 TraceCheckUtils]: 14: Hoare triple {8515#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8516#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:06,333 INFO L273 TraceCheckUtils]: 15: Hoare triple {8516#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8517#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:06,334 INFO L273 TraceCheckUtils]: 16: Hoare triple {8517#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8518#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:06,335 INFO L273 TraceCheckUtils]: 17: Hoare triple {8518#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8519#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:06,336 INFO L273 TraceCheckUtils]: 18: Hoare triple {8519#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8520#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:06,337 INFO L273 TraceCheckUtils]: 19: Hoare triple {8520#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8521#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:06,338 INFO L273 TraceCheckUtils]: 20: Hoare triple {8521#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8522#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:06,339 INFO L273 TraceCheckUtils]: 21: Hoare triple {8522#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:06,340 INFO L273 TraceCheckUtils]: 22: Hoare triple {8523#(<= main_~i~0 16)} assume !(~i~0 < 100000); {8506#false} is VALID [2018-11-23 12:03:06,340 INFO L273 TraceCheckUtils]: 23: Hoare triple {8506#false} ~i~0 := 0; {8506#false} is VALID [2018-11-23 12:03:06,340 INFO L273 TraceCheckUtils]: 24: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {8506#false} is VALID [2018-11-23 12:03:06,340 INFO L273 TraceCheckUtils]: 25: Hoare triple {8506#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8506#false} is VALID [2018-11-23 12:03:06,341 INFO L273 TraceCheckUtils]: 26: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {8506#false} is VALID [2018-11-23 12:03:06,341 INFO L273 TraceCheckUtils]: 27: Hoare triple {8506#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8506#false} is VALID [2018-11-23 12:03:06,341 INFO L273 TraceCheckUtils]: 28: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {8506#false} is VALID [2018-11-23 12:03:06,341 INFO L273 TraceCheckUtils]: 29: Hoare triple {8506#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8506#false} is VALID [2018-11-23 12:03:06,341 INFO L273 TraceCheckUtils]: 30: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {8506#false} is VALID [2018-11-23 12:03:06,342 INFO L273 TraceCheckUtils]: 31: Hoare triple {8506#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8506#false} is VALID [2018-11-23 12:03:06,342 INFO L273 TraceCheckUtils]: 32: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {8506#false} is VALID [2018-11-23 12:03:06,342 INFO L273 TraceCheckUtils]: 33: Hoare triple {8506#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8506#false} is VALID [2018-11-23 12:03:06,342 INFO L273 TraceCheckUtils]: 34: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {8506#false} is VALID [2018-11-23 12:03:06,342 INFO L273 TraceCheckUtils]: 35: Hoare triple {8506#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8506#false} is VALID [2018-11-23 12:03:06,343 INFO L273 TraceCheckUtils]: 36: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {8506#false} is VALID [2018-11-23 12:03:06,343 INFO L273 TraceCheckUtils]: 37: Hoare triple {8506#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8506#false} is VALID [2018-11-23 12:03:06,343 INFO L273 TraceCheckUtils]: 38: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {8506#false} is VALID [2018-11-23 12:03:06,343 INFO L273 TraceCheckUtils]: 39: Hoare triple {8506#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8506#false} is VALID [2018-11-23 12:03:06,343 INFO L273 TraceCheckUtils]: 40: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {8506#false} is VALID [2018-11-23 12:03:06,344 INFO L273 TraceCheckUtils]: 41: Hoare triple {8506#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8506#false} is VALID [2018-11-23 12:03:06,344 INFO L273 TraceCheckUtils]: 42: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {8506#false} is VALID [2018-11-23 12:03:06,344 INFO L273 TraceCheckUtils]: 43: Hoare triple {8506#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8506#false} is VALID [2018-11-23 12:03:06,344 INFO L273 TraceCheckUtils]: 44: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {8506#false} is VALID [2018-11-23 12:03:06,344 INFO L273 TraceCheckUtils]: 45: Hoare triple {8506#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8506#false} is VALID [2018-11-23 12:03:06,345 INFO L273 TraceCheckUtils]: 46: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {8506#false} is VALID [2018-11-23 12:03:06,345 INFO L273 TraceCheckUtils]: 47: Hoare triple {8506#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8506#false} is VALID [2018-11-23 12:03:06,345 INFO L273 TraceCheckUtils]: 48: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {8506#false} is VALID [2018-11-23 12:03:06,345 INFO L273 TraceCheckUtils]: 49: Hoare triple {8506#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8506#false} is VALID [2018-11-23 12:03:06,345 INFO L273 TraceCheckUtils]: 50: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {8506#false} is VALID [2018-11-23 12:03:06,345 INFO L273 TraceCheckUtils]: 51: Hoare triple {8506#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8506#false} is VALID [2018-11-23 12:03:06,345 INFO L273 TraceCheckUtils]: 52: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {8506#false} is VALID [2018-11-23 12:03:06,345 INFO L273 TraceCheckUtils]: 53: Hoare triple {8506#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8506#false} is VALID [2018-11-23 12:03:06,345 INFO L273 TraceCheckUtils]: 54: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {8506#false} is VALID [2018-11-23 12:03:06,346 INFO L273 TraceCheckUtils]: 55: Hoare triple {8506#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8506#false} is VALID [2018-11-23 12:03:06,346 INFO L273 TraceCheckUtils]: 56: Hoare triple {8506#false} assume !(~i~0 < 100000); {8506#false} is VALID [2018-11-23 12:03:06,346 INFO L273 TraceCheckUtils]: 57: Hoare triple {8506#false} ~i~0 := 0; {8506#false} is VALID [2018-11-23 12:03:06,346 INFO L273 TraceCheckUtils]: 58: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8506#false} is VALID [2018-11-23 12:03:06,346 INFO L273 TraceCheckUtils]: 59: Hoare triple {8506#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8506#false} is VALID [2018-11-23 12:03:06,346 INFO L273 TraceCheckUtils]: 60: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8506#false} is VALID [2018-11-23 12:03:06,346 INFO L273 TraceCheckUtils]: 61: Hoare triple {8506#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8506#false} is VALID [2018-11-23 12:03:06,346 INFO L273 TraceCheckUtils]: 62: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8506#false} is VALID [2018-11-23 12:03:06,347 INFO L273 TraceCheckUtils]: 63: Hoare triple {8506#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8506#false} is VALID [2018-11-23 12:03:06,347 INFO L273 TraceCheckUtils]: 64: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8506#false} is VALID [2018-11-23 12:03:06,347 INFO L273 TraceCheckUtils]: 65: Hoare triple {8506#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8506#false} is VALID [2018-11-23 12:03:06,347 INFO L273 TraceCheckUtils]: 66: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8506#false} is VALID [2018-11-23 12:03:06,347 INFO L273 TraceCheckUtils]: 67: Hoare triple {8506#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8506#false} is VALID [2018-11-23 12:03:06,347 INFO L273 TraceCheckUtils]: 68: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8506#false} is VALID [2018-11-23 12:03:06,347 INFO L273 TraceCheckUtils]: 69: Hoare triple {8506#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8506#false} is VALID [2018-11-23 12:03:06,347 INFO L273 TraceCheckUtils]: 70: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8506#false} is VALID [2018-11-23 12:03:06,347 INFO L273 TraceCheckUtils]: 71: Hoare triple {8506#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8506#false} is VALID [2018-11-23 12:03:06,348 INFO L273 TraceCheckUtils]: 72: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8506#false} is VALID [2018-11-23 12:03:06,348 INFO L273 TraceCheckUtils]: 73: Hoare triple {8506#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8506#false} is VALID [2018-11-23 12:03:06,348 INFO L273 TraceCheckUtils]: 74: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8506#false} is VALID [2018-11-23 12:03:06,348 INFO L273 TraceCheckUtils]: 75: Hoare triple {8506#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8506#false} is VALID [2018-11-23 12:03:06,348 INFO L273 TraceCheckUtils]: 76: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8506#false} is VALID [2018-11-23 12:03:06,348 INFO L273 TraceCheckUtils]: 77: Hoare triple {8506#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8506#false} is VALID [2018-11-23 12:03:06,348 INFO L273 TraceCheckUtils]: 78: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8506#false} is VALID [2018-11-23 12:03:06,348 INFO L273 TraceCheckUtils]: 79: Hoare triple {8506#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8506#false} is VALID [2018-11-23 12:03:06,349 INFO L273 TraceCheckUtils]: 80: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8506#false} is VALID [2018-11-23 12:03:06,349 INFO L273 TraceCheckUtils]: 81: Hoare triple {8506#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8506#false} is VALID [2018-11-23 12:03:06,349 INFO L273 TraceCheckUtils]: 82: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8506#false} is VALID [2018-11-23 12:03:06,349 INFO L273 TraceCheckUtils]: 83: Hoare triple {8506#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8506#false} is VALID [2018-11-23 12:03:06,349 INFO L273 TraceCheckUtils]: 84: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8506#false} is VALID [2018-11-23 12:03:06,349 INFO L273 TraceCheckUtils]: 85: Hoare triple {8506#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8506#false} is VALID [2018-11-23 12:03:06,349 INFO L273 TraceCheckUtils]: 86: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8506#false} is VALID [2018-11-23 12:03:06,349 INFO L273 TraceCheckUtils]: 87: Hoare triple {8506#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8506#false} is VALID [2018-11-23 12:03:06,349 INFO L273 TraceCheckUtils]: 88: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8506#false} is VALID [2018-11-23 12:03:06,350 INFO L273 TraceCheckUtils]: 89: Hoare triple {8506#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8506#false} is VALID [2018-11-23 12:03:06,350 INFO L273 TraceCheckUtils]: 90: Hoare triple {8506#false} assume !(~i~0 < 100000); {8506#false} is VALID [2018-11-23 12:03:06,350 INFO L273 TraceCheckUtils]: 91: Hoare triple {8506#false} havoc ~x~0;~x~0 := 0; {8506#false} is VALID [2018-11-23 12:03:06,350 INFO L273 TraceCheckUtils]: 92: Hoare triple {8506#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {8506#false} is VALID [2018-11-23 12:03:06,350 INFO L256 TraceCheckUtils]: 93: Hoare triple {8506#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {8506#false} is VALID [2018-11-23 12:03:06,350 INFO L273 TraceCheckUtils]: 94: Hoare triple {8506#false} ~cond := #in~cond; {8506#false} is VALID [2018-11-23 12:03:06,350 INFO L273 TraceCheckUtils]: 95: Hoare triple {8506#false} assume 0 == ~cond; {8506#false} is VALID [2018-11-23 12:03:06,350 INFO L273 TraceCheckUtils]: 96: Hoare triple {8506#false} assume !false; {8506#false} is VALID [2018-11-23 12:03:06,354 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-11-23 12:03:06,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:06,355 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:03:06,363 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:03:10,653 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 12:03:10,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:10,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:11,043 INFO L256 TraceCheckUtils]: 0: Hoare triple {8505#true} call ULTIMATE.init(); {8505#true} is VALID [2018-11-23 12:03:11,043 INFO L273 TraceCheckUtils]: 1: Hoare triple {8505#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8505#true} is VALID [2018-11-23 12:03:11,043 INFO L273 TraceCheckUtils]: 2: Hoare triple {8505#true} assume true; {8505#true} is VALID [2018-11-23 12:03:11,044 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8505#true} {8505#true} #76#return; {8505#true} is VALID [2018-11-23 12:03:11,044 INFO L256 TraceCheckUtils]: 4: Hoare triple {8505#true} call #t~ret7 := main(); {8505#true} is VALID [2018-11-23 12:03:11,045 INFO L273 TraceCheckUtils]: 5: Hoare triple {8505#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {8542#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:11,046 INFO L273 TraceCheckUtils]: 6: Hoare triple {8542#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8508#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:11,047 INFO L273 TraceCheckUtils]: 7: Hoare triple {8508#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8509#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:11,047 INFO L273 TraceCheckUtils]: 8: Hoare triple {8509#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8510#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:11,048 INFO L273 TraceCheckUtils]: 9: Hoare triple {8510#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8511#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:11,048 INFO L273 TraceCheckUtils]: 10: Hoare triple {8511#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8512#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:11,059 INFO L273 TraceCheckUtils]: 11: Hoare triple {8512#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8513#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:11,060 INFO L273 TraceCheckUtils]: 12: Hoare triple {8513#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8514#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:11,060 INFO L273 TraceCheckUtils]: 13: Hoare triple {8514#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8515#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:11,061 INFO L273 TraceCheckUtils]: 14: Hoare triple {8515#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8516#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:11,061 INFO L273 TraceCheckUtils]: 15: Hoare triple {8516#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8517#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:11,062 INFO L273 TraceCheckUtils]: 16: Hoare triple {8517#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8518#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:11,062 INFO L273 TraceCheckUtils]: 17: Hoare triple {8518#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8519#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:11,063 INFO L273 TraceCheckUtils]: 18: Hoare triple {8519#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8520#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:11,064 INFO L273 TraceCheckUtils]: 19: Hoare triple {8520#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8521#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:11,065 INFO L273 TraceCheckUtils]: 20: Hoare triple {8521#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8522#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:11,065 INFO L273 TraceCheckUtils]: 21: Hoare triple {8522#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:11,066 INFO L273 TraceCheckUtils]: 22: Hoare triple {8523#(<= main_~i~0 16)} assume !(~i~0 < 100000); {8506#false} is VALID [2018-11-23 12:03:11,066 INFO L273 TraceCheckUtils]: 23: Hoare triple {8506#false} ~i~0 := 0; {8506#false} is VALID [2018-11-23 12:03:11,067 INFO L273 TraceCheckUtils]: 24: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {8506#false} is VALID [2018-11-23 12:03:11,067 INFO L273 TraceCheckUtils]: 25: Hoare triple {8506#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8506#false} is VALID [2018-11-23 12:03:11,067 INFO L273 TraceCheckUtils]: 26: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {8506#false} is VALID [2018-11-23 12:03:11,067 INFO L273 TraceCheckUtils]: 27: Hoare triple {8506#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8506#false} is VALID [2018-11-23 12:03:11,067 INFO L273 TraceCheckUtils]: 28: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {8506#false} is VALID [2018-11-23 12:03:11,068 INFO L273 TraceCheckUtils]: 29: Hoare triple {8506#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8506#false} is VALID [2018-11-23 12:03:11,068 INFO L273 TraceCheckUtils]: 30: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {8506#false} is VALID [2018-11-23 12:03:11,068 INFO L273 TraceCheckUtils]: 31: Hoare triple {8506#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8506#false} is VALID [2018-11-23 12:03:11,068 INFO L273 TraceCheckUtils]: 32: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {8506#false} is VALID [2018-11-23 12:03:11,068 INFO L273 TraceCheckUtils]: 33: Hoare triple {8506#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8506#false} is VALID [2018-11-23 12:03:11,069 INFO L273 TraceCheckUtils]: 34: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {8506#false} is VALID [2018-11-23 12:03:11,069 INFO L273 TraceCheckUtils]: 35: Hoare triple {8506#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8506#false} is VALID [2018-11-23 12:03:11,069 INFO L273 TraceCheckUtils]: 36: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {8506#false} is VALID [2018-11-23 12:03:11,069 INFO L273 TraceCheckUtils]: 37: Hoare triple {8506#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8506#false} is VALID [2018-11-23 12:03:11,069 INFO L273 TraceCheckUtils]: 38: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {8506#false} is VALID [2018-11-23 12:03:11,069 INFO L273 TraceCheckUtils]: 39: Hoare triple {8506#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8506#false} is VALID [2018-11-23 12:03:11,070 INFO L273 TraceCheckUtils]: 40: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {8506#false} is VALID [2018-11-23 12:03:11,070 INFO L273 TraceCheckUtils]: 41: Hoare triple {8506#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8506#false} is VALID [2018-11-23 12:03:11,070 INFO L273 TraceCheckUtils]: 42: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {8506#false} is VALID [2018-11-23 12:03:11,070 INFO L273 TraceCheckUtils]: 43: Hoare triple {8506#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8506#false} is VALID [2018-11-23 12:03:11,070 INFO L273 TraceCheckUtils]: 44: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {8506#false} is VALID [2018-11-23 12:03:11,070 INFO L273 TraceCheckUtils]: 45: Hoare triple {8506#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8506#false} is VALID [2018-11-23 12:03:11,070 INFO L273 TraceCheckUtils]: 46: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {8506#false} is VALID [2018-11-23 12:03:11,070 INFO L273 TraceCheckUtils]: 47: Hoare triple {8506#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8506#false} is VALID [2018-11-23 12:03:11,071 INFO L273 TraceCheckUtils]: 48: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {8506#false} is VALID [2018-11-23 12:03:11,071 INFO L273 TraceCheckUtils]: 49: Hoare triple {8506#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8506#false} is VALID [2018-11-23 12:03:11,071 INFO L273 TraceCheckUtils]: 50: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {8506#false} is VALID [2018-11-23 12:03:11,071 INFO L273 TraceCheckUtils]: 51: Hoare triple {8506#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8506#false} is VALID [2018-11-23 12:03:11,071 INFO L273 TraceCheckUtils]: 52: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {8506#false} is VALID [2018-11-23 12:03:11,071 INFO L273 TraceCheckUtils]: 53: Hoare triple {8506#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8506#false} is VALID [2018-11-23 12:03:11,071 INFO L273 TraceCheckUtils]: 54: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {8506#false} is VALID [2018-11-23 12:03:11,071 INFO L273 TraceCheckUtils]: 55: Hoare triple {8506#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8506#false} is VALID [2018-11-23 12:03:11,071 INFO L273 TraceCheckUtils]: 56: Hoare triple {8506#false} assume !(~i~0 < 100000); {8506#false} is VALID [2018-11-23 12:03:11,072 INFO L273 TraceCheckUtils]: 57: Hoare triple {8506#false} ~i~0 := 0; {8506#false} is VALID [2018-11-23 12:03:11,072 INFO L273 TraceCheckUtils]: 58: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8506#false} is VALID [2018-11-23 12:03:11,072 INFO L273 TraceCheckUtils]: 59: Hoare triple {8506#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8506#false} is VALID [2018-11-23 12:03:11,072 INFO L273 TraceCheckUtils]: 60: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8506#false} is VALID [2018-11-23 12:03:11,072 INFO L273 TraceCheckUtils]: 61: Hoare triple {8506#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8506#false} is VALID [2018-11-23 12:03:11,072 INFO L273 TraceCheckUtils]: 62: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8506#false} is VALID [2018-11-23 12:03:11,072 INFO L273 TraceCheckUtils]: 63: Hoare triple {8506#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8506#false} is VALID [2018-11-23 12:03:11,072 INFO L273 TraceCheckUtils]: 64: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8506#false} is VALID [2018-11-23 12:03:11,073 INFO L273 TraceCheckUtils]: 65: Hoare triple {8506#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8506#false} is VALID [2018-11-23 12:03:11,073 INFO L273 TraceCheckUtils]: 66: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8506#false} is VALID [2018-11-23 12:03:11,073 INFO L273 TraceCheckUtils]: 67: Hoare triple {8506#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8506#false} is VALID [2018-11-23 12:03:11,073 INFO L273 TraceCheckUtils]: 68: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8506#false} is VALID [2018-11-23 12:03:11,073 INFO L273 TraceCheckUtils]: 69: Hoare triple {8506#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8506#false} is VALID [2018-11-23 12:03:11,073 INFO L273 TraceCheckUtils]: 70: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8506#false} is VALID [2018-11-23 12:03:11,073 INFO L273 TraceCheckUtils]: 71: Hoare triple {8506#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8506#false} is VALID [2018-11-23 12:03:11,073 INFO L273 TraceCheckUtils]: 72: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8506#false} is VALID [2018-11-23 12:03:11,073 INFO L273 TraceCheckUtils]: 73: Hoare triple {8506#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8506#false} is VALID [2018-11-23 12:03:11,074 INFO L273 TraceCheckUtils]: 74: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8506#false} is VALID [2018-11-23 12:03:11,074 INFO L273 TraceCheckUtils]: 75: Hoare triple {8506#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8506#false} is VALID [2018-11-23 12:03:11,074 INFO L273 TraceCheckUtils]: 76: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8506#false} is VALID [2018-11-23 12:03:11,074 INFO L273 TraceCheckUtils]: 77: Hoare triple {8506#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8506#false} is VALID [2018-11-23 12:03:11,074 INFO L273 TraceCheckUtils]: 78: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8506#false} is VALID [2018-11-23 12:03:11,074 INFO L273 TraceCheckUtils]: 79: Hoare triple {8506#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8506#false} is VALID [2018-11-23 12:03:11,074 INFO L273 TraceCheckUtils]: 80: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8506#false} is VALID [2018-11-23 12:03:11,074 INFO L273 TraceCheckUtils]: 81: Hoare triple {8506#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8506#false} is VALID [2018-11-23 12:03:11,074 INFO L273 TraceCheckUtils]: 82: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8506#false} is VALID [2018-11-23 12:03:11,075 INFO L273 TraceCheckUtils]: 83: Hoare triple {8506#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8506#false} is VALID [2018-11-23 12:03:11,075 INFO L273 TraceCheckUtils]: 84: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8506#false} is VALID [2018-11-23 12:03:11,075 INFO L273 TraceCheckUtils]: 85: Hoare triple {8506#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8506#false} is VALID [2018-11-23 12:03:11,075 INFO L273 TraceCheckUtils]: 86: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8506#false} is VALID [2018-11-23 12:03:11,075 INFO L273 TraceCheckUtils]: 87: Hoare triple {8506#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8506#false} is VALID [2018-11-23 12:03:11,075 INFO L273 TraceCheckUtils]: 88: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8506#false} is VALID [2018-11-23 12:03:11,075 INFO L273 TraceCheckUtils]: 89: Hoare triple {8506#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8506#false} is VALID [2018-11-23 12:03:11,075 INFO L273 TraceCheckUtils]: 90: Hoare triple {8506#false} assume !(~i~0 < 100000); {8506#false} is VALID [2018-11-23 12:03:11,076 INFO L273 TraceCheckUtils]: 91: Hoare triple {8506#false} havoc ~x~0;~x~0 := 0; {8506#false} is VALID [2018-11-23 12:03:11,076 INFO L273 TraceCheckUtils]: 92: Hoare triple {8506#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {8506#false} is VALID [2018-11-23 12:03:11,076 INFO L256 TraceCheckUtils]: 93: Hoare triple {8506#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {8506#false} is VALID [2018-11-23 12:03:11,076 INFO L273 TraceCheckUtils]: 94: Hoare triple {8506#false} ~cond := #in~cond; {8506#false} is VALID [2018-11-23 12:03:11,076 INFO L273 TraceCheckUtils]: 95: Hoare triple {8506#false} assume 0 == ~cond; {8506#false} is VALID [2018-11-23 12:03:11,076 INFO L273 TraceCheckUtils]: 96: Hoare triple {8506#false} assume !false; {8506#false} is VALID [2018-11-23 12:03:11,080 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-11-23 12:03:11,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:11,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 12:03:11,102 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2018-11-23 12:03:11,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:11,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:03:11,131 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:11,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:03:11,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:03:11,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:03:11,132 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand 20 states. [2018-11-23 12:03:12,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:12,408 INFO L93 Difference]: Finished difference Result 188 states and 196 transitions. [2018-11-23 12:03:12,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:03:12,409 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2018-11-23 12:03:12,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:12,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:03:12,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 134 transitions. [2018-11-23 12:03:12,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:03:12,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 134 transitions. [2018-11-23 12:03:12,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 134 transitions. [2018-11-23 12:03:12,559 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:12,562 INFO L225 Difference]: With dead ends: 188 [2018-11-23 12:03:12,562 INFO L226 Difference]: Without dead ends: 109 [2018-11-23 12:03:12,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:03:12,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-23 12:03:12,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-11-23 12:03:12,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:12,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 107 states. [2018-11-23 12:03:12,627 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 107 states. [2018-11-23 12:03:12,627 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 107 states. [2018-11-23 12:03:12,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:12,629 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2018-11-23 12:03:12,629 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 112 transitions. [2018-11-23 12:03:12,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:12,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:12,629 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 109 states. [2018-11-23 12:03:12,629 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 109 states. [2018-11-23 12:03:12,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:12,631 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2018-11-23 12:03:12,632 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 112 transitions. [2018-11-23 12:03:12,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:12,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:12,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:12,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:12,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-23 12:03:12,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 110 transitions. [2018-11-23 12:03:12,635 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 110 transitions. Word has length 97 [2018-11-23 12:03:12,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:12,635 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 110 transitions. [2018-11-23 12:03:12,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:03:12,635 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2018-11-23 12:03:12,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-23 12:03:12,636 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:12,636 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:12,637 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:12,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:12,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1207301786, now seen corresponding path program 16 times [2018-11-23 12:03:12,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:12,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:12,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:12,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:12,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:13,667 INFO L256 TraceCheckUtils]: 0: Hoare triple {9487#true} call ULTIMATE.init(); {9487#true} is VALID [2018-11-23 12:03:13,667 INFO L273 TraceCheckUtils]: 1: Hoare triple {9487#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9487#true} is VALID [2018-11-23 12:03:13,667 INFO L273 TraceCheckUtils]: 2: Hoare triple {9487#true} assume true; {9487#true} is VALID [2018-11-23 12:03:13,668 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9487#true} {9487#true} #76#return; {9487#true} is VALID [2018-11-23 12:03:13,668 INFO L256 TraceCheckUtils]: 4: Hoare triple {9487#true} call #t~ret7 := main(); {9487#true} is VALID [2018-11-23 12:03:13,669 INFO L273 TraceCheckUtils]: 5: Hoare triple {9487#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {9489#(= main_~i~0 0)} is VALID [2018-11-23 12:03:13,671 INFO L273 TraceCheckUtils]: 6: Hoare triple {9489#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9490#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:13,672 INFO L273 TraceCheckUtils]: 7: Hoare triple {9490#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9491#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:13,673 INFO L273 TraceCheckUtils]: 8: Hoare triple {9491#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9492#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:13,673 INFO L273 TraceCheckUtils]: 9: Hoare triple {9492#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9493#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:13,677 INFO L273 TraceCheckUtils]: 10: Hoare triple {9493#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9494#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:13,677 INFO L273 TraceCheckUtils]: 11: Hoare triple {9494#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9495#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:13,679 INFO L273 TraceCheckUtils]: 12: Hoare triple {9495#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9496#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:13,679 INFO L273 TraceCheckUtils]: 13: Hoare triple {9496#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9497#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:13,681 INFO L273 TraceCheckUtils]: 14: Hoare triple {9497#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9498#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:13,681 INFO L273 TraceCheckUtils]: 15: Hoare triple {9498#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9499#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:13,683 INFO L273 TraceCheckUtils]: 16: Hoare triple {9499#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9500#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:13,684 INFO L273 TraceCheckUtils]: 17: Hoare triple {9500#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9501#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:13,685 INFO L273 TraceCheckUtils]: 18: Hoare triple {9501#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9502#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:13,686 INFO L273 TraceCheckUtils]: 19: Hoare triple {9502#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9503#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:13,687 INFO L273 TraceCheckUtils]: 20: Hoare triple {9503#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9504#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:13,688 INFO L273 TraceCheckUtils]: 21: Hoare triple {9504#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9505#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:13,689 INFO L273 TraceCheckUtils]: 22: Hoare triple {9505#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9506#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:13,689 INFO L273 TraceCheckUtils]: 23: Hoare triple {9506#(<= main_~i~0 17)} assume !(~i~0 < 100000); {9488#false} is VALID [2018-11-23 12:03:13,690 INFO L273 TraceCheckUtils]: 24: Hoare triple {9488#false} ~i~0 := 0; {9488#false} is VALID [2018-11-23 12:03:13,690 INFO L273 TraceCheckUtils]: 25: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9488#false} is VALID [2018-11-23 12:03:13,690 INFO L273 TraceCheckUtils]: 26: Hoare triple {9488#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9488#false} is VALID [2018-11-23 12:03:13,690 INFO L273 TraceCheckUtils]: 27: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9488#false} is VALID [2018-11-23 12:03:13,690 INFO L273 TraceCheckUtils]: 28: Hoare triple {9488#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9488#false} is VALID [2018-11-23 12:03:13,691 INFO L273 TraceCheckUtils]: 29: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9488#false} is VALID [2018-11-23 12:03:13,691 INFO L273 TraceCheckUtils]: 30: Hoare triple {9488#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9488#false} is VALID [2018-11-23 12:03:13,691 INFO L273 TraceCheckUtils]: 31: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9488#false} is VALID [2018-11-23 12:03:13,691 INFO L273 TraceCheckUtils]: 32: Hoare triple {9488#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9488#false} is VALID [2018-11-23 12:03:13,691 INFO L273 TraceCheckUtils]: 33: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9488#false} is VALID [2018-11-23 12:03:13,692 INFO L273 TraceCheckUtils]: 34: Hoare triple {9488#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9488#false} is VALID [2018-11-23 12:03:13,692 INFO L273 TraceCheckUtils]: 35: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9488#false} is VALID [2018-11-23 12:03:13,692 INFO L273 TraceCheckUtils]: 36: Hoare triple {9488#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9488#false} is VALID [2018-11-23 12:03:13,692 INFO L273 TraceCheckUtils]: 37: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9488#false} is VALID [2018-11-23 12:03:13,692 INFO L273 TraceCheckUtils]: 38: Hoare triple {9488#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9488#false} is VALID [2018-11-23 12:03:13,693 INFO L273 TraceCheckUtils]: 39: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9488#false} is VALID [2018-11-23 12:03:13,693 INFO L273 TraceCheckUtils]: 40: Hoare triple {9488#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9488#false} is VALID [2018-11-23 12:03:13,693 INFO L273 TraceCheckUtils]: 41: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9488#false} is VALID [2018-11-23 12:03:13,693 INFO L273 TraceCheckUtils]: 42: Hoare triple {9488#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9488#false} is VALID [2018-11-23 12:03:13,693 INFO L273 TraceCheckUtils]: 43: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9488#false} is VALID [2018-11-23 12:03:13,694 INFO L273 TraceCheckUtils]: 44: Hoare triple {9488#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9488#false} is VALID [2018-11-23 12:03:13,694 INFO L273 TraceCheckUtils]: 45: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9488#false} is VALID [2018-11-23 12:03:13,694 INFO L273 TraceCheckUtils]: 46: Hoare triple {9488#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9488#false} is VALID [2018-11-23 12:03:13,694 INFO L273 TraceCheckUtils]: 47: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9488#false} is VALID [2018-11-23 12:03:13,694 INFO L273 TraceCheckUtils]: 48: Hoare triple {9488#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9488#false} is VALID [2018-11-23 12:03:13,695 INFO L273 TraceCheckUtils]: 49: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9488#false} is VALID [2018-11-23 12:03:13,695 INFO L273 TraceCheckUtils]: 50: Hoare triple {9488#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9488#false} is VALID [2018-11-23 12:03:13,695 INFO L273 TraceCheckUtils]: 51: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9488#false} is VALID [2018-11-23 12:03:13,695 INFO L273 TraceCheckUtils]: 52: Hoare triple {9488#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9488#false} is VALID [2018-11-23 12:03:13,695 INFO L273 TraceCheckUtils]: 53: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9488#false} is VALID [2018-11-23 12:03:13,695 INFO L273 TraceCheckUtils]: 54: Hoare triple {9488#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9488#false} is VALID [2018-11-23 12:03:13,695 INFO L273 TraceCheckUtils]: 55: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9488#false} is VALID [2018-11-23 12:03:13,695 INFO L273 TraceCheckUtils]: 56: Hoare triple {9488#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9488#false} is VALID [2018-11-23 12:03:13,695 INFO L273 TraceCheckUtils]: 57: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9488#false} is VALID [2018-11-23 12:03:13,696 INFO L273 TraceCheckUtils]: 58: Hoare triple {9488#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9488#false} is VALID [2018-11-23 12:03:13,696 INFO L273 TraceCheckUtils]: 59: Hoare triple {9488#false} assume !(~i~0 < 100000); {9488#false} is VALID [2018-11-23 12:03:13,696 INFO L273 TraceCheckUtils]: 60: Hoare triple {9488#false} ~i~0 := 0; {9488#false} is VALID [2018-11-23 12:03:13,696 INFO L273 TraceCheckUtils]: 61: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9488#false} is VALID [2018-11-23 12:03:13,696 INFO L273 TraceCheckUtils]: 62: Hoare triple {9488#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9488#false} is VALID [2018-11-23 12:03:13,696 INFO L273 TraceCheckUtils]: 63: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9488#false} is VALID [2018-11-23 12:03:13,696 INFO L273 TraceCheckUtils]: 64: Hoare triple {9488#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9488#false} is VALID [2018-11-23 12:03:13,696 INFO L273 TraceCheckUtils]: 65: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9488#false} is VALID [2018-11-23 12:03:13,696 INFO L273 TraceCheckUtils]: 66: Hoare triple {9488#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9488#false} is VALID [2018-11-23 12:03:13,697 INFO L273 TraceCheckUtils]: 67: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9488#false} is VALID [2018-11-23 12:03:13,697 INFO L273 TraceCheckUtils]: 68: Hoare triple {9488#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9488#false} is VALID [2018-11-23 12:03:13,697 INFO L273 TraceCheckUtils]: 69: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9488#false} is VALID [2018-11-23 12:03:13,697 INFO L273 TraceCheckUtils]: 70: Hoare triple {9488#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9488#false} is VALID [2018-11-23 12:03:13,697 INFO L273 TraceCheckUtils]: 71: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9488#false} is VALID [2018-11-23 12:03:13,697 INFO L273 TraceCheckUtils]: 72: Hoare triple {9488#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9488#false} is VALID [2018-11-23 12:03:13,697 INFO L273 TraceCheckUtils]: 73: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9488#false} is VALID [2018-11-23 12:03:13,697 INFO L273 TraceCheckUtils]: 74: Hoare triple {9488#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9488#false} is VALID [2018-11-23 12:03:13,698 INFO L273 TraceCheckUtils]: 75: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9488#false} is VALID [2018-11-23 12:03:13,698 INFO L273 TraceCheckUtils]: 76: Hoare triple {9488#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9488#false} is VALID [2018-11-23 12:03:13,698 INFO L273 TraceCheckUtils]: 77: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9488#false} is VALID [2018-11-23 12:03:13,698 INFO L273 TraceCheckUtils]: 78: Hoare triple {9488#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9488#false} is VALID [2018-11-23 12:03:13,698 INFO L273 TraceCheckUtils]: 79: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9488#false} is VALID [2018-11-23 12:03:13,698 INFO L273 TraceCheckUtils]: 80: Hoare triple {9488#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9488#false} is VALID [2018-11-23 12:03:13,698 INFO L273 TraceCheckUtils]: 81: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9488#false} is VALID [2018-11-23 12:03:13,698 INFO L273 TraceCheckUtils]: 82: Hoare triple {9488#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9488#false} is VALID [2018-11-23 12:03:13,698 INFO L273 TraceCheckUtils]: 83: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9488#false} is VALID [2018-11-23 12:03:13,699 INFO L273 TraceCheckUtils]: 84: Hoare triple {9488#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9488#false} is VALID [2018-11-23 12:03:13,699 INFO L273 TraceCheckUtils]: 85: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9488#false} is VALID [2018-11-23 12:03:13,699 INFO L273 TraceCheckUtils]: 86: Hoare triple {9488#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9488#false} is VALID [2018-11-23 12:03:13,699 INFO L273 TraceCheckUtils]: 87: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9488#false} is VALID [2018-11-23 12:03:13,699 INFO L273 TraceCheckUtils]: 88: Hoare triple {9488#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9488#false} is VALID [2018-11-23 12:03:13,699 INFO L273 TraceCheckUtils]: 89: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9488#false} is VALID [2018-11-23 12:03:13,699 INFO L273 TraceCheckUtils]: 90: Hoare triple {9488#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9488#false} is VALID [2018-11-23 12:03:13,699 INFO L273 TraceCheckUtils]: 91: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9488#false} is VALID [2018-11-23 12:03:13,700 INFO L273 TraceCheckUtils]: 92: Hoare triple {9488#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9488#false} is VALID [2018-11-23 12:03:13,700 INFO L273 TraceCheckUtils]: 93: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9488#false} is VALID [2018-11-23 12:03:13,700 INFO L273 TraceCheckUtils]: 94: Hoare triple {9488#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9488#false} is VALID [2018-11-23 12:03:13,700 INFO L273 TraceCheckUtils]: 95: Hoare triple {9488#false} assume !(~i~0 < 100000); {9488#false} is VALID [2018-11-23 12:03:13,700 INFO L273 TraceCheckUtils]: 96: Hoare triple {9488#false} havoc ~x~0;~x~0 := 0; {9488#false} is VALID [2018-11-23 12:03:13,700 INFO L273 TraceCheckUtils]: 97: Hoare triple {9488#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {9488#false} is VALID [2018-11-23 12:03:13,700 INFO L256 TraceCheckUtils]: 98: Hoare triple {9488#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {9488#false} is VALID [2018-11-23 12:03:13,700 INFO L273 TraceCheckUtils]: 99: Hoare triple {9488#false} ~cond := #in~cond; {9488#false} is VALID [2018-11-23 12:03:13,700 INFO L273 TraceCheckUtils]: 100: Hoare triple {9488#false} assume 0 == ~cond; {9488#false} is VALID [2018-11-23 12:03:13,701 INFO L273 TraceCheckUtils]: 101: Hoare triple {9488#false} assume !false; {9488#false} is VALID [2018-11-23 12:03:13,705 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-11-23 12:03:13,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:13,705 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:03:13,714 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:03:13,764 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:03:13,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:13,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:14,076 INFO L256 TraceCheckUtils]: 0: Hoare triple {9487#true} call ULTIMATE.init(); {9487#true} is VALID [2018-11-23 12:03:14,077 INFO L273 TraceCheckUtils]: 1: Hoare triple {9487#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9487#true} is VALID [2018-11-23 12:03:14,077 INFO L273 TraceCheckUtils]: 2: Hoare triple {9487#true} assume true; {9487#true} is VALID [2018-11-23 12:03:14,077 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9487#true} {9487#true} #76#return; {9487#true} is VALID [2018-11-23 12:03:14,077 INFO L256 TraceCheckUtils]: 4: Hoare triple {9487#true} call #t~ret7 := main(); {9487#true} is VALID [2018-11-23 12:03:14,077 INFO L273 TraceCheckUtils]: 5: Hoare triple {9487#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {9487#true} is VALID [2018-11-23 12:03:14,077 INFO L273 TraceCheckUtils]: 6: Hoare triple {9487#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9487#true} is VALID [2018-11-23 12:03:14,077 INFO L273 TraceCheckUtils]: 7: Hoare triple {9487#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9487#true} is VALID [2018-11-23 12:03:14,078 INFO L273 TraceCheckUtils]: 8: Hoare triple {9487#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9487#true} is VALID [2018-11-23 12:03:14,078 INFO L273 TraceCheckUtils]: 9: Hoare triple {9487#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9487#true} is VALID [2018-11-23 12:03:14,078 INFO L273 TraceCheckUtils]: 10: Hoare triple {9487#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9487#true} is VALID [2018-11-23 12:03:14,078 INFO L273 TraceCheckUtils]: 11: Hoare triple {9487#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9487#true} is VALID [2018-11-23 12:03:14,078 INFO L273 TraceCheckUtils]: 12: Hoare triple {9487#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9487#true} is VALID [2018-11-23 12:03:14,078 INFO L273 TraceCheckUtils]: 13: Hoare triple {9487#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9487#true} is VALID [2018-11-23 12:03:14,078 INFO L273 TraceCheckUtils]: 14: Hoare triple {9487#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9487#true} is VALID [2018-11-23 12:03:14,078 INFO L273 TraceCheckUtils]: 15: Hoare triple {9487#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9487#true} is VALID [2018-11-23 12:03:14,078 INFO L273 TraceCheckUtils]: 16: Hoare triple {9487#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9487#true} is VALID [2018-11-23 12:03:14,079 INFO L273 TraceCheckUtils]: 17: Hoare triple {9487#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9487#true} is VALID [2018-11-23 12:03:14,079 INFO L273 TraceCheckUtils]: 18: Hoare triple {9487#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9487#true} is VALID [2018-11-23 12:03:14,079 INFO L273 TraceCheckUtils]: 19: Hoare triple {9487#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9487#true} is VALID [2018-11-23 12:03:14,079 INFO L273 TraceCheckUtils]: 20: Hoare triple {9487#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9487#true} is VALID [2018-11-23 12:03:14,079 INFO L273 TraceCheckUtils]: 21: Hoare triple {9487#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9487#true} is VALID [2018-11-23 12:03:14,079 INFO L273 TraceCheckUtils]: 22: Hoare triple {9487#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9487#true} is VALID [2018-11-23 12:03:14,079 INFO L273 TraceCheckUtils]: 23: Hoare triple {9487#true} assume !(~i~0 < 100000); {9487#true} is VALID [2018-11-23 12:03:14,079 INFO L273 TraceCheckUtils]: 24: Hoare triple {9487#true} ~i~0 := 0; {9487#true} is VALID [2018-11-23 12:03:14,079 INFO L273 TraceCheckUtils]: 25: Hoare triple {9487#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9487#true} is VALID [2018-11-23 12:03:14,080 INFO L273 TraceCheckUtils]: 26: Hoare triple {9487#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9487#true} is VALID [2018-11-23 12:03:14,080 INFO L273 TraceCheckUtils]: 27: Hoare triple {9487#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9487#true} is VALID [2018-11-23 12:03:14,080 INFO L273 TraceCheckUtils]: 28: Hoare triple {9487#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9487#true} is VALID [2018-11-23 12:03:14,080 INFO L273 TraceCheckUtils]: 29: Hoare triple {9487#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9487#true} is VALID [2018-11-23 12:03:14,080 INFO L273 TraceCheckUtils]: 30: Hoare triple {9487#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9487#true} is VALID [2018-11-23 12:03:14,080 INFO L273 TraceCheckUtils]: 31: Hoare triple {9487#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9487#true} is VALID [2018-11-23 12:03:14,080 INFO L273 TraceCheckUtils]: 32: Hoare triple {9487#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9487#true} is VALID [2018-11-23 12:03:14,080 INFO L273 TraceCheckUtils]: 33: Hoare triple {9487#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9487#true} is VALID [2018-11-23 12:03:14,081 INFO L273 TraceCheckUtils]: 34: Hoare triple {9487#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9487#true} is VALID [2018-11-23 12:03:14,081 INFO L273 TraceCheckUtils]: 35: Hoare triple {9487#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9487#true} is VALID [2018-11-23 12:03:14,081 INFO L273 TraceCheckUtils]: 36: Hoare triple {9487#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9487#true} is VALID [2018-11-23 12:03:14,081 INFO L273 TraceCheckUtils]: 37: Hoare triple {9487#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9487#true} is VALID [2018-11-23 12:03:14,081 INFO L273 TraceCheckUtils]: 38: Hoare triple {9487#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9487#true} is VALID [2018-11-23 12:03:14,081 INFO L273 TraceCheckUtils]: 39: Hoare triple {9487#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9487#true} is VALID [2018-11-23 12:03:14,081 INFO L273 TraceCheckUtils]: 40: Hoare triple {9487#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9487#true} is VALID [2018-11-23 12:03:14,081 INFO L273 TraceCheckUtils]: 41: Hoare triple {9487#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9487#true} is VALID [2018-11-23 12:03:14,081 INFO L273 TraceCheckUtils]: 42: Hoare triple {9487#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9487#true} is VALID [2018-11-23 12:03:14,082 INFO L273 TraceCheckUtils]: 43: Hoare triple {9487#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9487#true} is VALID [2018-11-23 12:03:14,082 INFO L273 TraceCheckUtils]: 44: Hoare triple {9487#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9487#true} is VALID [2018-11-23 12:03:14,082 INFO L273 TraceCheckUtils]: 45: Hoare triple {9487#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9487#true} is VALID [2018-11-23 12:03:14,082 INFO L273 TraceCheckUtils]: 46: Hoare triple {9487#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9487#true} is VALID [2018-11-23 12:03:14,082 INFO L273 TraceCheckUtils]: 47: Hoare triple {9487#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9487#true} is VALID [2018-11-23 12:03:14,082 INFO L273 TraceCheckUtils]: 48: Hoare triple {9487#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9487#true} is VALID [2018-11-23 12:03:14,082 INFO L273 TraceCheckUtils]: 49: Hoare triple {9487#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9487#true} is VALID [2018-11-23 12:03:14,082 INFO L273 TraceCheckUtils]: 50: Hoare triple {9487#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9487#true} is VALID [2018-11-23 12:03:14,082 INFO L273 TraceCheckUtils]: 51: Hoare triple {9487#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9487#true} is VALID [2018-11-23 12:03:14,083 INFO L273 TraceCheckUtils]: 52: Hoare triple {9487#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9487#true} is VALID [2018-11-23 12:03:14,083 INFO L273 TraceCheckUtils]: 53: Hoare triple {9487#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9487#true} is VALID [2018-11-23 12:03:14,083 INFO L273 TraceCheckUtils]: 54: Hoare triple {9487#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9487#true} is VALID [2018-11-23 12:03:14,083 INFO L273 TraceCheckUtils]: 55: Hoare triple {9487#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9487#true} is VALID [2018-11-23 12:03:14,083 INFO L273 TraceCheckUtils]: 56: Hoare triple {9487#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9487#true} is VALID [2018-11-23 12:03:14,083 INFO L273 TraceCheckUtils]: 57: Hoare triple {9487#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9487#true} is VALID [2018-11-23 12:03:14,083 INFO L273 TraceCheckUtils]: 58: Hoare triple {9487#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9487#true} is VALID [2018-11-23 12:03:14,083 INFO L273 TraceCheckUtils]: 59: Hoare triple {9487#true} assume !(~i~0 < 100000); {9487#true} is VALID [2018-11-23 12:03:14,084 INFO L273 TraceCheckUtils]: 60: Hoare triple {9487#true} ~i~0 := 0; {9690#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:14,084 INFO L273 TraceCheckUtils]: 61: Hoare triple {9690#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9690#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:14,085 INFO L273 TraceCheckUtils]: 62: Hoare triple {9690#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9490#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:14,085 INFO L273 TraceCheckUtils]: 63: Hoare triple {9490#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9490#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:14,085 INFO L273 TraceCheckUtils]: 64: Hoare triple {9490#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9491#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:14,086 INFO L273 TraceCheckUtils]: 65: Hoare triple {9491#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9491#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:14,086 INFO L273 TraceCheckUtils]: 66: Hoare triple {9491#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9492#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:14,087 INFO L273 TraceCheckUtils]: 67: Hoare triple {9492#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9492#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:14,088 INFO L273 TraceCheckUtils]: 68: Hoare triple {9492#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9493#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:14,088 INFO L273 TraceCheckUtils]: 69: Hoare triple {9493#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9493#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:14,089 INFO L273 TraceCheckUtils]: 70: Hoare triple {9493#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9494#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:14,089 INFO L273 TraceCheckUtils]: 71: Hoare triple {9494#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9494#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:14,090 INFO L273 TraceCheckUtils]: 72: Hoare triple {9494#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9495#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:14,091 INFO L273 TraceCheckUtils]: 73: Hoare triple {9495#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9495#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:14,091 INFO L273 TraceCheckUtils]: 74: Hoare triple {9495#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9496#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:14,092 INFO L273 TraceCheckUtils]: 75: Hoare triple {9496#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9496#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:14,093 INFO L273 TraceCheckUtils]: 76: Hoare triple {9496#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9497#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:14,093 INFO L273 TraceCheckUtils]: 77: Hoare triple {9497#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9497#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:14,094 INFO L273 TraceCheckUtils]: 78: Hoare triple {9497#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9498#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:14,094 INFO L273 TraceCheckUtils]: 79: Hoare triple {9498#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9498#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:14,095 INFO L273 TraceCheckUtils]: 80: Hoare triple {9498#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9499#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:14,096 INFO L273 TraceCheckUtils]: 81: Hoare triple {9499#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9499#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:14,097 INFO L273 TraceCheckUtils]: 82: Hoare triple {9499#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9500#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:14,097 INFO L273 TraceCheckUtils]: 83: Hoare triple {9500#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9500#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:14,098 INFO L273 TraceCheckUtils]: 84: Hoare triple {9500#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9501#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:14,098 INFO L273 TraceCheckUtils]: 85: Hoare triple {9501#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9501#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:14,099 INFO L273 TraceCheckUtils]: 86: Hoare triple {9501#(<= main_~i~0 12)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9502#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:14,100 INFO L273 TraceCheckUtils]: 87: Hoare triple {9502#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9502#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:14,100 INFO L273 TraceCheckUtils]: 88: Hoare triple {9502#(<= main_~i~0 13)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9503#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:14,101 INFO L273 TraceCheckUtils]: 89: Hoare triple {9503#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9503#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:14,102 INFO L273 TraceCheckUtils]: 90: Hoare triple {9503#(<= main_~i~0 14)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9504#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:14,102 INFO L273 TraceCheckUtils]: 91: Hoare triple {9504#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9504#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:14,103 INFO L273 TraceCheckUtils]: 92: Hoare triple {9504#(<= main_~i~0 15)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9505#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:14,103 INFO L273 TraceCheckUtils]: 93: Hoare triple {9505#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9505#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:14,104 INFO L273 TraceCheckUtils]: 94: Hoare triple {9505#(<= main_~i~0 16)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9506#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:14,105 INFO L273 TraceCheckUtils]: 95: Hoare triple {9506#(<= main_~i~0 17)} assume !(~i~0 < 100000); {9488#false} is VALID [2018-11-23 12:03:14,105 INFO L273 TraceCheckUtils]: 96: Hoare triple {9488#false} havoc ~x~0;~x~0 := 0; {9488#false} is VALID [2018-11-23 12:03:14,105 INFO L273 TraceCheckUtils]: 97: Hoare triple {9488#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {9488#false} is VALID [2018-11-23 12:03:14,106 INFO L256 TraceCheckUtils]: 98: Hoare triple {9488#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {9488#false} is VALID [2018-11-23 12:03:14,106 INFO L273 TraceCheckUtils]: 99: Hoare triple {9488#false} ~cond := #in~cond; {9488#false} is VALID [2018-11-23 12:03:14,106 INFO L273 TraceCheckUtils]: 100: Hoare triple {9488#false} assume 0 == ~cond; {9488#false} is VALID [2018-11-23 12:03:14,106 INFO L273 TraceCheckUtils]: 101: Hoare triple {9488#false} assume !false; {9488#false} is VALID [2018-11-23 12:03:14,112 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-11-23 12:03:14,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:14,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 12:03:14,132 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 102 [2018-11-23 12:03:14,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:14,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 12:03:14,231 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:14,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 12:03:14,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 12:03:14,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:03:14,233 INFO L87 Difference]: Start difference. First operand 107 states and 110 transitions. Second operand 21 states. [2018-11-23 12:03:14,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:14,882 INFO L93 Difference]: Finished difference Result 197 states and 205 transitions. [2018-11-23 12:03:14,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 12:03:14,882 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 102 [2018-11-23 12:03:14,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:14,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:03:14,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 139 transitions. [2018-11-23 12:03:14,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:03:14,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 139 transitions. [2018-11-23 12:03:14,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 139 transitions. [2018-11-23 12:03:15,039 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:15,042 INFO L225 Difference]: With dead ends: 197 [2018-11-23 12:03:15,042 INFO L226 Difference]: Without dead ends: 114 [2018-11-23 12:03:15,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:03:15,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-23 12:03:15,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2018-11-23 12:03:15,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:15,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 112 states. [2018-11-23 12:03:15,098 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 112 states. [2018-11-23 12:03:15,099 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 112 states. [2018-11-23 12:03:15,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:15,101 INFO L93 Difference]: Finished difference Result 114 states and 117 transitions. [2018-11-23 12:03:15,101 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 117 transitions. [2018-11-23 12:03:15,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:15,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:15,102 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 114 states. [2018-11-23 12:03:15,102 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 114 states. [2018-11-23 12:03:15,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:15,104 INFO L93 Difference]: Finished difference Result 114 states and 117 transitions. [2018-11-23 12:03:15,104 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 117 transitions. [2018-11-23 12:03:15,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:15,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:15,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:15,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:15,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-23 12:03:15,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 115 transitions. [2018-11-23 12:03:15,107 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 115 transitions. Word has length 102 [2018-11-23 12:03:15,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:15,108 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 115 transitions. [2018-11-23 12:03:15,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 12:03:15,108 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 115 transitions. [2018-11-23 12:03:15,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-23 12:03:15,109 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:15,109 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:15,109 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:15,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:15,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1112684590, now seen corresponding path program 17 times [2018-11-23 12:03:15,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:15,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:15,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:15,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:15,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:15,754 INFO L256 TraceCheckUtils]: 0: Hoare triple {10517#true} call ULTIMATE.init(); {10517#true} is VALID [2018-11-23 12:03:15,754 INFO L273 TraceCheckUtils]: 1: Hoare triple {10517#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10517#true} is VALID [2018-11-23 12:03:15,754 INFO L273 TraceCheckUtils]: 2: Hoare triple {10517#true} assume true; {10517#true} is VALID [2018-11-23 12:03:15,754 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10517#true} {10517#true} #76#return; {10517#true} is VALID [2018-11-23 12:03:15,755 INFO L256 TraceCheckUtils]: 4: Hoare triple {10517#true} call #t~ret7 := main(); {10517#true} is VALID [2018-11-23 12:03:15,755 INFO L273 TraceCheckUtils]: 5: Hoare triple {10517#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {10519#(= main_~i~0 0)} is VALID [2018-11-23 12:03:15,756 INFO L273 TraceCheckUtils]: 6: Hoare triple {10519#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10520#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:15,756 INFO L273 TraceCheckUtils]: 7: Hoare triple {10520#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10521#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:15,757 INFO L273 TraceCheckUtils]: 8: Hoare triple {10521#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10522#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:15,758 INFO L273 TraceCheckUtils]: 9: Hoare triple {10522#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10523#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:15,759 INFO L273 TraceCheckUtils]: 10: Hoare triple {10523#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10524#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:15,759 INFO L273 TraceCheckUtils]: 11: Hoare triple {10524#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10525#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:15,760 INFO L273 TraceCheckUtils]: 12: Hoare triple {10525#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10526#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:15,761 INFO L273 TraceCheckUtils]: 13: Hoare triple {10526#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10527#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:15,762 INFO L273 TraceCheckUtils]: 14: Hoare triple {10527#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10528#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:15,764 INFO L273 TraceCheckUtils]: 15: Hoare triple {10528#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10529#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:15,765 INFO L273 TraceCheckUtils]: 16: Hoare triple {10529#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10530#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:15,766 INFO L273 TraceCheckUtils]: 17: Hoare triple {10530#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10531#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:15,767 INFO L273 TraceCheckUtils]: 18: Hoare triple {10531#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10532#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:15,768 INFO L273 TraceCheckUtils]: 19: Hoare triple {10532#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10533#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:15,769 INFO L273 TraceCheckUtils]: 20: Hoare triple {10533#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10534#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:15,770 INFO L273 TraceCheckUtils]: 21: Hoare triple {10534#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10535#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:15,771 INFO L273 TraceCheckUtils]: 22: Hoare triple {10535#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10536#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:15,772 INFO L273 TraceCheckUtils]: 23: Hoare triple {10536#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10537#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:15,773 INFO L273 TraceCheckUtils]: 24: Hoare triple {10537#(<= main_~i~0 18)} assume !(~i~0 < 100000); {10518#false} is VALID [2018-11-23 12:03:15,773 INFO L273 TraceCheckUtils]: 25: Hoare triple {10518#false} ~i~0 := 0; {10518#false} is VALID [2018-11-23 12:03:15,773 INFO L273 TraceCheckUtils]: 26: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10518#false} is VALID [2018-11-23 12:03:15,773 INFO L273 TraceCheckUtils]: 27: Hoare triple {10518#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10518#false} is VALID [2018-11-23 12:03:15,774 INFO L273 TraceCheckUtils]: 28: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10518#false} is VALID [2018-11-23 12:03:15,774 INFO L273 TraceCheckUtils]: 29: Hoare triple {10518#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10518#false} is VALID [2018-11-23 12:03:15,774 INFO L273 TraceCheckUtils]: 30: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10518#false} is VALID [2018-11-23 12:03:15,774 INFO L273 TraceCheckUtils]: 31: Hoare triple {10518#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10518#false} is VALID [2018-11-23 12:03:15,775 INFO L273 TraceCheckUtils]: 32: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10518#false} is VALID [2018-11-23 12:03:15,775 INFO L273 TraceCheckUtils]: 33: Hoare triple {10518#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10518#false} is VALID [2018-11-23 12:03:15,775 INFO L273 TraceCheckUtils]: 34: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10518#false} is VALID [2018-11-23 12:03:15,775 INFO L273 TraceCheckUtils]: 35: Hoare triple {10518#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10518#false} is VALID [2018-11-23 12:03:15,776 INFO L273 TraceCheckUtils]: 36: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10518#false} is VALID [2018-11-23 12:03:15,776 INFO L273 TraceCheckUtils]: 37: Hoare triple {10518#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10518#false} is VALID [2018-11-23 12:03:15,776 INFO L273 TraceCheckUtils]: 38: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10518#false} is VALID [2018-11-23 12:03:15,776 INFO L273 TraceCheckUtils]: 39: Hoare triple {10518#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10518#false} is VALID [2018-11-23 12:03:15,776 INFO L273 TraceCheckUtils]: 40: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10518#false} is VALID [2018-11-23 12:03:15,776 INFO L273 TraceCheckUtils]: 41: Hoare triple {10518#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10518#false} is VALID [2018-11-23 12:03:15,776 INFO L273 TraceCheckUtils]: 42: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10518#false} is VALID [2018-11-23 12:03:15,777 INFO L273 TraceCheckUtils]: 43: Hoare triple {10518#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10518#false} is VALID [2018-11-23 12:03:15,777 INFO L273 TraceCheckUtils]: 44: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10518#false} is VALID [2018-11-23 12:03:15,777 INFO L273 TraceCheckUtils]: 45: Hoare triple {10518#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10518#false} is VALID [2018-11-23 12:03:15,777 INFO L273 TraceCheckUtils]: 46: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10518#false} is VALID [2018-11-23 12:03:15,777 INFO L273 TraceCheckUtils]: 47: Hoare triple {10518#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10518#false} is VALID [2018-11-23 12:03:15,777 INFO L273 TraceCheckUtils]: 48: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10518#false} is VALID [2018-11-23 12:03:15,777 INFO L273 TraceCheckUtils]: 49: Hoare triple {10518#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10518#false} is VALID [2018-11-23 12:03:15,778 INFO L273 TraceCheckUtils]: 50: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10518#false} is VALID [2018-11-23 12:03:15,778 INFO L273 TraceCheckUtils]: 51: Hoare triple {10518#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10518#false} is VALID [2018-11-23 12:03:15,778 INFO L273 TraceCheckUtils]: 52: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10518#false} is VALID [2018-11-23 12:03:15,778 INFO L273 TraceCheckUtils]: 53: Hoare triple {10518#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10518#false} is VALID [2018-11-23 12:03:15,778 INFO L273 TraceCheckUtils]: 54: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10518#false} is VALID [2018-11-23 12:03:15,778 INFO L273 TraceCheckUtils]: 55: Hoare triple {10518#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10518#false} is VALID [2018-11-23 12:03:15,778 INFO L273 TraceCheckUtils]: 56: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10518#false} is VALID [2018-11-23 12:03:15,779 INFO L273 TraceCheckUtils]: 57: Hoare triple {10518#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10518#false} is VALID [2018-11-23 12:03:15,779 INFO L273 TraceCheckUtils]: 58: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10518#false} is VALID [2018-11-23 12:03:15,779 INFO L273 TraceCheckUtils]: 59: Hoare triple {10518#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10518#false} is VALID [2018-11-23 12:03:15,779 INFO L273 TraceCheckUtils]: 60: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10518#false} is VALID [2018-11-23 12:03:15,779 INFO L273 TraceCheckUtils]: 61: Hoare triple {10518#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10518#false} is VALID [2018-11-23 12:03:15,779 INFO L273 TraceCheckUtils]: 62: Hoare triple {10518#false} assume !(~i~0 < 100000); {10518#false} is VALID [2018-11-23 12:03:15,780 INFO L273 TraceCheckUtils]: 63: Hoare triple {10518#false} ~i~0 := 0; {10518#false} is VALID [2018-11-23 12:03:15,780 INFO L273 TraceCheckUtils]: 64: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10518#false} is VALID [2018-11-23 12:03:15,780 INFO L273 TraceCheckUtils]: 65: Hoare triple {10518#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10518#false} is VALID [2018-11-23 12:03:15,780 INFO L273 TraceCheckUtils]: 66: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10518#false} is VALID [2018-11-23 12:03:15,780 INFO L273 TraceCheckUtils]: 67: Hoare triple {10518#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10518#false} is VALID [2018-11-23 12:03:15,780 INFO L273 TraceCheckUtils]: 68: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10518#false} is VALID [2018-11-23 12:03:15,780 INFO L273 TraceCheckUtils]: 69: Hoare triple {10518#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10518#false} is VALID [2018-11-23 12:03:15,781 INFO L273 TraceCheckUtils]: 70: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10518#false} is VALID [2018-11-23 12:03:15,781 INFO L273 TraceCheckUtils]: 71: Hoare triple {10518#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10518#false} is VALID [2018-11-23 12:03:15,781 INFO L273 TraceCheckUtils]: 72: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10518#false} is VALID [2018-11-23 12:03:15,781 INFO L273 TraceCheckUtils]: 73: Hoare triple {10518#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10518#false} is VALID [2018-11-23 12:03:15,781 INFO L273 TraceCheckUtils]: 74: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10518#false} is VALID [2018-11-23 12:03:15,781 INFO L273 TraceCheckUtils]: 75: Hoare triple {10518#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10518#false} is VALID [2018-11-23 12:03:15,781 INFO L273 TraceCheckUtils]: 76: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10518#false} is VALID [2018-11-23 12:03:15,782 INFO L273 TraceCheckUtils]: 77: Hoare triple {10518#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10518#false} is VALID [2018-11-23 12:03:15,782 INFO L273 TraceCheckUtils]: 78: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10518#false} is VALID [2018-11-23 12:03:15,782 INFO L273 TraceCheckUtils]: 79: Hoare triple {10518#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10518#false} is VALID [2018-11-23 12:03:15,782 INFO L273 TraceCheckUtils]: 80: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10518#false} is VALID [2018-11-23 12:03:15,782 INFO L273 TraceCheckUtils]: 81: Hoare triple {10518#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10518#false} is VALID [2018-11-23 12:03:15,782 INFO L273 TraceCheckUtils]: 82: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10518#false} is VALID [2018-11-23 12:03:15,782 INFO L273 TraceCheckUtils]: 83: Hoare triple {10518#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10518#false} is VALID [2018-11-23 12:03:15,799 INFO L273 TraceCheckUtils]: 84: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10518#false} is VALID [2018-11-23 12:03:15,800 INFO L273 TraceCheckUtils]: 85: Hoare triple {10518#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10518#false} is VALID [2018-11-23 12:03:15,800 INFO L273 TraceCheckUtils]: 86: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10518#false} is VALID [2018-11-23 12:03:15,800 INFO L273 TraceCheckUtils]: 87: Hoare triple {10518#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10518#false} is VALID [2018-11-23 12:03:15,800 INFO L273 TraceCheckUtils]: 88: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10518#false} is VALID [2018-11-23 12:03:15,800 INFO L273 TraceCheckUtils]: 89: Hoare triple {10518#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10518#false} is VALID [2018-11-23 12:03:15,800 INFO L273 TraceCheckUtils]: 90: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10518#false} is VALID [2018-11-23 12:03:15,801 INFO L273 TraceCheckUtils]: 91: Hoare triple {10518#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10518#false} is VALID [2018-11-23 12:03:15,801 INFO L273 TraceCheckUtils]: 92: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10518#false} is VALID [2018-11-23 12:03:15,801 INFO L273 TraceCheckUtils]: 93: Hoare triple {10518#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10518#false} is VALID [2018-11-23 12:03:15,801 INFO L273 TraceCheckUtils]: 94: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10518#false} is VALID [2018-11-23 12:03:15,801 INFO L273 TraceCheckUtils]: 95: Hoare triple {10518#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10518#false} is VALID [2018-11-23 12:03:15,802 INFO L273 TraceCheckUtils]: 96: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10518#false} is VALID [2018-11-23 12:03:15,802 INFO L273 TraceCheckUtils]: 97: Hoare triple {10518#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10518#false} is VALID [2018-11-23 12:03:15,803 INFO L273 TraceCheckUtils]: 98: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10518#false} is VALID [2018-11-23 12:03:15,803 INFO L273 TraceCheckUtils]: 99: Hoare triple {10518#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10518#false} is VALID [2018-11-23 12:03:15,803 INFO L273 TraceCheckUtils]: 100: Hoare triple {10518#false} assume !(~i~0 < 100000); {10518#false} is VALID [2018-11-23 12:03:15,803 INFO L273 TraceCheckUtils]: 101: Hoare triple {10518#false} havoc ~x~0;~x~0 := 0; {10518#false} is VALID [2018-11-23 12:03:15,803 INFO L273 TraceCheckUtils]: 102: Hoare triple {10518#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {10518#false} is VALID [2018-11-23 12:03:15,803 INFO L256 TraceCheckUtils]: 103: Hoare triple {10518#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {10518#false} is VALID [2018-11-23 12:03:15,803 INFO L273 TraceCheckUtils]: 104: Hoare triple {10518#false} ~cond := #in~cond; {10518#false} is VALID [2018-11-23 12:03:15,803 INFO L273 TraceCheckUtils]: 105: Hoare triple {10518#false} assume 0 == ~cond; {10518#false} is VALID [2018-11-23 12:03:15,804 INFO L273 TraceCheckUtils]: 106: Hoare triple {10518#false} assume !false; {10518#false} is VALID [2018-11-23 12:03:15,808 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2018-11-23 12:03:15,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:15,809 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:03:15,817 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:04:34,014 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-11-23 12:04:34,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:04:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:34,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:04:34,275 INFO L256 TraceCheckUtils]: 0: Hoare triple {10517#true} call ULTIMATE.init(); {10517#true} is VALID [2018-11-23 12:04:34,276 INFO L273 TraceCheckUtils]: 1: Hoare triple {10517#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10517#true} is VALID [2018-11-23 12:04:34,276 INFO L273 TraceCheckUtils]: 2: Hoare triple {10517#true} assume true; {10517#true} is VALID [2018-11-23 12:04:34,276 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10517#true} {10517#true} #76#return; {10517#true} is VALID [2018-11-23 12:04:34,276 INFO L256 TraceCheckUtils]: 4: Hoare triple {10517#true} call #t~ret7 := main(); {10517#true} is VALID [2018-11-23 12:04:34,276 INFO L273 TraceCheckUtils]: 5: Hoare triple {10517#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {10517#true} is VALID [2018-11-23 12:04:34,277 INFO L273 TraceCheckUtils]: 6: Hoare triple {10517#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10517#true} is VALID [2018-11-23 12:04:34,277 INFO L273 TraceCheckUtils]: 7: Hoare triple {10517#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10517#true} is VALID [2018-11-23 12:04:34,277 INFO L273 TraceCheckUtils]: 8: Hoare triple {10517#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10517#true} is VALID [2018-11-23 12:04:34,277 INFO L273 TraceCheckUtils]: 9: Hoare triple {10517#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10517#true} is VALID [2018-11-23 12:04:34,277 INFO L273 TraceCheckUtils]: 10: Hoare triple {10517#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10517#true} is VALID [2018-11-23 12:04:34,278 INFO L273 TraceCheckUtils]: 11: Hoare triple {10517#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10517#true} is VALID [2018-11-23 12:04:34,278 INFO L273 TraceCheckUtils]: 12: Hoare triple {10517#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10517#true} is VALID [2018-11-23 12:04:34,278 INFO L273 TraceCheckUtils]: 13: Hoare triple {10517#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10517#true} is VALID [2018-11-23 12:04:34,278 INFO L273 TraceCheckUtils]: 14: Hoare triple {10517#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10517#true} is VALID [2018-11-23 12:04:34,278 INFO L273 TraceCheckUtils]: 15: Hoare triple {10517#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10517#true} is VALID [2018-11-23 12:04:34,279 INFO L273 TraceCheckUtils]: 16: Hoare triple {10517#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10517#true} is VALID [2018-11-23 12:04:34,279 INFO L273 TraceCheckUtils]: 17: Hoare triple {10517#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10517#true} is VALID [2018-11-23 12:04:34,279 INFO L273 TraceCheckUtils]: 18: Hoare triple {10517#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10517#true} is VALID [2018-11-23 12:04:34,279 INFO L273 TraceCheckUtils]: 19: Hoare triple {10517#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10517#true} is VALID [2018-11-23 12:04:34,279 INFO L273 TraceCheckUtils]: 20: Hoare triple {10517#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10517#true} is VALID [2018-11-23 12:04:34,279 INFO L273 TraceCheckUtils]: 21: Hoare triple {10517#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10517#true} is VALID [2018-11-23 12:04:34,279 INFO L273 TraceCheckUtils]: 22: Hoare triple {10517#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10517#true} is VALID [2018-11-23 12:04:34,279 INFO L273 TraceCheckUtils]: 23: Hoare triple {10517#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10517#true} is VALID [2018-11-23 12:04:34,280 INFO L273 TraceCheckUtils]: 24: Hoare triple {10517#true} assume !(~i~0 < 100000); {10517#true} is VALID [2018-11-23 12:04:34,280 INFO L273 TraceCheckUtils]: 25: Hoare triple {10517#true} ~i~0 := 0; {10517#true} is VALID [2018-11-23 12:04:34,280 INFO L273 TraceCheckUtils]: 26: Hoare triple {10517#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10517#true} is VALID [2018-11-23 12:04:34,280 INFO L273 TraceCheckUtils]: 27: Hoare triple {10517#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10517#true} is VALID [2018-11-23 12:04:34,280 INFO L273 TraceCheckUtils]: 28: Hoare triple {10517#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10517#true} is VALID [2018-11-23 12:04:34,280 INFO L273 TraceCheckUtils]: 29: Hoare triple {10517#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10517#true} is VALID [2018-11-23 12:04:34,280 INFO L273 TraceCheckUtils]: 30: Hoare triple {10517#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10517#true} is VALID [2018-11-23 12:04:34,280 INFO L273 TraceCheckUtils]: 31: Hoare triple {10517#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10517#true} is VALID [2018-11-23 12:04:34,281 INFO L273 TraceCheckUtils]: 32: Hoare triple {10517#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10517#true} is VALID [2018-11-23 12:04:34,281 INFO L273 TraceCheckUtils]: 33: Hoare triple {10517#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10517#true} is VALID [2018-11-23 12:04:34,281 INFO L273 TraceCheckUtils]: 34: Hoare triple {10517#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10517#true} is VALID [2018-11-23 12:04:34,281 INFO L273 TraceCheckUtils]: 35: Hoare triple {10517#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10517#true} is VALID [2018-11-23 12:04:34,281 INFO L273 TraceCheckUtils]: 36: Hoare triple {10517#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10517#true} is VALID [2018-11-23 12:04:34,281 INFO L273 TraceCheckUtils]: 37: Hoare triple {10517#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10517#true} is VALID [2018-11-23 12:04:34,281 INFO L273 TraceCheckUtils]: 38: Hoare triple {10517#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10517#true} is VALID [2018-11-23 12:04:34,281 INFO L273 TraceCheckUtils]: 39: Hoare triple {10517#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10517#true} is VALID [2018-11-23 12:04:34,281 INFO L273 TraceCheckUtils]: 40: Hoare triple {10517#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10517#true} is VALID [2018-11-23 12:04:34,282 INFO L273 TraceCheckUtils]: 41: Hoare triple {10517#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10517#true} is VALID [2018-11-23 12:04:34,282 INFO L273 TraceCheckUtils]: 42: Hoare triple {10517#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10517#true} is VALID [2018-11-23 12:04:34,282 INFO L273 TraceCheckUtils]: 43: Hoare triple {10517#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10517#true} is VALID [2018-11-23 12:04:34,282 INFO L273 TraceCheckUtils]: 44: Hoare triple {10517#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10517#true} is VALID [2018-11-23 12:04:34,282 INFO L273 TraceCheckUtils]: 45: Hoare triple {10517#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10517#true} is VALID [2018-11-23 12:04:34,282 INFO L273 TraceCheckUtils]: 46: Hoare triple {10517#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10517#true} is VALID [2018-11-23 12:04:34,282 INFO L273 TraceCheckUtils]: 47: Hoare triple {10517#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10517#true} is VALID [2018-11-23 12:04:34,282 INFO L273 TraceCheckUtils]: 48: Hoare triple {10517#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10517#true} is VALID [2018-11-23 12:04:34,282 INFO L273 TraceCheckUtils]: 49: Hoare triple {10517#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10517#true} is VALID [2018-11-23 12:04:34,283 INFO L273 TraceCheckUtils]: 50: Hoare triple {10517#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10517#true} is VALID [2018-11-23 12:04:34,283 INFO L273 TraceCheckUtils]: 51: Hoare triple {10517#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10517#true} is VALID [2018-11-23 12:04:34,283 INFO L273 TraceCheckUtils]: 52: Hoare triple {10517#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10517#true} is VALID [2018-11-23 12:04:34,283 INFO L273 TraceCheckUtils]: 53: Hoare triple {10517#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10517#true} is VALID [2018-11-23 12:04:34,283 INFO L273 TraceCheckUtils]: 54: Hoare triple {10517#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10517#true} is VALID [2018-11-23 12:04:34,283 INFO L273 TraceCheckUtils]: 55: Hoare triple {10517#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10517#true} is VALID [2018-11-23 12:04:34,283 INFO L273 TraceCheckUtils]: 56: Hoare triple {10517#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10517#true} is VALID [2018-11-23 12:04:34,283 INFO L273 TraceCheckUtils]: 57: Hoare triple {10517#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10517#true} is VALID [2018-11-23 12:04:34,283 INFO L273 TraceCheckUtils]: 58: Hoare triple {10517#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10517#true} is VALID [2018-11-23 12:04:34,283 INFO L273 TraceCheckUtils]: 59: Hoare triple {10517#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10517#true} is VALID [2018-11-23 12:04:34,284 INFO L273 TraceCheckUtils]: 60: Hoare triple {10517#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10517#true} is VALID [2018-11-23 12:04:34,284 INFO L273 TraceCheckUtils]: 61: Hoare triple {10517#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10517#true} is VALID [2018-11-23 12:04:34,284 INFO L273 TraceCheckUtils]: 62: Hoare triple {10517#true} assume !(~i~0 < 100000); {10517#true} is VALID [2018-11-23 12:04:34,284 INFO L273 TraceCheckUtils]: 63: Hoare triple {10517#true} ~i~0 := 0; {10730#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:34,285 INFO L273 TraceCheckUtils]: 64: Hoare triple {10730#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10730#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:34,285 INFO L273 TraceCheckUtils]: 65: Hoare triple {10730#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10520#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:34,285 INFO L273 TraceCheckUtils]: 66: Hoare triple {10520#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10520#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:34,286 INFO L273 TraceCheckUtils]: 67: Hoare triple {10520#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10521#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:34,286 INFO L273 TraceCheckUtils]: 68: Hoare triple {10521#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10521#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:34,287 INFO L273 TraceCheckUtils]: 69: Hoare triple {10521#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10522#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:34,287 INFO L273 TraceCheckUtils]: 70: Hoare triple {10522#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10522#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:34,288 INFO L273 TraceCheckUtils]: 71: Hoare triple {10522#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10523#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:34,288 INFO L273 TraceCheckUtils]: 72: Hoare triple {10523#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10523#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:34,289 INFO L273 TraceCheckUtils]: 73: Hoare triple {10523#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10524#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:34,290 INFO L273 TraceCheckUtils]: 74: Hoare triple {10524#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10524#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:34,290 INFO L273 TraceCheckUtils]: 75: Hoare triple {10524#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10525#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:34,291 INFO L273 TraceCheckUtils]: 76: Hoare triple {10525#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10525#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:34,292 INFO L273 TraceCheckUtils]: 77: Hoare triple {10525#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10526#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:34,292 INFO L273 TraceCheckUtils]: 78: Hoare triple {10526#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10526#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:34,293 INFO L273 TraceCheckUtils]: 79: Hoare triple {10526#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10527#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:34,294 INFO L273 TraceCheckUtils]: 80: Hoare triple {10527#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10527#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:34,294 INFO L273 TraceCheckUtils]: 81: Hoare triple {10527#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10528#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:34,295 INFO L273 TraceCheckUtils]: 82: Hoare triple {10528#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10528#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:34,296 INFO L273 TraceCheckUtils]: 83: Hoare triple {10528#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10529#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:34,296 INFO L273 TraceCheckUtils]: 84: Hoare triple {10529#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10529#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:34,297 INFO L273 TraceCheckUtils]: 85: Hoare triple {10529#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10530#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:34,297 INFO L273 TraceCheckUtils]: 86: Hoare triple {10530#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10530#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:34,298 INFO L273 TraceCheckUtils]: 87: Hoare triple {10530#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10531#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:34,299 INFO L273 TraceCheckUtils]: 88: Hoare triple {10531#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10531#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:34,299 INFO L273 TraceCheckUtils]: 89: Hoare triple {10531#(<= main_~i~0 12)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10532#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:34,300 INFO L273 TraceCheckUtils]: 90: Hoare triple {10532#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10532#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:34,301 INFO L273 TraceCheckUtils]: 91: Hoare triple {10532#(<= main_~i~0 13)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10533#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:34,301 INFO L273 TraceCheckUtils]: 92: Hoare triple {10533#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10533#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:34,302 INFO L273 TraceCheckUtils]: 93: Hoare triple {10533#(<= main_~i~0 14)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10534#(<= main_~i~0 15)} is VALID [2018-11-23 12:04:34,303 INFO L273 TraceCheckUtils]: 94: Hoare triple {10534#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10534#(<= main_~i~0 15)} is VALID [2018-11-23 12:04:34,303 INFO L273 TraceCheckUtils]: 95: Hoare triple {10534#(<= main_~i~0 15)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10535#(<= main_~i~0 16)} is VALID [2018-11-23 12:04:34,304 INFO L273 TraceCheckUtils]: 96: Hoare triple {10535#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10535#(<= main_~i~0 16)} is VALID [2018-11-23 12:04:34,305 INFO L273 TraceCheckUtils]: 97: Hoare triple {10535#(<= main_~i~0 16)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10536#(<= main_~i~0 17)} is VALID [2018-11-23 12:04:34,305 INFO L273 TraceCheckUtils]: 98: Hoare triple {10536#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10536#(<= main_~i~0 17)} is VALID [2018-11-23 12:04:34,306 INFO L273 TraceCheckUtils]: 99: Hoare triple {10536#(<= main_~i~0 17)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10537#(<= main_~i~0 18)} is VALID [2018-11-23 12:04:34,307 INFO L273 TraceCheckUtils]: 100: Hoare triple {10537#(<= main_~i~0 18)} assume !(~i~0 < 100000); {10518#false} is VALID [2018-11-23 12:04:34,307 INFO L273 TraceCheckUtils]: 101: Hoare triple {10518#false} havoc ~x~0;~x~0 := 0; {10518#false} is VALID [2018-11-23 12:04:34,307 INFO L273 TraceCheckUtils]: 102: Hoare triple {10518#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {10518#false} is VALID [2018-11-23 12:04:34,307 INFO L256 TraceCheckUtils]: 103: Hoare triple {10518#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {10518#false} is VALID [2018-11-23 12:04:34,307 INFO L273 TraceCheckUtils]: 104: Hoare triple {10518#false} ~cond := #in~cond; {10518#false} is VALID [2018-11-23 12:04:34,308 INFO L273 TraceCheckUtils]: 105: Hoare triple {10518#false} assume 0 == ~cond; {10518#false} is VALID [2018-11-23 12:04:34,308 INFO L273 TraceCheckUtils]: 106: Hoare triple {10518#false} assume !false; {10518#false} is VALID [2018-11-23 12:04:34,314 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-11-23 12:04:34,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:04:34,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 12:04:34,348 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 107 [2018-11-23 12:04:34,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:34,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 12:04:34,439 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:04:34,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 12:04:34,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 12:04:34,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:04:34,440 INFO L87 Difference]: Start difference. First operand 112 states and 115 transitions. Second operand 22 states. [2018-11-23 12:04:35,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:35,014 INFO L93 Difference]: Finished difference Result 206 states and 214 transitions. [2018-11-23 12:04:35,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 12:04:35,014 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 107 [2018-11-23 12:04:35,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:35,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:04:35,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 144 transitions. [2018-11-23 12:04:35,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:04:35,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 144 transitions. [2018-11-23 12:04:35,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 144 transitions. [2018-11-23 12:04:35,169 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:35,171 INFO L225 Difference]: With dead ends: 206 [2018-11-23 12:04:35,171 INFO L226 Difference]: Without dead ends: 119 [2018-11-23 12:04:35,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:04:35,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-23 12:04:35,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-11-23 12:04:35,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:35,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 117 states. [2018-11-23 12:04:35,234 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 117 states. [2018-11-23 12:04:35,234 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 117 states. [2018-11-23 12:04:35,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:35,237 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2018-11-23 12:04:35,237 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2018-11-23 12:04:35,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:35,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:35,238 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 119 states. [2018-11-23 12:04:35,238 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 119 states. [2018-11-23 12:04:35,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:35,240 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2018-11-23 12:04:35,240 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2018-11-23 12:04:35,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:35,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:35,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:35,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:35,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-23 12:04:35,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 120 transitions. [2018-11-23 12:04:35,243 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 120 transitions. Word has length 107 [2018-11-23 12:04:35,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:35,243 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 120 transitions. [2018-11-23 12:04:35,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 12:04:35,244 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2018-11-23 12:04:35,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-23 12:04:35,245 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:35,245 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:04:35,245 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:35,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:35,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1010160530, now seen corresponding path program 18 times [2018-11-23 12:04:35,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:35,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:35,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:35,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:04:35,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:35,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:36,081 INFO L256 TraceCheckUtils]: 0: Hoare triple {11595#true} call ULTIMATE.init(); {11595#true} is VALID [2018-11-23 12:04:36,082 INFO L273 TraceCheckUtils]: 1: Hoare triple {11595#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11595#true} is VALID [2018-11-23 12:04:36,082 INFO L273 TraceCheckUtils]: 2: Hoare triple {11595#true} assume true; {11595#true} is VALID [2018-11-23 12:04:36,082 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11595#true} {11595#true} #76#return; {11595#true} is VALID [2018-11-23 12:04:36,082 INFO L256 TraceCheckUtils]: 4: Hoare triple {11595#true} call #t~ret7 := main(); {11595#true} is VALID [2018-11-23 12:04:36,082 INFO L273 TraceCheckUtils]: 5: Hoare triple {11595#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {11597#(= main_~i~0 0)} is VALID [2018-11-23 12:04:36,083 INFO L273 TraceCheckUtils]: 6: Hoare triple {11597#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11598#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:36,083 INFO L273 TraceCheckUtils]: 7: Hoare triple {11598#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11599#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:36,084 INFO L273 TraceCheckUtils]: 8: Hoare triple {11599#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11600#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:36,085 INFO L273 TraceCheckUtils]: 9: Hoare triple {11600#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11601#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:36,085 INFO L273 TraceCheckUtils]: 10: Hoare triple {11601#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11602#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:36,086 INFO L273 TraceCheckUtils]: 11: Hoare triple {11602#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11603#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:36,086 INFO L273 TraceCheckUtils]: 12: Hoare triple {11603#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11604#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:36,087 INFO L273 TraceCheckUtils]: 13: Hoare triple {11604#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11605#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:36,088 INFO L273 TraceCheckUtils]: 14: Hoare triple {11605#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11606#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:36,089 INFO L273 TraceCheckUtils]: 15: Hoare triple {11606#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11607#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:36,090 INFO L273 TraceCheckUtils]: 16: Hoare triple {11607#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11608#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:36,091 INFO L273 TraceCheckUtils]: 17: Hoare triple {11608#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11609#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:36,092 INFO L273 TraceCheckUtils]: 18: Hoare triple {11609#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11610#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:36,093 INFO L273 TraceCheckUtils]: 19: Hoare triple {11610#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11611#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:36,094 INFO L273 TraceCheckUtils]: 20: Hoare triple {11611#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11612#(<= main_~i~0 15)} is VALID [2018-11-23 12:04:36,095 INFO L273 TraceCheckUtils]: 21: Hoare triple {11612#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11613#(<= main_~i~0 16)} is VALID [2018-11-23 12:04:36,095 INFO L273 TraceCheckUtils]: 22: Hoare triple {11613#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11614#(<= main_~i~0 17)} is VALID [2018-11-23 12:04:36,096 INFO L273 TraceCheckUtils]: 23: Hoare triple {11614#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11615#(<= main_~i~0 18)} is VALID [2018-11-23 12:04:36,097 INFO L273 TraceCheckUtils]: 24: Hoare triple {11615#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11616#(<= main_~i~0 19)} is VALID [2018-11-23 12:04:36,098 INFO L273 TraceCheckUtils]: 25: Hoare triple {11616#(<= main_~i~0 19)} assume !(~i~0 < 100000); {11596#false} is VALID [2018-11-23 12:04:36,098 INFO L273 TraceCheckUtils]: 26: Hoare triple {11596#false} ~i~0 := 0; {11596#false} is VALID [2018-11-23 12:04:36,098 INFO L273 TraceCheckUtils]: 27: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11596#false} is VALID [2018-11-23 12:04:36,099 INFO L273 TraceCheckUtils]: 28: Hoare triple {11596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11596#false} is VALID [2018-11-23 12:04:36,099 INFO L273 TraceCheckUtils]: 29: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11596#false} is VALID [2018-11-23 12:04:36,099 INFO L273 TraceCheckUtils]: 30: Hoare triple {11596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11596#false} is VALID [2018-11-23 12:04:36,099 INFO L273 TraceCheckUtils]: 31: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11596#false} is VALID [2018-11-23 12:04:36,099 INFO L273 TraceCheckUtils]: 32: Hoare triple {11596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11596#false} is VALID [2018-11-23 12:04:36,100 INFO L273 TraceCheckUtils]: 33: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11596#false} is VALID [2018-11-23 12:04:36,100 INFO L273 TraceCheckUtils]: 34: Hoare triple {11596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11596#false} is VALID [2018-11-23 12:04:36,100 INFO L273 TraceCheckUtils]: 35: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11596#false} is VALID [2018-11-23 12:04:36,100 INFO L273 TraceCheckUtils]: 36: Hoare triple {11596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11596#false} is VALID [2018-11-23 12:04:36,100 INFO L273 TraceCheckUtils]: 37: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11596#false} is VALID [2018-11-23 12:04:36,101 INFO L273 TraceCheckUtils]: 38: Hoare triple {11596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11596#false} is VALID [2018-11-23 12:04:36,101 INFO L273 TraceCheckUtils]: 39: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11596#false} is VALID [2018-11-23 12:04:36,101 INFO L273 TraceCheckUtils]: 40: Hoare triple {11596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11596#false} is VALID [2018-11-23 12:04:36,101 INFO L273 TraceCheckUtils]: 41: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11596#false} is VALID [2018-11-23 12:04:36,101 INFO L273 TraceCheckUtils]: 42: Hoare triple {11596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11596#false} is VALID [2018-11-23 12:04:36,102 INFO L273 TraceCheckUtils]: 43: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11596#false} is VALID [2018-11-23 12:04:36,102 INFO L273 TraceCheckUtils]: 44: Hoare triple {11596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11596#false} is VALID [2018-11-23 12:04:36,102 INFO L273 TraceCheckUtils]: 45: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11596#false} is VALID [2018-11-23 12:04:36,102 INFO L273 TraceCheckUtils]: 46: Hoare triple {11596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11596#false} is VALID [2018-11-23 12:04:36,102 INFO L273 TraceCheckUtils]: 47: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11596#false} is VALID [2018-11-23 12:04:36,103 INFO L273 TraceCheckUtils]: 48: Hoare triple {11596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11596#false} is VALID [2018-11-23 12:04:36,103 INFO L273 TraceCheckUtils]: 49: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11596#false} is VALID [2018-11-23 12:04:36,103 INFO L273 TraceCheckUtils]: 50: Hoare triple {11596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11596#false} is VALID [2018-11-23 12:04:36,103 INFO L273 TraceCheckUtils]: 51: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11596#false} is VALID [2018-11-23 12:04:36,103 INFO L273 TraceCheckUtils]: 52: Hoare triple {11596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11596#false} is VALID [2018-11-23 12:04:36,104 INFO L273 TraceCheckUtils]: 53: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11596#false} is VALID [2018-11-23 12:04:36,104 INFO L273 TraceCheckUtils]: 54: Hoare triple {11596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11596#false} is VALID [2018-11-23 12:04:36,104 INFO L273 TraceCheckUtils]: 55: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11596#false} is VALID [2018-11-23 12:04:36,104 INFO L273 TraceCheckUtils]: 56: Hoare triple {11596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11596#false} is VALID [2018-11-23 12:04:36,104 INFO L273 TraceCheckUtils]: 57: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11596#false} is VALID [2018-11-23 12:04:36,104 INFO L273 TraceCheckUtils]: 58: Hoare triple {11596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11596#false} is VALID [2018-11-23 12:04:36,105 INFO L273 TraceCheckUtils]: 59: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11596#false} is VALID [2018-11-23 12:04:36,105 INFO L273 TraceCheckUtils]: 60: Hoare triple {11596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11596#false} is VALID [2018-11-23 12:04:36,105 INFO L273 TraceCheckUtils]: 61: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11596#false} is VALID [2018-11-23 12:04:36,105 INFO L273 TraceCheckUtils]: 62: Hoare triple {11596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11596#false} is VALID [2018-11-23 12:04:36,105 INFO L273 TraceCheckUtils]: 63: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11596#false} is VALID [2018-11-23 12:04:36,105 INFO L273 TraceCheckUtils]: 64: Hoare triple {11596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11596#false} is VALID [2018-11-23 12:04:36,105 INFO L273 TraceCheckUtils]: 65: Hoare triple {11596#false} assume !(~i~0 < 100000); {11596#false} is VALID [2018-11-23 12:04:36,105 INFO L273 TraceCheckUtils]: 66: Hoare triple {11596#false} ~i~0 := 0; {11596#false} is VALID [2018-11-23 12:04:36,105 INFO L273 TraceCheckUtils]: 67: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11596#false} is VALID [2018-11-23 12:04:36,106 INFO L273 TraceCheckUtils]: 68: Hoare triple {11596#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11596#false} is VALID [2018-11-23 12:04:36,106 INFO L273 TraceCheckUtils]: 69: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11596#false} is VALID [2018-11-23 12:04:36,106 INFO L273 TraceCheckUtils]: 70: Hoare triple {11596#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11596#false} is VALID [2018-11-23 12:04:36,106 INFO L273 TraceCheckUtils]: 71: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11596#false} is VALID [2018-11-23 12:04:36,106 INFO L273 TraceCheckUtils]: 72: Hoare triple {11596#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11596#false} is VALID [2018-11-23 12:04:36,106 INFO L273 TraceCheckUtils]: 73: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11596#false} is VALID [2018-11-23 12:04:36,106 INFO L273 TraceCheckUtils]: 74: Hoare triple {11596#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11596#false} is VALID [2018-11-23 12:04:36,106 INFO L273 TraceCheckUtils]: 75: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11596#false} is VALID [2018-11-23 12:04:36,106 INFO L273 TraceCheckUtils]: 76: Hoare triple {11596#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11596#false} is VALID [2018-11-23 12:04:36,107 INFO L273 TraceCheckUtils]: 77: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11596#false} is VALID [2018-11-23 12:04:36,107 INFO L273 TraceCheckUtils]: 78: Hoare triple {11596#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11596#false} is VALID [2018-11-23 12:04:36,107 INFO L273 TraceCheckUtils]: 79: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11596#false} is VALID [2018-11-23 12:04:36,107 INFO L273 TraceCheckUtils]: 80: Hoare triple {11596#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11596#false} is VALID [2018-11-23 12:04:36,107 INFO L273 TraceCheckUtils]: 81: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11596#false} is VALID [2018-11-23 12:04:36,107 INFO L273 TraceCheckUtils]: 82: Hoare triple {11596#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11596#false} is VALID [2018-11-23 12:04:36,107 INFO L273 TraceCheckUtils]: 83: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11596#false} is VALID [2018-11-23 12:04:36,107 INFO L273 TraceCheckUtils]: 84: Hoare triple {11596#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11596#false} is VALID [2018-11-23 12:04:36,107 INFO L273 TraceCheckUtils]: 85: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11596#false} is VALID [2018-11-23 12:04:36,108 INFO L273 TraceCheckUtils]: 86: Hoare triple {11596#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11596#false} is VALID [2018-11-23 12:04:36,108 INFO L273 TraceCheckUtils]: 87: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11596#false} is VALID [2018-11-23 12:04:36,108 INFO L273 TraceCheckUtils]: 88: Hoare triple {11596#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11596#false} is VALID [2018-11-23 12:04:36,108 INFO L273 TraceCheckUtils]: 89: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11596#false} is VALID [2018-11-23 12:04:36,108 INFO L273 TraceCheckUtils]: 90: Hoare triple {11596#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11596#false} is VALID [2018-11-23 12:04:36,108 INFO L273 TraceCheckUtils]: 91: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11596#false} is VALID [2018-11-23 12:04:36,108 INFO L273 TraceCheckUtils]: 92: Hoare triple {11596#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11596#false} is VALID [2018-11-23 12:04:36,108 INFO L273 TraceCheckUtils]: 93: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11596#false} is VALID [2018-11-23 12:04:36,108 INFO L273 TraceCheckUtils]: 94: Hoare triple {11596#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11596#false} is VALID [2018-11-23 12:04:36,109 INFO L273 TraceCheckUtils]: 95: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11596#false} is VALID [2018-11-23 12:04:36,109 INFO L273 TraceCheckUtils]: 96: Hoare triple {11596#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11596#false} is VALID [2018-11-23 12:04:36,109 INFO L273 TraceCheckUtils]: 97: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11596#false} is VALID [2018-11-23 12:04:36,109 INFO L273 TraceCheckUtils]: 98: Hoare triple {11596#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11596#false} is VALID [2018-11-23 12:04:36,109 INFO L273 TraceCheckUtils]: 99: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11596#false} is VALID [2018-11-23 12:04:36,109 INFO L273 TraceCheckUtils]: 100: Hoare triple {11596#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11596#false} is VALID [2018-11-23 12:04:36,109 INFO L273 TraceCheckUtils]: 101: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11596#false} is VALID [2018-11-23 12:04:36,109 INFO L273 TraceCheckUtils]: 102: Hoare triple {11596#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11596#false} is VALID [2018-11-23 12:04:36,110 INFO L273 TraceCheckUtils]: 103: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11596#false} is VALID [2018-11-23 12:04:36,110 INFO L273 TraceCheckUtils]: 104: Hoare triple {11596#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11596#false} is VALID [2018-11-23 12:04:36,110 INFO L273 TraceCheckUtils]: 105: Hoare triple {11596#false} assume !(~i~0 < 100000); {11596#false} is VALID [2018-11-23 12:04:36,110 INFO L273 TraceCheckUtils]: 106: Hoare triple {11596#false} havoc ~x~0;~x~0 := 0; {11596#false} is VALID [2018-11-23 12:04:36,110 INFO L273 TraceCheckUtils]: 107: Hoare triple {11596#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {11596#false} is VALID [2018-11-23 12:04:36,110 INFO L256 TraceCheckUtils]: 108: Hoare triple {11596#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {11596#false} is VALID [2018-11-23 12:04:36,110 INFO L273 TraceCheckUtils]: 109: Hoare triple {11596#false} ~cond := #in~cond; {11596#false} is VALID [2018-11-23 12:04:36,110 INFO L273 TraceCheckUtils]: 110: Hoare triple {11596#false} assume 0 == ~cond; {11596#false} is VALID [2018-11-23 12:04:36,110 INFO L273 TraceCheckUtils]: 111: Hoare triple {11596#false} assume !false; {11596#false} is VALID [2018-11-23 12:04:36,115 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2018-11-23 12:04:36,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:36,116 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:04:36,124 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE