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_copyInit_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:02:02,651 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:02:02,653 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:02:02,665 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:02:02,668 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:02:02,669 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:02:02,673 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:02:02,679 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:02:02,684 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:02:02,685 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:02:02,687 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:02:02,687 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:02:02,688 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:02:02,690 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:02:02,691 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:02:02,697 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:02:02,698 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:02:02,704 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:02:02,706 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:02:02,712 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:02:02,715 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:02:02,716 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:02:02,718 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:02:02,718 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:02:02,718 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:02:02,722 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:02:02,723 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:02:02,724 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:02:02,724 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:02:02,728 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:02:02,728 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:02:02,730 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:02:02,730 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:02:02,730 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:02:02,731 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:02:02,733 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:02:02,733 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:02:02,763 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:02:02,763 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:02:02,764 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:02:02,764 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:02:02,767 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:02:02,767 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:02:02,767 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:02:02,767 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:02:02,768 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:02:02,768 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:02:02,768 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:02:02,768 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:02:02,768 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:02:02,769 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:02:02,771 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:02:02,771 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:02:02,771 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:02:02,771 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:02:02,771 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:02:02,773 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:02:02,773 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:02:02,773 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:02:02,773 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:02:02,774 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:02:02,774 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:02:02,774 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:02:02,774 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:02:02,774 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:02:02,775 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:02:02,775 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:02:02,776 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:02:02,840 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:02:02,859 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:02:02,863 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:02:02,865 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:02:02,865 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:02:02,866 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copyInit_true-unreach-call_ground.i [2018-11-23 12:02:02,937 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2573c9205/5f99d3390cdd4910bb059543276e1e8d/FLAGd77d86cd4 [2018-11-23 12:02:03,423 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:02:03,424 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copyInit_true-unreach-call_ground.i [2018-11-23 12:02:03,430 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2573c9205/5f99d3390cdd4910bb059543276e1e8d/FLAGd77d86cd4 [2018-11-23 12:02:03,806 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2573c9205/5f99d3390cdd4910bb059543276e1e8d [2018-11-23 12:02:03,815 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:02:03,816 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:02:03,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:02:03,817 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:02:03,820 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:02:03,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:02:03" (1/1) ... [2018-11-23 12:02:03,824 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d94b8da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:03, skipping insertion in model container [2018-11-23 12:02:03,824 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:02:03" (1/1) ... [2018-11-23 12:02:03,833 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:02:03,852 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:02:04,072 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:02:04,077 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:02:04,103 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:02:04,129 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:02:04,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:04 WrapperNode [2018-11-23 12:02:04,129 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:02:04,130 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:02:04,131 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:02:04,131 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:02:04,142 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:02:04" (1/1) ... [2018-11-23 12:02:04,153 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:02:04" (1/1) ... [2018-11-23 12:02:04,164 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:02:04,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:02:04,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:02:04,165 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:02:04,173 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:04" (1/1) ... [2018-11-23 12:02:04,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:04" (1/1) ... [2018-11-23 12:02:04,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:04" (1/1) ... [2018-11-23 12:02:04,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:04" (1/1) ... [2018-11-23 12:02:04,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:04" (1/1) ... [2018-11-23 12:02:04,197 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:04" (1/1) ... [2018-11-23 12:02:04,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:04" (1/1) ... [2018-11-23 12:02:04,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:02:04,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:02:04,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:02:04,201 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:02:04,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:04" (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:02:04,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:02:04,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:02:04,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:02:04,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:02:04,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:02:04,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:02:04,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:02:04,328 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:02:04,329 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:02:04,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:02:04,329 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:02:04,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:02:04,867 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:02:04,867 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:02:04,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:02:04 BoogieIcfgContainer [2018-11-23 12:02:04,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:02:04,869 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:02:04,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:02:04,873 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:02:04,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:02:03" (1/3) ... [2018-11-23 12:02:04,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5096eaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:02:04, skipping insertion in model container [2018-11-23 12:02:04,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:04" (2/3) ... [2018-11-23 12:02:04,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5096eaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:02:04, skipping insertion in model container [2018-11-23 12:02:04,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:02:04" (3/3) ... [2018-11-23 12:02:04,877 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copyInit_true-unreach-call_ground.i [2018-11-23 12:02:04,888 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:02:04,896 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:02:04,913 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:02:04,946 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:02:04,947 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:02:04,947 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:02:04,947 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:02:04,947 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:02:04,948 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:02:04,948 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:02:04,948 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:02:04,948 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:02:04,967 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-23 12:02:04,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:02:04,974 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:04,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:04,977 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:04,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:04,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1085876810, now seen corresponding path program 1 times [2018-11-23 12:02:04,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:04,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:05,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:05,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:05,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:05,156 INFO L256 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {29#true} is VALID [2018-11-23 12:02:05,160 INFO L273 TraceCheckUtils]: 1: Hoare triple {29#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {29#true} is VALID [2018-11-23 12:02:05,161 INFO L273 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2018-11-23 12:02:05,162 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #62#return; {29#true} is VALID [2018-11-23 12:02:05,162 INFO L256 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret4 := main(); {29#true} is VALID [2018-11-23 12:02:05,162 INFO L273 TraceCheckUtils]: 5: Hoare triple {29#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {29#true} is VALID [2018-11-23 12:02:05,166 INFO L273 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2018-11-23 12:02:05,166 INFO L273 TraceCheckUtils]: 7: Hoare triple {30#false} ~i~0 := 0; {30#false} is VALID [2018-11-23 12:02:05,167 INFO L273 TraceCheckUtils]: 8: Hoare triple {30#false} assume !(~i~0 < 100000); {30#false} is VALID [2018-11-23 12:02:05,167 INFO L273 TraceCheckUtils]: 9: Hoare triple {30#false} havoc ~x~0;~x~0 := 0; {30#false} is VALID [2018-11-23 12:02:05,167 INFO L273 TraceCheckUtils]: 10: Hoare triple {30#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {30#false} is VALID [2018-11-23 12:02:05,168 INFO L256 TraceCheckUtils]: 11: Hoare triple {30#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {30#false} is VALID [2018-11-23 12:02:05,168 INFO L273 TraceCheckUtils]: 12: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2018-11-23 12:02:05,169 INFO L273 TraceCheckUtils]: 13: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2018-11-23 12:02:05,169 INFO L273 TraceCheckUtils]: 14: Hoare triple {30#false} assume !false; {30#false} is VALID [2018-11-23 12:02:05,173 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:02:05,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:02:05,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:02:05,181 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 12:02:05,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:05,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:02:05,286 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:05,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:02:05,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:02:05,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:02:05,299 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-11-23 12:02:05,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:05,719 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2018-11-23 12:02:05,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:02:05,721 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 12:02:05,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:05,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:02:05,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 56 transitions. [2018-11-23 12:02:05,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:02:05,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 56 transitions. [2018-11-23 12:02:05,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 56 transitions. [2018-11-23 12:02:06,021 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:06,033 INFO L225 Difference]: With dead ends: 45 [2018-11-23 12:02:06,033 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 12:02:06,036 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:02:06,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 12:02:06,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 12:02:06,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:06,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 12:02:06,082 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 12:02:06,082 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 12:02:06,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:06,086 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-23 12:02:06,086 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-23 12:02:06,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:06,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:06,088 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 12:02:06,088 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 12:02:06,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:06,092 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-23 12:02:06,093 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-23 12:02:06,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:06,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:06,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:06,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:06,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:02:06,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-11-23 12:02:06,102 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 15 [2018-11-23 12:02:06,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:06,102 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-23 12:02:06,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:02:06,103 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-23 12:02:06,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:02:06,103 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:06,104 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:06,104 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:06,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:06,105 INFO L82 PathProgramCache]: Analyzing trace with hash -274239930, now seen corresponding path program 1 times [2018-11-23 12:02:06,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:06,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:06,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:06,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:06,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:06,190 INFO L256 TraceCheckUtils]: 0: Hoare triple {163#true} call ULTIMATE.init(); {163#true} is VALID [2018-11-23 12:02:06,190 INFO L273 TraceCheckUtils]: 1: Hoare triple {163#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {163#true} is VALID [2018-11-23 12:02:06,191 INFO L273 TraceCheckUtils]: 2: Hoare triple {163#true} assume true; {163#true} is VALID [2018-11-23 12:02:06,191 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {163#true} {163#true} #62#return; {163#true} is VALID [2018-11-23 12:02:06,191 INFO L256 TraceCheckUtils]: 4: Hoare triple {163#true} call #t~ret4 := main(); {163#true} is VALID [2018-11-23 12:02:06,208 INFO L273 TraceCheckUtils]: 5: Hoare triple {163#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {165#(= main_~i~0 0)} is VALID [2018-11-23 12:02:06,224 INFO L273 TraceCheckUtils]: 6: Hoare triple {165#(= main_~i~0 0)} assume !(~i~0 < 100000); {164#false} is VALID [2018-11-23 12:02:06,224 INFO L273 TraceCheckUtils]: 7: Hoare triple {164#false} ~i~0 := 0; {164#false} is VALID [2018-11-23 12:02:06,225 INFO L273 TraceCheckUtils]: 8: Hoare triple {164#false} assume !(~i~0 < 100000); {164#false} is VALID [2018-11-23 12:02:06,225 INFO L273 TraceCheckUtils]: 9: Hoare triple {164#false} havoc ~x~0;~x~0 := 0; {164#false} is VALID [2018-11-23 12:02:06,228 INFO L273 TraceCheckUtils]: 10: Hoare triple {164#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {164#false} is VALID [2018-11-23 12:02:06,228 INFO L256 TraceCheckUtils]: 11: Hoare triple {164#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {164#false} is VALID [2018-11-23 12:02:06,229 INFO L273 TraceCheckUtils]: 12: Hoare triple {164#false} ~cond := #in~cond; {164#false} is VALID [2018-11-23 12:02:06,229 INFO L273 TraceCheckUtils]: 13: Hoare triple {164#false} assume 0 == ~cond; {164#false} is VALID [2018-11-23 12:02:06,230 INFO L273 TraceCheckUtils]: 14: Hoare triple {164#false} assume !false; {164#false} is VALID [2018-11-23 12:02:06,232 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:02:06,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:02:06,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:02:06,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 12:02:06,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:06,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:02:06,348 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:06,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:02:06,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:02:06,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:02:06,349 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 3 states. [2018-11-23 12:02:06,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:06,509 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-11-23 12:02:06,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:02:06,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 12:02:06,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:06,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:02:06,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2018-11-23 12:02:06,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:02:06,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2018-11-23 12:02:06,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 43 transitions. [2018-11-23 12:02:06,680 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:06,683 INFO L225 Difference]: With dead ends: 38 [2018-11-23 12:02:06,684 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 12:02:06,686 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:02:06,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 12:02:06,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-23 12:02:06,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:06,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2018-11-23 12:02:06,840 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2018-11-23 12:02:06,840 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2018-11-23 12:02:06,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:06,843 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-23 12:02:06,843 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 12:02:06,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:06,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:06,844 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2018-11-23 12:02:06,844 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2018-11-23 12:02:06,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:06,847 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-23 12:02:06,848 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 12:02:06,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:06,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:06,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:06,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:06,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:02:06,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-23 12:02:06,851 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2018-11-23 12:02:06,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:06,853 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-23 12:02:06,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:02:06,854 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 12:02:06,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:02:06,855 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:06,855 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:06,855 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:06,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:06,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1258895644, now seen corresponding path program 1 times [2018-11-23 12:02:06,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:06,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:06,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:06,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:06,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:07,012 INFO L256 TraceCheckUtils]: 0: Hoare triple {303#true} call ULTIMATE.init(); {303#true} is VALID [2018-11-23 12:02:07,012 INFO L273 TraceCheckUtils]: 1: Hoare triple {303#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {303#true} is VALID [2018-11-23 12:02:07,013 INFO L273 TraceCheckUtils]: 2: Hoare triple {303#true} assume true; {303#true} is VALID [2018-11-23 12:02:07,013 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {303#true} {303#true} #62#return; {303#true} is VALID [2018-11-23 12:02:07,013 INFO L256 TraceCheckUtils]: 4: Hoare triple {303#true} call #t~ret4 := main(); {303#true} is VALID [2018-11-23 12:02:07,015 INFO L273 TraceCheckUtils]: 5: Hoare triple {303#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {305#(= main_~i~0 0)} is VALID [2018-11-23 12:02:07,018 INFO L273 TraceCheckUtils]: 6: Hoare triple {305#(= 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; {306#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:07,019 INFO L273 TraceCheckUtils]: 7: Hoare triple {306#(<= main_~i~0 1)} assume !(~i~0 < 100000); {304#false} is VALID [2018-11-23 12:02:07,019 INFO L273 TraceCheckUtils]: 8: Hoare triple {304#false} ~i~0 := 0; {304#false} is VALID [2018-11-23 12:02:07,019 INFO L273 TraceCheckUtils]: 9: Hoare triple {304#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {304#false} is VALID [2018-11-23 12:02:07,020 INFO L273 TraceCheckUtils]: 10: Hoare triple {304#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {304#false} is VALID [2018-11-23 12:02:07,020 INFO L273 TraceCheckUtils]: 11: Hoare triple {304#false} assume !(~i~0 < 100000); {304#false} is VALID [2018-11-23 12:02:07,020 INFO L273 TraceCheckUtils]: 12: Hoare triple {304#false} havoc ~x~0;~x~0 := 0; {304#false} is VALID [2018-11-23 12:02:07,020 INFO L273 TraceCheckUtils]: 13: Hoare triple {304#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {304#false} is VALID [2018-11-23 12:02:07,021 INFO L256 TraceCheckUtils]: 14: Hoare triple {304#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {304#false} is VALID [2018-11-23 12:02:07,021 INFO L273 TraceCheckUtils]: 15: Hoare triple {304#false} ~cond := #in~cond; {304#false} is VALID [2018-11-23 12:02:07,021 INFO L273 TraceCheckUtils]: 16: Hoare triple {304#false} assume 0 == ~cond; {304#false} is VALID [2018-11-23 12:02:07,021 INFO L273 TraceCheckUtils]: 17: Hoare triple {304#false} assume !false; {304#false} is VALID [2018-11-23 12:02:07,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:02:07,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:07,023 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:02:07,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:07,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:07,278 INFO L256 TraceCheckUtils]: 0: Hoare triple {303#true} call ULTIMATE.init(); {303#true} is VALID [2018-11-23 12:02:07,278 INFO L273 TraceCheckUtils]: 1: Hoare triple {303#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {303#true} is VALID [2018-11-23 12:02:07,279 INFO L273 TraceCheckUtils]: 2: Hoare triple {303#true} assume true; {303#true} is VALID [2018-11-23 12:02:07,279 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {303#true} {303#true} #62#return; {303#true} is VALID [2018-11-23 12:02:07,279 INFO L256 TraceCheckUtils]: 4: Hoare triple {303#true} call #t~ret4 := main(); {303#true} is VALID [2018-11-23 12:02:07,283 INFO L273 TraceCheckUtils]: 5: Hoare triple {303#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {325#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:07,285 INFO L273 TraceCheckUtils]: 6: Hoare triple {325#(<= 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; {306#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:07,285 INFO L273 TraceCheckUtils]: 7: Hoare triple {306#(<= main_~i~0 1)} assume !(~i~0 < 100000); {304#false} is VALID [2018-11-23 12:02:07,286 INFO L273 TraceCheckUtils]: 8: Hoare triple {304#false} ~i~0 := 0; {304#false} is VALID [2018-11-23 12:02:07,286 INFO L273 TraceCheckUtils]: 9: Hoare triple {304#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {304#false} is VALID [2018-11-23 12:02:07,286 INFO L273 TraceCheckUtils]: 10: Hoare triple {304#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {304#false} is VALID [2018-11-23 12:02:07,287 INFO L273 TraceCheckUtils]: 11: Hoare triple {304#false} assume !(~i~0 < 100000); {304#false} is VALID [2018-11-23 12:02:07,287 INFO L273 TraceCheckUtils]: 12: Hoare triple {304#false} havoc ~x~0;~x~0 := 0; {304#false} is VALID [2018-11-23 12:02:07,287 INFO L273 TraceCheckUtils]: 13: Hoare triple {304#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {304#false} is VALID [2018-11-23 12:02:07,287 INFO L256 TraceCheckUtils]: 14: Hoare triple {304#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {304#false} is VALID [2018-11-23 12:02:07,288 INFO L273 TraceCheckUtils]: 15: Hoare triple {304#false} ~cond := #in~cond; {304#false} is VALID [2018-11-23 12:02:07,288 INFO L273 TraceCheckUtils]: 16: Hoare triple {304#false} assume 0 == ~cond; {304#false} is VALID [2018-11-23 12:02:07,288 INFO L273 TraceCheckUtils]: 17: Hoare triple {304#false} assume !false; {304#false} is VALID [2018-11-23 12:02:07,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:02:07,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:07,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:02:07,310 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-23 12:02:07,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:07,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:02:07,347 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:07,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:02:07,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:02:07,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:02:07,348 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 5 states. [2018-11-23 12:02:07,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:07,688 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-23 12:02:07,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:02:07,688 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-23 12:02:07,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:07,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:02:07,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2018-11-23 12:02:07,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:02:07,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2018-11-23 12:02:07,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 46 transitions. [2018-11-23 12:02:07,802 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:07,804 INFO L225 Difference]: With dead ends: 42 [2018-11-23 12:02:07,804 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 12:02:07,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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:02:07,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 12:02:07,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-23 12:02:07,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:07,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 26 states. [2018-11-23 12:02:07,850 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 26 states. [2018-11-23 12:02:07,850 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 26 states. [2018-11-23 12:02:07,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:07,853 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-23 12:02:07,853 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 12:02:07,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:07,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:07,854 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 27 states. [2018-11-23 12:02:07,854 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 27 states. [2018-11-23 12:02:07,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:07,857 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-23 12:02:07,857 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 12:02:07,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:07,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:07,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:07,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:07,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:02:07,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-23 12:02:07,861 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 18 [2018-11-23 12:02:07,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:07,861 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-23 12:02:07,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:02:07,861 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 12:02:07,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:02:07,862 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:07,862 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:07,863 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:07,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:07,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1615172030, now seen corresponding path program 2 times [2018-11-23 12:02:07,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:07,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:07,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:07,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:07,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:07,984 INFO L256 TraceCheckUtils]: 0: Hoare triple {514#true} call ULTIMATE.init(); {514#true} is VALID [2018-11-23 12:02:07,984 INFO L273 TraceCheckUtils]: 1: Hoare triple {514#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {514#true} is VALID [2018-11-23 12:02:07,985 INFO L273 TraceCheckUtils]: 2: Hoare triple {514#true} assume true; {514#true} is VALID [2018-11-23 12:02:07,985 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {514#true} {514#true} #62#return; {514#true} is VALID [2018-11-23 12:02:07,985 INFO L256 TraceCheckUtils]: 4: Hoare triple {514#true} call #t~ret4 := main(); {514#true} is VALID [2018-11-23 12:02:07,994 INFO L273 TraceCheckUtils]: 5: Hoare triple {514#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {516#(= main_~i~0 0)} is VALID [2018-11-23 12:02:08,003 INFO L273 TraceCheckUtils]: 6: Hoare triple {516#(= 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; {517#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:08,004 INFO L273 TraceCheckUtils]: 7: Hoare triple {517#(<= 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; {518#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:08,005 INFO L273 TraceCheckUtils]: 8: Hoare triple {518#(<= main_~i~0 2)} assume !(~i~0 < 100000); {515#false} is VALID [2018-11-23 12:02:08,005 INFO L273 TraceCheckUtils]: 9: Hoare triple {515#false} ~i~0 := 0; {515#false} is VALID [2018-11-23 12:02:08,006 INFO L273 TraceCheckUtils]: 10: Hoare triple {515#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {515#false} is VALID [2018-11-23 12:02:08,006 INFO L273 TraceCheckUtils]: 11: Hoare triple {515#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {515#false} is VALID [2018-11-23 12:02:08,006 INFO L273 TraceCheckUtils]: 12: Hoare triple {515#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {515#false} is VALID [2018-11-23 12:02:08,007 INFO L273 TraceCheckUtils]: 13: Hoare triple {515#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {515#false} is VALID [2018-11-23 12:02:08,007 INFO L273 TraceCheckUtils]: 14: Hoare triple {515#false} assume !(~i~0 < 100000); {515#false} is VALID [2018-11-23 12:02:08,008 INFO L273 TraceCheckUtils]: 15: Hoare triple {515#false} havoc ~x~0;~x~0 := 0; {515#false} is VALID [2018-11-23 12:02:08,008 INFO L273 TraceCheckUtils]: 16: Hoare triple {515#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {515#false} is VALID [2018-11-23 12:02:08,008 INFO L256 TraceCheckUtils]: 17: Hoare triple {515#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {515#false} is VALID [2018-11-23 12:02:08,009 INFO L273 TraceCheckUtils]: 18: Hoare triple {515#false} ~cond := #in~cond; {515#false} is VALID [2018-11-23 12:02:08,009 INFO L273 TraceCheckUtils]: 19: Hoare triple {515#false} assume 0 == ~cond; {515#false} is VALID [2018-11-23 12:02:08,009 INFO L273 TraceCheckUtils]: 20: Hoare triple {515#false} assume !false; {515#false} is VALID [2018-11-23 12:02:08,010 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:02:08,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:08,011 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:02:08,027 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:02:08,050 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:02:08,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:08,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:08,210 INFO L256 TraceCheckUtils]: 0: Hoare triple {514#true} call ULTIMATE.init(); {514#true} is VALID [2018-11-23 12:02:08,211 INFO L273 TraceCheckUtils]: 1: Hoare triple {514#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {514#true} is VALID [2018-11-23 12:02:08,212 INFO L273 TraceCheckUtils]: 2: Hoare triple {514#true} assume true; {514#true} is VALID [2018-11-23 12:02:08,212 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {514#true} {514#true} #62#return; {514#true} is VALID [2018-11-23 12:02:08,212 INFO L256 TraceCheckUtils]: 4: Hoare triple {514#true} call #t~ret4 := main(); {514#true} is VALID [2018-11-23 12:02:08,214 INFO L273 TraceCheckUtils]: 5: Hoare triple {514#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {537#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:08,215 INFO L273 TraceCheckUtils]: 6: Hoare triple {537#(<= 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; {517#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:08,215 INFO L273 TraceCheckUtils]: 7: Hoare triple {517#(<= 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; {518#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:08,216 INFO L273 TraceCheckUtils]: 8: Hoare triple {518#(<= main_~i~0 2)} assume !(~i~0 < 100000); {515#false} is VALID [2018-11-23 12:02:08,217 INFO L273 TraceCheckUtils]: 9: Hoare triple {515#false} ~i~0 := 0; {515#false} is VALID [2018-11-23 12:02:08,217 INFO L273 TraceCheckUtils]: 10: Hoare triple {515#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {515#false} is VALID [2018-11-23 12:02:08,218 INFO L273 TraceCheckUtils]: 11: Hoare triple {515#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {515#false} is VALID [2018-11-23 12:02:08,218 INFO L273 TraceCheckUtils]: 12: Hoare triple {515#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {515#false} is VALID [2018-11-23 12:02:08,219 INFO L273 TraceCheckUtils]: 13: Hoare triple {515#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {515#false} is VALID [2018-11-23 12:02:08,219 INFO L273 TraceCheckUtils]: 14: Hoare triple {515#false} assume !(~i~0 < 100000); {515#false} is VALID [2018-11-23 12:02:08,220 INFO L273 TraceCheckUtils]: 15: Hoare triple {515#false} havoc ~x~0;~x~0 := 0; {515#false} is VALID [2018-11-23 12:02:08,220 INFO L273 TraceCheckUtils]: 16: Hoare triple {515#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {515#false} is VALID [2018-11-23 12:02:08,220 INFO L256 TraceCheckUtils]: 17: Hoare triple {515#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {515#false} is VALID [2018-11-23 12:02:08,221 INFO L273 TraceCheckUtils]: 18: Hoare triple {515#false} ~cond := #in~cond; {515#false} is VALID [2018-11-23 12:02:08,221 INFO L273 TraceCheckUtils]: 19: Hoare triple {515#false} assume 0 == ~cond; {515#false} is VALID [2018-11-23 12:02:08,221 INFO L273 TraceCheckUtils]: 20: Hoare triple {515#false} assume !false; {515#false} is VALID [2018-11-23 12:02:08,222 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:02:08,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:08,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:02:08,243 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 12:02:08,244 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:08,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:02:08,279 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:08,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:02:08,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:02:08,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:02:08,281 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 6 states. [2018-11-23 12:02:08,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:08,526 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-11-23 12:02:08,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:02:08,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 12:02:08,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:08,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:02:08,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2018-11-23 12:02:08,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:02:08,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2018-11-23 12:02:08,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 49 transitions. [2018-11-23 12:02:08,611 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:08,613 INFO L225 Difference]: With dead ends: 47 [2018-11-23 12:02:08,613 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:02:08,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 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:02:08,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:02:08,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 12:02:08,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:08,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-23 12:02:08,636 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-23 12:02:08,637 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-23 12:02:08,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:08,639 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-11-23 12:02:08,640 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-23 12:02:08,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:08,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:08,641 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-23 12:02:08,641 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-23 12:02:08,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:08,643 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-11-23 12:02:08,644 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-23 12:02:08,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:08,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:08,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:08,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:08,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:02:08,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-11-23 12:02:08,647 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 21 [2018-11-23 12:02:08,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:08,647 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-23 12:02:08,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:02:08,648 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-23 12:02:08,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:02:08,649 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:08,649 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:08,649 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:08,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:08,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1115557856, now seen corresponding path program 3 times [2018-11-23 12:02:08,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:08,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:08,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:08,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:08,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:08,789 INFO L256 TraceCheckUtils]: 0: Hoare triple {754#true} call ULTIMATE.init(); {754#true} is VALID [2018-11-23 12:02:08,790 INFO L273 TraceCheckUtils]: 1: Hoare triple {754#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {754#true} is VALID [2018-11-23 12:02:08,790 INFO L273 TraceCheckUtils]: 2: Hoare triple {754#true} assume true; {754#true} is VALID [2018-11-23 12:02:08,791 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {754#true} {754#true} #62#return; {754#true} is VALID [2018-11-23 12:02:08,791 INFO L256 TraceCheckUtils]: 4: Hoare triple {754#true} call #t~ret4 := main(); {754#true} is VALID [2018-11-23 12:02:08,793 INFO L273 TraceCheckUtils]: 5: Hoare triple {754#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {756#(= main_~i~0 0)} is VALID [2018-11-23 12:02:08,794 INFO L273 TraceCheckUtils]: 6: Hoare triple {756#(= 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; {757#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:08,794 INFO L273 TraceCheckUtils]: 7: Hoare triple {757#(<= 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; {758#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:08,796 INFO L273 TraceCheckUtils]: 8: Hoare triple {758#(<= 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; {759#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:08,797 INFO L273 TraceCheckUtils]: 9: Hoare triple {759#(<= main_~i~0 3)} assume !(~i~0 < 100000); {755#false} is VALID [2018-11-23 12:02:08,797 INFO L273 TraceCheckUtils]: 10: Hoare triple {755#false} ~i~0 := 0; {755#false} is VALID [2018-11-23 12:02:08,798 INFO L273 TraceCheckUtils]: 11: Hoare triple {755#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {755#false} is VALID [2018-11-23 12:02:08,798 INFO L273 TraceCheckUtils]: 12: Hoare triple {755#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {755#false} is VALID [2018-11-23 12:02:08,798 INFO L273 TraceCheckUtils]: 13: Hoare triple {755#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {755#false} is VALID [2018-11-23 12:02:08,799 INFO L273 TraceCheckUtils]: 14: Hoare triple {755#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {755#false} is VALID [2018-11-23 12:02:08,799 INFO L273 TraceCheckUtils]: 15: Hoare triple {755#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {755#false} is VALID [2018-11-23 12:02:08,800 INFO L273 TraceCheckUtils]: 16: Hoare triple {755#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {755#false} is VALID [2018-11-23 12:02:08,800 INFO L273 TraceCheckUtils]: 17: Hoare triple {755#false} assume !(~i~0 < 100000); {755#false} is VALID [2018-11-23 12:02:08,801 INFO L273 TraceCheckUtils]: 18: Hoare triple {755#false} havoc ~x~0;~x~0 := 0; {755#false} is VALID [2018-11-23 12:02:08,801 INFO L273 TraceCheckUtils]: 19: Hoare triple {755#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {755#false} is VALID [2018-11-23 12:02:08,802 INFO L256 TraceCheckUtils]: 20: Hoare triple {755#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {755#false} is VALID [2018-11-23 12:02:08,802 INFO L273 TraceCheckUtils]: 21: Hoare triple {755#false} ~cond := #in~cond; {755#false} is VALID [2018-11-23 12:02:08,802 INFO L273 TraceCheckUtils]: 22: Hoare triple {755#false} assume 0 == ~cond; {755#false} is VALID [2018-11-23 12:02:08,802 INFO L273 TraceCheckUtils]: 23: Hoare triple {755#false} assume !false; {755#false} is VALID [2018-11-23 12:02:08,804 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 12:02:08,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:08,804 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:02:08,825 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:02:08,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 12:02:08,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:08,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:08,966 INFO L256 TraceCheckUtils]: 0: Hoare triple {754#true} call ULTIMATE.init(); {754#true} is VALID [2018-11-23 12:02:08,967 INFO L273 TraceCheckUtils]: 1: Hoare triple {754#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {754#true} is VALID [2018-11-23 12:02:08,967 INFO L273 TraceCheckUtils]: 2: Hoare triple {754#true} assume true; {754#true} is VALID [2018-11-23 12:02:08,968 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {754#true} {754#true} #62#return; {754#true} is VALID [2018-11-23 12:02:08,968 INFO L256 TraceCheckUtils]: 4: Hoare triple {754#true} call #t~ret4 := main(); {754#true} is VALID [2018-11-23 12:02:08,969 INFO L273 TraceCheckUtils]: 5: Hoare triple {754#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {778#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:08,971 INFO L273 TraceCheckUtils]: 6: Hoare triple {778#(<= 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; {757#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:08,971 INFO L273 TraceCheckUtils]: 7: Hoare triple {757#(<= 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; {758#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:08,972 INFO L273 TraceCheckUtils]: 8: Hoare triple {758#(<= 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; {759#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:08,973 INFO L273 TraceCheckUtils]: 9: Hoare triple {759#(<= main_~i~0 3)} assume !(~i~0 < 100000); {755#false} is VALID [2018-11-23 12:02:08,974 INFO L273 TraceCheckUtils]: 10: Hoare triple {755#false} ~i~0 := 0; {755#false} is VALID [2018-11-23 12:02:08,974 INFO L273 TraceCheckUtils]: 11: Hoare triple {755#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {755#false} is VALID [2018-11-23 12:02:08,975 INFO L273 TraceCheckUtils]: 12: Hoare triple {755#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {755#false} is VALID [2018-11-23 12:02:08,975 INFO L273 TraceCheckUtils]: 13: Hoare triple {755#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {755#false} is VALID [2018-11-23 12:02:08,975 INFO L273 TraceCheckUtils]: 14: Hoare triple {755#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {755#false} is VALID [2018-11-23 12:02:08,976 INFO L273 TraceCheckUtils]: 15: Hoare triple {755#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {755#false} is VALID [2018-11-23 12:02:08,976 INFO L273 TraceCheckUtils]: 16: Hoare triple {755#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {755#false} is VALID [2018-11-23 12:02:08,976 INFO L273 TraceCheckUtils]: 17: Hoare triple {755#false} assume !(~i~0 < 100000); {755#false} is VALID [2018-11-23 12:02:08,977 INFO L273 TraceCheckUtils]: 18: Hoare triple {755#false} havoc ~x~0;~x~0 := 0; {755#false} is VALID [2018-11-23 12:02:08,977 INFO L273 TraceCheckUtils]: 19: Hoare triple {755#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {755#false} is VALID [2018-11-23 12:02:08,977 INFO L256 TraceCheckUtils]: 20: Hoare triple {755#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {755#false} is VALID [2018-11-23 12:02:08,978 INFO L273 TraceCheckUtils]: 21: Hoare triple {755#false} ~cond := #in~cond; {755#false} is VALID [2018-11-23 12:02:08,978 INFO L273 TraceCheckUtils]: 22: Hoare triple {755#false} assume 0 == ~cond; {755#false} is VALID [2018-11-23 12:02:08,978 INFO L273 TraceCheckUtils]: 23: Hoare triple {755#false} assume !false; {755#false} is VALID [2018-11-23 12:02:08,980 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 12:02:08,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:09,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 12:02:09,000 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-23 12:02:09,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:09,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:02:09,083 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:09,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:02:09,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:02:09,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:02:09,084 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 7 states. [2018-11-23 12:02:09,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:09,267 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-11-23 12:02:09,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:02:09,267 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-23 12:02:09,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:09,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:02:09,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2018-11-23 12:02:09,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:02:09,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2018-11-23 12:02:09,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 52 transitions. [2018-11-23 12:02:09,379 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:09,381 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:02:09,381 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 12:02:09,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 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:02:09,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 12:02:09,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-23 12:02:09,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:09,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 32 states. [2018-11-23 12:02:09,406 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 32 states. [2018-11-23 12:02:09,406 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 32 states. [2018-11-23 12:02:09,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:09,408 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-23 12:02:09,408 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-23 12:02:09,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:09,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:09,409 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states. [2018-11-23 12:02:09,409 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states. [2018-11-23 12:02:09,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:09,411 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-23 12:02:09,412 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-23 12:02:09,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:09,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:09,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:09,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:09,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:02:09,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-11-23 12:02:09,415 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 24 [2018-11-23 12:02:09,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:09,415 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-23 12:02:09,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:02:09,416 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-23 12:02:09,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:02:09,417 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:09,417 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:09,417 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:09,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:09,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1574965310, now seen corresponding path program 4 times [2018-11-23 12:02:09,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:09,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:09,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:09,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:09,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:09,618 INFO L256 TraceCheckUtils]: 0: Hoare triple {1023#true} call ULTIMATE.init(); {1023#true} is VALID [2018-11-23 12:02:09,618 INFO L273 TraceCheckUtils]: 1: Hoare triple {1023#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1023#true} is VALID [2018-11-23 12:02:09,619 INFO L273 TraceCheckUtils]: 2: Hoare triple {1023#true} assume true; {1023#true} is VALID [2018-11-23 12:02:09,619 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1023#true} {1023#true} #62#return; {1023#true} is VALID [2018-11-23 12:02:09,620 INFO L256 TraceCheckUtils]: 4: Hoare triple {1023#true} call #t~ret4 := main(); {1023#true} is VALID [2018-11-23 12:02:09,620 INFO L273 TraceCheckUtils]: 5: Hoare triple {1023#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1025#(= main_~i~0 0)} is VALID [2018-11-23 12:02:09,622 INFO L273 TraceCheckUtils]: 6: Hoare triple {1025#(= 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; {1026#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:09,622 INFO L273 TraceCheckUtils]: 7: Hoare triple {1026#(<= 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; {1027#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:09,623 INFO L273 TraceCheckUtils]: 8: Hoare triple {1027#(<= 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; {1028#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:09,624 INFO L273 TraceCheckUtils]: 9: Hoare triple {1028#(<= 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; {1029#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:09,625 INFO L273 TraceCheckUtils]: 10: Hoare triple {1029#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1024#false} is VALID [2018-11-23 12:02:09,626 INFO L273 TraceCheckUtils]: 11: Hoare triple {1024#false} ~i~0 := 0; {1024#false} is VALID [2018-11-23 12:02:09,626 INFO L273 TraceCheckUtils]: 12: Hoare triple {1024#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1024#false} is VALID [2018-11-23 12:02:09,627 INFO L273 TraceCheckUtils]: 13: Hoare triple {1024#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1024#false} is VALID [2018-11-23 12:02:09,627 INFO L273 TraceCheckUtils]: 14: Hoare triple {1024#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1024#false} is VALID [2018-11-23 12:02:09,627 INFO L273 TraceCheckUtils]: 15: Hoare triple {1024#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1024#false} is VALID [2018-11-23 12:02:09,628 INFO L273 TraceCheckUtils]: 16: Hoare triple {1024#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1024#false} is VALID [2018-11-23 12:02:09,628 INFO L273 TraceCheckUtils]: 17: Hoare triple {1024#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1024#false} is VALID [2018-11-23 12:02:09,628 INFO L273 TraceCheckUtils]: 18: Hoare triple {1024#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1024#false} is VALID [2018-11-23 12:02:09,629 INFO L273 TraceCheckUtils]: 19: Hoare triple {1024#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1024#false} is VALID [2018-11-23 12:02:09,629 INFO L273 TraceCheckUtils]: 20: Hoare triple {1024#false} assume !(~i~0 < 100000); {1024#false} is VALID [2018-11-23 12:02:09,629 INFO L273 TraceCheckUtils]: 21: Hoare triple {1024#false} havoc ~x~0;~x~0 := 0; {1024#false} is VALID [2018-11-23 12:02:09,630 INFO L273 TraceCheckUtils]: 22: Hoare triple {1024#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1024#false} is VALID [2018-11-23 12:02:09,630 INFO L256 TraceCheckUtils]: 23: Hoare triple {1024#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {1024#false} is VALID [2018-11-23 12:02:09,630 INFO L273 TraceCheckUtils]: 24: Hoare triple {1024#false} ~cond := #in~cond; {1024#false} is VALID [2018-11-23 12:02:09,631 INFO L273 TraceCheckUtils]: 25: Hoare triple {1024#false} assume 0 == ~cond; {1024#false} is VALID [2018-11-23 12:02:09,631 INFO L273 TraceCheckUtils]: 26: Hoare triple {1024#false} assume !false; {1024#false} is VALID [2018-11-23 12:02:09,632 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 12:02:09,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:09,633 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:02:09,642 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:02:09,691 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:02:09,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:09,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:09,875 INFO L256 TraceCheckUtils]: 0: Hoare triple {1023#true} call ULTIMATE.init(); {1023#true} is VALID [2018-11-23 12:02:09,876 INFO L273 TraceCheckUtils]: 1: Hoare triple {1023#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1023#true} is VALID [2018-11-23 12:02:09,876 INFO L273 TraceCheckUtils]: 2: Hoare triple {1023#true} assume true; {1023#true} is VALID [2018-11-23 12:02:09,877 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1023#true} {1023#true} #62#return; {1023#true} is VALID [2018-11-23 12:02:09,877 INFO L256 TraceCheckUtils]: 4: Hoare triple {1023#true} call #t~ret4 := main(); {1023#true} is VALID [2018-11-23 12:02:09,878 INFO L273 TraceCheckUtils]: 5: Hoare triple {1023#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1023#true} is VALID [2018-11-23 12:02:09,878 INFO L273 TraceCheckUtils]: 6: Hoare triple {1023#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1023#true} is VALID [2018-11-23 12:02:09,879 INFO L273 TraceCheckUtils]: 7: Hoare triple {1023#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1023#true} is VALID [2018-11-23 12:02:09,879 INFO L273 TraceCheckUtils]: 8: Hoare triple {1023#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1023#true} is VALID [2018-11-23 12:02:09,879 INFO L273 TraceCheckUtils]: 9: Hoare triple {1023#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1023#true} is VALID [2018-11-23 12:02:09,879 INFO L273 TraceCheckUtils]: 10: Hoare triple {1023#true} assume !(~i~0 < 100000); {1023#true} is VALID [2018-11-23 12:02:09,887 INFO L273 TraceCheckUtils]: 11: Hoare triple {1023#true} ~i~0 := 0; {1066#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:09,904 INFO L273 TraceCheckUtils]: 12: Hoare triple {1066#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1066#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:09,918 INFO L273 TraceCheckUtils]: 13: Hoare triple {1066#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1026#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:09,923 INFO L273 TraceCheckUtils]: 14: Hoare triple {1026#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1026#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:09,924 INFO L273 TraceCheckUtils]: 15: Hoare triple {1026#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1027#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:09,925 INFO L273 TraceCheckUtils]: 16: Hoare triple {1027#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1027#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:09,925 INFO L273 TraceCheckUtils]: 17: Hoare triple {1027#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1028#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:09,926 INFO L273 TraceCheckUtils]: 18: Hoare triple {1028#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1028#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:09,927 INFO L273 TraceCheckUtils]: 19: Hoare triple {1028#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1029#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:09,935 INFO L273 TraceCheckUtils]: 20: Hoare triple {1029#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1024#false} is VALID [2018-11-23 12:02:09,936 INFO L273 TraceCheckUtils]: 21: Hoare triple {1024#false} havoc ~x~0;~x~0 := 0; {1024#false} is VALID [2018-11-23 12:02:09,936 INFO L273 TraceCheckUtils]: 22: Hoare triple {1024#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1024#false} is VALID [2018-11-23 12:02:09,936 INFO L256 TraceCheckUtils]: 23: Hoare triple {1024#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {1024#false} is VALID [2018-11-23 12:02:09,936 INFO L273 TraceCheckUtils]: 24: Hoare triple {1024#false} ~cond := #in~cond; {1024#false} is VALID [2018-11-23 12:02:09,937 INFO L273 TraceCheckUtils]: 25: Hoare triple {1024#false} assume 0 == ~cond; {1024#false} is VALID [2018-11-23 12:02:09,937 INFO L273 TraceCheckUtils]: 26: Hoare triple {1024#false} assume !false; {1024#false} is VALID [2018-11-23 12:02:09,938 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 12:02:09,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:09,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:02:09,963 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-23 12:02:09,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:09,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:02:10,007 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:10,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:02:10,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:02:10,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:02:10,008 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 8 states. [2018-11-23 12:02:10,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:10,208 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-11-23 12:02:10,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:02:10,209 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-23 12:02:10,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:10,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:02:10,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2018-11-23 12:02:10,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:02:10,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2018-11-23 12:02:10,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 55 transitions. [2018-11-23 12:02:10,384 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:10,386 INFO L225 Difference]: With dead ends: 57 [2018-11-23 12:02:10,386 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 12:02:10,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:02:10,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 12:02:10,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-23 12:02:10,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:10,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2018-11-23 12:02:10,424 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2018-11-23 12:02:10,424 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2018-11-23 12:02:10,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:10,426 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-23 12:02:10,426 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-23 12:02:10,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:10,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:10,427 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2018-11-23 12:02:10,428 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2018-11-23 12:02:10,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:10,429 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-23 12:02:10,430 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-23 12:02:10,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:10,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:10,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:10,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:10,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:02:10,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-11-23 12:02:10,432 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 27 [2018-11-23 12:02:10,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:10,433 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-11-23 12:02:10,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:02:10,433 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-23 12:02:10,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:02:10,434 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:10,434 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:10,435 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:10,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:10,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1364556508, now seen corresponding path program 5 times [2018-11-23 12:02:10,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:10,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:10,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:10,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:10,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:10,597 INFO L256 TraceCheckUtils]: 0: Hoare triple {1321#true} call ULTIMATE.init(); {1321#true} is VALID [2018-11-23 12:02:10,598 INFO L273 TraceCheckUtils]: 1: Hoare triple {1321#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1321#true} is VALID [2018-11-23 12:02:10,598 INFO L273 TraceCheckUtils]: 2: Hoare triple {1321#true} assume true; {1321#true} is VALID [2018-11-23 12:02:10,598 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1321#true} {1321#true} #62#return; {1321#true} is VALID [2018-11-23 12:02:10,599 INFO L256 TraceCheckUtils]: 4: Hoare triple {1321#true} call #t~ret4 := main(); {1321#true} is VALID [2018-11-23 12:02:10,600 INFO L273 TraceCheckUtils]: 5: Hoare triple {1321#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1323#(= main_~i~0 0)} is VALID [2018-11-23 12:02:10,602 INFO L273 TraceCheckUtils]: 6: Hoare triple {1323#(= 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; {1324#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:10,603 INFO L273 TraceCheckUtils]: 7: Hoare triple {1324#(<= 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; {1325#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:10,605 INFO L273 TraceCheckUtils]: 8: Hoare triple {1325#(<= 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; {1326#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:10,606 INFO L273 TraceCheckUtils]: 9: Hoare triple {1326#(<= 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; {1327#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:10,607 INFO L273 TraceCheckUtils]: 10: Hoare triple {1327#(<= 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; {1328#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:10,608 INFO L273 TraceCheckUtils]: 11: Hoare triple {1328#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1322#false} is VALID [2018-11-23 12:02:10,609 INFO L273 TraceCheckUtils]: 12: Hoare triple {1322#false} ~i~0 := 0; {1322#false} is VALID [2018-11-23 12:02:10,609 INFO L273 TraceCheckUtils]: 13: Hoare triple {1322#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1322#false} is VALID [2018-11-23 12:02:10,609 INFO L273 TraceCheckUtils]: 14: Hoare triple {1322#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1322#false} is VALID [2018-11-23 12:02:10,610 INFO L273 TraceCheckUtils]: 15: Hoare triple {1322#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1322#false} is VALID [2018-11-23 12:02:10,610 INFO L273 TraceCheckUtils]: 16: Hoare triple {1322#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1322#false} is VALID [2018-11-23 12:02:10,611 INFO L273 TraceCheckUtils]: 17: Hoare triple {1322#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1322#false} is VALID [2018-11-23 12:02:10,611 INFO L273 TraceCheckUtils]: 18: Hoare triple {1322#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1322#false} is VALID [2018-11-23 12:02:10,612 INFO L273 TraceCheckUtils]: 19: Hoare triple {1322#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1322#false} is VALID [2018-11-23 12:02:10,612 INFO L273 TraceCheckUtils]: 20: Hoare triple {1322#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1322#false} is VALID [2018-11-23 12:02:10,612 INFO L273 TraceCheckUtils]: 21: Hoare triple {1322#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1322#false} is VALID [2018-11-23 12:02:10,613 INFO L273 TraceCheckUtils]: 22: Hoare triple {1322#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1322#false} is VALID [2018-11-23 12:02:10,613 INFO L273 TraceCheckUtils]: 23: Hoare triple {1322#false} assume !(~i~0 < 100000); {1322#false} is VALID [2018-11-23 12:02:10,613 INFO L273 TraceCheckUtils]: 24: Hoare triple {1322#false} havoc ~x~0;~x~0 := 0; {1322#false} is VALID [2018-11-23 12:02:10,613 INFO L273 TraceCheckUtils]: 25: Hoare triple {1322#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1322#false} is VALID [2018-11-23 12:02:10,613 INFO L256 TraceCheckUtils]: 26: Hoare triple {1322#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {1322#false} is VALID [2018-11-23 12:02:10,614 INFO L273 TraceCheckUtils]: 27: Hoare triple {1322#false} ~cond := #in~cond; {1322#false} is VALID [2018-11-23 12:02:10,614 INFO L273 TraceCheckUtils]: 28: Hoare triple {1322#false} assume 0 == ~cond; {1322#false} is VALID [2018-11-23 12:02:10,614 INFO L273 TraceCheckUtils]: 29: Hoare triple {1322#false} assume !false; {1322#false} is VALID [2018-11-23 12:02:10,615 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 12:02:10,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:10,616 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:10,631 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:02:10,711 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 12:02:10,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:10,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:10,858 INFO L256 TraceCheckUtils]: 0: Hoare triple {1321#true} call ULTIMATE.init(); {1321#true} is VALID [2018-11-23 12:02:10,858 INFO L273 TraceCheckUtils]: 1: Hoare triple {1321#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1321#true} is VALID [2018-11-23 12:02:10,858 INFO L273 TraceCheckUtils]: 2: Hoare triple {1321#true} assume true; {1321#true} is VALID [2018-11-23 12:02:10,859 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1321#true} {1321#true} #62#return; {1321#true} is VALID [2018-11-23 12:02:10,859 INFO L256 TraceCheckUtils]: 4: Hoare triple {1321#true} call #t~ret4 := main(); {1321#true} is VALID [2018-11-23 12:02:10,859 INFO L273 TraceCheckUtils]: 5: Hoare triple {1321#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1321#true} is VALID [2018-11-23 12:02:10,859 INFO L273 TraceCheckUtils]: 6: Hoare triple {1321#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1321#true} is VALID [2018-11-23 12:02:10,859 INFO L273 TraceCheckUtils]: 7: Hoare triple {1321#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1321#true} is VALID [2018-11-23 12:02:10,860 INFO L273 TraceCheckUtils]: 8: Hoare triple {1321#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1321#true} is VALID [2018-11-23 12:02:10,860 INFO L273 TraceCheckUtils]: 9: Hoare triple {1321#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1321#true} is VALID [2018-11-23 12:02:10,860 INFO L273 TraceCheckUtils]: 10: Hoare triple {1321#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1321#true} is VALID [2018-11-23 12:02:10,860 INFO L273 TraceCheckUtils]: 11: Hoare triple {1321#true} assume !(~i~0 < 100000); {1321#true} is VALID [2018-11-23 12:02:10,861 INFO L273 TraceCheckUtils]: 12: Hoare triple {1321#true} ~i~0 := 0; {1368#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:10,862 INFO L273 TraceCheckUtils]: 13: Hoare triple {1368#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1368#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:10,864 INFO L273 TraceCheckUtils]: 14: Hoare triple {1368#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1324#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:10,868 INFO L273 TraceCheckUtils]: 15: Hoare triple {1324#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1324#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:10,870 INFO L273 TraceCheckUtils]: 16: Hoare triple {1324#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1325#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:10,871 INFO L273 TraceCheckUtils]: 17: Hoare triple {1325#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1325#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:10,873 INFO L273 TraceCheckUtils]: 18: Hoare triple {1325#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1326#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:10,875 INFO L273 TraceCheckUtils]: 19: Hoare triple {1326#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1326#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:10,876 INFO L273 TraceCheckUtils]: 20: Hoare triple {1326#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1327#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:10,882 INFO L273 TraceCheckUtils]: 21: Hoare triple {1327#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1327#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:10,883 INFO L273 TraceCheckUtils]: 22: Hoare triple {1327#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1328#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:10,883 INFO L273 TraceCheckUtils]: 23: Hoare triple {1328#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1322#false} is VALID [2018-11-23 12:02:10,883 INFO L273 TraceCheckUtils]: 24: Hoare triple {1322#false} havoc ~x~0;~x~0 := 0; {1322#false} is VALID [2018-11-23 12:02:10,884 INFO L273 TraceCheckUtils]: 25: Hoare triple {1322#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1322#false} is VALID [2018-11-23 12:02:10,884 INFO L256 TraceCheckUtils]: 26: Hoare triple {1322#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {1322#false} is VALID [2018-11-23 12:02:10,884 INFO L273 TraceCheckUtils]: 27: Hoare triple {1322#false} ~cond := #in~cond; {1322#false} is VALID [2018-11-23 12:02:10,884 INFO L273 TraceCheckUtils]: 28: Hoare triple {1322#false} assume 0 == ~cond; {1322#false} is VALID [2018-11-23 12:02:10,884 INFO L273 TraceCheckUtils]: 29: Hoare triple {1322#false} assume !false; {1322#false} is VALID [2018-11-23 12:02:10,886 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:02:10,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:10,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 12:02:10,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-11-23 12:02:10,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:10,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:02:10,969 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:02:10,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:02:10,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:02:10,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:02:10,970 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 9 states. [2018-11-23 12:02:11,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:11,272 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2018-11-23 12:02:11,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:02:11,273 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-11-23 12:02:11,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:11,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:02:11,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2018-11-23 12:02:11,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:02:11,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2018-11-23 12:02:11,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 58 transitions. [2018-11-23 12:02:11,348 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:11,349 INFO L225 Difference]: With dead ends: 62 [2018-11-23 12:02:11,350 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:02:11,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:02:11,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:02:11,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-23 12:02:11,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:11,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 38 states. [2018-11-23 12:02:11,374 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 38 states. [2018-11-23 12:02:11,374 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 38 states. [2018-11-23 12:02:11,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:11,376 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-23 12:02:11,376 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-23 12:02:11,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:11,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:11,377 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 39 states. [2018-11-23 12:02:11,377 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 39 states. [2018-11-23 12:02:11,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:11,379 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-23 12:02:11,379 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-23 12:02:11,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:11,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:11,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:11,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:11,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:02:11,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-23 12:02:11,382 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 30 [2018-11-23 12:02:11,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:11,383 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-23 12:02:11,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:02:11,383 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-23 12:02:11,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:02:11,384 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:11,384 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:11,384 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:11,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:11,385 INFO L82 PathProgramCache]: Analyzing trace with hash 2008503354, now seen corresponding path program 6 times [2018-11-23 12:02:11,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:11,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:11,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:11,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:11,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:11,576 INFO L256 TraceCheckUtils]: 0: Hoare triple {1648#true} call ULTIMATE.init(); {1648#true} is VALID [2018-11-23 12:02:11,577 INFO L273 TraceCheckUtils]: 1: Hoare triple {1648#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1648#true} is VALID [2018-11-23 12:02:11,577 INFO L273 TraceCheckUtils]: 2: Hoare triple {1648#true} assume true; {1648#true} is VALID [2018-11-23 12:02:11,578 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1648#true} {1648#true} #62#return; {1648#true} is VALID [2018-11-23 12:02:11,578 INFO L256 TraceCheckUtils]: 4: Hoare triple {1648#true} call #t~ret4 := main(); {1648#true} is VALID [2018-11-23 12:02:11,579 INFO L273 TraceCheckUtils]: 5: Hoare triple {1648#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1650#(= main_~i~0 0)} is VALID [2018-11-23 12:02:11,580 INFO L273 TraceCheckUtils]: 6: Hoare triple {1650#(= 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; {1651#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:11,581 INFO L273 TraceCheckUtils]: 7: Hoare triple {1651#(<= 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; {1652#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:11,581 INFO L273 TraceCheckUtils]: 8: Hoare triple {1652#(<= 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; {1653#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:11,582 INFO L273 TraceCheckUtils]: 9: Hoare triple {1653#(<= 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; {1654#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:11,583 INFO L273 TraceCheckUtils]: 10: Hoare triple {1654#(<= 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; {1655#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:11,584 INFO L273 TraceCheckUtils]: 11: Hoare triple {1655#(<= 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; {1656#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:11,585 INFO L273 TraceCheckUtils]: 12: Hoare triple {1656#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1649#false} is VALID [2018-11-23 12:02:11,585 INFO L273 TraceCheckUtils]: 13: Hoare triple {1649#false} ~i~0 := 0; {1649#false} is VALID [2018-11-23 12:02:11,586 INFO L273 TraceCheckUtils]: 14: Hoare triple {1649#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1649#false} is VALID [2018-11-23 12:02:11,586 INFO L273 TraceCheckUtils]: 15: Hoare triple {1649#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1649#false} is VALID [2018-11-23 12:02:11,586 INFO L273 TraceCheckUtils]: 16: Hoare triple {1649#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1649#false} is VALID [2018-11-23 12:02:11,586 INFO L273 TraceCheckUtils]: 17: Hoare triple {1649#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1649#false} is VALID [2018-11-23 12:02:11,587 INFO L273 TraceCheckUtils]: 18: Hoare triple {1649#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1649#false} is VALID [2018-11-23 12:02:11,587 INFO L273 TraceCheckUtils]: 19: Hoare triple {1649#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1649#false} is VALID [2018-11-23 12:02:11,587 INFO L273 TraceCheckUtils]: 20: Hoare triple {1649#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1649#false} is VALID [2018-11-23 12:02:11,588 INFO L273 TraceCheckUtils]: 21: Hoare triple {1649#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1649#false} is VALID [2018-11-23 12:02:11,588 INFO L273 TraceCheckUtils]: 22: Hoare triple {1649#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1649#false} is VALID [2018-11-23 12:02:11,589 INFO L273 TraceCheckUtils]: 23: Hoare triple {1649#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1649#false} is VALID [2018-11-23 12:02:11,589 INFO L273 TraceCheckUtils]: 24: Hoare triple {1649#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1649#false} is VALID [2018-11-23 12:02:11,589 INFO L273 TraceCheckUtils]: 25: Hoare triple {1649#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1649#false} is VALID [2018-11-23 12:02:11,589 INFO L273 TraceCheckUtils]: 26: Hoare triple {1649#false} assume !(~i~0 < 100000); {1649#false} is VALID [2018-11-23 12:02:11,589 INFO L273 TraceCheckUtils]: 27: Hoare triple {1649#false} havoc ~x~0;~x~0 := 0; {1649#false} is VALID [2018-11-23 12:02:11,590 INFO L273 TraceCheckUtils]: 28: Hoare triple {1649#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1649#false} is VALID [2018-11-23 12:02:11,590 INFO L256 TraceCheckUtils]: 29: Hoare triple {1649#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {1649#false} is VALID [2018-11-23 12:02:11,590 INFO L273 TraceCheckUtils]: 30: Hoare triple {1649#false} ~cond := #in~cond; {1649#false} is VALID [2018-11-23 12:02:11,590 INFO L273 TraceCheckUtils]: 31: Hoare triple {1649#false} assume 0 == ~cond; {1649#false} is VALID [2018-11-23 12:02:11,590 INFO L273 TraceCheckUtils]: 32: Hoare triple {1649#false} assume !false; {1649#false} is VALID [2018-11-23 12:02:11,592 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 12:02:11,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:11,592 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:11,603 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:02:11,731 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 12:02:11,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:11,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:12,102 INFO L256 TraceCheckUtils]: 0: Hoare triple {1648#true} call ULTIMATE.init(); {1648#true} is VALID [2018-11-23 12:02:12,103 INFO L273 TraceCheckUtils]: 1: Hoare triple {1648#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1648#true} is VALID [2018-11-23 12:02:12,103 INFO L273 TraceCheckUtils]: 2: Hoare triple {1648#true} assume true; {1648#true} is VALID [2018-11-23 12:02:12,104 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1648#true} {1648#true} #62#return; {1648#true} is VALID [2018-11-23 12:02:12,104 INFO L256 TraceCheckUtils]: 4: Hoare triple {1648#true} call #t~ret4 := main(); {1648#true} is VALID [2018-11-23 12:02:12,104 INFO L273 TraceCheckUtils]: 5: Hoare triple {1648#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1648#true} is VALID [2018-11-23 12:02:12,105 INFO L273 TraceCheckUtils]: 6: Hoare triple {1648#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1648#true} is VALID [2018-11-23 12:02:12,105 INFO L273 TraceCheckUtils]: 7: Hoare triple {1648#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1648#true} is VALID [2018-11-23 12:02:12,105 INFO L273 TraceCheckUtils]: 8: Hoare triple {1648#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1648#true} is VALID [2018-11-23 12:02:12,106 INFO L273 TraceCheckUtils]: 9: Hoare triple {1648#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1648#true} is VALID [2018-11-23 12:02:12,106 INFO L273 TraceCheckUtils]: 10: Hoare triple {1648#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1648#true} is VALID [2018-11-23 12:02:12,106 INFO L273 TraceCheckUtils]: 11: Hoare triple {1648#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1648#true} is VALID [2018-11-23 12:02:12,106 INFO L273 TraceCheckUtils]: 12: Hoare triple {1648#true} assume !(~i~0 < 100000); {1648#true} is VALID [2018-11-23 12:02:12,107 INFO L273 TraceCheckUtils]: 13: Hoare triple {1648#true} ~i~0 := 0; {1699#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:12,108 INFO L273 TraceCheckUtils]: 14: Hoare triple {1699#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1699#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:12,109 INFO L273 TraceCheckUtils]: 15: Hoare triple {1699#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1651#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:12,109 INFO L273 TraceCheckUtils]: 16: Hoare triple {1651#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1651#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:12,109 INFO L273 TraceCheckUtils]: 17: Hoare triple {1651#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1652#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:12,110 INFO L273 TraceCheckUtils]: 18: Hoare triple {1652#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1652#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:12,110 INFO L273 TraceCheckUtils]: 19: Hoare triple {1652#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1653#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:12,111 INFO L273 TraceCheckUtils]: 20: Hoare triple {1653#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1653#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:12,111 INFO L273 TraceCheckUtils]: 21: Hoare triple {1653#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1654#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:12,112 INFO L273 TraceCheckUtils]: 22: Hoare triple {1654#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1654#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:12,113 INFO L273 TraceCheckUtils]: 23: Hoare triple {1654#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1655#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:12,113 INFO L273 TraceCheckUtils]: 24: Hoare triple {1655#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1655#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:12,114 INFO L273 TraceCheckUtils]: 25: Hoare triple {1655#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1656#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:12,115 INFO L273 TraceCheckUtils]: 26: Hoare triple {1656#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1649#false} is VALID [2018-11-23 12:02:12,116 INFO L273 TraceCheckUtils]: 27: Hoare triple {1649#false} havoc ~x~0;~x~0 := 0; {1649#false} is VALID [2018-11-23 12:02:12,116 INFO L273 TraceCheckUtils]: 28: Hoare triple {1649#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1649#false} is VALID [2018-11-23 12:02:12,116 INFO L256 TraceCheckUtils]: 29: Hoare triple {1649#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {1649#false} is VALID [2018-11-23 12:02:12,116 INFO L273 TraceCheckUtils]: 30: Hoare triple {1649#false} ~cond := #in~cond; {1649#false} is VALID [2018-11-23 12:02:12,117 INFO L273 TraceCheckUtils]: 31: Hoare triple {1649#false} assume 0 == ~cond; {1649#false} is VALID [2018-11-23 12:02:12,117 INFO L273 TraceCheckUtils]: 32: Hoare triple {1649#false} assume !false; {1649#false} is VALID [2018-11-23 12:02:12,119 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 12:02:12,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:12,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 12:02:12,139 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-11-23 12:02:12,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:12,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:02:12,293 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:12,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:02:12,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:02:12,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:02:12,294 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 10 states. [2018-11-23 12:02:12,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:12,669 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2018-11-23 12:02:12,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:02:12,669 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-11-23 12:02:12,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:12,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:02:12,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2018-11-23 12:02:12,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:02:12,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2018-11-23 12:02:12,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 61 transitions. [2018-11-23 12:02:12,741 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:12,743 INFO L225 Difference]: With dead ends: 67 [2018-11-23 12:02:12,743 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 12:02:12,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:02:12,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 12:02:12,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-23 12:02:12,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:12,769 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2018-11-23 12:02:12,769 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2018-11-23 12:02:12,770 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2018-11-23 12:02:12,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:12,772 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-23 12:02:12,773 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-23 12:02:12,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:12,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:12,774 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2018-11-23 12:02:12,774 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2018-11-23 12:02:12,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:12,776 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-23 12:02:12,776 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-23 12:02:12,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:12,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:12,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:12,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:12,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:02:12,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-11-23 12:02:12,779 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 33 [2018-11-23 12:02:12,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:12,779 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-11-23 12:02:12,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:02:12,779 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-11-23 12:02:12,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 12:02:12,780 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:12,780 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:12,781 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:12,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:12,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1155270616, now seen corresponding path program 7 times [2018-11-23 12:02:12,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:12,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:12,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:12,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:12,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:13,135 INFO L256 TraceCheckUtils]: 0: Hoare triple {2004#true} call ULTIMATE.init(); {2004#true} is VALID [2018-11-23 12:02:13,135 INFO L273 TraceCheckUtils]: 1: Hoare triple {2004#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2004#true} is VALID [2018-11-23 12:02:13,135 INFO L273 TraceCheckUtils]: 2: Hoare triple {2004#true} assume true; {2004#true} is VALID [2018-11-23 12:02:13,136 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2004#true} {2004#true} #62#return; {2004#true} is VALID [2018-11-23 12:02:13,136 INFO L256 TraceCheckUtils]: 4: Hoare triple {2004#true} call #t~ret4 := main(); {2004#true} is VALID [2018-11-23 12:02:13,137 INFO L273 TraceCheckUtils]: 5: Hoare triple {2004#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2006#(= main_~i~0 0)} is VALID [2018-11-23 12:02:13,138 INFO L273 TraceCheckUtils]: 6: Hoare triple {2006#(= 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; {2007#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:13,139 INFO L273 TraceCheckUtils]: 7: Hoare triple {2007#(<= 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; {2008#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:13,139 INFO L273 TraceCheckUtils]: 8: Hoare triple {2008#(<= 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; {2009#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:13,140 INFO L273 TraceCheckUtils]: 9: Hoare triple {2009#(<= 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; {2010#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:13,141 INFO L273 TraceCheckUtils]: 10: Hoare triple {2010#(<= 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; {2011#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:13,148 INFO L273 TraceCheckUtils]: 11: Hoare triple {2011#(<= 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; {2012#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:13,151 INFO L273 TraceCheckUtils]: 12: Hoare triple {2012#(<= 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; {2013#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:13,151 INFO L273 TraceCheckUtils]: 13: Hoare triple {2013#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2005#false} is VALID [2018-11-23 12:02:13,151 INFO L273 TraceCheckUtils]: 14: Hoare triple {2005#false} ~i~0 := 0; {2005#false} is VALID [2018-11-23 12:02:13,152 INFO L273 TraceCheckUtils]: 15: Hoare triple {2005#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2005#false} is VALID [2018-11-23 12:02:13,152 INFO L273 TraceCheckUtils]: 16: Hoare triple {2005#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2005#false} is VALID [2018-11-23 12:02:13,152 INFO L273 TraceCheckUtils]: 17: Hoare triple {2005#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2005#false} is VALID [2018-11-23 12:02:13,152 INFO L273 TraceCheckUtils]: 18: Hoare triple {2005#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2005#false} is VALID [2018-11-23 12:02:13,153 INFO L273 TraceCheckUtils]: 19: Hoare triple {2005#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2005#false} is VALID [2018-11-23 12:02:13,153 INFO L273 TraceCheckUtils]: 20: Hoare triple {2005#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2005#false} is VALID [2018-11-23 12:02:13,153 INFO L273 TraceCheckUtils]: 21: Hoare triple {2005#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2005#false} is VALID [2018-11-23 12:02:13,153 INFO L273 TraceCheckUtils]: 22: Hoare triple {2005#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2005#false} is VALID [2018-11-23 12:02:13,154 INFO L273 TraceCheckUtils]: 23: Hoare triple {2005#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2005#false} is VALID [2018-11-23 12:02:13,154 INFO L273 TraceCheckUtils]: 24: Hoare triple {2005#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2005#false} is VALID [2018-11-23 12:02:13,154 INFO L273 TraceCheckUtils]: 25: Hoare triple {2005#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2005#false} is VALID [2018-11-23 12:02:13,154 INFO L273 TraceCheckUtils]: 26: Hoare triple {2005#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2005#false} is VALID [2018-11-23 12:02:13,155 INFO L273 TraceCheckUtils]: 27: Hoare triple {2005#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2005#false} is VALID [2018-11-23 12:02:13,155 INFO L273 TraceCheckUtils]: 28: Hoare triple {2005#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2005#false} is VALID [2018-11-23 12:02:13,155 INFO L273 TraceCheckUtils]: 29: Hoare triple {2005#false} assume !(~i~0 < 100000); {2005#false} is VALID [2018-11-23 12:02:13,155 INFO L273 TraceCheckUtils]: 30: Hoare triple {2005#false} havoc ~x~0;~x~0 := 0; {2005#false} is VALID [2018-11-23 12:02:13,156 INFO L273 TraceCheckUtils]: 31: Hoare triple {2005#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2005#false} is VALID [2018-11-23 12:02:13,156 INFO L256 TraceCheckUtils]: 32: Hoare triple {2005#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {2005#false} is VALID [2018-11-23 12:02:13,156 INFO L273 TraceCheckUtils]: 33: Hoare triple {2005#false} ~cond := #in~cond; {2005#false} is VALID [2018-11-23 12:02:13,156 INFO L273 TraceCheckUtils]: 34: Hoare triple {2005#false} assume 0 == ~cond; {2005#false} is VALID [2018-11-23 12:02:13,157 INFO L273 TraceCheckUtils]: 35: Hoare triple {2005#false} assume !false; {2005#false} is VALID [2018-11-23 12:02:13,158 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-23 12:02:13,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:13,159 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:13,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:13,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:13,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:13,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:13,400 INFO L256 TraceCheckUtils]: 0: Hoare triple {2004#true} call ULTIMATE.init(); {2004#true} is VALID [2018-11-23 12:02:13,401 INFO L273 TraceCheckUtils]: 1: Hoare triple {2004#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2004#true} is VALID [2018-11-23 12:02:13,401 INFO L273 TraceCheckUtils]: 2: Hoare triple {2004#true} assume true; {2004#true} is VALID [2018-11-23 12:02:13,401 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2004#true} {2004#true} #62#return; {2004#true} is VALID [2018-11-23 12:02:13,402 INFO L256 TraceCheckUtils]: 4: Hoare triple {2004#true} call #t~ret4 := main(); {2004#true} is VALID [2018-11-23 12:02:13,403 INFO L273 TraceCheckUtils]: 5: Hoare triple {2004#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2032#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:13,403 INFO L273 TraceCheckUtils]: 6: Hoare triple {2032#(<= 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; {2007#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:13,404 INFO L273 TraceCheckUtils]: 7: Hoare triple {2007#(<= 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; {2008#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:13,404 INFO L273 TraceCheckUtils]: 8: Hoare triple {2008#(<= 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; {2009#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:13,405 INFO L273 TraceCheckUtils]: 9: Hoare triple {2009#(<= 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; {2010#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:13,407 INFO L273 TraceCheckUtils]: 10: Hoare triple {2010#(<= 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; {2011#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:13,408 INFO L273 TraceCheckUtils]: 11: Hoare triple {2011#(<= 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; {2012#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:13,412 INFO L273 TraceCheckUtils]: 12: Hoare triple {2012#(<= 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; {2013#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:13,413 INFO L273 TraceCheckUtils]: 13: Hoare triple {2013#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2005#false} is VALID [2018-11-23 12:02:13,413 INFO L273 TraceCheckUtils]: 14: Hoare triple {2005#false} ~i~0 := 0; {2005#false} is VALID [2018-11-23 12:02:13,413 INFO L273 TraceCheckUtils]: 15: Hoare triple {2005#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2005#false} is VALID [2018-11-23 12:02:13,414 INFO L273 TraceCheckUtils]: 16: Hoare triple {2005#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2005#false} is VALID [2018-11-23 12:02:13,414 INFO L273 TraceCheckUtils]: 17: Hoare triple {2005#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2005#false} is VALID [2018-11-23 12:02:13,414 INFO L273 TraceCheckUtils]: 18: Hoare triple {2005#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2005#false} is VALID [2018-11-23 12:02:13,414 INFO L273 TraceCheckUtils]: 19: Hoare triple {2005#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2005#false} is VALID [2018-11-23 12:02:13,414 INFO L273 TraceCheckUtils]: 20: Hoare triple {2005#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2005#false} is VALID [2018-11-23 12:02:13,414 INFO L273 TraceCheckUtils]: 21: Hoare triple {2005#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2005#false} is VALID [2018-11-23 12:02:13,415 INFO L273 TraceCheckUtils]: 22: Hoare triple {2005#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2005#false} is VALID [2018-11-23 12:02:13,415 INFO L273 TraceCheckUtils]: 23: Hoare triple {2005#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2005#false} is VALID [2018-11-23 12:02:13,415 INFO L273 TraceCheckUtils]: 24: Hoare triple {2005#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2005#false} is VALID [2018-11-23 12:02:13,415 INFO L273 TraceCheckUtils]: 25: Hoare triple {2005#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2005#false} is VALID [2018-11-23 12:02:13,415 INFO L273 TraceCheckUtils]: 26: Hoare triple {2005#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2005#false} is VALID [2018-11-23 12:02:13,415 INFO L273 TraceCheckUtils]: 27: Hoare triple {2005#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2005#false} is VALID [2018-11-23 12:02:13,415 INFO L273 TraceCheckUtils]: 28: Hoare triple {2005#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2005#false} is VALID [2018-11-23 12:02:13,416 INFO L273 TraceCheckUtils]: 29: Hoare triple {2005#false} assume !(~i~0 < 100000); {2005#false} is VALID [2018-11-23 12:02:13,416 INFO L273 TraceCheckUtils]: 30: Hoare triple {2005#false} havoc ~x~0;~x~0 := 0; {2005#false} is VALID [2018-11-23 12:02:13,416 INFO L273 TraceCheckUtils]: 31: Hoare triple {2005#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2005#false} is VALID [2018-11-23 12:02:13,416 INFO L256 TraceCheckUtils]: 32: Hoare triple {2005#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {2005#false} is VALID [2018-11-23 12:02:13,416 INFO L273 TraceCheckUtils]: 33: Hoare triple {2005#false} ~cond := #in~cond; {2005#false} is VALID [2018-11-23 12:02:13,416 INFO L273 TraceCheckUtils]: 34: Hoare triple {2005#false} assume 0 == ~cond; {2005#false} is VALID [2018-11-23 12:02:13,416 INFO L273 TraceCheckUtils]: 35: Hoare triple {2005#false} assume !false; {2005#false} is VALID [2018-11-23 12:02:13,417 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-23 12:02:13,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:13,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:02:13,439 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-11-23 12:02:13,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:13,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:02:13,462 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:02:13,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:02:13,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:02:13,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:02:13,463 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 11 states. [2018-11-23 12:02:14,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:14,053 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-11-23 12:02:14,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:02:14,053 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-11-23 12:02:14,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:14,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:02:14,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 64 transitions. [2018-11-23 12:02:14,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:02:14,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 64 transitions. [2018-11-23 12:02:14,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 64 transitions. [2018-11-23 12:02:14,140 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:02:14,142 INFO L225 Difference]: With dead ends: 72 [2018-11-23 12:02:14,143 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 12:02:14,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:02:14,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 12:02:14,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-23 12:02:14,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:14,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 44 states. [2018-11-23 12:02:14,172 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 44 states. [2018-11-23 12:02:14,173 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 44 states. [2018-11-23 12:02:14,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:14,175 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-11-23 12:02:14,175 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-11-23 12:02:14,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:14,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:14,176 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 45 states. [2018-11-23 12:02:14,176 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 45 states. [2018-11-23 12:02:14,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:14,178 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-11-23 12:02:14,178 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-11-23 12:02:14,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:14,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:14,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:14,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:14,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:02:14,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-23 12:02:14,181 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 36 [2018-11-23 12:02:14,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:14,181 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-23 12:02:14,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:02:14,181 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-23 12:02:14,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 12:02:14,182 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:14,182 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:14,182 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:14,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:14,183 INFO L82 PathProgramCache]: Analyzing trace with hash -2090911178, now seen corresponding path program 8 times [2018-11-23 12:02:14,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:14,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:14,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:14,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:14,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:14,383 INFO L256 TraceCheckUtils]: 0: Hoare triple {2389#true} call ULTIMATE.init(); {2389#true} is VALID [2018-11-23 12:02:14,383 INFO L273 TraceCheckUtils]: 1: Hoare triple {2389#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2389#true} is VALID [2018-11-23 12:02:14,383 INFO L273 TraceCheckUtils]: 2: Hoare triple {2389#true} assume true; {2389#true} is VALID [2018-11-23 12:02:14,384 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2389#true} {2389#true} #62#return; {2389#true} is VALID [2018-11-23 12:02:14,384 INFO L256 TraceCheckUtils]: 4: Hoare triple {2389#true} call #t~ret4 := main(); {2389#true} is VALID [2018-11-23 12:02:14,384 INFO L273 TraceCheckUtils]: 5: Hoare triple {2389#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2391#(= main_~i~0 0)} is VALID [2018-11-23 12:02:14,390 INFO L273 TraceCheckUtils]: 6: Hoare triple {2391#(= 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; {2392#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:14,390 INFO L273 TraceCheckUtils]: 7: Hoare triple {2392#(<= 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; {2393#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:14,391 INFO L273 TraceCheckUtils]: 8: Hoare triple {2393#(<= 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; {2394#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:14,392 INFO L273 TraceCheckUtils]: 9: Hoare triple {2394#(<= 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; {2395#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:14,392 INFO L273 TraceCheckUtils]: 10: Hoare triple {2395#(<= 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; {2396#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:14,393 INFO L273 TraceCheckUtils]: 11: Hoare triple {2396#(<= 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; {2397#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:14,394 INFO L273 TraceCheckUtils]: 12: Hoare triple {2397#(<= 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; {2398#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:14,395 INFO L273 TraceCheckUtils]: 13: Hoare triple {2398#(<= 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; {2399#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:14,396 INFO L273 TraceCheckUtils]: 14: Hoare triple {2399#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2390#false} is VALID [2018-11-23 12:02:14,396 INFO L273 TraceCheckUtils]: 15: Hoare triple {2390#false} ~i~0 := 0; {2390#false} is VALID [2018-11-23 12:02:14,396 INFO L273 TraceCheckUtils]: 16: Hoare triple {2390#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2390#false} is VALID [2018-11-23 12:02:14,397 INFO L273 TraceCheckUtils]: 17: Hoare triple {2390#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2390#false} is VALID [2018-11-23 12:02:14,397 INFO L273 TraceCheckUtils]: 18: Hoare triple {2390#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2390#false} is VALID [2018-11-23 12:02:14,397 INFO L273 TraceCheckUtils]: 19: Hoare triple {2390#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2390#false} is VALID [2018-11-23 12:02:14,397 INFO L273 TraceCheckUtils]: 20: Hoare triple {2390#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2390#false} is VALID [2018-11-23 12:02:14,398 INFO L273 TraceCheckUtils]: 21: Hoare triple {2390#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2390#false} is VALID [2018-11-23 12:02:14,398 INFO L273 TraceCheckUtils]: 22: Hoare triple {2390#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2390#false} is VALID [2018-11-23 12:02:14,398 INFO L273 TraceCheckUtils]: 23: Hoare triple {2390#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2390#false} is VALID [2018-11-23 12:02:14,398 INFO L273 TraceCheckUtils]: 24: Hoare triple {2390#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2390#false} is VALID [2018-11-23 12:02:14,398 INFO L273 TraceCheckUtils]: 25: Hoare triple {2390#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2390#false} is VALID [2018-11-23 12:02:14,399 INFO L273 TraceCheckUtils]: 26: Hoare triple {2390#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2390#false} is VALID [2018-11-23 12:02:14,399 INFO L273 TraceCheckUtils]: 27: Hoare triple {2390#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2390#false} is VALID [2018-11-23 12:02:14,399 INFO L273 TraceCheckUtils]: 28: Hoare triple {2390#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2390#false} is VALID [2018-11-23 12:02:14,399 INFO L273 TraceCheckUtils]: 29: Hoare triple {2390#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2390#false} is VALID [2018-11-23 12:02:14,400 INFO L273 TraceCheckUtils]: 30: Hoare triple {2390#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2390#false} is VALID [2018-11-23 12:02:14,400 INFO L273 TraceCheckUtils]: 31: Hoare triple {2390#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2390#false} is VALID [2018-11-23 12:02:14,400 INFO L273 TraceCheckUtils]: 32: Hoare triple {2390#false} assume !(~i~0 < 100000); {2390#false} is VALID [2018-11-23 12:02:14,400 INFO L273 TraceCheckUtils]: 33: Hoare triple {2390#false} havoc ~x~0;~x~0 := 0; {2390#false} is VALID [2018-11-23 12:02:14,401 INFO L273 TraceCheckUtils]: 34: Hoare triple {2390#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2390#false} is VALID [2018-11-23 12:02:14,401 INFO L256 TraceCheckUtils]: 35: Hoare triple {2390#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {2390#false} is VALID [2018-11-23 12:02:14,401 INFO L273 TraceCheckUtils]: 36: Hoare triple {2390#false} ~cond := #in~cond; {2390#false} is VALID [2018-11-23 12:02:14,401 INFO L273 TraceCheckUtils]: 37: Hoare triple {2390#false} assume 0 == ~cond; {2390#false} is VALID [2018-11-23 12:02:14,401 INFO L273 TraceCheckUtils]: 38: Hoare triple {2390#false} assume !false; {2390#false} is VALID [2018-11-23 12:02:14,402 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 12:02:14,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:14,403 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:14,416 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:02:14,452 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:02:14,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:14,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:14,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:14,637 INFO L256 TraceCheckUtils]: 0: Hoare triple {2389#true} call ULTIMATE.init(); {2389#true} is VALID [2018-11-23 12:02:14,638 INFO L273 TraceCheckUtils]: 1: Hoare triple {2389#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2389#true} is VALID [2018-11-23 12:02:14,638 INFO L273 TraceCheckUtils]: 2: Hoare triple {2389#true} assume true; {2389#true} is VALID [2018-11-23 12:02:14,638 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2389#true} {2389#true} #62#return; {2389#true} is VALID [2018-11-23 12:02:14,638 INFO L256 TraceCheckUtils]: 4: Hoare triple {2389#true} call #t~ret4 := main(); {2389#true} is VALID [2018-11-23 12:02:14,642 INFO L273 TraceCheckUtils]: 5: Hoare triple {2389#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2418#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:14,643 INFO L273 TraceCheckUtils]: 6: Hoare triple {2418#(<= 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; {2392#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:14,644 INFO L273 TraceCheckUtils]: 7: Hoare triple {2392#(<= 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; {2393#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:14,645 INFO L273 TraceCheckUtils]: 8: Hoare triple {2393#(<= 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; {2394#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:14,645 INFO L273 TraceCheckUtils]: 9: Hoare triple {2394#(<= 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; {2395#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:14,646 INFO L273 TraceCheckUtils]: 10: Hoare triple {2395#(<= 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; {2396#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:14,647 INFO L273 TraceCheckUtils]: 11: Hoare triple {2396#(<= 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; {2397#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:14,647 INFO L273 TraceCheckUtils]: 12: Hoare triple {2397#(<= 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; {2398#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:14,649 INFO L273 TraceCheckUtils]: 13: Hoare triple {2398#(<= 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; {2399#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:14,649 INFO L273 TraceCheckUtils]: 14: Hoare triple {2399#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2390#false} is VALID [2018-11-23 12:02:14,650 INFO L273 TraceCheckUtils]: 15: Hoare triple {2390#false} ~i~0 := 0; {2390#false} is VALID [2018-11-23 12:02:14,650 INFO L273 TraceCheckUtils]: 16: Hoare triple {2390#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2390#false} is VALID [2018-11-23 12:02:14,650 INFO L273 TraceCheckUtils]: 17: Hoare triple {2390#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2390#false} is VALID [2018-11-23 12:02:14,651 INFO L273 TraceCheckUtils]: 18: Hoare triple {2390#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2390#false} is VALID [2018-11-23 12:02:14,651 INFO L273 TraceCheckUtils]: 19: Hoare triple {2390#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2390#false} is VALID [2018-11-23 12:02:14,651 INFO L273 TraceCheckUtils]: 20: Hoare triple {2390#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2390#false} is VALID [2018-11-23 12:02:14,651 INFO L273 TraceCheckUtils]: 21: Hoare triple {2390#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2390#false} is VALID [2018-11-23 12:02:14,652 INFO L273 TraceCheckUtils]: 22: Hoare triple {2390#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2390#false} is VALID [2018-11-23 12:02:14,652 INFO L273 TraceCheckUtils]: 23: Hoare triple {2390#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2390#false} is VALID [2018-11-23 12:02:14,652 INFO L273 TraceCheckUtils]: 24: Hoare triple {2390#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2390#false} is VALID [2018-11-23 12:02:14,653 INFO L273 TraceCheckUtils]: 25: Hoare triple {2390#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2390#false} is VALID [2018-11-23 12:02:14,653 INFO L273 TraceCheckUtils]: 26: Hoare triple {2390#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2390#false} is VALID [2018-11-23 12:02:14,653 INFO L273 TraceCheckUtils]: 27: Hoare triple {2390#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2390#false} is VALID [2018-11-23 12:02:14,653 INFO L273 TraceCheckUtils]: 28: Hoare triple {2390#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2390#false} is VALID [2018-11-23 12:02:14,653 INFO L273 TraceCheckUtils]: 29: Hoare triple {2390#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2390#false} is VALID [2018-11-23 12:02:14,654 INFO L273 TraceCheckUtils]: 30: Hoare triple {2390#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2390#false} is VALID [2018-11-23 12:02:14,654 INFO L273 TraceCheckUtils]: 31: Hoare triple {2390#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2390#false} is VALID [2018-11-23 12:02:14,654 INFO L273 TraceCheckUtils]: 32: Hoare triple {2390#false} assume !(~i~0 < 100000); {2390#false} is VALID [2018-11-23 12:02:14,654 INFO L273 TraceCheckUtils]: 33: Hoare triple {2390#false} havoc ~x~0;~x~0 := 0; {2390#false} is VALID [2018-11-23 12:02:14,655 INFO L273 TraceCheckUtils]: 34: Hoare triple {2390#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2390#false} is VALID [2018-11-23 12:02:14,655 INFO L256 TraceCheckUtils]: 35: Hoare triple {2390#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {2390#false} is VALID [2018-11-23 12:02:14,655 INFO L273 TraceCheckUtils]: 36: Hoare triple {2390#false} ~cond := #in~cond; {2390#false} is VALID [2018-11-23 12:02:14,655 INFO L273 TraceCheckUtils]: 37: Hoare triple {2390#false} assume 0 == ~cond; {2390#false} is VALID [2018-11-23 12:02:14,655 INFO L273 TraceCheckUtils]: 38: Hoare triple {2390#false} assume !false; {2390#false} is VALID [2018-11-23 12:02:14,656 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 12:02:14,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:14,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:02:14,676 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-11-23 12:02:14,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:14,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:02:14,706 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:14,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:02:14,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:02:14,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:02:14,707 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 12 states. [2018-11-23 12:02:15,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:15,169 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-11-23 12:02:15,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:02:15,169 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-11-23 12:02:15,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:15,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:02:15,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 67 transitions. [2018-11-23 12:02:15,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:02:15,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 67 transitions. [2018-11-23 12:02:15,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 67 transitions. [2018-11-23 12:02:15,276 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:15,277 INFO L225 Difference]: With dead ends: 77 [2018-11-23 12:02:15,277 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 12:02:15,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:02:15,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 12:02:15,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-11-23 12:02:15,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:15,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2018-11-23 12:02:15,300 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2018-11-23 12:02:15,300 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2018-11-23 12:02:15,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:15,302 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-23 12:02:15,302 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-23 12:02:15,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:15,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:15,302 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2018-11-23 12:02:15,303 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2018-11-23 12:02:15,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:15,303 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-23 12:02:15,304 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-23 12:02:15,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:15,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:15,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:15,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:15,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:02:15,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-11-23 12:02:15,305 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 39 [2018-11-23 12:02:15,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:15,305 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-11-23 12:02:15,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:02:15,306 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-11-23 12:02:15,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 12:02:15,306 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:15,306 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:15,307 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:15,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:15,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1997490476, now seen corresponding path program 9 times [2018-11-23 12:02:15,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:15,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:15,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:15,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:15,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:15,515 INFO L256 TraceCheckUtils]: 0: Hoare triple {2803#true} call ULTIMATE.init(); {2803#true} is VALID [2018-11-23 12:02:15,515 INFO L273 TraceCheckUtils]: 1: Hoare triple {2803#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2803#true} is VALID [2018-11-23 12:02:15,515 INFO L273 TraceCheckUtils]: 2: Hoare triple {2803#true} assume true; {2803#true} is VALID [2018-11-23 12:02:15,515 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2803#true} {2803#true} #62#return; {2803#true} is VALID [2018-11-23 12:02:15,516 INFO L256 TraceCheckUtils]: 4: Hoare triple {2803#true} call #t~ret4 := main(); {2803#true} is VALID [2018-11-23 12:02:15,516 INFO L273 TraceCheckUtils]: 5: Hoare triple {2803#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2805#(= main_~i~0 0)} is VALID [2018-11-23 12:02:15,517 INFO L273 TraceCheckUtils]: 6: Hoare triple {2805#(= 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; {2806#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:15,518 INFO L273 TraceCheckUtils]: 7: Hoare triple {2806#(<= 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; {2807#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:15,518 INFO L273 TraceCheckUtils]: 8: Hoare triple {2807#(<= 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; {2808#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:15,519 INFO L273 TraceCheckUtils]: 9: Hoare triple {2808#(<= 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; {2809#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:15,520 INFO L273 TraceCheckUtils]: 10: Hoare triple {2809#(<= 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; {2810#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:15,520 INFO L273 TraceCheckUtils]: 11: Hoare triple {2810#(<= 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; {2811#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:15,521 INFO L273 TraceCheckUtils]: 12: Hoare triple {2811#(<= 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; {2812#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:15,522 INFO L273 TraceCheckUtils]: 13: Hoare triple {2812#(<= 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; {2813#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:15,523 INFO L273 TraceCheckUtils]: 14: Hoare triple {2813#(<= 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; {2814#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:15,524 INFO L273 TraceCheckUtils]: 15: Hoare triple {2814#(<= main_~i~0 9)} assume !(~i~0 < 100000); {2804#false} is VALID [2018-11-23 12:02:15,524 INFO L273 TraceCheckUtils]: 16: Hoare triple {2804#false} ~i~0 := 0; {2804#false} is VALID [2018-11-23 12:02:15,524 INFO L273 TraceCheckUtils]: 17: Hoare triple {2804#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2804#false} is VALID [2018-11-23 12:02:15,524 INFO L273 TraceCheckUtils]: 18: Hoare triple {2804#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2804#false} is VALID [2018-11-23 12:02:15,525 INFO L273 TraceCheckUtils]: 19: Hoare triple {2804#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2804#false} is VALID [2018-11-23 12:02:15,525 INFO L273 TraceCheckUtils]: 20: Hoare triple {2804#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2804#false} is VALID [2018-11-23 12:02:15,525 INFO L273 TraceCheckUtils]: 21: Hoare triple {2804#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2804#false} is VALID [2018-11-23 12:02:15,525 INFO L273 TraceCheckUtils]: 22: Hoare triple {2804#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2804#false} is VALID [2018-11-23 12:02:15,526 INFO L273 TraceCheckUtils]: 23: Hoare triple {2804#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2804#false} is VALID [2018-11-23 12:02:15,526 INFO L273 TraceCheckUtils]: 24: Hoare triple {2804#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2804#false} is VALID [2018-11-23 12:02:15,526 INFO L273 TraceCheckUtils]: 25: Hoare triple {2804#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2804#false} is VALID [2018-11-23 12:02:15,527 INFO L273 TraceCheckUtils]: 26: Hoare triple {2804#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2804#false} is VALID [2018-11-23 12:02:15,527 INFO L273 TraceCheckUtils]: 27: Hoare triple {2804#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2804#false} is VALID [2018-11-23 12:02:15,527 INFO L273 TraceCheckUtils]: 28: Hoare triple {2804#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2804#false} is VALID [2018-11-23 12:02:15,527 INFO L273 TraceCheckUtils]: 29: Hoare triple {2804#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2804#false} is VALID [2018-11-23 12:02:15,528 INFO L273 TraceCheckUtils]: 30: Hoare triple {2804#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2804#false} is VALID [2018-11-23 12:02:15,528 INFO L273 TraceCheckUtils]: 31: Hoare triple {2804#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2804#false} is VALID [2018-11-23 12:02:15,528 INFO L273 TraceCheckUtils]: 32: Hoare triple {2804#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2804#false} is VALID [2018-11-23 12:02:15,528 INFO L273 TraceCheckUtils]: 33: Hoare triple {2804#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2804#false} is VALID [2018-11-23 12:02:15,528 INFO L273 TraceCheckUtils]: 34: Hoare triple {2804#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2804#false} is VALID [2018-11-23 12:02:15,529 INFO L273 TraceCheckUtils]: 35: Hoare triple {2804#false} assume !(~i~0 < 100000); {2804#false} is VALID [2018-11-23 12:02:15,529 INFO L273 TraceCheckUtils]: 36: Hoare triple {2804#false} havoc ~x~0;~x~0 := 0; {2804#false} is VALID [2018-11-23 12:02:15,529 INFO L273 TraceCheckUtils]: 37: Hoare triple {2804#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2804#false} is VALID [2018-11-23 12:02:15,529 INFO L256 TraceCheckUtils]: 38: Hoare triple {2804#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {2804#false} is VALID [2018-11-23 12:02:15,529 INFO L273 TraceCheckUtils]: 39: Hoare triple {2804#false} ~cond := #in~cond; {2804#false} is VALID [2018-11-23 12:02:15,530 INFO L273 TraceCheckUtils]: 40: Hoare triple {2804#false} assume 0 == ~cond; {2804#false} is VALID [2018-11-23 12:02:15,530 INFO L273 TraceCheckUtils]: 41: Hoare triple {2804#false} assume !false; {2804#false} is VALID [2018-11-23 12:02:15,531 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-23 12:02:15,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:15,531 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:15,546 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:02:15,646 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:02:15,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:15,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:15,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:15,787 INFO L256 TraceCheckUtils]: 0: Hoare triple {2803#true} call ULTIMATE.init(); {2803#true} is VALID [2018-11-23 12:02:15,787 INFO L273 TraceCheckUtils]: 1: Hoare triple {2803#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2803#true} is VALID [2018-11-23 12:02:15,787 INFO L273 TraceCheckUtils]: 2: Hoare triple {2803#true} assume true; {2803#true} is VALID [2018-11-23 12:02:15,787 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2803#true} {2803#true} #62#return; {2803#true} is VALID [2018-11-23 12:02:15,788 INFO L256 TraceCheckUtils]: 4: Hoare triple {2803#true} call #t~ret4 := main(); {2803#true} is VALID [2018-11-23 12:02:15,788 INFO L273 TraceCheckUtils]: 5: Hoare triple {2803#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2833#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:15,790 INFO L273 TraceCheckUtils]: 6: Hoare triple {2833#(<= 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; {2806#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:15,791 INFO L273 TraceCheckUtils]: 7: Hoare triple {2806#(<= 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; {2807#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:15,791 INFO L273 TraceCheckUtils]: 8: Hoare triple {2807#(<= 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; {2808#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:15,792 INFO L273 TraceCheckUtils]: 9: Hoare triple {2808#(<= 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; {2809#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:15,793 INFO L273 TraceCheckUtils]: 10: Hoare triple {2809#(<= 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; {2810#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:15,794 INFO L273 TraceCheckUtils]: 11: Hoare triple {2810#(<= 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; {2811#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:15,795 INFO L273 TraceCheckUtils]: 12: Hoare triple {2811#(<= 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; {2812#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:15,796 INFO L273 TraceCheckUtils]: 13: Hoare triple {2812#(<= 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; {2813#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:15,797 INFO L273 TraceCheckUtils]: 14: Hoare triple {2813#(<= 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; {2814#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:15,798 INFO L273 TraceCheckUtils]: 15: Hoare triple {2814#(<= main_~i~0 9)} assume !(~i~0 < 100000); {2804#false} is VALID [2018-11-23 12:02:15,798 INFO L273 TraceCheckUtils]: 16: Hoare triple {2804#false} ~i~0 := 0; {2804#false} is VALID [2018-11-23 12:02:15,798 INFO L273 TraceCheckUtils]: 17: Hoare triple {2804#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2804#false} is VALID [2018-11-23 12:02:15,799 INFO L273 TraceCheckUtils]: 18: Hoare triple {2804#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2804#false} is VALID [2018-11-23 12:02:15,799 INFO L273 TraceCheckUtils]: 19: Hoare triple {2804#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2804#false} is VALID [2018-11-23 12:02:15,799 INFO L273 TraceCheckUtils]: 20: Hoare triple {2804#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2804#false} is VALID [2018-11-23 12:02:15,799 INFO L273 TraceCheckUtils]: 21: Hoare triple {2804#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2804#false} is VALID [2018-11-23 12:02:15,799 INFO L273 TraceCheckUtils]: 22: Hoare triple {2804#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2804#false} is VALID [2018-11-23 12:02:15,800 INFO L273 TraceCheckUtils]: 23: Hoare triple {2804#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2804#false} is VALID [2018-11-23 12:02:15,800 INFO L273 TraceCheckUtils]: 24: Hoare triple {2804#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2804#false} is VALID [2018-11-23 12:02:15,800 INFO L273 TraceCheckUtils]: 25: Hoare triple {2804#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2804#false} is VALID [2018-11-23 12:02:15,800 INFO L273 TraceCheckUtils]: 26: Hoare triple {2804#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2804#false} is VALID [2018-11-23 12:02:15,801 INFO L273 TraceCheckUtils]: 27: Hoare triple {2804#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2804#false} is VALID [2018-11-23 12:02:15,801 INFO L273 TraceCheckUtils]: 28: Hoare triple {2804#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2804#false} is VALID [2018-11-23 12:02:15,801 INFO L273 TraceCheckUtils]: 29: Hoare triple {2804#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2804#false} is VALID [2018-11-23 12:02:15,801 INFO L273 TraceCheckUtils]: 30: Hoare triple {2804#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2804#false} is VALID [2018-11-23 12:02:15,801 INFO L273 TraceCheckUtils]: 31: Hoare triple {2804#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2804#false} is VALID [2018-11-23 12:02:15,801 INFO L273 TraceCheckUtils]: 32: Hoare triple {2804#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2804#false} is VALID [2018-11-23 12:02:15,801 INFO L273 TraceCheckUtils]: 33: Hoare triple {2804#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2804#false} is VALID [2018-11-23 12:02:15,802 INFO L273 TraceCheckUtils]: 34: Hoare triple {2804#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2804#false} is VALID [2018-11-23 12:02:15,802 INFO L273 TraceCheckUtils]: 35: Hoare triple {2804#false} assume !(~i~0 < 100000); {2804#false} is VALID [2018-11-23 12:02:15,802 INFO L273 TraceCheckUtils]: 36: Hoare triple {2804#false} havoc ~x~0;~x~0 := 0; {2804#false} is VALID [2018-11-23 12:02:15,802 INFO L273 TraceCheckUtils]: 37: Hoare triple {2804#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2804#false} is VALID [2018-11-23 12:02:15,802 INFO L256 TraceCheckUtils]: 38: Hoare triple {2804#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {2804#false} is VALID [2018-11-23 12:02:15,802 INFO L273 TraceCheckUtils]: 39: Hoare triple {2804#false} ~cond := #in~cond; {2804#false} is VALID [2018-11-23 12:02:15,802 INFO L273 TraceCheckUtils]: 40: Hoare triple {2804#false} assume 0 == ~cond; {2804#false} is VALID [2018-11-23 12:02:15,802 INFO L273 TraceCheckUtils]: 41: Hoare triple {2804#false} assume !false; {2804#false} is VALID [2018-11-23 12:02:15,803 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-23 12:02:15,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:15,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 12:02:15,825 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2018-11-23 12:02:15,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:15,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:02:15,848 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:15,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:02:15,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:02:15,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:02:15,849 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 13 states. [2018-11-23 12:02:16,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:16,112 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-11-23 12:02:16,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:02:16,112 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2018-11-23 12:02:16,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:16,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:02:16,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2018-11-23 12:02:16,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:02:16,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2018-11-23 12:02:16,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 70 transitions. [2018-11-23 12:02:16,231 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:16,233 INFO L225 Difference]: With dead ends: 82 [2018-11-23 12:02:16,233 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 12:02:16,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 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:16,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 12:02:16,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-11-23 12:02:16,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:16,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 50 states. [2018-11-23 12:02:16,268 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 50 states. [2018-11-23 12:02:16,268 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 50 states. [2018-11-23 12:02:16,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:16,269 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-11-23 12:02:16,269 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-11-23 12:02:16,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:16,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:16,270 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 51 states. [2018-11-23 12:02:16,270 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 51 states. [2018-11-23 12:02:16,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:16,272 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-11-23 12:02:16,272 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-11-23 12:02:16,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:16,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:16,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:16,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:16,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 12:02:16,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2018-11-23 12:02:16,274 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 42 [2018-11-23 12:02:16,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:16,275 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2018-11-23 12:02:16,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:02:16,275 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-11-23 12:02:16,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 12:02:16,276 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:16,276 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:16,276 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:16,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:16,277 INFO L82 PathProgramCache]: Analyzing trace with hash 527876658, now seen corresponding path program 10 times [2018-11-23 12:02:16,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:16,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:16,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:16,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:16,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:16,556 INFO L256 TraceCheckUtils]: 0: Hoare triple {3246#true} call ULTIMATE.init(); {3246#true} is VALID [2018-11-23 12:02:16,557 INFO L273 TraceCheckUtils]: 1: Hoare triple {3246#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3246#true} is VALID [2018-11-23 12:02:16,557 INFO L273 TraceCheckUtils]: 2: Hoare triple {3246#true} assume true; {3246#true} is VALID [2018-11-23 12:02:16,557 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3246#true} {3246#true} #62#return; {3246#true} is VALID [2018-11-23 12:02:16,557 INFO L256 TraceCheckUtils]: 4: Hoare triple {3246#true} call #t~ret4 := main(); {3246#true} is VALID [2018-11-23 12:02:16,557 INFO L273 TraceCheckUtils]: 5: Hoare triple {3246#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3248#(= main_~i~0 0)} is VALID [2018-11-23 12:02:16,558 INFO L273 TraceCheckUtils]: 6: Hoare triple {3248#(= 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; {3249#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:16,559 INFO L273 TraceCheckUtils]: 7: Hoare triple {3249#(<= 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; {3250#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:16,560 INFO L273 TraceCheckUtils]: 8: Hoare triple {3250#(<= 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; {3251#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:16,561 INFO L273 TraceCheckUtils]: 9: Hoare triple {3251#(<= 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; {3252#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:16,562 INFO L273 TraceCheckUtils]: 10: Hoare triple {3252#(<= 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; {3253#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:16,563 INFO L273 TraceCheckUtils]: 11: Hoare triple {3253#(<= 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; {3254#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:16,564 INFO L273 TraceCheckUtils]: 12: Hoare triple {3254#(<= 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; {3255#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:16,565 INFO L273 TraceCheckUtils]: 13: Hoare triple {3255#(<= 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; {3256#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:16,566 INFO L273 TraceCheckUtils]: 14: Hoare triple {3256#(<= 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; {3257#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:16,567 INFO L273 TraceCheckUtils]: 15: Hoare triple {3257#(<= 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; {3258#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:16,568 INFO L273 TraceCheckUtils]: 16: Hoare triple {3258#(<= main_~i~0 10)} assume !(~i~0 < 100000); {3247#false} is VALID [2018-11-23 12:02:16,568 INFO L273 TraceCheckUtils]: 17: Hoare triple {3247#false} ~i~0 := 0; {3247#false} is VALID [2018-11-23 12:02:16,568 INFO L273 TraceCheckUtils]: 18: Hoare triple {3247#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3247#false} is VALID [2018-11-23 12:02:16,569 INFO L273 TraceCheckUtils]: 19: Hoare triple {3247#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3247#false} is VALID [2018-11-23 12:02:16,569 INFO L273 TraceCheckUtils]: 20: Hoare triple {3247#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3247#false} is VALID [2018-11-23 12:02:16,569 INFO L273 TraceCheckUtils]: 21: Hoare triple {3247#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3247#false} is VALID [2018-11-23 12:02:16,569 INFO L273 TraceCheckUtils]: 22: Hoare triple {3247#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3247#false} is VALID [2018-11-23 12:02:16,569 INFO L273 TraceCheckUtils]: 23: Hoare triple {3247#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3247#false} is VALID [2018-11-23 12:02:16,570 INFO L273 TraceCheckUtils]: 24: Hoare triple {3247#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3247#false} is VALID [2018-11-23 12:02:16,570 INFO L273 TraceCheckUtils]: 25: Hoare triple {3247#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3247#false} is VALID [2018-11-23 12:02:16,570 INFO L273 TraceCheckUtils]: 26: Hoare triple {3247#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3247#false} is VALID [2018-11-23 12:02:16,570 INFO L273 TraceCheckUtils]: 27: Hoare triple {3247#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3247#false} is VALID [2018-11-23 12:02:16,570 INFO L273 TraceCheckUtils]: 28: Hoare triple {3247#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3247#false} is VALID [2018-11-23 12:02:16,571 INFO L273 TraceCheckUtils]: 29: Hoare triple {3247#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3247#false} is VALID [2018-11-23 12:02:16,571 INFO L273 TraceCheckUtils]: 30: Hoare triple {3247#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3247#false} is VALID [2018-11-23 12:02:16,571 INFO L273 TraceCheckUtils]: 31: Hoare triple {3247#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3247#false} is VALID [2018-11-23 12:02:16,571 INFO L273 TraceCheckUtils]: 32: Hoare triple {3247#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3247#false} is VALID [2018-11-23 12:02:16,572 INFO L273 TraceCheckUtils]: 33: Hoare triple {3247#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3247#false} is VALID [2018-11-23 12:02:16,572 INFO L273 TraceCheckUtils]: 34: Hoare triple {3247#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3247#false} is VALID [2018-11-23 12:02:16,572 INFO L273 TraceCheckUtils]: 35: Hoare triple {3247#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3247#false} is VALID [2018-11-23 12:02:16,572 INFO L273 TraceCheckUtils]: 36: Hoare triple {3247#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3247#false} is VALID [2018-11-23 12:02:16,572 INFO L273 TraceCheckUtils]: 37: Hoare triple {3247#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3247#false} is VALID [2018-11-23 12:02:16,573 INFO L273 TraceCheckUtils]: 38: Hoare triple {3247#false} assume !(~i~0 < 100000); {3247#false} is VALID [2018-11-23 12:02:16,573 INFO L273 TraceCheckUtils]: 39: Hoare triple {3247#false} havoc ~x~0;~x~0 := 0; {3247#false} is VALID [2018-11-23 12:02:16,573 INFO L273 TraceCheckUtils]: 40: Hoare triple {3247#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3247#false} is VALID [2018-11-23 12:02:16,573 INFO L256 TraceCheckUtils]: 41: Hoare triple {3247#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {3247#false} is VALID [2018-11-23 12:02:16,573 INFO L273 TraceCheckUtils]: 42: Hoare triple {3247#false} ~cond := #in~cond; {3247#false} is VALID [2018-11-23 12:02:16,574 INFO L273 TraceCheckUtils]: 43: Hoare triple {3247#false} assume 0 == ~cond; {3247#false} is VALID [2018-11-23 12:02:16,574 INFO L273 TraceCheckUtils]: 44: Hoare triple {3247#false} assume !false; {3247#false} is VALID [2018-11-23 12:02:16,575 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 12:02:16,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:16,575 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:16,587 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:02:16,637 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:02:16,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:16,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:16,838 INFO L256 TraceCheckUtils]: 0: Hoare triple {3246#true} call ULTIMATE.init(); {3246#true} is VALID [2018-11-23 12:02:16,838 INFO L273 TraceCheckUtils]: 1: Hoare triple {3246#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3246#true} is VALID [2018-11-23 12:02:16,839 INFO L273 TraceCheckUtils]: 2: Hoare triple {3246#true} assume true; {3246#true} is VALID [2018-11-23 12:02:16,839 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3246#true} {3246#true} #62#return; {3246#true} is VALID [2018-11-23 12:02:16,839 INFO L256 TraceCheckUtils]: 4: Hoare triple {3246#true} call #t~ret4 := main(); {3246#true} is VALID [2018-11-23 12:02:16,839 INFO L273 TraceCheckUtils]: 5: Hoare triple {3246#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3246#true} is VALID [2018-11-23 12:02:16,840 INFO L273 TraceCheckUtils]: 6: Hoare triple {3246#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3246#true} is VALID [2018-11-23 12:02:16,840 INFO L273 TraceCheckUtils]: 7: Hoare triple {3246#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3246#true} is VALID [2018-11-23 12:02:16,840 INFO L273 TraceCheckUtils]: 8: Hoare triple {3246#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3246#true} is VALID [2018-11-23 12:02:16,840 INFO L273 TraceCheckUtils]: 9: Hoare triple {3246#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3246#true} is VALID [2018-11-23 12:02:16,840 INFO L273 TraceCheckUtils]: 10: Hoare triple {3246#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3246#true} is VALID [2018-11-23 12:02:16,840 INFO L273 TraceCheckUtils]: 11: Hoare triple {3246#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3246#true} is VALID [2018-11-23 12:02:16,840 INFO L273 TraceCheckUtils]: 12: Hoare triple {3246#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3246#true} is VALID [2018-11-23 12:02:16,841 INFO L273 TraceCheckUtils]: 13: Hoare triple {3246#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3246#true} is VALID [2018-11-23 12:02:16,841 INFO L273 TraceCheckUtils]: 14: Hoare triple {3246#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3246#true} is VALID [2018-11-23 12:02:16,841 INFO L273 TraceCheckUtils]: 15: Hoare triple {3246#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3246#true} is VALID [2018-11-23 12:02:16,841 INFO L273 TraceCheckUtils]: 16: Hoare triple {3246#true} assume !(~i~0 < 100000); {3246#true} is VALID [2018-11-23 12:02:16,841 INFO L273 TraceCheckUtils]: 17: Hoare triple {3246#true} ~i~0 := 0; {3313#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:16,842 INFO L273 TraceCheckUtils]: 18: Hoare triple {3313#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3313#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:16,842 INFO L273 TraceCheckUtils]: 19: Hoare triple {3313#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3249#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:16,842 INFO L273 TraceCheckUtils]: 20: Hoare triple {3249#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3249#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:16,843 INFO L273 TraceCheckUtils]: 21: Hoare triple {3249#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3250#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:16,843 INFO L273 TraceCheckUtils]: 22: Hoare triple {3250#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3250#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:16,861 INFO L273 TraceCheckUtils]: 23: Hoare triple {3250#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3251#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:16,862 INFO L273 TraceCheckUtils]: 24: Hoare triple {3251#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3251#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:16,863 INFO L273 TraceCheckUtils]: 25: Hoare triple {3251#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3252#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:16,863 INFO L273 TraceCheckUtils]: 26: Hoare triple {3252#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3252#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:16,863 INFO L273 TraceCheckUtils]: 27: Hoare triple {3252#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3253#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:16,864 INFO L273 TraceCheckUtils]: 28: Hoare triple {3253#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3253#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:16,864 INFO L273 TraceCheckUtils]: 29: Hoare triple {3253#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3254#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:16,865 INFO L273 TraceCheckUtils]: 30: Hoare triple {3254#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3254#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:16,865 INFO L273 TraceCheckUtils]: 31: Hoare triple {3254#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3255#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:16,865 INFO L273 TraceCheckUtils]: 32: Hoare triple {3255#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3255#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:16,866 INFO L273 TraceCheckUtils]: 33: Hoare triple {3255#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3256#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:16,866 INFO L273 TraceCheckUtils]: 34: Hoare triple {3256#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3256#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:16,867 INFO L273 TraceCheckUtils]: 35: Hoare triple {3256#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3257#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:16,868 INFO L273 TraceCheckUtils]: 36: Hoare triple {3257#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3257#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:16,868 INFO L273 TraceCheckUtils]: 37: Hoare triple {3257#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3258#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:16,874 INFO L273 TraceCheckUtils]: 38: Hoare triple {3258#(<= main_~i~0 10)} assume !(~i~0 < 100000); {3247#false} is VALID [2018-11-23 12:02:16,874 INFO L273 TraceCheckUtils]: 39: Hoare triple {3247#false} havoc ~x~0;~x~0 := 0; {3247#false} is VALID [2018-11-23 12:02:16,874 INFO L273 TraceCheckUtils]: 40: Hoare triple {3247#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3247#false} is VALID [2018-11-23 12:02:16,874 INFO L256 TraceCheckUtils]: 41: Hoare triple {3247#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {3247#false} is VALID [2018-11-23 12:02:16,874 INFO L273 TraceCheckUtils]: 42: Hoare triple {3247#false} ~cond := #in~cond; {3247#false} is VALID [2018-11-23 12:02:16,874 INFO L273 TraceCheckUtils]: 43: Hoare triple {3247#false} assume 0 == ~cond; {3247#false} is VALID [2018-11-23 12:02:16,875 INFO L273 TraceCheckUtils]: 44: Hoare triple {3247#false} assume !false; {3247#false} is VALID [2018-11-23 12:02:16,876 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 12:02:16,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:16,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 12:02:16,896 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2018-11-23 12:02:16,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:16,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:02:16,972 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:16,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:02:16,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:02:16,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:02:16,974 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 14 states. [2018-11-23 12:02:17,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:17,261 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2018-11-23 12:02:17,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:02:17,262 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2018-11-23 12:02:17,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:17,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:02:17,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 73 transitions. [2018-11-23 12:02:17,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:02:17,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 73 transitions. [2018-11-23 12:02:17,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 73 transitions. [2018-11-23 12:02:17,346 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:17,347 INFO L225 Difference]: With dead ends: 87 [2018-11-23 12:02:17,347 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 12:02:17,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 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:17,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 12:02:17,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-11-23 12:02:17,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:17,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 53 states. [2018-11-23 12:02:17,374 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 53 states. [2018-11-23 12:02:17,374 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 53 states. [2018-11-23 12:02:17,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:17,375 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-11-23 12:02:17,375 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-11-23 12:02:17,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:17,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:17,376 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 54 states. [2018-11-23 12:02:17,376 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 54 states. [2018-11-23 12:02:17,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:17,377 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-11-23 12:02:17,377 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-11-23 12:02:17,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:17,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:17,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:17,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:17,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 12:02:17,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-11-23 12:02:17,379 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 45 [2018-11-23 12:02:17,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:17,379 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-11-23 12:02:17,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:02:17,380 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-11-23 12:02:17,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 12:02:17,380 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:17,380 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:17,381 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:17,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:17,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1374848976, now seen corresponding path program 11 times [2018-11-23 12:02:17,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:17,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:17,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:17,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:17,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:17,723 INFO L256 TraceCheckUtils]: 0: Hoare triple {3718#true} call ULTIMATE.init(); {3718#true} is VALID [2018-11-23 12:02:17,723 INFO L273 TraceCheckUtils]: 1: Hoare triple {3718#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3718#true} is VALID [2018-11-23 12:02:17,724 INFO L273 TraceCheckUtils]: 2: Hoare triple {3718#true} assume true; {3718#true} is VALID [2018-11-23 12:02:17,724 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3718#true} {3718#true} #62#return; {3718#true} is VALID [2018-11-23 12:02:17,724 INFO L256 TraceCheckUtils]: 4: Hoare triple {3718#true} call #t~ret4 := main(); {3718#true} is VALID [2018-11-23 12:02:17,739 INFO L273 TraceCheckUtils]: 5: Hoare triple {3718#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3720#(= main_~i~0 0)} is VALID [2018-11-23 12:02:17,747 INFO L273 TraceCheckUtils]: 6: Hoare triple {3720#(= 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; {3721#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:17,748 INFO L273 TraceCheckUtils]: 7: Hoare triple {3721#(<= 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; {3722#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:17,749 INFO L273 TraceCheckUtils]: 8: Hoare triple {3722#(<= 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; {3723#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:17,749 INFO L273 TraceCheckUtils]: 9: Hoare triple {3723#(<= 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; {3724#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:17,752 INFO L273 TraceCheckUtils]: 10: Hoare triple {3724#(<= 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; {3725#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:17,752 INFO L273 TraceCheckUtils]: 11: Hoare triple {3725#(<= 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; {3726#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:17,755 INFO L273 TraceCheckUtils]: 12: Hoare triple {3726#(<= 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; {3727#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:17,755 INFO L273 TraceCheckUtils]: 13: Hoare triple {3727#(<= 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; {3728#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:17,756 INFO L273 TraceCheckUtils]: 14: Hoare triple {3728#(<= 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; {3729#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:17,756 INFO L273 TraceCheckUtils]: 15: Hoare triple {3729#(<= 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; {3730#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:17,757 INFO L273 TraceCheckUtils]: 16: Hoare triple {3730#(<= 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; {3731#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:17,757 INFO L273 TraceCheckUtils]: 17: Hoare triple {3731#(<= main_~i~0 11)} assume !(~i~0 < 100000); {3719#false} is VALID [2018-11-23 12:02:17,757 INFO L273 TraceCheckUtils]: 18: Hoare triple {3719#false} ~i~0 := 0; {3719#false} is VALID [2018-11-23 12:02:17,758 INFO L273 TraceCheckUtils]: 19: Hoare triple {3719#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3719#false} is VALID [2018-11-23 12:02:17,758 INFO L273 TraceCheckUtils]: 20: Hoare triple {3719#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3719#false} is VALID [2018-11-23 12:02:17,758 INFO L273 TraceCheckUtils]: 21: Hoare triple {3719#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3719#false} is VALID [2018-11-23 12:02:17,758 INFO L273 TraceCheckUtils]: 22: Hoare triple {3719#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3719#false} is VALID [2018-11-23 12:02:17,758 INFO L273 TraceCheckUtils]: 23: Hoare triple {3719#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3719#false} is VALID [2018-11-23 12:02:17,758 INFO L273 TraceCheckUtils]: 24: Hoare triple {3719#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3719#false} is VALID [2018-11-23 12:02:17,758 INFO L273 TraceCheckUtils]: 25: Hoare triple {3719#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3719#false} is VALID [2018-11-23 12:02:17,758 INFO L273 TraceCheckUtils]: 26: Hoare triple {3719#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3719#false} is VALID [2018-11-23 12:02:17,759 INFO L273 TraceCheckUtils]: 27: Hoare triple {3719#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3719#false} is VALID [2018-11-23 12:02:17,759 INFO L273 TraceCheckUtils]: 28: Hoare triple {3719#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3719#false} is VALID [2018-11-23 12:02:17,759 INFO L273 TraceCheckUtils]: 29: Hoare triple {3719#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3719#false} is VALID [2018-11-23 12:02:17,759 INFO L273 TraceCheckUtils]: 30: Hoare triple {3719#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3719#false} is VALID [2018-11-23 12:02:17,759 INFO L273 TraceCheckUtils]: 31: Hoare triple {3719#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3719#false} is VALID [2018-11-23 12:02:17,759 INFO L273 TraceCheckUtils]: 32: Hoare triple {3719#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3719#false} is VALID [2018-11-23 12:02:17,759 INFO L273 TraceCheckUtils]: 33: Hoare triple {3719#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3719#false} is VALID [2018-11-23 12:02:17,759 INFO L273 TraceCheckUtils]: 34: Hoare triple {3719#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3719#false} is VALID [2018-11-23 12:02:17,760 INFO L273 TraceCheckUtils]: 35: Hoare triple {3719#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3719#false} is VALID [2018-11-23 12:02:17,760 INFO L273 TraceCheckUtils]: 36: Hoare triple {3719#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3719#false} is VALID [2018-11-23 12:02:17,760 INFO L273 TraceCheckUtils]: 37: Hoare triple {3719#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3719#false} is VALID [2018-11-23 12:02:17,760 INFO L273 TraceCheckUtils]: 38: Hoare triple {3719#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3719#false} is VALID [2018-11-23 12:02:17,760 INFO L273 TraceCheckUtils]: 39: Hoare triple {3719#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3719#false} is VALID [2018-11-23 12:02:17,760 INFO L273 TraceCheckUtils]: 40: Hoare triple {3719#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3719#false} is VALID [2018-11-23 12:02:17,760 INFO L273 TraceCheckUtils]: 41: Hoare triple {3719#false} assume !(~i~0 < 100000); {3719#false} is VALID [2018-11-23 12:02:17,761 INFO L273 TraceCheckUtils]: 42: Hoare triple {3719#false} havoc ~x~0;~x~0 := 0; {3719#false} is VALID [2018-11-23 12:02:17,761 INFO L273 TraceCheckUtils]: 43: Hoare triple {3719#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3719#false} is VALID [2018-11-23 12:02:17,761 INFO L256 TraceCheckUtils]: 44: Hoare triple {3719#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {3719#false} is VALID [2018-11-23 12:02:17,761 INFO L273 TraceCheckUtils]: 45: Hoare triple {3719#false} ~cond := #in~cond; {3719#false} is VALID [2018-11-23 12:02:17,761 INFO L273 TraceCheckUtils]: 46: Hoare triple {3719#false} assume 0 == ~cond; {3719#false} is VALID [2018-11-23 12:02:17,761 INFO L273 TraceCheckUtils]: 47: Hoare triple {3719#false} assume !false; {3719#false} is VALID [2018-11-23 12:02:17,762 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-23 12:02:17,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:17,763 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:17,772 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:02:19,468 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 12:02:19,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:19,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:19,635 INFO L256 TraceCheckUtils]: 0: Hoare triple {3718#true} call ULTIMATE.init(); {3718#true} is VALID [2018-11-23 12:02:19,635 INFO L273 TraceCheckUtils]: 1: Hoare triple {3718#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3718#true} is VALID [2018-11-23 12:02:19,636 INFO L273 TraceCheckUtils]: 2: Hoare triple {3718#true} assume true; {3718#true} is VALID [2018-11-23 12:02:19,636 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3718#true} {3718#true} #62#return; {3718#true} is VALID [2018-11-23 12:02:19,636 INFO L256 TraceCheckUtils]: 4: Hoare triple {3718#true} call #t~ret4 := main(); {3718#true} is VALID [2018-11-23 12:02:19,637 INFO L273 TraceCheckUtils]: 5: Hoare triple {3718#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3750#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:19,638 INFO L273 TraceCheckUtils]: 6: Hoare triple {3750#(<= 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; {3721#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:19,638 INFO L273 TraceCheckUtils]: 7: Hoare triple {3721#(<= 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; {3722#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:19,639 INFO L273 TraceCheckUtils]: 8: Hoare triple {3722#(<= 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; {3723#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:19,640 INFO L273 TraceCheckUtils]: 9: Hoare triple {3723#(<= 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; {3724#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:19,640 INFO L273 TraceCheckUtils]: 10: Hoare triple {3724#(<= 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; {3725#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:19,641 INFO L273 TraceCheckUtils]: 11: Hoare triple {3725#(<= 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; {3726#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:19,642 INFO L273 TraceCheckUtils]: 12: Hoare triple {3726#(<= 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; {3727#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:19,643 INFO L273 TraceCheckUtils]: 13: Hoare triple {3727#(<= 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; {3728#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:19,644 INFO L273 TraceCheckUtils]: 14: Hoare triple {3728#(<= 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; {3729#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:19,645 INFO L273 TraceCheckUtils]: 15: Hoare triple {3729#(<= 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; {3730#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:19,646 INFO L273 TraceCheckUtils]: 16: Hoare triple {3730#(<= 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; {3731#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:19,647 INFO L273 TraceCheckUtils]: 17: Hoare triple {3731#(<= main_~i~0 11)} assume !(~i~0 < 100000); {3719#false} is VALID [2018-11-23 12:02:19,647 INFO L273 TraceCheckUtils]: 18: Hoare triple {3719#false} ~i~0 := 0; {3719#false} is VALID [2018-11-23 12:02:19,647 INFO L273 TraceCheckUtils]: 19: Hoare triple {3719#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3719#false} is VALID [2018-11-23 12:02:19,647 INFO L273 TraceCheckUtils]: 20: Hoare triple {3719#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3719#false} is VALID [2018-11-23 12:02:19,648 INFO L273 TraceCheckUtils]: 21: Hoare triple {3719#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3719#false} is VALID [2018-11-23 12:02:19,648 INFO L273 TraceCheckUtils]: 22: Hoare triple {3719#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3719#false} is VALID [2018-11-23 12:02:19,648 INFO L273 TraceCheckUtils]: 23: Hoare triple {3719#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3719#false} is VALID [2018-11-23 12:02:19,648 INFO L273 TraceCheckUtils]: 24: Hoare triple {3719#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3719#false} is VALID [2018-11-23 12:02:19,648 INFO L273 TraceCheckUtils]: 25: Hoare triple {3719#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3719#false} is VALID [2018-11-23 12:02:19,649 INFO L273 TraceCheckUtils]: 26: Hoare triple {3719#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3719#false} is VALID [2018-11-23 12:02:19,649 INFO L273 TraceCheckUtils]: 27: Hoare triple {3719#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3719#false} is VALID [2018-11-23 12:02:19,649 INFO L273 TraceCheckUtils]: 28: Hoare triple {3719#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3719#false} is VALID [2018-11-23 12:02:19,649 INFO L273 TraceCheckUtils]: 29: Hoare triple {3719#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3719#false} is VALID [2018-11-23 12:02:19,650 INFO L273 TraceCheckUtils]: 30: Hoare triple {3719#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3719#false} is VALID [2018-11-23 12:02:19,650 INFO L273 TraceCheckUtils]: 31: Hoare triple {3719#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3719#false} is VALID [2018-11-23 12:02:19,650 INFO L273 TraceCheckUtils]: 32: Hoare triple {3719#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3719#false} is VALID [2018-11-23 12:02:19,650 INFO L273 TraceCheckUtils]: 33: Hoare triple {3719#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3719#false} is VALID [2018-11-23 12:02:19,650 INFO L273 TraceCheckUtils]: 34: Hoare triple {3719#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3719#false} is VALID [2018-11-23 12:02:19,651 INFO L273 TraceCheckUtils]: 35: Hoare triple {3719#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3719#false} is VALID [2018-11-23 12:02:19,651 INFO L273 TraceCheckUtils]: 36: Hoare triple {3719#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3719#false} is VALID [2018-11-23 12:02:19,651 INFO L273 TraceCheckUtils]: 37: Hoare triple {3719#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3719#false} is VALID [2018-11-23 12:02:19,651 INFO L273 TraceCheckUtils]: 38: Hoare triple {3719#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3719#false} is VALID [2018-11-23 12:02:19,651 INFO L273 TraceCheckUtils]: 39: Hoare triple {3719#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3719#false} is VALID [2018-11-23 12:02:19,651 INFO L273 TraceCheckUtils]: 40: Hoare triple {3719#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3719#false} is VALID [2018-11-23 12:02:19,652 INFO L273 TraceCheckUtils]: 41: Hoare triple {3719#false} assume !(~i~0 < 100000); {3719#false} is VALID [2018-11-23 12:02:19,652 INFO L273 TraceCheckUtils]: 42: Hoare triple {3719#false} havoc ~x~0;~x~0 := 0; {3719#false} is VALID [2018-11-23 12:02:19,652 INFO L273 TraceCheckUtils]: 43: Hoare triple {3719#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3719#false} is VALID [2018-11-23 12:02:19,652 INFO L256 TraceCheckUtils]: 44: Hoare triple {3719#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {3719#false} is VALID [2018-11-23 12:02:19,652 INFO L273 TraceCheckUtils]: 45: Hoare triple {3719#false} ~cond := #in~cond; {3719#false} is VALID [2018-11-23 12:02:19,652 INFO L273 TraceCheckUtils]: 46: Hoare triple {3719#false} assume 0 == ~cond; {3719#false} is VALID [2018-11-23 12:02:19,652 INFO L273 TraceCheckUtils]: 47: Hoare triple {3719#false} assume !false; {3719#false} is VALID [2018-11-23 12:02:19,654 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-23 12:02:19,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:19,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 12:02:19,675 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2018-11-23 12:02:19,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:19,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:02:19,699 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:19,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:02:19,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:02:19,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:02:19,701 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 15 states. [2018-11-23 12:02:20,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:20,068 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2018-11-23 12:02:20,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:02:20,068 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2018-11-23 12:02:20,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:20,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:02:20,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 76 transitions. [2018-11-23 12:02:20,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:02:20,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 76 transitions. [2018-11-23 12:02:20,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 76 transitions. [2018-11-23 12:02:20,224 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:20,226 INFO L225 Difference]: With dead ends: 92 [2018-11-23 12:02:20,226 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:02:20,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 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:20,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:02:20,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-23 12:02:20,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:20,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 56 states. [2018-11-23 12:02:20,280 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 56 states. [2018-11-23 12:02:20,280 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 56 states. [2018-11-23 12:02:20,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:20,282 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-11-23 12:02:20,282 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-11-23 12:02:20,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:20,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:20,282 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 57 states. [2018-11-23 12:02:20,282 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 57 states. [2018-11-23 12:02:20,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:20,284 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-11-23 12:02:20,284 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-11-23 12:02:20,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:20,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:20,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:20,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:20,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 12:02:20,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-11-23 12:02:20,285 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 48 [2018-11-23 12:02:20,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:20,286 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-11-23 12:02:20,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:02:20,286 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-11-23 12:02:20,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 12:02:20,286 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:20,287 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:20,287 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:20,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:20,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1289950162, now seen corresponding path program 12 times [2018-11-23 12:02:20,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:20,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:20,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:20,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:20,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:21,077 INFO L256 TraceCheckUtils]: 0: Hoare triple {4219#true} call ULTIMATE.init(); {4219#true} is VALID [2018-11-23 12:02:21,077 INFO L273 TraceCheckUtils]: 1: Hoare triple {4219#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4219#true} is VALID [2018-11-23 12:02:21,078 INFO L273 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2018-11-23 12:02:21,078 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4219#true} #62#return; {4219#true} is VALID [2018-11-23 12:02:21,078 INFO L256 TraceCheckUtils]: 4: Hoare triple {4219#true} call #t~ret4 := main(); {4219#true} is VALID [2018-11-23 12:02:21,079 INFO L273 TraceCheckUtils]: 5: Hoare triple {4219#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4221#(= main_~i~0 0)} is VALID [2018-11-23 12:02:21,080 INFO L273 TraceCheckUtils]: 6: Hoare triple {4221#(= 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; {4222#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:21,081 INFO L273 TraceCheckUtils]: 7: Hoare triple {4222#(<= 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; {4223#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:21,081 INFO L273 TraceCheckUtils]: 8: Hoare triple {4223#(<= 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; {4224#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:21,082 INFO L273 TraceCheckUtils]: 9: Hoare triple {4224#(<= 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; {4225#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:21,083 INFO L273 TraceCheckUtils]: 10: Hoare triple {4225#(<= 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; {4226#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:21,083 INFO L273 TraceCheckUtils]: 11: Hoare triple {4226#(<= 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; {4227#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:21,084 INFO L273 TraceCheckUtils]: 12: Hoare triple {4227#(<= 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; {4228#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:21,085 INFO L273 TraceCheckUtils]: 13: Hoare triple {4228#(<= 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; {4229#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:21,086 INFO L273 TraceCheckUtils]: 14: Hoare triple {4229#(<= 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; {4230#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:21,088 INFO L273 TraceCheckUtils]: 15: Hoare triple {4230#(<= 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; {4231#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:21,089 INFO L273 TraceCheckUtils]: 16: Hoare triple {4231#(<= 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; {4232#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:21,090 INFO L273 TraceCheckUtils]: 17: Hoare triple {4232#(<= 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; {4233#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:21,090 INFO L273 TraceCheckUtils]: 18: Hoare triple {4233#(<= main_~i~0 12)} assume !(~i~0 < 100000); {4220#false} is VALID [2018-11-23 12:02:21,091 INFO L273 TraceCheckUtils]: 19: Hoare triple {4220#false} ~i~0 := 0; {4220#false} is VALID [2018-11-23 12:02:21,091 INFO L273 TraceCheckUtils]: 20: Hoare triple {4220#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4220#false} is VALID [2018-11-23 12:02:21,091 INFO L273 TraceCheckUtils]: 21: Hoare triple {4220#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4220#false} is VALID [2018-11-23 12:02:21,092 INFO L273 TraceCheckUtils]: 22: Hoare triple {4220#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4220#false} is VALID [2018-11-23 12:02:21,092 INFO L273 TraceCheckUtils]: 23: Hoare triple {4220#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4220#false} is VALID [2018-11-23 12:02:21,092 INFO L273 TraceCheckUtils]: 24: Hoare triple {4220#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4220#false} is VALID [2018-11-23 12:02:21,093 INFO L273 TraceCheckUtils]: 25: Hoare triple {4220#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4220#false} is VALID [2018-11-23 12:02:21,093 INFO L273 TraceCheckUtils]: 26: Hoare triple {4220#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4220#false} is VALID [2018-11-23 12:02:21,094 INFO L273 TraceCheckUtils]: 27: Hoare triple {4220#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4220#false} is VALID [2018-11-23 12:02:21,094 INFO L273 TraceCheckUtils]: 28: Hoare triple {4220#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4220#false} is VALID [2018-11-23 12:02:21,094 INFO L273 TraceCheckUtils]: 29: Hoare triple {4220#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4220#false} is VALID [2018-11-23 12:02:21,094 INFO L273 TraceCheckUtils]: 30: Hoare triple {4220#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4220#false} is VALID [2018-11-23 12:02:21,095 INFO L273 TraceCheckUtils]: 31: Hoare triple {4220#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4220#false} is VALID [2018-11-23 12:02:21,095 INFO L273 TraceCheckUtils]: 32: Hoare triple {4220#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4220#false} is VALID [2018-11-23 12:02:21,095 INFO L273 TraceCheckUtils]: 33: Hoare triple {4220#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4220#false} is VALID [2018-11-23 12:02:21,095 INFO L273 TraceCheckUtils]: 34: Hoare triple {4220#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4220#false} is VALID [2018-11-23 12:02:21,095 INFO L273 TraceCheckUtils]: 35: Hoare triple {4220#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4220#false} is VALID [2018-11-23 12:02:21,096 INFO L273 TraceCheckUtils]: 36: Hoare triple {4220#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4220#false} is VALID [2018-11-23 12:02:21,096 INFO L273 TraceCheckUtils]: 37: Hoare triple {4220#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4220#false} is VALID [2018-11-23 12:02:21,096 INFO L273 TraceCheckUtils]: 38: Hoare triple {4220#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4220#false} is VALID [2018-11-23 12:02:21,096 INFO L273 TraceCheckUtils]: 39: Hoare triple {4220#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4220#false} is VALID [2018-11-23 12:02:21,097 INFO L273 TraceCheckUtils]: 40: Hoare triple {4220#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4220#false} is VALID [2018-11-23 12:02:21,097 INFO L273 TraceCheckUtils]: 41: Hoare triple {4220#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4220#false} is VALID [2018-11-23 12:02:21,097 INFO L273 TraceCheckUtils]: 42: Hoare triple {4220#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4220#false} is VALID [2018-11-23 12:02:21,097 INFO L273 TraceCheckUtils]: 43: Hoare triple {4220#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4220#false} is VALID [2018-11-23 12:02:21,097 INFO L273 TraceCheckUtils]: 44: Hoare triple {4220#false} assume !(~i~0 < 100000); {4220#false} is VALID [2018-11-23 12:02:21,098 INFO L273 TraceCheckUtils]: 45: Hoare triple {4220#false} havoc ~x~0;~x~0 := 0; {4220#false} is VALID [2018-11-23 12:02:21,098 INFO L273 TraceCheckUtils]: 46: Hoare triple {4220#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4220#false} is VALID [2018-11-23 12:02:21,098 INFO L256 TraceCheckUtils]: 47: Hoare triple {4220#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {4220#false} is VALID [2018-11-23 12:02:21,098 INFO L273 TraceCheckUtils]: 48: Hoare triple {4220#false} ~cond := #in~cond; {4220#false} is VALID [2018-11-23 12:02:21,099 INFO L273 TraceCheckUtils]: 49: Hoare triple {4220#false} assume 0 == ~cond; {4220#false} is VALID [2018-11-23 12:02:21,099 INFO L273 TraceCheckUtils]: 50: Hoare triple {4220#false} assume !false; {4220#false} is VALID [2018-11-23 12:02:21,102 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-23 12:02:21,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:21,103 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:21,119 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:02:22,637 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 12:02:22,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:22,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:22,991 INFO L256 TraceCheckUtils]: 0: Hoare triple {4219#true} call ULTIMATE.init(); {4219#true} is VALID [2018-11-23 12:02:22,991 INFO L273 TraceCheckUtils]: 1: Hoare triple {4219#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4219#true} is VALID [2018-11-23 12:02:22,991 INFO L273 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2018-11-23 12:02:22,992 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4219#true} #62#return; {4219#true} is VALID [2018-11-23 12:02:22,992 INFO L256 TraceCheckUtils]: 4: Hoare triple {4219#true} call #t~ret4 := main(); {4219#true} is VALID [2018-11-23 12:02:22,992 INFO L273 TraceCheckUtils]: 5: Hoare triple {4219#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4219#true} is VALID [2018-11-23 12:02:22,992 INFO L273 TraceCheckUtils]: 6: Hoare triple {4219#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4219#true} is VALID [2018-11-23 12:02:22,992 INFO L273 TraceCheckUtils]: 7: Hoare triple {4219#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4219#true} is VALID [2018-11-23 12:02:22,992 INFO L273 TraceCheckUtils]: 8: Hoare triple {4219#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4219#true} is VALID [2018-11-23 12:02:22,992 INFO L273 TraceCheckUtils]: 9: Hoare triple {4219#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4219#true} is VALID [2018-11-23 12:02:22,993 INFO L273 TraceCheckUtils]: 10: Hoare triple {4219#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4219#true} is VALID [2018-11-23 12:02:22,993 INFO L273 TraceCheckUtils]: 11: Hoare triple {4219#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4219#true} is VALID [2018-11-23 12:02:22,993 INFO L273 TraceCheckUtils]: 12: Hoare triple {4219#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4219#true} is VALID [2018-11-23 12:02:22,993 INFO L273 TraceCheckUtils]: 13: Hoare triple {4219#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4219#true} is VALID [2018-11-23 12:02:22,993 INFO L273 TraceCheckUtils]: 14: Hoare triple {4219#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4219#true} is VALID [2018-11-23 12:02:22,993 INFO L273 TraceCheckUtils]: 15: Hoare triple {4219#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4219#true} is VALID [2018-11-23 12:02:22,994 INFO L273 TraceCheckUtils]: 16: Hoare triple {4219#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4219#true} is VALID [2018-11-23 12:02:22,995 INFO L273 TraceCheckUtils]: 17: Hoare triple {4219#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4288#(<= main_~i~0 100000)} is VALID [2018-11-23 12:02:22,995 INFO L273 TraceCheckUtils]: 18: Hoare triple {4288#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {4219#true} is VALID [2018-11-23 12:02:22,995 INFO L273 TraceCheckUtils]: 19: Hoare triple {4219#true} ~i~0 := 0; {4295#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:22,996 INFO L273 TraceCheckUtils]: 20: Hoare triple {4295#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4295#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:22,996 INFO L273 TraceCheckUtils]: 21: Hoare triple {4295#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4222#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:22,997 INFO L273 TraceCheckUtils]: 22: Hoare triple {4222#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4222#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:22,997 INFO L273 TraceCheckUtils]: 23: Hoare triple {4222#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4223#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:22,998 INFO L273 TraceCheckUtils]: 24: Hoare triple {4223#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4223#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:22,999 INFO L273 TraceCheckUtils]: 25: Hoare triple {4223#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4224#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:22,999 INFO L273 TraceCheckUtils]: 26: Hoare triple {4224#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4224#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:23,000 INFO L273 TraceCheckUtils]: 27: Hoare triple {4224#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4225#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:23,001 INFO L273 TraceCheckUtils]: 28: Hoare triple {4225#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4225#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:23,002 INFO L273 TraceCheckUtils]: 29: Hoare triple {4225#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4226#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:23,002 INFO L273 TraceCheckUtils]: 30: Hoare triple {4226#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4226#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:23,003 INFO L273 TraceCheckUtils]: 31: Hoare triple {4226#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4227#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:23,004 INFO L273 TraceCheckUtils]: 32: Hoare triple {4227#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4227#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:23,005 INFO L273 TraceCheckUtils]: 33: Hoare triple {4227#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4228#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:23,006 INFO L273 TraceCheckUtils]: 34: Hoare triple {4228#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4228#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:23,006 INFO L273 TraceCheckUtils]: 35: Hoare triple {4228#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4229#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:23,007 INFO L273 TraceCheckUtils]: 36: Hoare triple {4229#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4229#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:23,008 INFO L273 TraceCheckUtils]: 37: Hoare triple {4229#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4230#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:23,009 INFO L273 TraceCheckUtils]: 38: Hoare triple {4230#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4230#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:23,010 INFO L273 TraceCheckUtils]: 39: Hoare triple {4230#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4231#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:23,010 INFO L273 TraceCheckUtils]: 40: Hoare triple {4231#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4231#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:23,011 INFO L273 TraceCheckUtils]: 41: Hoare triple {4231#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4232#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:23,012 INFO L273 TraceCheckUtils]: 42: Hoare triple {4232#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4232#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:23,013 INFO L273 TraceCheckUtils]: 43: Hoare triple {4232#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4233#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:23,013 INFO L273 TraceCheckUtils]: 44: Hoare triple {4233#(<= main_~i~0 12)} assume !(~i~0 < 100000); {4220#false} is VALID [2018-11-23 12:02:23,014 INFO L273 TraceCheckUtils]: 45: Hoare triple {4220#false} havoc ~x~0;~x~0 := 0; {4220#false} is VALID [2018-11-23 12:02:23,014 INFO L273 TraceCheckUtils]: 46: Hoare triple {4220#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4220#false} is VALID [2018-11-23 12:02:23,014 INFO L256 TraceCheckUtils]: 47: Hoare triple {4220#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {4220#false} is VALID [2018-11-23 12:02:23,014 INFO L273 TraceCheckUtils]: 48: Hoare triple {4220#false} ~cond := #in~cond; {4220#false} is VALID [2018-11-23 12:02:23,015 INFO L273 TraceCheckUtils]: 49: Hoare triple {4220#false} assume 0 == ~cond; {4220#false} is VALID [2018-11-23 12:02:23,015 INFO L273 TraceCheckUtils]: 50: Hoare triple {4220#false} assume !false; {4220#false} is VALID [2018-11-23 12:02:23,018 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 12 proven. 144 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-23 12:02:23,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:23,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 17 [2018-11-23 12:02:23,039 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 51 [2018-11-23 12:02:23,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:23,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:02:23,121 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:02:23,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:02:23,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:02:23,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:02:23,122 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 17 states. [2018-11-23 12:02:23,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:23,614 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2018-11-23 12:02:23,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:02:23,614 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 51 [2018-11-23 12:02:23,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:23,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:02:23,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 87 transitions. [2018-11-23 12:02:23,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:02:23,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 87 transitions. [2018-11-23 12:02:23,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 87 transitions. [2018-11-23 12:02:24,078 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:24,080 INFO L225 Difference]: With dead ends: 103 [2018-11-23 12:02:24,080 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 12:02:24,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:02:24,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 12:02:24,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 59. [2018-11-23 12:02:24,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:24,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 59 states. [2018-11-23 12:02:24,155 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 59 states. [2018-11-23 12:02:24,155 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 59 states. [2018-11-23 12:02:24,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:24,158 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-23 12:02:24,158 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-23 12:02:24,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:24,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:24,159 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 66 states. [2018-11-23 12:02:24,159 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 66 states. [2018-11-23 12:02:24,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:24,161 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-23 12:02:24,161 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-23 12:02:24,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:24,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:24,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:24,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:24,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:02:24,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-11-23 12:02:24,163 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 51 [2018-11-23 12:02:24,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:24,164 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-11-23 12:02:24,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:02:24,164 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-11-23 12:02:24,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 12:02:24,164 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:24,165 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:24,165 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:24,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:24,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1556118220, now seen corresponding path program 13 times [2018-11-23 12:02:24,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:24,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:24,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:24,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:24,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:25,228 INFO L256 TraceCheckUtils]: 0: Hoare triple {4771#true} call ULTIMATE.init(); {4771#true} is VALID [2018-11-23 12:02:25,228 INFO L273 TraceCheckUtils]: 1: Hoare triple {4771#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4771#true} is VALID [2018-11-23 12:02:25,229 INFO L273 TraceCheckUtils]: 2: Hoare triple {4771#true} assume true; {4771#true} is VALID [2018-11-23 12:02:25,229 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4771#true} {4771#true} #62#return; {4771#true} is VALID [2018-11-23 12:02:25,229 INFO L256 TraceCheckUtils]: 4: Hoare triple {4771#true} call #t~ret4 := main(); {4771#true} is VALID [2018-11-23 12:02:25,230 INFO L273 TraceCheckUtils]: 5: Hoare triple {4771#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4773#(= main_~i~0 0)} is VALID [2018-11-23 12:02:25,231 INFO L273 TraceCheckUtils]: 6: Hoare triple {4773#(= 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; {4774#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:25,231 INFO L273 TraceCheckUtils]: 7: Hoare triple {4774#(<= 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; {4775#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:25,232 INFO L273 TraceCheckUtils]: 8: Hoare triple {4775#(<= 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; {4776#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:25,232 INFO L273 TraceCheckUtils]: 9: Hoare triple {4776#(<= 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; {4777#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:25,233 INFO L273 TraceCheckUtils]: 10: Hoare triple {4777#(<= 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; {4778#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:25,233 INFO L273 TraceCheckUtils]: 11: Hoare triple {4778#(<= 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; {4779#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:25,234 INFO L273 TraceCheckUtils]: 12: Hoare triple {4779#(<= 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; {4780#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:25,235 INFO L273 TraceCheckUtils]: 13: Hoare triple {4780#(<= 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; {4781#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:25,236 INFO L273 TraceCheckUtils]: 14: Hoare triple {4781#(<= 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; {4782#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:25,237 INFO L273 TraceCheckUtils]: 15: Hoare triple {4782#(<= 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; {4783#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:25,238 INFO L273 TraceCheckUtils]: 16: Hoare triple {4783#(<= 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; {4784#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:25,239 INFO L273 TraceCheckUtils]: 17: Hoare triple {4784#(<= 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; {4785#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:25,240 INFO L273 TraceCheckUtils]: 18: Hoare triple {4785#(<= 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; {4786#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:25,241 INFO L273 TraceCheckUtils]: 19: Hoare triple {4786#(<= main_~i~0 13)} assume !(~i~0 < 100000); {4772#false} is VALID [2018-11-23 12:02:25,241 INFO L273 TraceCheckUtils]: 20: Hoare triple {4772#false} ~i~0 := 0; {4772#false} is VALID [2018-11-23 12:02:25,241 INFO L273 TraceCheckUtils]: 21: Hoare triple {4772#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4772#false} is VALID [2018-11-23 12:02:25,241 INFO L273 TraceCheckUtils]: 22: Hoare triple {4772#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4772#false} is VALID [2018-11-23 12:02:25,241 INFO L273 TraceCheckUtils]: 23: Hoare triple {4772#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4772#false} is VALID [2018-11-23 12:02:25,242 INFO L273 TraceCheckUtils]: 24: Hoare triple {4772#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4772#false} is VALID [2018-11-23 12:02:25,242 INFO L273 TraceCheckUtils]: 25: Hoare triple {4772#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4772#false} is VALID [2018-11-23 12:02:25,242 INFO L273 TraceCheckUtils]: 26: Hoare triple {4772#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4772#false} is VALID [2018-11-23 12:02:25,242 INFO L273 TraceCheckUtils]: 27: Hoare triple {4772#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4772#false} is VALID [2018-11-23 12:02:25,243 INFO L273 TraceCheckUtils]: 28: Hoare triple {4772#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4772#false} is VALID [2018-11-23 12:02:25,243 INFO L273 TraceCheckUtils]: 29: Hoare triple {4772#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4772#false} is VALID [2018-11-23 12:02:25,243 INFO L273 TraceCheckUtils]: 30: Hoare triple {4772#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4772#false} is VALID [2018-11-23 12:02:25,243 INFO L273 TraceCheckUtils]: 31: Hoare triple {4772#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4772#false} is VALID [2018-11-23 12:02:25,243 INFO L273 TraceCheckUtils]: 32: Hoare triple {4772#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4772#false} is VALID [2018-11-23 12:02:25,244 INFO L273 TraceCheckUtils]: 33: Hoare triple {4772#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4772#false} is VALID [2018-11-23 12:02:25,244 INFO L273 TraceCheckUtils]: 34: Hoare triple {4772#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4772#false} is VALID [2018-11-23 12:02:25,244 INFO L273 TraceCheckUtils]: 35: Hoare triple {4772#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4772#false} is VALID [2018-11-23 12:02:25,244 INFO L273 TraceCheckUtils]: 36: Hoare triple {4772#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4772#false} is VALID [2018-11-23 12:02:25,244 INFO L273 TraceCheckUtils]: 37: Hoare triple {4772#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4772#false} is VALID [2018-11-23 12:02:25,244 INFO L273 TraceCheckUtils]: 38: Hoare triple {4772#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4772#false} is VALID [2018-11-23 12:02:25,244 INFO L273 TraceCheckUtils]: 39: Hoare triple {4772#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4772#false} is VALID [2018-11-23 12:02:25,244 INFO L273 TraceCheckUtils]: 40: Hoare triple {4772#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4772#false} is VALID [2018-11-23 12:02:25,245 INFO L273 TraceCheckUtils]: 41: Hoare triple {4772#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4772#false} is VALID [2018-11-23 12:02:25,245 INFO L273 TraceCheckUtils]: 42: Hoare triple {4772#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4772#false} is VALID [2018-11-23 12:02:25,245 INFO L273 TraceCheckUtils]: 43: Hoare triple {4772#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4772#false} is VALID [2018-11-23 12:02:25,245 INFO L273 TraceCheckUtils]: 44: Hoare triple {4772#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4772#false} is VALID [2018-11-23 12:02:25,245 INFO L273 TraceCheckUtils]: 45: Hoare triple {4772#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4772#false} is VALID [2018-11-23 12:02:25,245 INFO L273 TraceCheckUtils]: 46: Hoare triple {4772#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4772#false} is VALID [2018-11-23 12:02:25,245 INFO L273 TraceCheckUtils]: 47: Hoare triple {4772#false} assume !(~i~0 < 100000); {4772#false} is VALID [2018-11-23 12:02:25,245 INFO L273 TraceCheckUtils]: 48: Hoare triple {4772#false} havoc ~x~0;~x~0 := 0; {4772#false} is VALID [2018-11-23 12:02:25,246 INFO L273 TraceCheckUtils]: 49: Hoare triple {4772#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4772#false} is VALID [2018-11-23 12:02:25,246 INFO L256 TraceCheckUtils]: 50: Hoare triple {4772#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {4772#false} is VALID [2018-11-23 12:02:25,246 INFO L273 TraceCheckUtils]: 51: Hoare triple {4772#false} ~cond := #in~cond; {4772#false} is VALID [2018-11-23 12:02:25,246 INFO L273 TraceCheckUtils]: 52: Hoare triple {4772#false} assume 0 == ~cond; {4772#false} is VALID [2018-11-23 12:02:25,246 INFO L273 TraceCheckUtils]: 53: Hoare triple {4772#false} assume !false; {4772#false} is VALID [2018-11-23 12:02:25,248 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-11-23 12:02:25,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:25,248 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:02:25,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:25,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:25,406 INFO L256 TraceCheckUtils]: 0: Hoare triple {4771#true} call ULTIMATE.init(); {4771#true} is VALID [2018-11-23 12:02:25,407 INFO L273 TraceCheckUtils]: 1: Hoare triple {4771#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4771#true} is VALID [2018-11-23 12:02:25,407 INFO L273 TraceCheckUtils]: 2: Hoare triple {4771#true} assume true; {4771#true} is VALID [2018-11-23 12:02:25,407 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4771#true} {4771#true} #62#return; {4771#true} is VALID [2018-11-23 12:02:25,407 INFO L256 TraceCheckUtils]: 4: Hoare triple {4771#true} call #t~ret4 := main(); {4771#true} is VALID [2018-11-23 12:02:25,408 INFO L273 TraceCheckUtils]: 5: Hoare triple {4771#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4805#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:25,409 INFO L273 TraceCheckUtils]: 6: Hoare triple {4805#(<= 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; {4774#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:25,410 INFO L273 TraceCheckUtils]: 7: Hoare triple {4774#(<= 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; {4775#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:25,410 INFO L273 TraceCheckUtils]: 8: Hoare triple {4775#(<= 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; {4776#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:25,411 INFO L273 TraceCheckUtils]: 9: Hoare triple {4776#(<= 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; {4777#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:25,412 INFO L273 TraceCheckUtils]: 10: Hoare triple {4777#(<= 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; {4778#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:25,414 INFO L273 TraceCheckUtils]: 11: Hoare triple {4778#(<= 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; {4779#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:25,415 INFO L273 TraceCheckUtils]: 12: Hoare triple {4779#(<= 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; {4780#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:25,416 INFO L273 TraceCheckUtils]: 13: Hoare triple {4780#(<= 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; {4781#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:25,416 INFO L273 TraceCheckUtils]: 14: Hoare triple {4781#(<= 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; {4782#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:25,417 INFO L273 TraceCheckUtils]: 15: Hoare triple {4782#(<= 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; {4783#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:25,417 INFO L273 TraceCheckUtils]: 16: Hoare triple {4783#(<= 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; {4784#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:25,418 INFO L273 TraceCheckUtils]: 17: Hoare triple {4784#(<= 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; {4785#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:25,419 INFO L273 TraceCheckUtils]: 18: Hoare triple {4785#(<= 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; {4786#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:25,420 INFO L273 TraceCheckUtils]: 19: Hoare triple {4786#(<= main_~i~0 13)} assume !(~i~0 < 100000); {4772#false} is VALID [2018-11-23 12:02:25,420 INFO L273 TraceCheckUtils]: 20: Hoare triple {4772#false} ~i~0 := 0; {4772#false} is VALID [2018-11-23 12:02:25,420 INFO L273 TraceCheckUtils]: 21: Hoare triple {4772#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4772#false} is VALID [2018-11-23 12:02:25,420 INFO L273 TraceCheckUtils]: 22: Hoare triple {4772#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4772#false} is VALID [2018-11-23 12:02:25,420 INFO L273 TraceCheckUtils]: 23: Hoare triple {4772#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4772#false} is VALID [2018-11-23 12:02:25,421 INFO L273 TraceCheckUtils]: 24: Hoare triple {4772#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4772#false} is VALID [2018-11-23 12:02:25,421 INFO L273 TraceCheckUtils]: 25: Hoare triple {4772#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4772#false} is VALID [2018-11-23 12:02:25,421 INFO L273 TraceCheckUtils]: 26: Hoare triple {4772#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4772#false} is VALID [2018-11-23 12:02:25,421 INFO L273 TraceCheckUtils]: 27: Hoare triple {4772#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4772#false} is VALID [2018-11-23 12:02:25,421 INFO L273 TraceCheckUtils]: 28: Hoare triple {4772#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4772#false} is VALID [2018-11-23 12:02:25,422 INFO L273 TraceCheckUtils]: 29: Hoare triple {4772#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4772#false} is VALID [2018-11-23 12:02:25,422 INFO L273 TraceCheckUtils]: 30: Hoare triple {4772#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4772#false} is VALID [2018-11-23 12:02:25,422 INFO L273 TraceCheckUtils]: 31: Hoare triple {4772#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4772#false} is VALID [2018-11-23 12:02:25,422 INFO L273 TraceCheckUtils]: 32: Hoare triple {4772#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4772#false} is VALID [2018-11-23 12:02:25,423 INFO L273 TraceCheckUtils]: 33: Hoare triple {4772#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4772#false} is VALID [2018-11-23 12:02:25,423 INFO L273 TraceCheckUtils]: 34: Hoare triple {4772#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4772#false} is VALID [2018-11-23 12:02:25,423 INFO L273 TraceCheckUtils]: 35: Hoare triple {4772#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4772#false} is VALID [2018-11-23 12:02:25,423 INFO L273 TraceCheckUtils]: 36: Hoare triple {4772#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4772#false} is VALID [2018-11-23 12:02:25,423 INFO L273 TraceCheckUtils]: 37: Hoare triple {4772#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4772#false} is VALID [2018-11-23 12:02:25,424 INFO L273 TraceCheckUtils]: 38: Hoare triple {4772#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4772#false} is VALID [2018-11-23 12:02:25,424 INFO L273 TraceCheckUtils]: 39: Hoare triple {4772#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4772#false} is VALID [2018-11-23 12:02:25,424 INFO L273 TraceCheckUtils]: 40: Hoare triple {4772#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4772#false} is VALID [2018-11-23 12:02:25,424 INFO L273 TraceCheckUtils]: 41: Hoare triple {4772#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4772#false} is VALID [2018-11-23 12:02:25,424 INFO L273 TraceCheckUtils]: 42: Hoare triple {4772#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4772#false} is VALID [2018-11-23 12:02:25,424 INFO L273 TraceCheckUtils]: 43: Hoare triple {4772#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4772#false} is VALID [2018-11-23 12:02:25,424 INFO L273 TraceCheckUtils]: 44: Hoare triple {4772#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4772#false} is VALID [2018-11-23 12:02:25,424 INFO L273 TraceCheckUtils]: 45: Hoare triple {4772#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4772#false} is VALID [2018-11-23 12:02:25,425 INFO L273 TraceCheckUtils]: 46: Hoare triple {4772#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4772#false} is VALID [2018-11-23 12:02:25,425 INFO L273 TraceCheckUtils]: 47: Hoare triple {4772#false} assume !(~i~0 < 100000); {4772#false} is VALID [2018-11-23 12:02:25,425 INFO L273 TraceCheckUtils]: 48: Hoare triple {4772#false} havoc ~x~0;~x~0 := 0; {4772#false} is VALID [2018-11-23 12:02:25,425 INFO L273 TraceCheckUtils]: 49: Hoare triple {4772#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4772#false} is VALID [2018-11-23 12:02:25,425 INFO L256 TraceCheckUtils]: 50: Hoare triple {4772#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {4772#false} is VALID [2018-11-23 12:02:25,425 INFO L273 TraceCheckUtils]: 51: Hoare triple {4772#false} ~cond := #in~cond; {4772#false} is VALID [2018-11-23 12:02:25,425 INFO L273 TraceCheckUtils]: 52: Hoare triple {4772#false} assume 0 == ~cond; {4772#false} is VALID [2018-11-23 12:02:25,425 INFO L273 TraceCheckUtils]: 53: Hoare triple {4772#false} assume !false; {4772#false} is VALID [2018-11-23 12:02:25,427 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-11-23 12:02:25,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:25,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:02:25,449 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2018-11-23 12:02:25,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:25,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:02:25,476 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:25,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:02:25,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:02:25,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:02:25,478 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 17 states. [2018-11-23 12:02:25,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:25,966 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2018-11-23 12:02:25,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:02:25,966 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2018-11-23 12:02:25,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:25,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:02:25,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 82 transitions. [2018-11-23 12:02:25,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:02:25,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 82 transitions. [2018-11-23 12:02:25,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 82 transitions. [2018-11-23 12:02:26,681 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:26,683 INFO L225 Difference]: With dead ends: 102 [2018-11-23 12:02:26,683 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 12:02:26,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:02:26,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 12:02:26,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-11-23 12:02:26,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:26,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 62 states. [2018-11-23 12:02:26,712 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 62 states. [2018-11-23 12:02:26,712 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 62 states. [2018-11-23 12:02:26,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:26,713 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-11-23 12:02:26,714 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-11-23 12:02:26,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:26,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:26,714 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 63 states. [2018-11-23 12:02:26,714 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 63 states. [2018-11-23 12:02:26,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:26,715 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-11-23 12:02:26,715 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-11-23 12:02:26,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:26,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:26,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:26,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:26,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 12:02:26,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-11-23 12:02:26,717 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 54 [2018-11-23 12:02:26,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:26,717 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-11-23 12:02:26,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:02:26,718 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-11-23 12:02:26,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 12:02:26,718 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:26,719 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:26,719 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:26,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:26,719 INFO L82 PathProgramCache]: Analyzing trace with hash 770750506, now seen corresponding path program 14 times [2018-11-23 12:02:26,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:26,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:26,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:26,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:26,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:27,035 INFO L256 TraceCheckUtils]: 0: Hoare triple {5330#true} call ULTIMATE.init(); {5330#true} is VALID [2018-11-23 12:02:27,036 INFO L273 TraceCheckUtils]: 1: Hoare triple {5330#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5330#true} is VALID [2018-11-23 12:02:27,036 INFO L273 TraceCheckUtils]: 2: Hoare triple {5330#true} assume true; {5330#true} is VALID [2018-11-23 12:02:27,036 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5330#true} {5330#true} #62#return; {5330#true} is VALID [2018-11-23 12:02:27,036 INFO L256 TraceCheckUtils]: 4: Hoare triple {5330#true} call #t~ret4 := main(); {5330#true} is VALID [2018-11-23 12:02:27,037 INFO L273 TraceCheckUtils]: 5: Hoare triple {5330#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5332#(= main_~i~0 0)} is VALID [2018-11-23 12:02:27,038 INFO L273 TraceCheckUtils]: 6: Hoare triple {5332#(= 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; {5333#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:27,039 INFO L273 TraceCheckUtils]: 7: Hoare triple {5333#(<= 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; {5334#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:27,039 INFO L273 TraceCheckUtils]: 8: Hoare triple {5334#(<= 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; {5335#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:27,040 INFO L273 TraceCheckUtils]: 9: Hoare triple {5335#(<= 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; {5336#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:27,041 INFO L273 TraceCheckUtils]: 10: Hoare triple {5336#(<= 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; {5337#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:27,041 INFO L273 TraceCheckUtils]: 11: Hoare triple {5337#(<= 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; {5338#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:27,042 INFO L273 TraceCheckUtils]: 12: Hoare triple {5338#(<= 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; {5339#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:27,043 INFO L273 TraceCheckUtils]: 13: Hoare triple {5339#(<= 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; {5340#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:27,044 INFO L273 TraceCheckUtils]: 14: Hoare triple {5340#(<= 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; {5341#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:27,045 INFO L273 TraceCheckUtils]: 15: Hoare triple {5341#(<= 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; {5342#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:27,046 INFO L273 TraceCheckUtils]: 16: Hoare triple {5342#(<= 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; {5343#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:27,047 INFO L273 TraceCheckUtils]: 17: Hoare triple {5343#(<= 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; {5344#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:27,048 INFO L273 TraceCheckUtils]: 18: Hoare triple {5344#(<= 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; {5345#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:27,048 INFO L273 TraceCheckUtils]: 19: Hoare triple {5345#(<= 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; {5346#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:27,049 INFO L273 TraceCheckUtils]: 20: Hoare triple {5346#(<= main_~i~0 14)} assume !(~i~0 < 100000); {5331#false} is VALID [2018-11-23 12:02:27,049 INFO L273 TraceCheckUtils]: 21: Hoare triple {5331#false} ~i~0 := 0; {5331#false} is VALID [2018-11-23 12:02:27,050 INFO L273 TraceCheckUtils]: 22: Hoare triple {5331#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5331#false} is VALID [2018-11-23 12:02:27,050 INFO L273 TraceCheckUtils]: 23: Hoare triple {5331#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5331#false} is VALID [2018-11-23 12:02:27,050 INFO L273 TraceCheckUtils]: 24: Hoare triple {5331#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5331#false} is VALID [2018-11-23 12:02:27,050 INFO L273 TraceCheckUtils]: 25: Hoare triple {5331#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5331#false} is VALID [2018-11-23 12:02:27,051 INFO L273 TraceCheckUtils]: 26: Hoare triple {5331#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5331#false} is VALID [2018-11-23 12:02:27,051 INFO L273 TraceCheckUtils]: 27: Hoare triple {5331#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5331#false} is VALID [2018-11-23 12:02:27,051 INFO L273 TraceCheckUtils]: 28: Hoare triple {5331#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5331#false} is VALID [2018-11-23 12:02:27,051 INFO L273 TraceCheckUtils]: 29: Hoare triple {5331#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5331#false} is VALID [2018-11-23 12:02:27,051 INFO L273 TraceCheckUtils]: 30: Hoare triple {5331#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5331#false} is VALID [2018-11-23 12:02:27,052 INFO L273 TraceCheckUtils]: 31: Hoare triple {5331#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5331#false} is VALID [2018-11-23 12:02:27,052 INFO L273 TraceCheckUtils]: 32: Hoare triple {5331#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5331#false} is VALID [2018-11-23 12:02:27,052 INFO L273 TraceCheckUtils]: 33: Hoare triple {5331#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5331#false} is VALID [2018-11-23 12:02:27,052 INFO L273 TraceCheckUtils]: 34: Hoare triple {5331#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5331#false} is VALID [2018-11-23 12:02:27,052 INFO L273 TraceCheckUtils]: 35: Hoare triple {5331#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5331#false} is VALID [2018-11-23 12:02:27,052 INFO L273 TraceCheckUtils]: 36: Hoare triple {5331#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5331#false} is VALID [2018-11-23 12:02:27,053 INFO L273 TraceCheckUtils]: 37: Hoare triple {5331#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5331#false} is VALID [2018-11-23 12:02:27,053 INFO L273 TraceCheckUtils]: 38: Hoare triple {5331#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5331#false} is VALID [2018-11-23 12:02:27,053 INFO L273 TraceCheckUtils]: 39: Hoare triple {5331#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5331#false} is VALID [2018-11-23 12:02:27,053 INFO L273 TraceCheckUtils]: 40: Hoare triple {5331#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5331#false} is VALID [2018-11-23 12:02:27,053 INFO L273 TraceCheckUtils]: 41: Hoare triple {5331#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5331#false} is VALID [2018-11-23 12:02:27,053 INFO L273 TraceCheckUtils]: 42: Hoare triple {5331#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5331#false} is VALID [2018-11-23 12:02:27,053 INFO L273 TraceCheckUtils]: 43: Hoare triple {5331#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5331#false} is VALID [2018-11-23 12:02:27,053 INFO L273 TraceCheckUtils]: 44: Hoare triple {5331#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5331#false} is VALID [2018-11-23 12:02:27,053 INFO L273 TraceCheckUtils]: 45: Hoare triple {5331#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5331#false} is VALID [2018-11-23 12:02:27,054 INFO L273 TraceCheckUtils]: 46: Hoare triple {5331#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5331#false} is VALID [2018-11-23 12:02:27,054 INFO L273 TraceCheckUtils]: 47: Hoare triple {5331#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5331#false} is VALID [2018-11-23 12:02:27,054 INFO L273 TraceCheckUtils]: 48: Hoare triple {5331#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5331#false} is VALID [2018-11-23 12:02:27,054 INFO L273 TraceCheckUtils]: 49: Hoare triple {5331#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5331#false} is VALID [2018-11-23 12:02:27,054 INFO L273 TraceCheckUtils]: 50: Hoare triple {5331#false} assume !(~i~0 < 100000); {5331#false} is VALID [2018-11-23 12:02:27,054 INFO L273 TraceCheckUtils]: 51: Hoare triple {5331#false} havoc ~x~0;~x~0 := 0; {5331#false} is VALID [2018-11-23 12:02:27,054 INFO L273 TraceCheckUtils]: 52: Hoare triple {5331#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5331#false} is VALID [2018-11-23 12:02:27,054 INFO L256 TraceCheckUtils]: 53: Hoare triple {5331#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {5331#false} is VALID [2018-11-23 12:02:27,055 INFO L273 TraceCheckUtils]: 54: Hoare triple {5331#false} ~cond := #in~cond; {5331#false} is VALID [2018-11-23 12:02:27,055 INFO L273 TraceCheckUtils]: 55: Hoare triple {5331#false} assume 0 == ~cond; {5331#false} is VALID [2018-11-23 12:02:27,055 INFO L273 TraceCheckUtils]: 56: Hoare triple {5331#false} assume !false; {5331#false} is VALID [2018-11-23 12:02:27,056 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-11-23 12:02:27,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:27,057 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:02:27,065 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:02:27,092 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:02:27,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:27,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:27,309 INFO L256 TraceCheckUtils]: 0: Hoare triple {5330#true} call ULTIMATE.init(); {5330#true} is VALID [2018-11-23 12:02:27,309 INFO L273 TraceCheckUtils]: 1: Hoare triple {5330#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5330#true} is VALID [2018-11-23 12:02:27,309 INFO L273 TraceCheckUtils]: 2: Hoare triple {5330#true} assume true; {5330#true} is VALID [2018-11-23 12:02:27,310 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5330#true} {5330#true} #62#return; {5330#true} is VALID [2018-11-23 12:02:27,310 INFO L256 TraceCheckUtils]: 4: Hoare triple {5330#true} call #t~ret4 := main(); {5330#true} is VALID [2018-11-23 12:02:27,311 INFO L273 TraceCheckUtils]: 5: Hoare triple {5330#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5365#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:27,311 INFO L273 TraceCheckUtils]: 6: Hoare triple {5365#(<= 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; {5333#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:27,312 INFO L273 TraceCheckUtils]: 7: Hoare triple {5333#(<= 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; {5334#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:27,312 INFO L273 TraceCheckUtils]: 8: Hoare triple {5334#(<= 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; {5335#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:27,313 INFO L273 TraceCheckUtils]: 9: Hoare triple {5335#(<= 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; {5336#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:27,314 INFO L273 TraceCheckUtils]: 10: Hoare triple {5336#(<= 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; {5337#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:27,315 INFO L273 TraceCheckUtils]: 11: Hoare triple {5337#(<= 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; {5338#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:27,316 INFO L273 TraceCheckUtils]: 12: Hoare triple {5338#(<= 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; {5339#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:27,317 INFO L273 TraceCheckUtils]: 13: Hoare triple {5339#(<= 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; {5340#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:27,318 INFO L273 TraceCheckUtils]: 14: Hoare triple {5340#(<= 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; {5341#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:27,319 INFO L273 TraceCheckUtils]: 15: Hoare triple {5341#(<= 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; {5342#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:27,319 INFO L273 TraceCheckUtils]: 16: Hoare triple {5342#(<= 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; {5343#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:27,320 INFO L273 TraceCheckUtils]: 17: Hoare triple {5343#(<= 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; {5344#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:27,321 INFO L273 TraceCheckUtils]: 18: Hoare triple {5344#(<= 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; {5345#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:27,322 INFO L273 TraceCheckUtils]: 19: Hoare triple {5345#(<= 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; {5346#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:27,323 INFO L273 TraceCheckUtils]: 20: Hoare triple {5346#(<= main_~i~0 14)} assume !(~i~0 < 100000); {5331#false} is VALID [2018-11-23 12:02:27,323 INFO L273 TraceCheckUtils]: 21: Hoare triple {5331#false} ~i~0 := 0; {5331#false} is VALID [2018-11-23 12:02:27,323 INFO L273 TraceCheckUtils]: 22: Hoare triple {5331#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5331#false} is VALID [2018-11-23 12:02:27,323 INFO L273 TraceCheckUtils]: 23: Hoare triple {5331#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5331#false} is VALID [2018-11-23 12:02:27,324 INFO L273 TraceCheckUtils]: 24: Hoare triple {5331#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5331#false} is VALID [2018-11-23 12:02:27,324 INFO L273 TraceCheckUtils]: 25: Hoare triple {5331#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5331#false} is VALID [2018-11-23 12:02:27,324 INFO L273 TraceCheckUtils]: 26: Hoare triple {5331#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5331#false} is VALID [2018-11-23 12:02:27,324 INFO L273 TraceCheckUtils]: 27: Hoare triple {5331#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5331#false} is VALID [2018-11-23 12:02:27,324 INFO L273 TraceCheckUtils]: 28: Hoare triple {5331#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5331#false} is VALID [2018-11-23 12:02:27,325 INFO L273 TraceCheckUtils]: 29: Hoare triple {5331#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5331#false} is VALID [2018-11-23 12:02:27,325 INFO L273 TraceCheckUtils]: 30: Hoare triple {5331#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5331#false} is VALID [2018-11-23 12:02:27,325 INFO L273 TraceCheckUtils]: 31: Hoare triple {5331#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5331#false} is VALID [2018-11-23 12:02:27,325 INFO L273 TraceCheckUtils]: 32: Hoare triple {5331#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5331#false} is VALID [2018-11-23 12:02:27,325 INFO L273 TraceCheckUtils]: 33: Hoare triple {5331#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5331#false} is VALID [2018-11-23 12:02:27,326 INFO L273 TraceCheckUtils]: 34: Hoare triple {5331#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5331#false} is VALID [2018-11-23 12:02:27,326 INFO L273 TraceCheckUtils]: 35: Hoare triple {5331#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5331#false} is VALID [2018-11-23 12:02:27,326 INFO L273 TraceCheckUtils]: 36: Hoare triple {5331#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5331#false} is VALID [2018-11-23 12:02:27,326 INFO L273 TraceCheckUtils]: 37: Hoare triple {5331#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5331#false} is VALID [2018-11-23 12:02:27,326 INFO L273 TraceCheckUtils]: 38: Hoare triple {5331#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5331#false} is VALID [2018-11-23 12:02:27,327 INFO L273 TraceCheckUtils]: 39: Hoare triple {5331#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5331#false} is VALID [2018-11-23 12:02:27,327 INFO L273 TraceCheckUtils]: 40: Hoare triple {5331#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5331#false} is VALID [2018-11-23 12:02:27,327 INFO L273 TraceCheckUtils]: 41: Hoare triple {5331#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5331#false} is VALID [2018-11-23 12:02:27,327 INFO L273 TraceCheckUtils]: 42: Hoare triple {5331#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5331#false} is VALID [2018-11-23 12:02:27,327 INFO L273 TraceCheckUtils]: 43: Hoare triple {5331#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5331#false} is VALID [2018-11-23 12:02:27,328 INFO L273 TraceCheckUtils]: 44: Hoare triple {5331#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5331#false} is VALID [2018-11-23 12:02:27,328 INFO L273 TraceCheckUtils]: 45: Hoare triple {5331#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5331#false} is VALID [2018-11-23 12:02:27,328 INFO L273 TraceCheckUtils]: 46: Hoare triple {5331#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5331#false} is VALID [2018-11-23 12:02:27,328 INFO L273 TraceCheckUtils]: 47: Hoare triple {5331#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5331#false} is VALID [2018-11-23 12:02:27,328 INFO L273 TraceCheckUtils]: 48: Hoare triple {5331#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5331#false} is VALID [2018-11-23 12:02:27,328 INFO L273 TraceCheckUtils]: 49: Hoare triple {5331#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5331#false} is VALID [2018-11-23 12:02:27,328 INFO L273 TraceCheckUtils]: 50: Hoare triple {5331#false} assume !(~i~0 < 100000); {5331#false} is VALID [2018-11-23 12:02:27,328 INFO L273 TraceCheckUtils]: 51: Hoare triple {5331#false} havoc ~x~0;~x~0 := 0; {5331#false} is VALID [2018-11-23 12:02:27,329 INFO L273 TraceCheckUtils]: 52: Hoare triple {5331#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5331#false} is VALID [2018-11-23 12:02:27,329 INFO L256 TraceCheckUtils]: 53: Hoare triple {5331#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {5331#false} is VALID [2018-11-23 12:02:27,329 INFO L273 TraceCheckUtils]: 54: Hoare triple {5331#false} ~cond := #in~cond; {5331#false} is VALID [2018-11-23 12:02:27,329 INFO L273 TraceCheckUtils]: 55: Hoare triple {5331#false} assume 0 == ~cond; {5331#false} is VALID [2018-11-23 12:02:27,329 INFO L273 TraceCheckUtils]: 56: Hoare triple {5331#false} assume !false; {5331#false} is VALID [2018-11-23 12:02:27,331 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-11-23 12:02:27,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:27,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:02:27,350 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2018-11-23 12:02:27,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:27,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:02:27,374 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:27,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:02:27,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:02:27,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:02:27,375 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 18 states. [2018-11-23 12:02:27,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:27,716 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-11-23 12:02:27,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:02:27,716 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2018-11-23 12:02:27,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:27,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:02:27,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 85 transitions. [2018-11-23 12:02:27,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:02:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 85 transitions. [2018-11-23 12:02:27,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 85 transitions. [2018-11-23 12:02:28,153 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:28,154 INFO L225 Difference]: With dead ends: 107 [2018-11-23 12:02:28,154 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 12:02:28,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:02:28,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 12:02:28,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-11-23 12:02:28,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:28,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 65 states. [2018-11-23 12:02:28,189 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 65 states. [2018-11-23 12:02:28,189 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 65 states. [2018-11-23 12:02:28,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:28,191 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-11-23 12:02:28,191 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-11-23 12:02:28,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:28,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:28,192 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 66 states. [2018-11-23 12:02:28,192 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 66 states. [2018-11-23 12:02:28,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:28,194 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-11-23 12:02:28,194 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-11-23 12:02:28,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:28,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:28,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:28,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:28,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 12:02:28,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2018-11-23 12:02:28,196 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 57 [2018-11-23 12:02:28,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:28,197 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2018-11-23 12:02:28,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:02:28,197 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-11-23 12:02:28,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 12:02:28,198 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:28,198 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:28,198 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:28,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:28,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1363570744, now seen corresponding path program 15 times [2018-11-23 12:02:28,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:28,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:28,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:28,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:28,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:29,267 INFO L256 TraceCheckUtils]: 0: Hoare triple {5918#true} call ULTIMATE.init(); {5918#true} is VALID [2018-11-23 12:02:29,267 INFO L273 TraceCheckUtils]: 1: Hoare triple {5918#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5918#true} is VALID [2018-11-23 12:02:29,268 INFO L273 TraceCheckUtils]: 2: Hoare triple {5918#true} assume true; {5918#true} is VALID [2018-11-23 12:02:29,268 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5918#true} {5918#true} #62#return; {5918#true} is VALID [2018-11-23 12:02:29,268 INFO L256 TraceCheckUtils]: 4: Hoare triple {5918#true} call #t~ret4 := main(); {5918#true} is VALID [2018-11-23 12:02:29,268 INFO L273 TraceCheckUtils]: 5: Hoare triple {5918#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5920#(= main_~i~0 0)} is VALID [2018-11-23 12:02:29,269 INFO L273 TraceCheckUtils]: 6: Hoare triple {5920#(= 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; {5921#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:29,270 INFO L273 TraceCheckUtils]: 7: Hoare triple {5921#(<= 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; {5922#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:29,271 INFO L273 TraceCheckUtils]: 8: Hoare triple {5922#(<= 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; {5923#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:29,271 INFO L273 TraceCheckUtils]: 9: Hoare triple {5923#(<= 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; {5924#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:29,272 INFO L273 TraceCheckUtils]: 10: Hoare triple {5924#(<= 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; {5925#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:29,272 INFO L273 TraceCheckUtils]: 11: Hoare triple {5925#(<= 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; {5926#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:29,273 INFO L273 TraceCheckUtils]: 12: Hoare triple {5926#(<= 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; {5927#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:29,274 INFO L273 TraceCheckUtils]: 13: Hoare triple {5927#(<= 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; {5928#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:29,275 INFO L273 TraceCheckUtils]: 14: Hoare triple {5928#(<= 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; {5929#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:29,276 INFO L273 TraceCheckUtils]: 15: Hoare triple {5929#(<= 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; {5930#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:29,277 INFO L273 TraceCheckUtils]: 16: Hoare triple {5930#(<= 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; {5931#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:29,278 INFO L273 TraceCheckUtils]: 17: Hoare triple {5931#(<= 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; {5932#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:29,279 INFO L273 TraceCheckUtils]: 18: Hoare triple {5932#(<= 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; {5933#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:29,280 INFO L273 TraceCheckUtils]: 19: Hoare triple {5933#(<= 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; {5934#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:29,281 INFO L273 TraceCheckUtils]: 20: Hoare triple {5934#(<= 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; {5935#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:29,282 INFO L273 TraceCheckUtils]: 21: Hoare triple {5935#(<= main_~i~0 15)} assume !(~i~0 < 100000); {5919#false} is VALID [2018-11-23 12:02:29,282 INFO L273 TraceCheckUtils]: 22: Hoare triple {5919#false} ~i~0 := 0; {5919#false} is VALID [2018-11-23 12:02:29,282 INFO L273 TraceCheckUtils]: 23: Hoare triple {5919#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5919#false} is VALID [2018-11-23 12:02:29,282 INFO L273 TraceCheckUtils]: 24: Hoare triple {5919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5919#false} is VALID [2018-11-23 12:02:29,283 INFO L273 TraceCheckUtils]: 25: Hoare triple {5919#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5919#false} is VALID [2018-11-23 12:02:29,283 INFO L273 TraceCheckUtils]: 26: Hoare triple {5919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5919#false} is VALID [2018-11-23 12:02:29,283 INFO L273 TraceCheckUtils]: 27: Hoare triple {5919#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5919#false} is VALID [2018-11-23 12:02:29,283 INFO L273 TraceCheckUtils]: 28: Hoare triple {5919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5919#false} is VALID [2018-11-23 12:02:29,283 INFO L273 TraceCheckUtils]: 29: Hoare triple {5919#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5919#false} is VALID [2018-11-23 12:02:29,284 INFO L273 TraceCheckUtils]: 30: Hoare triple {5919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5919#false} is VALID [2018-11-23 12:02:29,284 INFO L273 TraceCheckUtils]: 31: Hoare triple {5919#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5919#false} is VALID [2018-11-23 12:02:29,284 INFO L273 TraceCheckUtils]: 32: Hoare triple {5919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5919#false} is VALID [2018-11-23 12:02:29,284 INFO L273 TraceCheckUtils]: 33: Hoare triple {5919#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5919#false} is VALID [2018-11-23 12:02:29,284 INFO L273 TraceCheckUtils]: 34: Hoare triple {5919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5919#false} is VALID [2018-11-23 12:02:29,285 INFO L273 TraceCheckUtils]: 35: Hoare triple {5919#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5919#false} is VALID [2018-11-23 12:02:29,285 INFO L273 TraceCheckUtils]: 36: Hoare triple {5919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5919#false} is VALID [2018-11-23 12:02:29,285 INFO L273 TraceCheckUtils]: 37: Hoare triple {5919#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5919#false} is VALID [2018-11-23 12:02:29,285 INFO L273 TraceCheckUtils]: 38: Hoare triple {5919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5919#false} is VALID [2018-11-23 12:02:29,285 INFO L273 TraceCheckUtils]: 39: Hoare triple {5919#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5919#false} is VALID [2018-11-23 12:02:29,286 INFO L273 TraceCheckUtils]: 40: Hoare triple {5919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5919#false} is VALID [2018-11-23 12:02:29,286 INFO L273 TraceCheckUtils]: 41: Hoare triple {5919#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5919#false} is VALID [2018-11-23 12:02:29,286 INFO L273 TraceCheckUtils]: 42: Hoare triple {5919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5919#false} is VALID [2018-11-23 12:02:29,286 INFO L273 TraceCheckUtils]: 43: Hoare triple {5919#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5919#false} is VALID [2018-11-23 12:02:29,286 INFO L273 TraceCheckUtils]: 44: Hoare triple {5919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5919#false} is VALID [2018-11-23 12:02:29,286 INFO L273 TraceCheckUtils]: 45: Hoare triple {5919#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5919#false} is VALID [2018-11-23 12:02:29,286 INFO L273 TraceCheckUtils]: 46: Hoare triple {5919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5919#false} is VALID [2018-11-23 12:02:29,286 INFO L273 TraceCheckUtils]: 47: Hoare triple {5919#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5919#false} is VALID [2018-11-23 12:02:29,286 INFO L273 TraceCheckUtils]: 48: Hoare triple {5919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5919#false} is VALID [2018-11-23 12:02:29,287 INFO L273 TraceCheckUtils]: 49: Hoare triple {5919#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5919#false} is VALID [2018-11-23 12:02:29,287 INFO L273 TraceCheckUtils]: 50: Hoare triple {5919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5919#false} is VALID [2018-11-23 12:02:29,287 INFO L273 TraceCheckUtils]: 51: Hoare triple {5919#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5919#false} is VALID [2018-11-23 12:02:29,287 INFO L273 TraceCheckUtils]: 52: Hoare triple {5919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5919#false} is VALID [2018-11-23 12:02:29,287 INFO L273 TraceCheckUtils]: 53: Hoare triple {5919#false} assume !(~i~0 < 100000); {5919#false} is VALID [2018-11-23 12:02:29,287 INFO L273 TraceCheckUtils]: 54: Hoare triple {5919#false} havoc ~x~0;~x~0 := 0; {5919#false} is VALID [2018-11-23 12:02:29,287 INFO L273 TraceCheckUtils]: 55: Hoare triple {5919#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5919#false} is VALID [2018-11-23 12:02:29,287 INFO L256 TraceCheckUtils]: 56: Hoare triple {5919#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {5919#false} is VALID [2018-11-23 12:02:29,288 INFO L273 TraceCheckUtils]: 57: Hoare triple {5919#false} ~cond := #in~cond; {5919#false} is VALID [2018-11-23 12:02:29,288 INFO L273 TraceCheckUtils]: 58: Hoare triple {5919#false} assume 0 == ~cond; {5919#false} is VALID [2018-11-23 12:02:29,288 INFO L273 TraceCheckUtils]: 59: Hoare triple {5919#false} assume !false; {5919#false} is VALID [2018-11-23 12:02:29,290 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-11-23 12:02:29,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:29,290 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:02:29,300 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:02:30,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 12:02:30,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:30,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:30,673 INFO L256 TraceCheckUtils]: 0: Hoare triple {5918#true} call ULTIMATE.init(); {5918#true} is VALID [2018-11-23 12:02:30,674 INFO L273 TraceCheckUtils]: 1: Hoare triple {5918#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5918#true} is VALID [2018-11-23 12:02:30,674 INFO L273 TraceCheckUtils]: 2: Hoare triple {5918#true} assume true; {5918#true} is VALID [2018-11-23 12:02:30,674 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5918#true} {5918#true} #62#return; {5918#true} is VALID [2018-11-23 12:02:30,674 INFO L256 TraceCheckUtils]: 4: Hoare triple {5918#true} call #t~ret4 := main(); {5918#true} is VALID [2018-11-23 12:02:30,675 INFO L273 TraceCheckUtils]: 5: Hoare triple {5918#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5954#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:30,676 INFO L273 TraceCheckUtils]: 6: Hoare triple {5954#(<= 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; {5921#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:30,677 INFO L273 TraceCheckUtils]: 7: Hoare triple {5921#(<= 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; {5922#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:30,677 INFO L273 TraceCheckUtils]: 8: Hoare triple {5922#(<= 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; {5923#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:30,678 INFO L273 TraceCheckUtils]: 9: Hoare triple {5923#(<= 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; {5924#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:30,679 INFO L273 TraceCheckUtils]: 10: Hoare triple {5924#(<= 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; {5925#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:30,680 INFO L273 TraceCheckUtils]: 11: Hoare triple {5925#(<= 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; {5926#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:30,681 INFO L273 TraceCheckUtils]: 12: Hoare triple {5926#(<= 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; {5927#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:30,682 INFO L273 TraceCheckUtils]: 13: Hoare triple {5927#(<= 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; {5928#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:30,683 INFO L273 TraceCheckUtils]: 14: Hoare triple {5928#(<= 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; {5929#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:30,684 INFO L273 TraceCheckUtils]: 15: Hoare triple {5929#(<= 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; {5930#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:30,685 INFO L273 TraceCheckUtils]: 16: Hoare triple {5930#(<= 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; {5931#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:30,686 INFO L273 TraceCheckUtils]: 17: Hoare triple {5931#(<= 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; {5932#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:30,687 INFO L273 TraceCheckUtils]: 18: Hoare triple {5932#(<= 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; {5933#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:30,687 INFO L273 TraceCheckUtils]: 19: Hoare triple {5933#(<= 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; {5934#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:30,688 INFO L273 TraceCheckUtils]: 20: Hoare triple {5934#(<= 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; {5935#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:30,689 INFO L273 TraceCheckUtils]: 21: Hoare triple {5935#(<= main_~i~0 15)} assume !(~i~0 < 100000); {5919#false} is VALID [2018-11-23 12:02:30,689 INFO L273 TraceCheckUtils]: 22: Hoare triple {5919#false} ~i~0 := 0; {5919#false} is VALID [2018-11-23 12:02:30,690 INFO L273 TraceCheckUtils]: 23: Hoare triple {5919#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5919#false} is VALID [2018-11-23 12:02:30,690 INFO L273 TraceCheckUtils]: 24: Hoare triple {5919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5919#false} is VALID [2018-11-23 12:02:30,690 INFO L273 TraceCheckUtils]: 25: Hoare triple {5919#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5919#false} is VALID [2018-11-23 12:02:30,690 INFO L273 TraceCheckUtils]: 26: Hoare triple {5919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5919#false} is VALID [2018-11-23 12:02:30,690 INFO L273 TraceCheckUtils]: 27: Hoare triple {5919#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5919#false} is VALID [2018-11-23 12:02:30,691 INFO L273 TraceCheckUtils]: 28: Hoare triple {5919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5919#false} is VALID [2018-11-23 12:02:30,691 INFO L273 TraceCheckUtils]: 29: Hoare triple {5919#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5919#false} is VALID [2018-11-23 12:02:30,691 INFO L273 TraceCheckUtils]: 30: Hoare triple {5919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5919#false} is VALID [2018-11-23 12:02:30,691 INFO L273 TraceCheckUtils]: 31: Hoare triple {5919#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5919#false} is VALID [2018-11-23 12:02:30,691 INFO L273 TraceCheckUtils]: 32: Hoare triple {5919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5919#false} is VALID [2018-11-23 12:02:30,692 INFO L273 TraceCheckUtils]: 33: Hoare triple {5919#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5919#false} is VALID [2018-11-23 12:02:30,692 INFO L273 TraceCheckUtils]: 34: Hoare triple {5919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5919#false} is VALID [2018-11-23 12:02:30,692 INFO L273 TraceCheckUtils]: 35: Hoare triple {5919#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5919#false} is VALID [2018-11-23 12:02:30,692 INFO L273 TraceCheckUtils]: 36: Hoare triple {5919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5919#false} is VALID [2018-11-23 12:02:30,692 INFO L273 TraceCheckUtils]: 37: Hoare triple {5919#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5919#false} is VALID [2018-11-23 12:02:30,692 INFO L273 TraceCheckUtils]: 38: Hoare triple {5919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5919#false} is VALID [2018-11-23 12:02:30,693 INFO L273 TraceCheckUtils]: 39: Hoare triple {5919#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5919#false} is VALID [2018-11-23 12:02:30,693 INFO L273 TraceCheckUtils]: 40: Hoare triple {5919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5919#false} is VALID [2018-11-23 12:02:30,693 INFO L273 TraceCheckUtils]: 41: Hoare triple {5919#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5919#false} is VALID [2018-11-23 12:02:30,693 INFO L273 TraceCheckUtils]: 42: Hoare triple {5919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5919#false} is VALID [2018-11-23 12:02:30,693 INFO L273 TraceCheckUtils]: 43: Hoare triple {5919#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5919#false} is VALID [2018-11-23 12:02:30,693 INFO L273 TraceCheckUtils]: 44: Hoare triple {5919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5919#false} is VALID [2018-11-23 12:02:30,693 INFO L273 TraceCheckUtils]: 45: Hoare triple {5919#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5919#false} is VALID [2018-11-23 12:02:30,693 INFO L273 TraceCheckUtils]: 46: Hoare triple {5919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5919#false} is VALID [2018-11-23 12:02:30,693 INFO L273 TraceCheckUtils]: 47: Hoare triple {5919#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5919#false} is VALID [2018-11-23 12:02:30,694 INFO L273 TraceCheckUtils]: 48: Hoare triple {5919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5919#false} is VALID [2018-11-23 12:02:30,694 INFO L273 TraceCheckUtils]: 49: Hoare triple {5919#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5919#false} is VALID [2018-11-23 12:02:30,694 INFO L273 TraceCheckUtils]: 50: Hoare triple {5919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5919#false} is VALID [2018-11-23 12:02:30,694 INFO L273 TraceCheckUtils]: 51: Hoare triple {5919#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5919#false} is VALID [2018-11-23 12:02:30,694 INFO L273 TraceCheckUtils]: 52: Hoare triple {5919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5919#false} is VALID [2018-11-23 12:02:30,694 INFO L273 TraceCheckUtils]: 53: Hoare triple {5919#false} assume !(~i~0 < 100000); {5919#false} is VALID [2018-11-23 12:02:30,694 INFO L273 TraceCheckUtils]: 54: Hoare triple {5919#false} havoc ~x~0;~x~0 := 0; {5919#false} is VALID [2018-11-23 12:02:30,694 INFO L273 TraceCheckUtils]: 55: Hoare triple {5919#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5919#false} is VALID [2018-11-23 12:02:30,695 INFO L256 TraceCheckUtils]: 56: Hoare triple {5919#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {5919#false} is VALID [2018-11-23 12:02:30,695 INFO L273 TraceCheckUtils]: 57: Hoare triple {5919#false} ~cond := #in~cond; {5919#false} is VALID [2018-11-23 12:02:30,695 INFO L273 TraceCheckUtils]: 58: Hoare triple {5919#false} assume 0 == ~cond; {5919#false} is VALID [2018-11-23 12:02:30,695 INFO L273 TraceCheckUtils]: 59: Hoare triple {5919#false} assume !false; {5919#false} is VALID [2018-11-23 12:02:30,697 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-11-23 12:02:30,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:30,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 12:02:30,718 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-11-23 12:02:30,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:30,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:02:30,754 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:30,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:02:30,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:02:30,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:02:30,755 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 19 states. [2018-11-23 12:02:31,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:31,247 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2018-11-23 12:02:31,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 12:02:31,247 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-11-23 12:02:31,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:31,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:02:31,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 88 transitions. [2018-11-23 12:02:31,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:02:31,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 88 transitions. [2018-11-23 12:02:31,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 88 transitions. [2018-11-23 12:02:31,363 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:31,365 INFO L225 Difference]: With dead ends: 112 [2018-11-23 12:02:31,366 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 12:02:31,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:02:31,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 12:02:31,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-11-23 12:02:31,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:31,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 68 states. [2018-11-23 12:02:31,398 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 68 states. [2018-11-23 12:02:31,398 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 68 states. [2018-11-23 12:02:31,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:31,399 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2018-11-23 12:02:31,399 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2018-11-23 12:02:31,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:31,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:31,400 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 69 states. [2018-11-23 12:02:31,400 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 69 states. [2018-11-23 12:02:31,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:31,401 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2018-11-23 12:02:31,401 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2018-11-23 12:02:31,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:31,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:31,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:31,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:31,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 12:02:31,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-11-23 12:02:31,403 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 60 [2018-11-23 12:02:31,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:31,404 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-11-23 12:02:31,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:02:31,404 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-11-23 12:02:31,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 12:02:31,405 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:31,405 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:31,405 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:31,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:31,405 INFO L82 PathProgramCache]: Analyzing trace with hash -938400218, now seen corresponding path program 16 times [2018-11-23 12:02:31,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:31,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:31,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:31,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:31,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:32,475 INFO L256 TraceCheckUtils]: 0: Hoare triple {6535#true} call ULTIMATE.init(); {6535#true} is VALID [2018-11-23 12:02:32,476 INFO L273 TraceCheckUtils]: 1: Hoare triple {6535#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6535#true} is VALID [2018-11-23 12:02:32,476 INFO L273 TraceCheckUtils]: 2: Hoare triple {6535#true} assume true; {6535#true} is VALID [2018-11-23 12:02:32,476 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6535#true} {6535#true} #62#return; {6535#true} is VALID [2018-11-23 12:02:32,476 INFO L256 TraceCheckUtils]: 4: Hoare triple {6535#true} call #t~ret4 := main(); {6535#true} is VALID [2018-11-23 12:02:32,477 INFO L273 TraceCheckUtils]: 5: Hoare triple {6535#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6537#(= main_~i~0 0)} is VALID [2018-11-23 12:02:32,478 INFO L273 TraceCheckUtils]: 6: Hoare triple {6537#(= 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; {6538#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:32,479 INFO L273 TraceCheckUtils]: 7: Hoare triple {6538#(<= 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; {6539#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:32,480 INFO L273 TraceCheckUtils]: 8: Hoare triple {6539#(<= 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; {6540#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:32,481 INFO L273 TraceCheckUtils]: 9: Hoare triple {6540#(<= 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; {6541#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:32,482 INFO L273 TraceCheckUtils]: 10: Hoare triple {6541#(<= 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; {6542#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:32,483 INFO L273 TraceCheckUtils]: 11: Hoare triple {6542#(<= 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; {6543#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:32,483 INFO L273 TraceCheckUtils]: 12: Hoare triple {6543#(<= 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; {6544#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:32,484 INFO L273 TraceCheckUtils]: 13: Hoare triple {6544#(<= 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; {6545#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:32,485 INFO L273 TraceCheckUtils]: 14: Hoare triple {6545#(<= 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; {6546#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:32,486 INFO L273 TraceCheckUtils]: 15: Hoare triple {6546#(<= 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; {6547#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:32,487 INFO L273 TraceCheckUtils]: 16: Hoare triple {6547#(<= 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; {6548#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:32,488 INFO L273 TraceCheckUtils]: 17: Hoare triple {6548#(<= 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; {6549#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:32,489 INFO L273 TraceCheckUtils]: 18: Hoare triple {6549#(<= 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; {6550#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:32,490 INFO L273 TraceCheckUtils]: 19: Hoare triple {6550#(<= 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; {6551#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:32,490 INFO L273 TraceCheckUtils]: 20: Hoare triple {6551#(<= 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; {6552#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:32,491 INFO L273 TraceCheckUtils]: 21: Hoare triple {6552#(<= 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; {6553#(<= main_~i~0 16)} is VALID [2018-11-23 12:02:32,492 INFO L273 TraceCheckUtils]: 22: Hoare triple {6553#(<= main_~i~0 16)} assume !(~i~0 < 100000); {6536#false} is VALID [2018-11-23 12:02:32,492 INFO L273 TraceCheckUtils]: 23: Hoare triple {6536#false} ~i~0 := 0; {6536#false} is VALID [2018-11-23 12:02:32,493 INFO L273 TraceCheckUtils]: 24: Hoare triple {6536#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6536#false} is VALID [2018-11-23 12:02:32,493 INFO L273 TraceCheckUtils]: 25: Hoare triple {6536#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6536#false} is VALID [2018-11-23 12:02:32,493 INFO L273 TraceCheckUtils]: 26: Hoare triple {6536#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6536#false} is VALID [2018-11-23 12:02:32,493 INFO L273 TraceCheckUtils]: 27: Hoare triple {6536#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6536#false} is VALID [2018-11-23 12:02:32,494 INFO L273 TraceCheckUtils]: 28: Hoare triple {6536#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6536#false} is VALID [2018-11-23 12:02:32,494 INFO L273 TraceCheckUtils]: 29: Hoare triple {6536#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6536#false} is VALID [2018-11-23 12:02:32,494 INFO L273 TraceCheckUtils]: 30: Hoare triple {6536#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6536#false} is VALID [2018-11-23 12:02:32,494 INFO L273 TraceCheckUtils]: 31: Hoare triple {6536#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6536#false} is VALID [2018-11-23 12:02:32,495 INFO L273 TraceCheckUtils]: 32: Hoare triple {6536#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6536#false} is VALID [2018-11-23 12:02:32,495 INFO L273 TraceCheckUtils]: 33: Hoare triple {6536#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6536#false} is VALID [2018-11-23 12:02:32,495 INFO L273 TraceCheckUtils]: 34: Hoare triple {6536#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6536#false} is VALID [2018-11-23 12:02:32,495 INFO L273 TraceCheckUtils]: 35: Hoare triple {6536#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6536#false} is VALID [2018-11-23 12:02:32,495 INFO L273 TraceCheckUtils]: 36: Hoare triple {6536#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6536#false} is VALID [2018-11-23 12:02:32,495 INFO L273 TraceCheckUtils]: 37: Hoare triple {6536#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6536#false} is VALID [2018-11-23 12:02:32,495 INFO L273 TraceCheckUtils]: 38: Hoare triple {6536#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6536#false} is VALID [2018-11-23 12:02:32,496 INFO L273 TraceCheckUtils]: 39: Hoare triple {6536#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6536#false} is VALID [2018-11-23 12:02:32,496 INFO L273 TraceCheckUtils]: 40: Hoare triple {6536#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6536#false} is VALID [2018-11-23 12:02:32,496 INFO L273 TraceCheckUtils]: 41: Hoare triple {6536#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6536#false} is VALID [2018-11-23 12:02:32,496 INFO L273 TraceCheckUtils]: 42: Hoare triple {6536#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6536#false} is VALID [2018-11-23 12:02:32,496 INFO L273 TraceCheckUtils]: 43: Hoare triple {6536#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6536#false} is VALID [2018-11-23 12:02:32,496 INFO L273 TraceCheckUtils]: 44: Hoare triple {6536#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6536#false} is VALID [2018-11-23 12:02:32,496 INFO L273 TraceCheckUtils]: 45: Hoare triple {6536#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6536#false} is VALID [2018-11-23 12:02:32,496 INFO L273 TraceCheckUtils]: 46: Hoare triple {6536#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6536#false} is VALID [2018-11-23 12:02:32,497 INFO L273 TraceCheckUtils]: 47: Hoare triple {6536#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6536#false} is VALID [2018-11-23 12:02:32,497 INFO L273 TraceCheckUtils]: 48: Hoare triple {6536#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6536#false} is VALID [2018-11-23 12:02:32,497 INFO L273 TraceCheckUtils]: 49: Hoare triple {6536#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6536#false} is VALID [2018-11-23 12:02:32,497 INFO L273 TraceCheckUtils]: 50: Hoare triple {6536#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6536#false} is VALID [2018-11-23 12:02:32,497 INFO L273 TraceCheckUtils]: 51: Hoare triple {6536#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6536#false} is VALID [2018-11-23 12:02:32,497 INFO L273 TraceCheckUtils]: 52: Hoare triple {6536#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6536#false} is VALID [2018-11-23 12:02:32,497 INFO L273 TraceCheckUtils]: 53: Hoare triple {6536#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6536#false} is VALID [2018-11-23 12:02:32,497 INFO L273 TraceCheckUtils]: 54: Hoare triple {6536#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6536#false} is VALID [2018-11-23 12:02:32,497 INFO L273 TraceCheckUtils]: 55: Hoare triple {6536#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6536#false} is VALID [2018-11-23 12:02:32,498 INFO L273 TraceCheckUtils]: 56: Hoare triple {6536#false} assume !(~i~0 < 100000); {6536#false} is VALID [2018-11-23 12:02:32,498 INFO L273 TraceCheckUtils]: 57: Hoare triple {6536#false} havoc ~x~0;~x~0 := 0; {6536#false} is VALID [2018-11-23 12:02:32,498 INFO L273 TraceCheckUtils]: 58: Hoare triple {6536#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {6536#false} is VALID [2018-11-23 12:02:32,498 INFO L256 TraceCheckUtils]: 59: Hoare triple {6536#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {6536#false} is VALID [2018-11-23 12:02:32,498 INFO L273 TraceCheckUtils]: 60: Hoare triple {6536#false} ~cond := #in~cond; {6536#false} is VALID [2018-11-23 12:02:32,498 INFO L273 TraceCheckUtils]: 61: Hoare triple {6536#false} assume 0 == ~cond; {6536#false} is VALID [2018-11-23 12:02:32,498 INFO L273 TraceCheckUtils]: 62: Hoare triple {6536#false} assume !false; {6536#false} is VALID [2018-11-23 12:02:32,501 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-23 12:02:32,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:32,501 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:02:32,510 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:02:32,557 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:02:32,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:32,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:33,012 INFO L256 TraceCheckUtils]: 0: Hoare triple {6535#true} call ULTIMATE.init(); {6535#true} is VALID [2018-11-23 12:02:33,012 INFO L273 TraceCheckUtils]: 1: Hoare triple {6535#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6535#true} is VALID [2018-11-23 12:02:33,012 INFO L273 TraceCheckUtils]: 2: Hoare triple {6535#true} assume true; {6535#true} is VALID [2018-11-23 12:02:33,013 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6535#true} {6535#true} #62#return; {6535#true} is VALID [2018-11-23 12:02:33,013 INFO L256 TraceCheckUtils]: 4: Hoare triple {6535#true} call #t~ret4 := main(); {6535#true} is VALID [2018-11-23 12:02:33,013 INFO L273 TraceCheckUtils]: 5: Hoare triple {6535#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6535#true} is VALID [2018-11-23 12:02:33,013 INFO L273 TraceCheckUtils]: 6: Hoare triple {6535#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6535#true} is VALID [2018-11-23 12:02:33,013 INFO L273 TraceCheckUtils]: 7: Hoare triple {6535#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6535#true} is VALID [2018-11-23 12:02:33,013 INFO L273 TraceCheckUtils]: 8: Hoare triple {6535#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6535#true} is VALID [2018-11-23 12:02:33,014 INFO L273 TraceCheckUtils]: 9: Hoare triple {6535#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6535#true} is VALID [2018-11-23 12:02:33,014 INFO L273 TraceCheckUtils]: 10: Hoare triple {6535#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6535#true} is VALID [2018-11-23 12:02:33,014 INFO L273 TraceCheckUtils]: 11: Hoare triple {6535#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6535#true} is VALID [2018-11-23 12:02:33,014 INFO L273 TraceCheckUtils]: 12: Hoare triple {6535#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6535#true} is VALID [2018-11-23 12:02:33,014 INFO L273 TraceCheckUtils]: 13: Hoare triple {6535#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6535#true} is VALID [2018-11-23 12:02:33,014 INFO L273 TraceCheckUtils]: 14: Hoare triple {6535#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6535#true} is VALID [2018-11-23 12:02:33,014 INFO L273 TraceCheckUtils]: 15: Hoare triple {6535#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6535#true} is VALID [2018-11-23 12:02:33,015 INFO L273 TraceCheckUtils]: 16: Hoare triple {6535#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6535#true} is VALID [2018-11-23 12:02:33,015 INFO L273 TraceCheckUtils]: 17: Hoare triple {6535#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6535#true} is VALID [2018-11-23 12:02:33,015 INFO L273 TraceCheckUtils]: 18: Hoare triple {6535#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6535#true} is VALID [2018-11-23 12:02:33,015 INFO L273 TraceCheckUtils]: 19: Hoare triple {6535#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6535#true} is VALID [2018-11-23 12:02:33,015 INFO L273 TraceCheckUtils]: 20: Hoare triple {6535#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6535#true} is VALID [2018-11-23 12:02:33,015 INFO L273 TraceCheckUtils]: 21: Hoare triple {6535#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6535#true} is VALID [2018-11-23 12:02:33,016 INFO L273 TraceCheckUtils]: 22: Hoare triple {6535#true} assume !(~i~0 < 100000); {6535#true} is VALID [2018-11-23 12:02:33,017 INFO L273 TraceCheckUtils]: 23: Hoare triple {6535#true} ~i~0 := 0; {6626#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:33,017 INFO L273 TraceCheckUtils]: 24: Hoare triple {6626#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6626#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:33,019 INFO L273 TraceCheckUtils]: 25: Hoare triple {6626#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6538#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:33,019 INFO L273 TraceCheckUtils]: 26: Hoare triple {6538#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6538#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:33,021 INFO L273 TraceCheckUtils]: 27: Hoare triple {6538#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6539#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:33,021 INFO L273 TraceCheckUtils]: 28: Hoare triple {6539#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6539#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:33,024 INFO L273 TraceCheckUtils]: 29: Hoare triple {6539#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6540#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:33,024 INFO L273 TraceCheckUtils]: 30: Hoare triple {6540#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6540#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:33,027 INFO L273 TraceCheckUtils]: 31: Hoare triple {6540#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6541#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:33,027 INFO L273 TraceCheckUtils]: 32: Hoare triple {6541#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6541#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:33,030 INFO L273 TraceCheckUtils]: 33: Hoare triple {6541#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6542#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:33,030 INFO L273 TraceCheckUtils]: 34: Hoare triple {6542#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6542#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:33,033 INFO L273 TraceCheckUtils]: 35: Hoare triple {6542#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6543#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:33,033 INFO L273 TraceCheckUtils]: 36: Hoare triple {6543#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6543#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:33,035 INFO L273 TraceCheckUtils]: 37: Hoare triple {6543#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6544#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:33,035 INFO L273 TraceCheckUtils]: 38: Hoare triple {6544#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6544#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:33,038 INFO L273 TraceCheckUtils]: 39: Hoare triple {6544#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6545#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:33,038 INFO L273 TraceCheckUtils]: 40: Hoare triple {6545#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6545#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:33,040 INFO L273 TraceCheckUtils]: 41: Hoare triple {6545#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6546#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:33,040 INFO L273 TraceCheckUtils]: 42: Hoare triple {6546#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6546#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:33,042 INFO L273 TraceCheckUtils]: 43: Hoare triple {6546#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6547#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:33,042 INFO L273 TraceCheckUtils]: 44: Hoare triple {6547#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6547#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:33,044 INFO L273 TraceCheckUtils]: 45: Hoare triple {6547#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6548#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:33,044 INFO L273 TraceCheckUtils]: 46: Hoare triple {6548#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6548#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:33,047 INFO L273 TraceCheckUtils]: 47: Hoare triple {6548#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6549#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:33,047 INFO L273 TraceCheckUtils]: 48: Hoare triple {6549#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6549#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:33,049 INFO L273 TraceCheckUtils]: 49: Hoare triple {6549#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6550#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:33,049 INFO L273 TraceCheckUtils]: 50: Hoare triple {6550#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6550#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:33,051 INFO L273 TraceCheckUtils]: 51: Hoare triple {6550#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6551#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:33,051 INFO L273 TraceCheckUtils]: 52: Hoare triple {6551#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6551#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:33,053 INFO L273 TraceCheckUtils]: 53: Hoare triple {6551#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6552#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:33,053 INFO L273 TraceCheckUtils]: 54: Hoare triple {6552#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6552#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:33,056 INFO L273 TraceCheckUtils]: 55: Hoare triple {6552#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6553#(<= main_~i~0 16)} is VALID [2018-11-23 12:02:33,056 INFO L273 TraceCheckUtils]: 56: Hoare triple {6553#(<= main_~i~0 16)} assume !(~i~0 < 100000); {6536#false} is VALID [2018-11-23 12:02:33,056 INFO L273 TraceCheckUtils]: 57: Hoare triple {6536#false} havoc ~x~0;~x~0 := 0; {6536#false} is VALID [2018-11-23 12:02:33,057 INFO L273 TraceCheckUtils]: 58: Hoare triple {6536#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {6536#false} is VALID [2018-11-23 12:02:33,057 INFO L256 TraceCheckUtils]: 59: Hoare triple {6536#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {6536#false} is VALID [2018-11-23 12:02:33,057 INFO L273 TraceCheckUtils]: 60: Hoare triple {6536#false} ~cond := #in~cond; {6536#false} is VALID [2018-11-23 12:02:33,057 INFO L273 TraceCheckUtils]: 61: Hoare triple {6536#false} assume 0 == ~cond; {6536#false} is VALID [2018-11-23 12:02:33,057 INFO L273 TraceCheckUtils]: 62: Hoare triple {6536#false} assume !false; {6536#false} is VALID [2018-11-23 12:02:33,062 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-23 12:02:33,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:33,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 12:02:33,082 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 63 [2018-11-23 12:02:33,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:33,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:02:33,184 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:33,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:02:33,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:02:33,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:02:33,185 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 20 states. [2018-11-23 12:02:33,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:33,789 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2018-11-23 12:02:33,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:02:33,789 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 63 [2018-11-23 12:02:33,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:33,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:02:33,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 91 transitions. [2018-11-23 12:02:33,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:02:33,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 91 transitions. [2018-11-23 12:02:33,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 91 transitions. [2018-11-23 12:02:33,907 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:33,909 INFO L225 Difference]: With dead ends: 117 [2018-11-23 12:02:33,909 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 12:02:33,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:02:33,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 12:02:34,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-11-23 12:02:34,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:34,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 71 states. [2018-11-23 12:02:34,059 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 71 states. [2018-11-23 12:02:34,060 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 71 states. [2018-11-23 12:02:34,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:34,061 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-11-23 12:02:34,061 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-11-23 12:02:34,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:34,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:34,061 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 72 states. [2018-11-23 12:02:34,062 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 72 states. [2018-11-23 12:02:34,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:34,063 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-11-23 12:02:34,063 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-11-23 12:02:34,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:34,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:34,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:34,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:34,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 12:02:34,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2018-11-23 12:02:34,066 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 63 [2018-11-23 12:02:34,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:34,066 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2018-11-23 12:02:34,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:02:34,066 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-11-23 12:02:34,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 12:02:34,067 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:34,067 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:34,068 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:34,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:34,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1438435012, now seen corresponding path program 17 times [2018-11-23 12:02:34,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:34,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:34,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:34,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:34,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:34,508 INFO L256 TraceCheckUtils]: 0: Hoare triple {7181#true} call ULTIMATE.init(); {7181#true} is VALID [2018-11-23 12:02:34,509 INFO L273 TraceCheckUtils]: 1: Hoare triple {7181#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7181#true} is VALID [2018-11-23 12:02:34,509 INFO L273 TraceCheckUtils]: 2: Hoare triple {7181#true} assume true; {7181#true} is VALID [2018-11-23 12:02:34,509 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7181#true} {7181#true} #62#return; {7181#true} is VALID [2018-11-23 12:02:34,509 INFO L256 TraceCheckUtils]: 4: Hoare triple {7181#true} call #t~ret4 := main(); {7181#true} is VALID [2018-11-23 12:02:34,510 INFO L273 TraceCheckUtils]: 5: Hoare triple {7181#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7183#(= main_~i~0 0)} is VALID [2018-11-23 12:02:34,511 INFO L273 TraceCheckUtils]: 6: Hoare triple {7183#(= 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; {7184#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:34,511 INFO L273 TraceCheckUtils]: 7: Hoare triple {7184#(<= 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; {7185#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:34,512 INFO L273 TraceCheckUtils]: 8: Hoare triple {7185#(<= 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; {7186#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:34,513 INFO L273 TraceCheckUtils]: 9: Hoare triple {7186#(<= 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; {7187#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:34,513 INFO L273 TraceCheckUtils]: 10: Hoare triple {7187#(<= 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; {7188#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:34,514 INFO L273 TraceCheckUtils]: 11: Hoare triple {7188#(<= 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; {7189#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:34,515 INFO L273 TraceCheckUtils]: 12: Hoare triple {7189#(<= 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; {7190#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:34,516 INFO L273 TraceCheckUtils]: 13: Hoare triple {7190#(<= 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; {7191#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:34,517 INFO L273 TraceCheckUtils]: 14: Hoare triple {7191#(<= 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; {7192#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:34,517 INFO L273 TraceCheckUtils]: 15: Hoare triple {7192#(<= 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; {7193#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:34,536 INFO L273 TraceCheckUtils]: 16: Hoare triple {7193#(<= 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; {7194#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:34,537 INFO L273 TraceCheckUtils]: 17: Hoare triple {7194#(<= 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; {7195#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:34,538 INFO L273 TraceCheckUtils]: 18: Hoare triple {7195#(<= 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; {7196#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:34,538 INFO L273 TraceCheckUtils]: 19: Hoare triple {7196#(<= 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; {7197#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:34,539 INFO L273 TraceCheckUtils]: 20: Hoare triple {7197#(<= 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; {7198#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:34,539 INFO L273 TraceCheckUtils]: 21: Hoare triple {7198#(<= 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; {7199#(<= main_~i~0 16)} is VALID [2018-11-23 12:02:34,540 INFO L273 TraceCheckUtils]: 22: Hoare triple {7199#(<= 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; {7200#(<= main_~i~0 17)} is VALID [2018-11-23 12:02:34,540 INFO L273 TraceCheckUtils]: 23: Hoare triple {7200#(<= main_~i~0 17)} assume !(~i~0 < 100000); {7182#false} is VALID [2018-11-23 12:02:34,541 INFO L273 TraceCheckUtils]: 24: Hoare triple {7182#false} ~i~0 := 0; {7182#false} is VALID [2018-11-23 12:02:34,541 INFO L273 TraceCheckUtils]: 25: Hoare triple {7182#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7182#false} is VALID [2018-11-23 12:02:34,541 INFO L273 TraceCheckUtils]: 26: Hoare triple {7182#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7182#false} is VALID [2018-11-23 12:02:34,541 INFO L273 TraceCheckUtils]: 27: Hoare triple {7182#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7182#false} is VALID [2018-11-23 12:02:34,541 INFO L273 TraceCheckUtils]: 28: Hoare triple {7182#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7182#false} is VALID [2018-11-23 12:02:34,541 INFO L273 TraceCheckUtils]: 29: Hoare triple {7182#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7182#false} is VALID [2018-11-23 12:02:34,541 INFO L273 TraceCheckUtils]: 30: Hoare triple {7182#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7182#false} is VALID [2018-11-23 12:02:34,541 INFO L273 TraceCheckUtils]: 31: Hoare triple {7182#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7182#false} is VALID [2018-11-23 12:02:34,542 INFO L273 TraceCheckUtils]: 32: Hoare triple {7182#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7182#false} is VALID [2018-11-23 12:02:34,542 INFO L273 TraceCheckUtils]: 33: Hoare triple {7182#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7182#false} is VALID [2018-11-23 12:02:34,542 INFO L273 TraceCheckUtils]: 34: Hoare triple {7182#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7182#false} is VALID [2018-11-23 12:02:34,542 INFO L273 TraceCheckUtils]: 35: Hoare triple {7182#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7182#false} is VALID [2018-11-23 12:02:34,542 INFO L273 TraceCheckUtils]: 36: Hoare triple {7182#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7182#false} is VALID [2018-11-23 12:02:34,543 INFO L273 TraceCheckUtils]: 37: Hoare triple {7182#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7182#false} is VALID [2018-11-23 12:02:34,543 INFO L273 TraceCheckUtils]: 38: Hoare triple {7182#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7182#false} is VALID [2018-11-23 12:02:34,543 INFO L273 TraceCheckUtils]: 39: Hoare triple {7182#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7182#false} is VALID [2018-11-23 12:02:34,543 INFO L273 TraceCheckUtils]: 40: Hoare triple {7182#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7182#false} is VALID [2018-11-23 12:02:34,543 INFO L273 TraceCheckUtils]: 41: Hoare triple {7182#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7182#false} is VALID [2018-11-23 12:02:34,543 INFO L273 TraceCheckUtils]: 42: Hoare triple {7182#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7182#false} is VALID [2018-11-23 12:02:34,544 INFO L273 TraceCheckUtils]: 43: Hoare triple {7182#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7182#false} is VALID [2018-11-23 12:02:34,544 INFO L273 TraceCheckUtils]: 44: Hoare triple {7182#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7182#false} is VALID [2018-11-23 12:02:34,544 INFO L273 TraceCheckUtils]: 45: Hoare triple {7182#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7182#false} is VALID [2018-11-23 12:02:34,544 INFO L273 TraceCheckUtils]: 46: Hoare triple {7182#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7182#false} is VALID [2018-11-23 12:02:34,544 INFO L273 TraceCheckUtils]: 47: Hoare triple {7182#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7182#false} is VALID [2018-11-23 12:02:34,544 INFO L273 TraceCheckUtils]: 48: Hoare triple {7182#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7182#false} is VALID [2018-11-23 12:02:34,544 INFO L273 TraceCheckUtils]: 49: Hoare triple {7182#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7182#false} is VALID [2018-11-23 12:02:34,544 INFO L273 TraceCheckUtils]: 50: Hoare triple {7182#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7182#false} is VALID [2018-11-23 12:02:34,544 INFO L273 TraceCheckUtils]: 51: Hoare triple {7182#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7182#false} is VALID [2018-11-23 12:02:34,545 INFO L273 TraceCheckUtils]: 52: Hoare triple {7182#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7182#false} is VALID [2018-11-23 12:02:34,545 INFO L273 TraceCheckUtils]: 53: Hoare triple {7182#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7182#false} is VALID [2018-11-23 12:02:34,545 INFO L273 TraceCheckUtils]: 54: Hoare triple {7182#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7182#false} is VALID [2018-11-23 12:02:34,545 INFO L273 TraceCheckUtils]: 55: Hoare triple {7182#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7182#false} is VALID [2018-11-23 12:02:34,545 INFO L273 TraceCheckUtils]: 56: Hoare triple {7182#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7182#false} is VALID [2018-11-23 12:02:34,545 INFO L273 TraceCheckUtils]: 57: Hoare triple {7182#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7182#false} is VALID [2018-11-23 12:02:34,545 INFO L273 TraceCheckUtils]: 58: Hoare triple {7182#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7182#false} is VALID [2018-11-23 12:02:34,545 INFO L273 TraceCheckUtils]: 59: Hoare triple {7182#false} assume !(~i~0 < 100000); {7182#false} is VALID [2018-11-23 12:02:34,545 INFO L273 TraceCheckUtils]: 60: Hoare triple {7182#false} havoc ~x~0;~x~0 := 0; {7182#false} is VALID [2018-11-23 12:02:34,546 INFO L273 TraceCheckUtils]: 61: Hoare triple {7182#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {7182#false} is VALID [2018-11-23 12:02:34,546 INFO L256 TraceCheckUtils]: 62: Hoare triple {7182#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {7182#false} is VALID [2018-11-23 12:02:34,546 INFO L273 TraceCheckUtils]: 63: Hoare triple {7182#false} ~cond := #in~cond; {7182#false} is VALID [2018-11-23 12:02:34,546 INFO L273 TraceCheckUtils]: 64: Hoare triple {7182#false} assume 0 == ~cond; {7182#false} is VALID [2018-11-23 12:02:34,546 INFO L273 TraceCheckUtils]: 65: Hoare triple {7182#false} assume !false; {7182#false} is VALID [2018-11-23 12:02:34,548 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-11-23 12:02:34,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:34,548 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:02:34,559 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:03:08,304 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-23 12:03:08,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:08,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:08,692 INFO L256 TraceCheckUtils]: 0: Hoare triple {7181#true} call ULTIMATE.init(); {7181#true} is VALID [2018-11-23 12:03:08,692 INFO L273 TraceCheckUtils]: 1: Hoare triple {7181#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7181#true} is VALID [2018-11-23 12:03:08,692 INFO L273 TraceCheckUtils]: 2: Hoare triple {7181#true} assume true; {7181#true} is VALID [2018-11-23 12:03:08,692 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7181#true} {7181#true} #62#return; {7181#true} is VALID [2018-11-23 12:03:08,693 INFO L256 TraceCheckUtils]: 4: Hoare triple {7181#true} call #t~ret4 := main(); {7181#true} is VALID [2018-11-23 12:03:08,695 INFO L273 TraceCheckUtils]: 5: Hoare triple {7181#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7219#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:08,696 INFO L273 TraceCheckUtils]: 6: Hoare triple {7219#(<= 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; {7184#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:08,697 INFO L273 TraceCheckUtils]: 7: Hoare triple {7184#(<= 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; {7185#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:08,698 INFO L273 TraceCheckUtils]: 8: Hoare triple {7185#(<= 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; {7186#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:08,699 INFO L273 TraceCheckUtils]: 9: Hoare triple {7186#(<= 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; {7187#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:08,700 INFO L273 TraceCheckUtils]: 10: Hoare triple {7187#(<= 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; {7188#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:08,701 INFO L273 TraceCheckUtils]: 11: Hoare triple {7188#(<= 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; {7189#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:08,702 INFO L273 TraceCheckUtils]: 12: Hoare triple {7189#(<= 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; {7190#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:08,703 INFO L273 TraceCheckUtils]: 13: Hoare triple {7190#(<= 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; {7191#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:08,704 INFO L273 TraceCheckUtils]: 14: Hoare triple {7191#(<= 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; {7192#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:08,705 INFO L273 TraceCheckUtils]: 15: Hoare triple {7192#(<= 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; {7193#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:08,707 INFO L273 TraceCheckUtils]: 16: Hoare triple {7193#(<= 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; {7194#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:08,708 INFO L273 TraceCheckUtils]: 17: Hoare triple {7194#(<= 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; {7195#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:08,709 INFO L273 TraceCheckUtils]: 18: Hoare triple {7195#(<= 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; {7196#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:08,709 INFO L273 TraceCheckUtils]: 19: Hoare triple {7196#(<= 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; {7197#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:08,711 INFO L273 TraceCheckUtils]: 20: Hoare triple {7197#(<= 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; {7198#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:08,713 INFO L273 TraceCheckUtils]: 21: Hoare triple {7198#(<= 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; {7199#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:08,716 INFO L273 TraceCheckUtils]: 22: Hoare triple {7199#(<= 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; {7200#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:08,716 INFO L273 TraceCheckUtils]: 23: Hoare triple {7200#(<= main_~i~0 17)} assume !(~i~0 < 100000); {7182#false} is VALID [2018-11-23 12:03:08,716 INFO L273 TraceCheckUtils]: 24: Hoare triple {7182#false} ~i~0 := 0; {7182#false} is VALID [2018-11-23 12:03:08,716 INFO L273 TraceCheckUtils]: 25: Hoare triple {7182#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7182#false} is VALID [2018-11-23 12:03:08,716 INFO L273 TraceCheckUtils]: 26: Hoare triple {7182#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7182#false} is VALID [2018-11-23 12:03:08,717 INFO L273 TraceCheckUtils]: 27: Hoare triple {7182#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7182#false} is VALID [2018-11-23 12:03:08,717 INFO L273 TraceCheckUtils]: 28: Hoare triple {7182#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7182#false} is VALID [2018-11-23 12:03:08,717 INFO L273 TraceCheckUtils]: 29: Hoare triple {7182#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7182#false} is VALID [2018-11-23 12:03:08,717 INFO L273 TraceCheckUtils]: 30: Hoare triple {7182#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7182#false} is VALID [2018-11-23 12:03:08,717 INFO L273 TraceCheckUtils]: 31: Hoare triple {7182#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7182#false} is VALID [2018-11-23 12:03:08,717 INFO L273 TraceCheckUtils]: 32: Hoare triple {7182#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7182#false} is VALID [2018-11-23 12:03:08,717 INFO L273 TraceCheckUtils]: 33: Hoare triple {7182#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7182#false} is VALID [2018-11-23 12:03:08,717 INFO L273 TraceCheckUtils]: 34: Hoare triple {7182#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7182#false} is VALID [2018-11-23 12:03:08,717 INFO L273 TraceCheckUtils]: 35: Hoare triple {7182#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7182#false} is VALID [2018-11-23 12:03:08,718 INFO L273 TraceCheckUtils]: 36: Hoare triple {7182#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7182#false} is VALID [2018-11-23 12:03:08,718 INFO L273 TraceCheckUtils]: 37: Hoare triple {7182#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7182#false} is VALID [2018-11-23 12:03:08,718 INFO L273 TraceCheckUtils]: 38: Hoare triple {7182#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7182#false} is VALID [2018-11-23 12:03:08,718 INFO L273 TraceCheckUtils]: 39: Hoare triple {7182#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7182#false} is VALID [2018-11-23 12:03:08,718 INFO L273 TraceCheckUtils]: 40: Hoare triple {7182#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7182#false} is VALID [2018-11-23 12:03:08,718 INFO L273 TraceCheckUtils]: 41: Hoare triple {7182#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7182#false} is VALID [2018-11-23 12:03:08,718 INFO L273 TraceCheckUtils]: 42: Hoare triple {7182#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7182#false} is VALID [2018-11-23 12:03:08,718 INFO L273 TraceCheckUtils]: 43: Hoare triple {7182#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7182#false} is VALID [2018-11-23 12:03:08,718 INFO L273 TraceCheckUtils]: 44: Hoare triple {7182#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7182#false} is VALID [2018-11-23 12:03:08,719 INFO L273 TraceCheckUtils]: 45: Hoare triple {7182#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7182#false} is VALID [2018-11-23 12:03:08,719 INFO L273 TraceCheckUtils]: 46: Hoare triple {7182#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7182#false} is VALID [2018-11-23 12:03:08,719 INFO L273 TraceCheckUtils]: 47: Hoare triple {7182#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7182#false} is VALID [2018-11-23 12:03:08,719 INFO L273 TraceCheckUtils]: 48: Hoare triple {7182#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7182#false} is VALID [2018-11-23 12:03:08,719 INFO L273 TraceCheckUtils]: 49: Hoare triple {7182#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7182#false} is VALID [2018-11-23 12:03:08,719 INFO L273 TraceCheckUtils]: 50: Hoare triple {7182#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7182#false} is VALID [2018-11-23 12:03:08,719 INFO L273 TraceCheckUtils]: 51: Hoare triple {7182#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7182#false} is VALID [2018-11-23 12:03:08,719 INFO L273 TraceCheckUtils]: 52: Hoare triple {7182#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7182#false} is VALID [2018-11-23 12:03:08,720 INFO L273 TraceCheckUtils]: 53: Hoare triple {7182#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7182#false} is VALID [2018-11-23 12:03:08,720 INFO L273 TraceCheckUtils]: 54: Hoare triple {7182#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7182#false} is VALID [2018-11-23 12:03:08,720 INFO L273 TraceCheckUtils]: 55: Hoare triple {7182#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7182#false} is VALID [2018-11-23 12:03:08,720 INFO L273 TraceCheckUtils]: 56: Hoare triple {7182#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7182#false} is VALID [2018-11-23 12:03:08,720 INFO L273 TraceCheckUtils]: 57: Hoare triple {7182#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7182#false} is VALID [2018-11-23 12:03:08,720 INFO L273 TraceCheckUtils]: 58: Hoare triple {7182#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7182#false} is VALID [2018-11-23 12:03:08,720 INFO L273 TraceCheckUtils]: 59: Hoare triple {7182#false} assume !(~i~0 < 100000); {7182#false} is VALID [2018-11-23 12:03:08,720 INFO L273 TraceCheckUtils]: 60: Hoare triple {7182#false} havoc ~x~0;~x~0 := 0; {7182#false} is VALID [2018-11-23 12:03:08,720 INFO L273 TraceCheckUtils]: 61: Hoare triple {7182#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {7182#false} is VALID [2018-11-23 12:03:08,721 INFO L256 TraceCheckUtils]: 62: Hoare triple {7182#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {7182#false} is VALID [2018-11-23 12:03:08,721 INFO L273 TraceCheckUtils]: 63: Hoare triple {7182#false} ~cond := #in~cond; {7182#false} is VALID [2018-11-23 12:03:08,721 INFO L273 TraceCheckUtils]: 64: Hoare triple {7182#false} assume 0 == ~cond; {7182#false} is VALID [2018-11-23 12:03:08,721 INFO L273 TraceCheckUtils]: 65: Hoare triple {7182#false} assume !false; {7182#false} is VALID [2018-11-23 12:03:08,723 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-11-23 12:03:08,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:08,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 12:03:08,749 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2018-11-23 12:03:08,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:08,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 12:03:08,824 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:03:08,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 12:03:08,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 12:03:08,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:03:08,825 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 21 states. [2018-11-23 12:03:09,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:09,588 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2018-11-23 12:03:09,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 12:03:09,588 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2018-11-23 12:03:09,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:09,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:03:09,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 94 transitions. [2018-11-23 12:03:09,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:03:09,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 94 transitions. [2018-11-23 12:03:09,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 94 transitions. [2018-11-23 12:03:09,689 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:03:09,690 INFO L225 Difference]: With dead ends: 122 [2018-11-23 12:03:09,690 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 12:03:09,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:03:09,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 12:03:09,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-11-23 12:03:09,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:09,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 74 states. [2018-11-23 12:03:09,757 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 74 states. [2018-11-23 12:03:09,757 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 74 states. [2018-11-23 12:03:09,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:09,758 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-11-23 12:03:09,758 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-11-23 12:03:09,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:09,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:09,759 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 75 states. [2018-11-23 12:03:09,759 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 75 states. [2018-11-23 12:03:09,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:09,760 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-11-23 12:03:09,760 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-11-23 12:03:09,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:09,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:09,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:09,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:09,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 12:03:09,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2018-11-23 12:03:09,763 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 66 [2018-11-23 12:03:09,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:09,763 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2018-11-23 12:03:09,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 12:03:09,763 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2018-11-23 12:03:09,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 12:03:09,764 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:09,764 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:09,764 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:09,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:09,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1038272990, now seen corresponding path program 18 times [2018-11-23 12:03:09,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:09,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:09,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:09,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:09,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:10,196 INFO L256 TraceCheckUtils]: 0: Hoare triple {7856#true} call ULTIMATE.init(); {7856#true} is VALID [2018-11-23 12:03:10,197 INFO L273 TraceCheckUtils]: 1: Hoare triple {7856#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7856#true} is VALID [2018-11-23 12:03:10,197 INFO L273 TraceCheckUtils]: 2: Hoare triple {7856#true} assume true; {7856#true} is VALID [2018-11-23 12:03:10,197 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7856#true} {7856#true} #62#return; {7856#true} is VALID [2018-11-23 12:03:10,197 INFO L256 TraceCheckUtils]: 4: Hoare triple {7856#true} call #t~ret4 := main(); {7856#true} is VALID [2018-11-23 12:03:10,198 INFO L273 TraceCheckUtils]: 5: Hoare triple {7856#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7858#(= main_~i~0 0)} is VALID [2018-11-23 12:03:10,199 INFO L273 TraceCheckUtils]: 6: Hoare triple {7858#(= 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; {7859#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:10,199 INFO L273 TraceCheckUtils]: 7: Hoare triple {7859#(<= 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; {7860#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:10,200 INFO L273 TraceCheckUtils]: 8: Hoare triple {7860#(<= 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; {7861#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:10,200 INFO L273 TraceCheckUtils]: 9: Hoare triple {7861#(<= 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; {7862#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:10,201 INFO L273 TraceCheckUtils]: 10: Hoare triple {7862#(<= 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; {7863#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:10,202 INFO L273 TraceCheckUtils]: 11: Hoare triple {7863#(<= 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; {7864#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:10,202 INFO L273 TraceCheckUtils]: 12: Hoare triple {7864#(<= 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; {7865#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:10,203 INFO L273 TraceCheckUtils]: 13: Hoare triple {7865#(<= 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; {7866#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:10,204 INFO L273 TraceCheckUtils]: 14: Hoare triple {7866#(<= 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; {7867#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:10,205 INFO L273 TraceCheckUtils]: 15: Hoare triple {7867#(<= 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; {7868#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:10,206 INFO L273 TraceCheckUtils]: 16: Hoare triple {7868#(<= 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; {7869#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:10,207 INFO L273 TraceCheckUtils]: 17: Hoare triple {7869#(<= 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; {7870#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:10,208 INFO L273 TraceCheckUtils]: 18: Hoare triple {7870#(<= 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; {7871#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:10,208 INFO L273 TraceCheckUtils]: 19: Hoare triple {7871#(<= 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; {7872#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:10,209 INFO L273 TraceCheckUtils]: 20: Hoare triple {7872#(<= 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; {7873#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:10,210 INFO L273 TraceCheckUtils]: 21: Hoare triple {7873#(<= 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; {7874#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:10,211 INFO L273 TraceCheckUtils]: 22: Hoare triple {7874#(<= 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; {7875#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:10,212 INFO L273 TraceCheckUtils]: 23: Hoare triple {7875#(<= 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; {7876#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:10,213 INFO L273 TraceCheckUtils]: 24: Hoare triple {7876#(<= main_~i~0 18)} assume !(~i~0 < 100000); {7857#false} is VALID [2018-11-23 12:03:10,213 INFO L273 TraceCheckUtils]: 25: Hoare triple {7857#false} ~i~0 := 0; {7857#false} is VALID [2018-11-23 12:03:10,213 INFO L273 TraceCheckUtils]: 26: Hoare triple {7857#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7857#false} is VALID [2018-11-23 12:03:10,213 INFO L273 TraceCheckUtils]: 27: Hoare triple {7857#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7857#false} is VALID [2018-11-23 12:03:10,213 INFO L273 TraceCheckUtils]: 28: Hoare triple {7857#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7857#false} is VALID [2018-11-23 12:03:10,214 INFO L273 TraceCheckUtils]: 29: Hoare triple {7857#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7857#false} is VALID [2018-11-23 12:03:10,214 INFO L273 TraceCheckUtils]: 30: Hoare triple {7857#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7857#false} is VALID [2018-11-23 12:03:10,214 INFO L273 TraceCheckUtils]: 31: Hoare triple {7857#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7857#false} is VALID [2018-11-23 12:03:10,214 INFO L273 TraceCheckUtils]: 32: Hoare triple {7857#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7857#false} is VALID [2018-11-23 12:03:10,214 INFO L273 TraceCheckUtils]: 33: Hoare triple {7857#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7857#false} is VALID [2018-11-23 12:03:10,215 INFO L273 TraceCheckUtils]: 34: Hoare triple {7857#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7857#false} is VALID [2018-11-23 12:03:10,215 INFO L273 TraceCheckUtils]: 35: Hoare triple {7857#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7857#false} is VALID [2018-11-23 12:03:10,215 INFO L273 TraceCheckUtils]: 36: Hoare triple {7857#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7857#false} is VALID [2018-11-23 12:03:10,215 INFO L273 TraceCheckUtils]: 37: Hoare triple {7857#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7857#false} is VALID [2018-11-23 12:03:10,215 INFO L273 TraceCheckUtils]: 38: Hoare triple {7857#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7857#false} is VALID [2018-11-23 12:03:10,215 INFO L273 TraceCheckUtils]: 39: Hoare triple {7857#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7857#false} is VALID [2018-11-23 12:03:10,216 INFO L273 TraceCheckUtils]: 40: Hoare triple {7857#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7857#false} is VALID [2018-11-23 12:03:10,216 INFO L273 TraceCheckUtils]: 41: Hoare triple {7857#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7857#false} is VALID [2018-11-23 12:03:10,216 INFO L273 TraceCheckUtils]: 42: Hoare triple {7857#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7857#false} is VALID [2018-11-23 12:03:10,216 INFO L273 TraceCheckUtils]: 43: Hoare triple {7857#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7857#false} is VALID [2018-11-23 12:03:10,216 INFO L273 TraceCheckUtils]: 44: Hoare triple {7857#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7857#false} is VALID [2018-11-23 12:03:10,216 INFO L273 TraceCheckUtils]: 45: Hoare triple {7857#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7857#false} is VALID [2018-11-23 12:03:10,216 INFO L273 TraceCheckUtils]: 46: Hoare triple {7857#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7857#false} is VALID [2018-11-23 12:03:10,217 INFO L273 TraceCheckUtils]: 47: Hoare triple {7857#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7857#false} is VALID [2018-11-23 12:03:10,217 INFO L273 TraceCheckUtils]: 48: Hoare triple {7857#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7857#false} is VALID [2018-11-23 12:03:10,217 INFO L273 TraceCheckUtils]: 49: Hoare triple {7857#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7857#false} is VALID [2018-11-23 12:03:10,217 INFO L273 TraceCheckUtils]: 50: Hoare triple {7857#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7857#false} is VALID [2018-11-23 12:03:10,217 INFO L273 TraceCheckUtils]: 51: Hoare triple {7857#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7857#false} is VALID [2018-11-23 12:03:10,217 INFO L273 TraceCheckUtils]: 52: Hoare triple {7857#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7857#false} is VALID [2018-11-23 12:03:10,217 INFO L273 TraceCheckUtils]: 53: Hoare triple {7857#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7857#false} is VALID [2018-11-23 12:03:10,217 INFO L273 TraceCheckUtils]: 54: Hoare triple {7857#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7857#false} is VALID [2018-11-23 12:03:10,217 INFO L273 TraceCheckUtils]: 55: Hoare triple {7857#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7857#false} is VALID [2018-11-23 12:03:10,218 INFO L273 TraceCheckUtils]: 56: Hoare triple {7857#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7857#false} is VALID [2018-11-23 12:03:10,218 INFO L273 TraceCheckUtils]: 57: Hoare triple {7857#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7857#false} is VALID [2018-11-23 12:03:10,218 INFO L273 TraceCheckUtils]: 58: Hoare triple {7857#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7857#false} is VALID [2018-11-23 12:03:10,218 INFO L273 TraceCheckUtils]: 59: Hoare triple {7857#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7857#false} is VALID [2018-11-23 12:03:10,218 INFO L273 TraceCheckUtils]: 60: Hoare triple {7857#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7857#false} is VALID [2018-11-23 12:03:10,218 INFO L273 TraceCheckUtils]: 61: Hoare triple {7857#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7857#false} is VALID [2018-11-23 12:03:10,218 INFO L273 TraceCheckUtils]: 62: Hoare triple {7857#false} assume !(~i~0 < 100000); {7857#false} is VALID [2018-11-23 12:03:10,218 INFO L273 TraceCheckUtils]: 63: Hoare triple {7857#false} havoc ~x~0;~x~0 := 0; {7857#false} is VALID [2018-11-23 12:03:10,218 INFO L273 TraceCheckUtils]: 64: Hoare triple {7857#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {7857#false} is VALID [2018-11-23 12:03:10,219 INFO L256 TraceCheckUtils]: 65: Hoare triple {7857#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {7857#false} is VALID [2018-11-23 12:03:10,219 INFO L273 TraceCheckUtils]: 66: Hoare triple {7857#false} ~cond := #in~cond; {7857#false} is VALID [2018-11-23 12:03:10,219 INFO L273 TraceCheckUtils]: 67: Hoare triple {7857#false} assume 0 == ~cond; {7857#false} is VALID [2018-11-23 12:03:10,219 INFO L273 TraceCheckUtils]: 68: Hoare triple {7857#false} assume !false; {7857#false} is VALID [2018-11-23 12:03:10,221 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-11-23 12:03:10,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:10,221 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:03:10,230 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:03:35,229 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 12:03:35,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:35,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:35,432 INFO L256 TraceCheckUtils]: 0: Hoare triple {7856#true} call ULTIMATE.init(); {7856#true} is VALID [2018-11-23 12:03:35,433 INFO L273 TraceCheckUtils]: 1: Hoare triple {7856#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7856#true} is VALID [2018-11-23 12:03:35,433 INFO L273 TraceCheckUtils]: 2: Hoare triple {7856#true} assume true; {7856#true} is VALID [2018-11-23 12:03:35,433 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7856#true} {7856#true} #62#return; {7856#true} is VALID [2018-11-23 12:03:35,433 INFO L256 TraceCheckUtils]: 4: Hoare triple {7856#true} call #t~ret4 := main(); {7856#true} is VALID [2018-11-23 12:03:35,433 INFO L273 TraceCheckUtils]: 5: Hoare triple {7856#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7856#true} is VALID [2018-11-23 12:03:35,434 INFO L273 TraceCheckUtils]: 6: Hoare triple {7856#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7856#true} is VALID [2018-11-23 12:03:35,434 INFO L273 TraceCheckUtils]: 7: Hoare triple {7856#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7856#true} is VALID [2018-11-23 12:03:35,434 INFO L273 TraceCheckUtils]: 8: Hoare triple {7856#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7856#true} is VALID [2018-11-23 12:03:35,434 INFO L273 TraceCheckUtils]: 9: Hoare triple {7856#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7856#true} is VALID [2018-11-23 12:03:35,434 INFO L273 TraceCheckUtils]: 10: Hoare triple {7856#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7856#true} is VALID [2018-11-23 12:03:35,435 INFO L273 TraceCheckUtils]: 11: Hoare triple {7856#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7856#true} is VALID [2018-11-23 12:03:35,435 INFO L273 TraceCheckUtils]: 12: Hoare triple {7856#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7856#true} is VALID [2018-11-23 12:03:35,435 INFO L273 TraceCheckUtils]: 13: Hoare triple {7856#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7856#true} is VALID [2018-11-23 12:03:35,435 INFO L273 TraceCheckUtils]: 14: Hoare triple {7856#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7856#true} is VALID [2018-11-23 12:03:35,435 INFO L273 TraceCheckUtils]: 15: Hoare triple {7856#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7856#true} is VALID [2018-11-23 12:03:35,435 INFO L273 TraceCheckUtils]: 16: Hoare triple {7856#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7856#true} is VALID [2018-11-23 12:03:35,435 INFO L273 TraceCheckUtils]: 17: Hoare triple {7856#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7856#true} is VALID [2018-11-23 12:03:35,435 INFO L273 TraceCheckUtils]: 18: Hoare triple {7856#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7856#true} is VALID [2018-11-23 12:03:35,436 INFO L273 TraceCheckUtils]: 19: Hoare triple {7856#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7856#true} is VALID [2018-11-23 12:03:35,436 INFO L273 TraceCheckUtils]: 20: Hoare triple {7856#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7856#true} is VALID [2018-11-23 12:03:35,436 INFO L273 TraceCheckUtils]: 21: Hoare triple {7856#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7856#true} is VALID [2018-11-23 12:03:35,436 INFO L273 TraceCheckUtils]: 22: Hoare triple {7856#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7856#true} is VALID [2018-11-23 12:03:35,436 INFO L273 TraceCheckUtils]: 23: Hoare triple {7856#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7949#(<= main_~i~0 100000)} is VALID [2018-11-23 12:03:35,437 INFO L273 TraceCheckUtils]: 24: Hoare triple {7949#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {7856#true} is VALID [2018-11-23 12:03:35,437 INFO L273 TraceCheckUtils]: 25: Hoare triple {7856#true} ~i~0 := 0; {7956#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:35,437 INFO L273 TraceCheckUtils]: 26: Hoare triple {7956#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7956#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:35,438 INFO L273 TraceCheckUtils]: 27: Hoare triple {7956#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7859#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:35,438 INFO L273 TraceCheckUtils]: 28: Hoare triple {7859#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7859#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:35,438 INFO L273 TraceCheckUtils]: 29: Hoare triple {7859#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7860#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:35,439 INFO L273 TraceCheckUtils]: 30: Hoare triple {7860#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7860#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:35,439 INFO L273 TraceCheckUtils]: 31: Hoare triple {7860#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7861#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:35,439 INFO L273 TraceCheckUtils]: 32: Hoare triple {7861#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7861#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:35,440 INFO L273 TraceCheckUtils]: 33: Hoare triple {7861#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7862#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:35,441 INFO L273 TraceCheckUtils]: 34: Hoare triple {7862#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7862#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:35,441 INFO L273 TraceCheckUtils]: 35: Hoare triple {7862#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7863#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:35,442 INFO L273 TraceCheckUtils]: 36: Hoare triple {7863#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7863#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:35,443 INFO L273 TraceCheckUtils]: 37: Hoare triple {7863#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7864#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:35,443 INFO L273 TraceCheckUtils]: 38: Hoare triple {7864#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7864#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:35,444 INFO L273 TraceCheckUtils]: 39: Hoare triple {7864#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7865#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:35,444 INFO L273 TraceCheckUtils]: 40: Hoare triple {7865#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7865#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:35,445 INFO L273 TraceCheckUtils]: 41: Hoare triple {7865#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7866#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:35,445 INFO L273 TraceCheckUtils]: 42: Hoare triple {7866#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7866#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:35,446 INFO L273 TraceCheckUtils]: 43: Hoare triple {7866#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7867#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:35,447 INFO L273 TraceCheckUtils]: 44: Hoare triple {7867#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7867#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:35,447 INFO L273 TraceCheckUtils]: 45: Hoare triple {7867#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7868#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:35,448 INFO L273 TraceCheckUtils]: 46: Hoare triple {7868#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7868#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:35,448 INFO L273 TraceCheckUtils]: 47: Hoare triple {7868#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7869#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:35,449 INFO L273 TraceCheckUtils]: 48: Hoare triple {7869#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7869#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:35,450 INFO L273 TraceCheckUtils]: 49: Hoare triple {7869#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7870#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:35,450 INFO L273 TraceCheckUtils]: 50: Hoare triple {7870#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7870#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:35,451 INFO L273 TraceCheckUtils]: 51: Hoare triple {7870#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7871#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:35,451 INFO L273 TraceCheckUtils]: 52: Hoare triple {7871#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7871#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:35,452 INFO L273 TraceCheckUtils]: 53: Hoare triple {7871#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7872#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:35,453 INFO L273 TraceCheckUtils]: 54: Hoare triple {7872#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7872#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:35,453 INFO L273 TraceCheckUtils]: 55: Hoare triple {7872#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7873#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:35,454 INFO L273 TraceCheckUtils]: 56: Hoare triple {7873#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7873#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:35,454 INFO L273 TraceCheckUtils]: 57: Hoare triple {7873#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7874#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:35,455 INFO L273 TraceCheckUtils]: 58: Hoare triple {7874#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7874#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:35,456 INFO L273 TraceCheckUtils]: 59: Hoare triple {7874#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7875#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:35,456 INFO L273 TraceCheckUtils]: 60: Hoare triple {7875#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7875#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:35,457 INFO L273 TraceCheckUtils]: 61: Hoare triple {7875#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7876#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:35,457 INFO L273 TraceCheckUtils]: 62: Hoare triple {7876#(<= main_~i~0 18)} assume !(~i~0 < 100000); {7857#false} is VALID [2018-11-23 12:03:35,458 INFO L273 TraceCheckUtils]: 63: Hoare triple {7857#false} havoc ~x~0;~x~0 := 0; {7857#false} is VALID [2018-11-23 12:03:35,458 INFO L273 TraceCheckUtils]: 64: Hoare triple {7857#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {7857#false} is VALID [2018-11-23 12:03:35,458 INFO L256 TraceCheckUtils]: 65: Hoare triple {7857#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {7857#false} is VALID [2018-11-23 12:03:35,458 INFO L273 TraceCheckUtils]: 66: Hoare triple {7857#false} ~cond := #in~cond; {7857#false} is VALID [2018-11-23 12:03:35,458 INFO L273 TraceCheckUtils]: 67: Hoare triple {7857#false} assume 0 == ~cond; {7857#false} is VALID [2018-11-23 12:03:35,459 INFO L273 TraceCheckUtils]: 68: Hoare triple {7857#false} assume !false; {7857#false} is VALID [2018-11-23 12:03:35,462 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 18 proven. 324 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-23 12:03:35,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:35,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 23 [2018-11-23 12:03:35,488 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 69 [2018-11-23 12:03:35,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:35,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:03:35,565 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:35,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:03:35,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:03:35,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:03:35,567 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 23 states. [2018-11-23 12:03:35,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:35,957 INFO L93 Difference]: Finished difference Result 133 states and 140 transitions. [2018-11-23 12:03:35,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 12:03:35,957 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 69 [2018-11-23 12:03:35,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:35,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:03:35,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 105 transitions. [2018-11-23 12:03:35,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:03:35,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 105 transitions. [2018-11-23 12:03:35,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 105 transitions. [2018-11-23 12:03:36,068 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:36,070 INFO L225 Difference]: With dead ends: 133 [2018-11-23 12:03:36,070 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 12:03:36,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:03:36,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 12:03:36,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2018-11-23 12:03:36,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:36,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 77 states. [2018-11-23 12:03:36,102 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 77 states. [2018-11-23 12:03:36,102 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 77 states. [2018-11-23 12:03:36,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:36,104 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2018-11-23 12:03:36,105 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-11-23 12:03:36,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:36,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:36,105 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 84 states. [2018-11-23 12:03:36,105 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 84 states. [2018-11-23 12:03:36,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:36,107 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2018-11-23 12:03:36,107 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-11-23 12:03:36,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:36,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:36,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:36,108 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:36,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 12:03:36,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2018-11-23 12:03:36,109 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 69 [2018-11-23 12:03:36,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:36,110 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2018-11-23 12:03:36,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:03:36,110 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2018-11-23 12:03:36,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 12:03:36,110 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:36,111 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:36,111 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:36,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:36,111 INFO L82 PathProgramCache]: Analyzing trace with hash 673783744, now seen corresponding path program 19 times [2018-11-23 12:03:36,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:36,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:36,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:36,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:36,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:36,768 INFO L256 TraceCheckUtils]: 0: Hoare triple {8582#true} call ULTIMATE.init(); {8582#true} is VALID [2018-11-23 12:03:36,769 INFO L273 TraceCheckUtils]: 1: Hoare triple {8582#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8582#true} is VALID [2018-11-23 12:03:36,769 INFO L273 TraceCheckUtils]: 2: Hoare triple {8582#true} assume true; {8582#true} is VALID [2018-11-23 12:03:36,769 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8582#true} {8582#true} #62#return; {8582#true} is VALID [2018-11-23 12:03:36,769 INFO L256 TraceCheckUtils]: 4: Hoare triple {8582#true} call #t~ret4 := main(); {8582#true} is VALID [2018-11-23 12:03:36,770 INFO L273 TraceCheckUtils]: 5: Hoare triple {8582#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8584#(= main_~i~0 0)} is VALID [2018-11-23 12:03:36,771 INFO L273 TraceCheckUtils]: 6: Hoare triple {8584#(= 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; {8585#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:36,772 INFO L273 TraceCheckUtils]: 7: Hoare triple {8585#(<= 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; {8586#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:36,773 INFO L273 TraceCheckUtils]: 8: Hoare triple {8586#(<= 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; {8587#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:36,773 INFO L273 TraceCheckUtils]: 9: Hoare triple {8587#(<= 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; {8588#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:36,774 INFO L273 TraceCheckUtils]: 10: Hoare triple {8588#(<= 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; {8589#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:36,775 INFO L273 TraceCheckUtils]: 11: Hoare triple {8589#(<= 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; {8590#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:36,776 INFO L273 TraceCheckUtils]: 12: Hoare triple {8590#(<= 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; {8591#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:36,777 INFO L273 TraceCheckUtils]: 13: Hoare triple {8591#(<= 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; {8592#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:36,778 INFO L273 TraceCheckUtils]: 14: Hoare triple {8592#(<= 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; {8593#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:36,779 INFO L273 TraceCheckUtils]: 15: Hoare triple {8593#(<= 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; {8594#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:36,780 INFO L273 TraceCheckUtils]: 16: Hoare triple {8594#(<= 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; {8595#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:36,781 INFO L273 TraceCheckUtils]: 17: Hoare triple {8595#(<= 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; {8596#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:36,782 INFO L273 TraceCheckUtils]: 18: Hoare triple {8596#(<= 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; {8597#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:36,782 INFO L273 TraceCheckUtils]: 19: Hoare triple {8597#(<= 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; {8598#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:36,783 INFO L273 TraceCheckUtils]: 20: Hoare triple {8598#(<= 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; {8599#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:36,784 INFO L273 TraceCheckUtils]: 21: Hoare triple {8599#(<= 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; {8600#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:36,785 INFO L273 TraceCheckUtils]: 22: Hoare triple {8600#(<= 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; {8601#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:36,786 INFO L273 TraceCheckUtils]: 23: Hoare triple {8601#(<= 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; {8602#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:36,787 INFO L273 TraceCheckUtils]: 24: Hoare triple {8602#(<= 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; {8603#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:36,788 INFO L273 TraceCheckUtils]: 25: Hoare triple {8603#(<= main_~i~0 19)} assume !(~i~0 < 100000); {8583#false} is VALID [2018-11-23 12:03:36,788 INFO L273 TraceCheckUtils]: 26: Hoare triple {8583#false} ~i~0 := 0; {8583#false} is VALID [2018-11-23 12:03:36,788 INFO L273 TraceCheckUtils]: 27: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:36,788 INFO L273 TraceCheckUtils]: 28: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:36,788 INFO L273 TraceCheckUtils]: 29: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:36,789 INFO L273 TraceCheckUtils]: 30: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:36,789 INFO L273 TraceCheckUtils]: 31: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:36,789 INFO L273 TraceCheckUtils]: 32: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:36,789 INFO L273 TraceCheckUtils]: 33: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:36,789 INFO L273 TraceCheckUtils]: 34: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:36,789 INFO L273 TraceCheckUtils]: 35: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:36,790 INFO L273 TraceCheckUtils]: 36: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:36,790 INFO L273 TraceCheckUtils]: 37: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:36,790 INFO L273 TraceCheckUtils]: 38: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:36,790 INFO L273 TraceCheckUtils]: 39: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:36,790 INFO L273 TraceCheckUtils]: 40: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:36,791 INFO L273 TraceCheckUtils]: 41: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:36,791 INFO L273 TraceCheckUtils]: 42: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:36,791 INFO L273 TraceCheckUtils]: 43: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:36,791 INFO L273 TraceCheckUtils]: 44: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:36,791 INFO L273 TraceCheckUtils]: 45: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:36,791 INFO L273 TraceCheckUtils]: 46: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:36,792 INFO L273 TraceCheckUtils]: 47: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:36,792 INFO L273 TraceCheckUtils]: 48: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:36,792 INFO L273 TraceCheckUtils]: 49: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:36,792 INFO L273 TraceCheckUtils]: 50: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:36,792 INFO L273 TraceCheckUtils]: 51: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:36,793 INFO L273 TraceCheckUtils]: 52: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:36,793 INFO L273 TraceCheckUtils]: 53: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:36,793 INFO L273 TraceCheckUtils]: 54: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:36,793 INFO L273 TraceCheckUtils]: 55: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:36,793 INFO L273 TraceCheckUtils]: 56: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:36,793 INFO L273 TraceCheckUtils]: 57: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:36,793 INFO L273 TraceCheckUtils]: 58: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:36,794 INFO L273 TraceCheckUtils]: 59: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:36,794 INFO L273 TraceCheckUtils]: 60: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:36,794 INFO L273 TraceCheckUtils]: 61: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:36,794 INFO L273 TraceCheckUtils]: 62: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:36,794 INFO L273 TraceCheckUtils]: 63: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:36,794 INFO L273 TraceCheckUtils]: 64: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:36,794 INFO L273 TraceCheckUtils]: 65: Hoare triple {8583#false} assume !(~i~0 < 100000); {8583#false} is VALID [2018-11-23 12:03:36,794 INFO L273 TraceCheckUtils]: 66: Hoare triple {8583#false} havoc ~x~0;~x~0 := 0; {8583#false} is VALID [2018-11-23 12:03:36,794 INFO L273 TraceCheckUtils]: 67: Hoare triple {8583#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {8583#false} is VALID [2018-11-23 12:03:36,795 INFO L256 TraceCheckUtils]: 68: Hoare triple {8583#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {8583#false} is VALID [2018-11-23 12:03:36,795 INFO L273 TraceCheckUtils]: 69: Hoare triple {8583#false} ~cond := #in~cond; {8583#false} is VALID [2018-11-23 12:03:36,795 INFO L273 TraceCheckUtils]: 70: Hoare triple {8583#false} assume 0 == ~cond; {8583#false} is VALID [2018-11-23 12:03:36,795 INFO L273 TraceCheckUtils]: 71: Hoare triple {8583#false} assume !false; {8583#false} is VALID [2018-11-23 12:03:36,797 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-11-23 12:03:36,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:36,798 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:36,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:03:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:36,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:37,088 INFO L256 TraceCheckUtils]: 0: Hoare triple {8582#true} call ULTIMATE.init(); {8582#true} is VALID [2018-11-23 12:03:37,088 INFO L273 TraceCheckUtils]: 1: Hoare triple {8582#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8582#true} is VALID [2018-11-23 12:03:37,088 INFO L273 TraceCheckUtils]: 2: Hoare triple {8582#true} assume true; {8582#true} is VALID [2018-11-23 12:03:37,089 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8582#true} {8582#true} #62#return; {8582#true} is VALID [2018-11-23 12:03:37,089 INFO L256 TraceCheckUtils]: 4: Hoare triple {8582#true} call #t~ret4 := main(); {8582#true} is VALID [2018-11-23 12:03:37,100 INFO L273 TraceCheckUtils]: 5: Hoare triple {8582#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8622#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:37,100 INFO L273 TraceCheckUtils]: 6: Hoare triple {8622#(<= 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; {8585#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:37,101 INFO L273 TraceCheckUtils]: 7: Hoare triple {8585#(<= 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; {8586#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:37,102 INFO L273 TraceCheckUtils]: 8: Hoare triple {8586#(<= 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; {8587#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:37,102 INFO L273 TraceCheckUtils]: 9: Hoare triple {8587#(<= 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; {8588#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:37,103 INFO L273 TraceCheckUtils]: 10: Hoare triple {8588#(<= 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; {8589#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:37,103 INFO L273 TraceCheckUtils]: 11: Hoare triple {8589#(<= 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; {8590#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:37,104 INFO L273 TraceCheckUtils]: 12: Hoare triple {8590#(<= 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; {8591#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:37,105 INFO L273 TraceCheckUtils]: 13: Hoare triple {8591#(<= 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; {8592#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:37,106 INFO L273 TraceCheckUtils]: 14: Hoare triple {8592#(<= 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; {8593#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:37,106 INFO L273 TraceCheckUtils]: 15: Hoare triple {8593#(<= 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; {8594#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:37,107 INFO L273 TraceCheckUtils]: 16: Hoare triple {8594#(<= 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; {8595#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:37,108 INFO L273 TraceCheckUtils]: 17: Hoare triple {8595#(<= 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; {8596#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:37,109 INFO L273 TraceCheckUtils]: 18: Hoare triple {8596#(<= 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; {8597#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:37,110 INFO L273 TraceCheckUtils]: 19: Hoare triple {8597#(<= 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; {8598#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:37,111 INFO L273 TraceCheckUtils]: 20: Hoare triple {8598#(<= 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; {8599#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:37,112 INFO L273 TraceCheckUtils]: 21: Hoare triple {8599#(<= 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; {8600#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:37,112 INFO L273 TraceCheckUtils]: 22: Hoare triple {8600#(<= 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; {8601#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:37,113 INFO L273 TraceCheckUtils]: 23: Hoare triple {8601#(<= 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; {8602#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:37,114 INFO L273 TraceCheckUtils]: 24: Hoare triple {8602#(<= 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; {8603#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:37,115 INFO L273 TraceCheckUtils]: 25: Hoare triple {8603#(<= main_~i~0 19)} assume !(~i~0 < 100000); {8583#false} is VALID [2018-11-23 12:03:37,115 INFO L273 TraceCheckUtils]: 26: Hoare triple {8583#false} ~i~0 := 0; {8583#false} is VALID [2018-11-23 12:03:37,115 INFO L273 TraceCheckUtils]: 27: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:37,116 INFO L273 TraceCheckUtils]: 28: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:37,116 INFO L273 TraceCheckUtils]: 29: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:37,116 INFO L273 TraceCheckUtils]: 30: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:37,116 INFO L273 TraceCheckUtils]: 31: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:37,116 INFO L273 TraceCheckUtils]: 32: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:37,117 INFO L273 TraceCheckUtils]: 33: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:37,117 INFO L273 TraceCheckUtils]: 34: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:37,117 INFO L273 TraceCheckUtils]: 35: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:37,117 INFO L273 TraceCheckUtils]: 36: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:37,117 INFO L273 TraceCheckUtils]: 37: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:37,118 INFO L273 TraceCheckUtils]: 38: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:37,118 INFO L273 TraceCheckUtils]: 39: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:37,118 INFO L273 TraceCheckUtils]: 40: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:37,118 INFO L273 TraceCheckUtils]: 41: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:37,118 INFO L273 TraceCheckUtils]: 42: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:37,119 INFO L273 TraceCheckUtils]: 43: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:37,119 INFO L273 TraceCheckUtils]: 44: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:37,119 INFO L273 TraceCheckUtils]: 45: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:37,119 INFO L273 TraceCheckUtils]: 46: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:37,119 INFO L273 TraceCheckUtils]: 47: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:37,119 INFO L273 TraceCheckUtils]: 48: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:37,119 INFO L273 TraceCheckUtils]: 49: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:37,119 INFO L273 TraceCheckUtils]: 50: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:37,119 INFO L273 TraceCheckUtils]: 51: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:37,120 INFO L273 TraceCheckUtils]: 52: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:37,120 INFO L273 TraceCheckUtils]: 53: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:37,120 INFO L273 TraceCheckUtils]: 54: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:37,120 INFO L273 TraceCheckUtils]: 55: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:37,120 INFO L273 TraceCheckUtils]: 56: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:37,120 INFO L273 TraceCheckUtils]: 57: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:37,120 INFO L273 TraceCheckUtils]: 58: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:37,120 INFO L273 TraceCheckUtils]: 59: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:37,121 INFO L273 TraceCheckUtils]: 60: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:37,121 INFO L273 TraceCheckUtils]: 61: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:37,121 INFO L273 TraceCheckUtils]: 62: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:37,121 INFO L273 TraceCheckUtils]: 63: Hoare triple {8583#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8583#false} is VALID [2018-11-23 12:03:37,121 INFO L273 TraceCheckUtils]: 64: Hoare triple {8583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8583#false} is VALID [2018-11-23 12:03:37,121 INFO L273 TraceCheckUtils]: 65: Hoare triple {8583#false} assume !(~i~0 < 100000); {8583#false} is VALID [2018-11-23 12:03:37,121 INFO L273 TraceCheckUtils]: 66: Hoare triple {8583#false} havoc ~x~0;~x~0 := 0; {8583#false} is VALID [2018-11-23 12:03:37,121 INFO L273 TraceCheckUtils]: 67: Hoare triple {8583#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {8583#false} is VALID [2018-11-23 12:03:37,121 INFO L256 TraceCheckUtils]: 68: Hoare triple {8583#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {8583#false} is VALID [2018-11-23 12:03:37,122 INFO L273 TraceCheckUtils]: 69: Hoare triple {8583#false} ~cond := #in~cond; {8583#false} is VALID [2018-11-23 12:03:37,122 INFO L273 TraceCheckUtils]: 70: Hoare triple {8583#false} assume 0 == ~cond; {8583#false} is VALID [2018-11-23 12:03:37,122 INFO L273 TraceCheckUtils]: 71: Hoare triple {8583#false} assume !false; {8583#false} is VALID [2018-11-23 12:03:37,124 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-11-23 12:03:37,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:37,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 12:03:37,144 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2018-11-23 12:03:37,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:37,144 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:03:37,172 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:37,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:03:37,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:03:37,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:03:37,173 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand 23 states. [2018-11-23 12:03:37,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:37,660 INFO L93 Difference]: Finished difference Result 132 states and 137 transitions. [2018-11-23 12:03:37,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 12:03:37,660 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2018-11-23 12:03:37,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:37,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:03:37,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 100 transitions. [2018-11-23 12:03:37,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:03:37,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 100 transitions. [2018-11-23 12:03:37,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 100 transitions. [2018-11-23 12:03:37,758 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:37,760 INFO L225 Difference]: With dead ends: 132 [2018-11-23 12:03:37,760 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 12:03:37,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:03:37,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 12:03:37,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-11-23 12:03:37,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:37,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 80 states. [2018-11-23 12:03:37,797 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 80 states. [2018-11-23 12:03:37,797 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 80 states. [2018-11-23 12:03:37,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:37,798 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2018-11-23 12:03:37,798 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2018-11-23 12:03:37,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:37,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:37,799 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 81 states. [2018-11-23 12:03:37,799 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 81 states. [2018-11-23 12:03:37,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:37,800 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2018-11-23 12:03:37,800 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2018-11-23 12:03:37,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:37,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:37,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:37,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:37,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 12:03:37,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-11-23 12:03:37,803 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 72 [2018-11-23 12:03:37,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:37,803 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-11-23 12:03:37,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:03:37,803 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-11-23 12:03:37,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 12:03:37,804 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:37,804 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:37,804 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:37,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:37,805 INFO L82 PathProgramCache]: Analyzing trace with hash 624158750, now seen corresponding path program 20 times [2018-11-23 12:03:37,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:37,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:37,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:37,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:03:37,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:38,209 INFO L256 TraceCheckUtils]: 0: Hoare triple {9315#true} call ULTIMATE.init(); {9315#true} is VALID [2018-11-23 12:03:38,209 INFO L273 TraceCheckUtils]: 1: Hoare triple {9315#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9315#true} is VALID [2018-11-23 12:03:38,209 INFO L273 TraceCheckUtils]: 2: Hoare triple {9315#true} assume true; {9315#true} is VALID [2018-11-23 12:03:38,209 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9315#true} {9315#true} #62#return; {9315#true} is VALID [2018-11-23 12:03:38,210 INFO L256 TraceCheckUtils]: 4: Hoare triple {9315#true} call #t~ret4 := main(); {9315#true} is VALID [2018-11-23 12:03:38,210 INFO L273 TraceCheckUtils]: 5: Hoare triple {9315#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9317#(= main_~i~0 0)} is VALID [2018-11-23 12:03:38,211 INFO L273 TraceCheckUtils]: 6: Hoare triple {9317#(= 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; {9318#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:38,212 INFO L273 TraceCheckUtils]: 7: Hoare triple {9318#(<= 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; {9319#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:38,213 INFO L273 TraceCheckUtils]: 8: Hoare triple {9319#(<= 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; {9320#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:38,213 INFO L273 TraceCheckUtils]: 9: Hoare triple {9320#(<= 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; {9321#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:38,214 INFO L273 TraceCheckUtils]: 10: Hoare triple {9321#(<= 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; {9322#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:38,215 INFO L273 TraceCheckUtils]: 11: Hoare triple {9322#(<= 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; {9323#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:38,216 INFO L273 TraceCheckUtils]: 12: Hoare triple {9323#(<= 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; {9324#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:38,217 INFO L273 TraceCheckUtils]: 13: Hoare triple {9324#(<= 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; {9325#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:38,218 INFO L273 TraceCheckUtils]: 14: Hoare triple {9325#(<= 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; {9326#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:38,219 INFO L273 TraceCheckUtils]: 15: Hoare triple {9326#(<= 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; {9327#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:38,220 INFO L273 TraceCheckUtils]: 16: Hoare triple {9327#(<= 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; {9328#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:38,221 INFO L273 TraceCheckUtils]: 17: Hoare triple {9328#(<= 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; {9329#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:38,221 INFO L273 TraceCheckUtils]: 18: Hoare triple {9329#(<= 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; {9330#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:38,222 INFO L273 TraceCheckUtils]: 19: Hoare triple {9330#(<= 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; {9331#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:38,223 INFO L273 TraceCheckUtils]: 20: Hoare triple {9331#(<= 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; {9332#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:38,224 INFO L273 TraceCheckUtils]: 21: Hoare triple {9332#(<= 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; {9333#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:38,225 INFO L273 TraceCheckUtils]: 22: Hoare triple {9333#(<= 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; {9334#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:38,226 INFO L273 TraceCheckUtils]: 23: Hoare triple {9334#(<= 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; {9335#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:38,227 INFO L273 TraceCheckUtils]: 24: Hoare triple {9335#(<= 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; {9336#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:38,228 INFO L273 TraceCheckUtils]: 25: Hoare triple {9336#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9337#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:38,228 INFO L273 TraceCheckUtils]: 26: Hoare triple {9337#(<= main_~i~0 20)} assume !(~i~0 < 100000); {9316#false} is VALID [2018-11-23 12:03:38,228 INFO L273 TraceCheckUtils]: 27: Hoare triple {9316#false} ~i~0 := 0; {9316#false} is VALID [2018-11-23 12:03:38,229 INFO L273 TraceCheckUtils]: 28: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,229 INFO L273 TraceCheckUtils]: 29: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,229 INFO L273 TraceCheckUtils]: 30: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,229 INFO L273 TraceCheckUtils]: 31: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,229 INFO L273 TraceCheckUtils]: 32: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,230 INFO L273 TraceCheckUtils]: 33: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,230 INFO L273 TraceCheckUtils]: 34: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,230 INFO L273 TraceCheckUtils]: 35: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,230 INFO L273 TraceCheckUtils]: 36: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,230 INFO L273 TraceCheckUtils]: 37: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,231 INFO L273 TraceCheckUtils]: 38: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,231 INFO L273 TraceCheckUtils]: 39: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,231 INFO L273 TraceCheckUtils]: 40: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,231 INFO L273 TraceCheckUtils]: 41: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,231 INFO L273 TraceCheckUtils]: 42: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,232 INFO L273 TraceCheckUtils]: 43: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,232 INFO L273 TraceCheckUtils]: 44: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,232 INFO L273 TraceCheckUtils]: 45: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,232 INFO L273 TraceCheckUtils]: 46: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,232 INFO L273 TraceCheckUtils]: 47: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,233 INFO L273 TraceCheckUtils]: 48: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,233 INFO L273 TraceCheckUtils]: 49: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,233 INFO L273 TraceCheckUtils]: 50: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,233 INFO L273 TraceCheckUtils]: 51: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,233 INFO L273 TraceCheckUtils]: 52: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,233 INFO L273 TraceCheckUtils]: 53: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,233 INFO L273 TraceCheckUtils]: 54: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,233 INFO L273 TraceCheckUtils]: 55: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,234 INFO L273 TraceCheckUtils]: 56: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,234 INFO L273 TraceCheckUtils]: 57: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,234 INFO L273 TraceCheckUtils]: 58: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,234 INFO L273 TraceCheckUtils]: 59: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,234 INFO L273 TraceCheckUtils]: 60: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,234 INFO L273 TraceCheckUtils]: 61: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,234 INFO L273 TraceCheckUtils]: 62: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,234 INFO L273 TraceCheckUtils]: 63: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,234 INFO L273 TraceCheckUtils]: 64: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,235 INFO L273 TraceCheckUtils]: 65: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,235 INFO L273 TraceCheckUtils]: 66: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,235 INFO L273 TraceCheckUtils]: 67: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,235 INFO L273 TraceCheckUtils]: 68: Hoare triple {9316#false} assume !(~i~0 < 100000); {9316#false} is VALID [2018-11-23 12:03:38,235 INFO L273 TraceCheckUtils]: 69: Hoare triple {9316#false} havoc ~x~0;~x~0 := 0; {9316#false} is VALID [2018-11-23 12:03:38,235 INFO L273 TraceCheckUtils]: 70: Hoare triple {9316#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {9316#false} is VALID [2018-11-23 12:03:38,235 INFO L256 TraceCheckUtils]: 71: Hoare triple {9316#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {9316#false} is VALID [2018-11-23 12:03:38,235 INFO L273 TraceCheckUtils]: 72: Hoare triple {9316#false} ~cond := #in~cond; {9316#false} is VALID [2018-11-23 12:03:38,236 INFO L273 TraceCheckUtils]: 73: Hoare triple {9316#false} assume 0 == ~cond; {9316#false} is VALID [2018-11-23 12:03:38,236 INFO L273 TraceCheckUtils]: 74: Hoare triple {9316#false} assume !false; {9316#false} is VALID [2018-11-23 12:03:38,238 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-11-23 12:03:38,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:38,239 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:38,247 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:03:38,284 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:03:38,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:38,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:38,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:38,516 INFO L256 TraceCheckUtils]: 0: Hoare triple {9315#true} call ULTIMATE.init(); {9315#true} is VALID [2018-11-23 12:03:38,516 INFO L273 TraceCheckUtils]: 1: Hoare triple {9315#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9315#true} is VALID [2018-11-23 12:03:38,517 INFO L273 TraceCheckUtils]: 2: Hoare triple {9315#true} assume true; {9315#true} is VALID [2018-11-23 12:03:38,517 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9315#true} {9315#true} #62#return; {9315#true} is VALID [2018-11-23 12:03:38,517 INFO L256 TraceCheckUtils]: 4: Hoare triple {9315#true} call #t~ret4 := main(); {9315#true} is VALID [2018-11-23 12:03:38,518 INFO L273 TraceCheckUtils]: 5: Hoare triple {9315#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9356#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:38,519 INFO L273 TraceCheckUtils]: 6: Hoare triple {9356#(<= 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; {9318#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:38,519 INFO L273 TraceCheckUtils]: 7: Hoare triple {9318#(<= 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; {9319#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:38,520 INFO L273 TraceCheckUtils]: 8: Hoare triple {9319#(<= 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; {9320#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:38,520 INFO L273 TraceCheckUtils]: 9: Hoare triple {9320#(<= 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; {9321#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:38,521 INFO L273 TraceCheckUtils]: 10: Hoare triple {9321#(<= 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; {9322#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:38,521 INFO L273 TraceCheckUtils]: 11: Hoare triple {9322#(<= 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; {9323#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:38,522 INFO L273 TraceCheckUtils]: 12: Hoare triple {9323#(<= 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; {9324#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:38,523 INFO L273 TraceCheckUtils]: 13: Hoare triple {9324#(<= 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; {9325#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:38,524 INFO L273 TraceCheckUtils]: 14: Hoare triple {9325#(<= 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; {9326#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:38,525 INFO L273 TraceCheckUtils]: 15: Hoare triple {9326#(<= 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; {9327#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:38,526 INFO L273 TraceCheckUtils]: 16: Hoare triple {9327#(<= 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; {9328#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:38,527 INFO L273 TraceCheckUtils]: 17: Hoare triple {9328#(<= 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; {9329#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:38,528 INFO L273 TraceCheckUtils]: 18: Hoare triple {9329#(<= 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; {9330#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:38,528 INFO L273 TraceCheckUtils]: 19: Hoare triple {9330#(<= 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; {9331#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:38,529 INFO L273 TraceCheckUtils]: 20: Hoare triple {9331#(<= 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; {9332#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:38,530 INFO L273 TraceCheckUtils]: 21: Hoare triple {9332#(<= 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; {9333#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:38,531 INFO L273 TraceCheckUtils]: 22: Hoare triple {9333#(<= 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; {9334#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:38,532 INFO L273 TraceCheckUtils]: 23: Hoare triple {9334#(<= 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; {9335#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:38,533 INFO L273 TraceCheckUtils]: 24: Hoare triple {9335#(<= 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; {9336#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:38,534 INFO L273 TraceCheckUtils]: 25: Hoare triple {9336#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9337#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:38,534 INFO L273 TraceCheckUtils]: 26: Hoare triple {9337#(<= main_~i~0 20)} assume !(~i~0 < 100000); {9316#false} is VALID [2018-11-23 12:03:38,535 INFO L273 TraceCheckUtils]: 27: Hoare triple {9316#false} ~i~0 := 0; {9316#false} is VALID [2018-11-23 12:03:38,535 INFO L273 TraceCheckUtils]: 28: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,535 INFO L273 TraceCheckUtils]: 29: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,535 INFO L273 TraceCheckUtils]: 30: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,535 INFO L273 TraceCheckUtils]: 31: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,536 INFO L273 TraceCheckUtils]: 32: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,536 INFO L273 TraceCheckUtils]: 33: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,536 INFO L273 TraceCheckUtils]: 34: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,536 INFO L273 TraceCheckUtils]: 35: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,536 INFO L273 TraceCheckUtils]: 36: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,537 INFO L273 TraceCheckUtils]: 37: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,537 INFO L273 TraceCheckUtils]: 38: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,537 INFO L273 TraceCheckUtils]: 39: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,537 INFO L273 TraceCheckUtils]: 40: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,537 INFO L273 TraceCheckUtils]: 41: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,538 INFO L273 TraceCheckUtils]: 42: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,538 INFO L273 TraceCheckUtils]: 43: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,538 INFO L273 TraceCheckUtils]: 44: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,538 INFO L273 TraceCheckUtils]: 45: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,538 INFO L273 TraceCheckUtils]: 46: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,539 INFO L273 TraceCheckUtils]: 47: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,539 INFO L273 TraceCheckUtils]: 48: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,539 INFO L273 TraceCheckUtils]: 49: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,539 INFO L273 TraceCheckUtils]: 50: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,539 INFO L273 TraceCheckUtils]: 51: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,539 INFO L273 TraceCheckUtils]: 52: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,540 INFO L273 TraceCheckUtils]: 53: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,540 INFO L273 TraceCheckUtils]: 54: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,540 INFO L273 TraceCheckUtils]: 55: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,540 INFO L273 TraceCheckUtils]: 56: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,540 INFO L273 TraceCheckUtils]: 57: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,540 INFO L273 TraceCheckUtils]: 58: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,540 INFO L273 TraceCheckUtils]: 59: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,540 INFO L273 TraceCheckUtils]: 60: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,540 INFO L273 TraceCheckUtils]: 61: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,541 INFO L273 TraceCheckUtils]: 62: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,541 INFO L273 TraceCheckUtils]: 63: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,541 INFO L273 TraceCheckUtils]: 64: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,541 INFO L273 TraceCheckUtils]: 65: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,541 INFO L273 TraceCheckUtils]: 66: Hoare triple {9316#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9316#false} is VALID [2018-11-23 12:03:38,541 INFO L273 TraceCheckUtils]: 67: Hoare triple {9316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9316#false} is VALID [2018-11-23 12:03:38,541 INFO L273 TraceCheckUtils]: 68: Hoare triple {9316#false} assume !(~i~0 < 100000); {9316#false} is VALID [2018-11-23 12:03:38,541 INFO L273 TraceCheckUtils]: 69: Hoare triple {9316#false} havoc ~x~0;~x~0 := 0; {9316#false} is VALID [2018-11-23 12:03:38,541 INFO L273 TraceCheckUtils]: 70: Hoare triple {9316#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {9316#false} is VALID [2018-11-23 12:03:38,542 INFO L256 TraceCheckUtils]: 71: Hoare triple {9316#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {9316#false} is VALID [2018-11-23 12:03:38,542 INFO L273 TraceCheckUtils]: 72: Hoare triple {9316#false} ~cond := #in~cond; {9316#false} is VALID [2018-11-23 12:03:38,542 INFO L273 TraceCheckUtils]: 73: Hoare triple {9316#false} assume 0 == ~cond; {9316#false} is VALID [2018-11-23 12:03:38,542 INFO L273 TraceCheckUtils]: 74: Hoare triple {9316#false} assume !false; {9316#false} is VALID [2018-11-23 12:03:38,545 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-11-23 12:03:38,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:38,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 12:03:38,564 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 75 [2018-11-23 12:03:38,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:38,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:03:38,592 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:38,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:03:38,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:03:38,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:03:38,593 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 24 states. [2018-11-23 12:03:39,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:39,556 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2018-11-23 12:03:39,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 12:03:39,556 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 75 [2018-11-23 12:03:39,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:39,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:03:39,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 103 transitions. [2018-11-23 12:03:39,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:03:39,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 103 transitions. [2018-11-23 12:03:39,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 103 transitions. [2018-11-23 12:03:39,679 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:39,681 INFO L225 Difference]: With dead ends: 137 [2018-11-23 12:03:39,681 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 12:03:39,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:03:39,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 12:03:39,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-11-23 12:03:39,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:39,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 83 states. [2018-11-23 12:03:39,723 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 83 states. [2018-11-23 12:03:39,723 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 83 states. [2018-11-23 12:03:39,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:39,724 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2018-11-23 12:03:39,725 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2018-11-23 12:03:39,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:39,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:39,725 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 84 states. [2018-11-23 12:03:39,725 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 84 states. [2018-11-23 12:03:39,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:39,726 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2018-11-23 12:03:39,726 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2018-11-23 12:03:39,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:39,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:39,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:39,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:39,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-23 12:03:39,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2018-11-23 12:03:39,728 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 75 [2018-11-23 12:03:39,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:39,728 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2018-11-23 12:03:39,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:03:39,728 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-11-23 12:03:39,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 12:03:39,729 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:39,729 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:39,729 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:39,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:39,730 INFO L82 PathProgramCache]: Analyzing trace with hash -2065851716, now seen corresponding path program 21 times [2018-11-23 12:03:39,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:39,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:39,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:39,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:39,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:40,270 INFO L256 TraceCheckUtils]: 0: Hoare triple {10077#true} call ULTIMATE.init(); {10077#true} is VALID [2018-11-23 12:03:40,271 INFO L273 TraceCheckUtils]: 1: Hoare triple {10077#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10077#true} is VALID [2018-11-23 12:03:40,271 INFO L273 TraceCheckUtils]: 2: Hoare triple {10077#true} assume true; {10077#true} is VALID [2018-11-23 12:03:40,271 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10077#true} {10077#true} #62#return; {10077#true} is VALID [2018-11-23 12:03:40,271 INFO L256 TraceCheckUtils]: 4: Hoare triple {10077#true} call #t~ret4 := main(); {10077#true} is VALID [2018-11-23 12:03:40,271 INFO L273 TraceCheckUtils]: 5: Hoare triple {10077#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10079#(= main_~i~0 0)} is VALID [2018-11-23 12:03:40,272 INFO L273 TraceCheckUtils]: 6: Hoare triple {10079#(= 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; {10080#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:40,272 INFO L273 TraceCheckUtils]: 7: Hoare triple {10080#(<= 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; {10081#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:40,273 INFO L273 TraceCheckUtils]: 8: Hoare triple {10081#(<= 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; {10082#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:40,274 INFO L273 TraceCheckUtils]: 9: Hoare triple {10082#(<= 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; {10083#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:40,275 INFO L273 TraceCheckUtils]: 10: Hoare triple {10083#(<= 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; {10084#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:40,276 INFO L273 TraceCheckUtils]: 11: Hoare triple {10084#(<= 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; {10085#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:40,277 INFO L273 TraceCheckUtils]: 12: Hoare triple {10085#(<= 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; {10086#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:40,277 INFO L273 TraceCheckUtils]: 13: Hoare triple {10086#(<= 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; {10087#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:40,278 INFO L273 TraceCheckUtils]: 14: Hoare triple {10087#(<= 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; {10088#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:40,279 INFO L273 TraceCheckUtils]: 15: Hoare triple {10088#(<= 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; {10089#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:40,280 INFO L273 TraceCheckUtils]: 16: Hoare triple {10089#(<= 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; {10090#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:40,281 INFO L273 TraceCheckUtils]: 17: Hoare triple {10090#(<= 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; {10091#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:40,282 INFO L273 TraceCheckUtils]: 18: Hoare triple {10091#(<= 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; {10092#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:40,283 INFO L273 TraceCheckUtils]: 19: Hoare triple {10092#(<= 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; {10093#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:40,283 INFO L273 TraceCheckUtils]: 20: Hoare triple {10093#(<= 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; {10094#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:40,284 INFO L273 TraceCheckUtils]: 21: Hoare triple {10094#(<= 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; {10095#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:40,285 INFO L273 TraceCheckUtils]: 22: Hoare triple {10095#(<= 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; {10096#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:40,286 INFO L273 TraceCheckUtils]: 23: Hoare triple {10096#(<= 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; {10097#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:40,287 INFO L273 TraceCheckUtils]: 24: Hoare triple {10097#(<= 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; {10098#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:40,288 INFO L273 TraceCheckUtils]: 25: Hoare triple {10098#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10099#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:40,289 INFO L273 TraceCheckUtils]: 26: Hoare triple {10099#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10100#(<= main_~i~0 21)} is VALID [2018-11-23 12:03:40,289 INFO L273 TraceCheckUtils]: 27: Hoare triple {10100#(<= main_~i~0 21)} assume !(~i~0 < 100000); {10078#false} is VALID [2018-11-23 12:03:40,290 INFO L273 TraceCheckUtils]: 28: Hoare triple {10078#false} ~i~0 := 0; {10078#false} is VALID [2018-11-23 12:03:40,290 INFO L273 TraceCheckUtils]: 29: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:40,290 INFO L273 TraceCheckUtils]: 30: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:40,290 INFO L273 TraceCheckUtils]: 31: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:40,290 INFO L273 TraceCheckUtils]: 32: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:40,290 INFO L273 TraceCheckUtils]: 33: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:40,291 INFO L273 TraceCheckUtils]: 34: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:40,291 INFO L273 TraceCheckUtils]: 35: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:40,291 INFO L273 TraceCheckUtils]: 36: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:40,291 INFO L273 TraceCheckUtils]: 37: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:40,291 INFO L273 TraceCheckUtils]: 38: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:40,292 INFO L273 TraceCheckUtils]: 39: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:40,292 INFO L273 TraceCheckUtils]: 40: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:40,292 INFO L273 TraceCheckUtils]: 41: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:40,292 INFO L273 TraceCheckUtils]: 42: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:40,292 INFO L273 TraceCheckUtils]: 43: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:40,292 INFO L273 TraceCheckUtils]: 44: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:40,293 INFO L273 TraceCheckUtils]: 45: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:40,293 INFO L273 TraceCheckUtils]: 46: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:40,293 INFO L273 TraceCheckUtils]: 47: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:40,293 INFO L273 TraceCheckUtils]: 48: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:40,293 INFO L273 TraceCheckUtils]: 49: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:40,294 INFO L273 TraceCheckUtils]: 50: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:40,294 INFO L273 TraceCheckUtils]: 51: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:40,294 INFO L273 TraceCheckUtils]: 52: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:40,294 INFO L273 TraceCheckUtils]: 53: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:40,294 INFO L273 TraceCheckUtils]: 54: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:40,294 INFO L273 TraceCheckUtils]: 55: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:40,294 INFO L273 TraceCheckUtils]: 56: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:40,294 INFO L273 TraceCheckUtils]: 57: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:40,295 INFO L273 TraceCheckUtils]: 58: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:40,295 INFO L273 TraceCheckUtils]: 59: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:40,295 INFO L273 TraceCheckUtils]: 60: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:40,295 INFO L273 TraceCheckUtils]: 61: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:40,295 INFO L273 TraceCheckUtils]: 62: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:40,295 INFO L273 TraceCheckUtils]: 63: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:40,295 INFO L273 TraceCheckUtils]: 64: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:40,295 INFO L273 TraceCheckUtils]: 65: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:40,295 INFO L273 TraceCheckUtils]: 66: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:40,296 INFO L273 TraceCheckUtils]: 67: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:40,296 INFO L273 TraceCheckUtils]: 68: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:40,296 INFO L273 TraceCheckUtils]: 69: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:40,296 INFO L273 TraceCheckUtils]: 70: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:40,296 INFO L273 TraceCheckUtils]: 71: Hoare triple {10078#false} assume !(~i~0 < 100000); {10078#false} is VALID [2018-11-23 12:03:40,296 INFO L273 TraceCheckUtils]: 72: Hoare triple {10078#false} havoc ~x~0;~x~0 := 0; {10078#false} is VALID [2018-11-23 12:03:40,296 INFO L273 TraceCheckUtils]: 73: Hoare triple {10078#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {10078#false} is VALID [2018-11-23 12:03:40,296 INFO L256 TraceCheckUtils]: 74: Hoare triple {10078#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {10078#false} is VALID [2018-11-23 12:03:40,296 INFO L273 TraceCheckUtils]: 75: Hoare triple {10078#false} ~cond := #in~cond; {10078#false} is VALID [2018-11-23 12:03:40,297 INFO L273 TraceCheckUtils]: 76: Hoare triple {10078#false} assume 0 == ~cond; {10078#false} is VALID [2018-11-23 12:03:40,297 INFO L273 TraceCheckUtils]: 77: Hoare triple {10078#false} assume !false; {10078#false} is VALID [2018-11-23 12:03:40,300 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2018-11-23 12:03:40,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:40,300 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:40,308 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:03:45,231 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-23 12:03:45,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:45,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:45,444 INFO L256 TraceCheckUtils]: 0: Hoare triple {10077#true} call ULTIMATE.init(); {10077#true} is VALID [2018-11-23 12:03:45,445 INFO L273 TraceCheckUtils]: 1: Hoare triple {10077#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10077#true} is VALID [2018-11-23 12:03:45,445 INFO L273 TraceCheckUtils]: 2: Hoare triple {10077#true} assume true; {10077#true} is VALID [2018-11-23 12:03:45,445 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10077#true} {10077#true} #62#return; {10077#true} is VALID [2018-11-23 12:03:45,445 INFO L256 TraceCheckUtils]: 4: Hoare triple {10077#true} call #t~ret4 := main(); {10077#true} is VALID [2018-11-23 12:03:45,446 INFO L273 TraceCheckUtils]: 5: Hoare triple {10077#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10119#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:45,447 INFO L273 TraceCheckUtils]: 6: Hoare triple {10119#(<= 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; {10080#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:45,448 INFO L273 TraceCheckUtils]: 7: Hoare triple {10080#(<= 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; {10081#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:45,448 INFO L273 TraceCheckUtils]: 8: Hoare triple {10081#(<= 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; {10082#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:45,449 INFO L273 TraceCheckUtils]: 9: Hoare triple {10082#(<= 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; {10083#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:45,449 INFO L273 TraceCheckUtils]: 10: Hoare triple {10083#(<= 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; {10084#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:45,450 INFO L273 TraceCheckUtils]: 11: Hoare triple {10084#(<= 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; {10085#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:45,451 INFO L273 TraceCheckUtils]: 12: Hoare triple {10085#(<= 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; {10086#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:45,452 INFO L273 TraceCheckUtils]: 13: Hoare triple {10086#(<= 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; {10087#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:45,453 INFO L273 TraceCheckUtils]: 14: Hoare triple {10087#(<= 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; {10088#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:45,454 INFO L273 TraceCheckUtils]: 15: Hoare triple {10088#(<= 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; {10089#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:45,455 INFO L273 TraceCheckUtils]: 16: Hoare triple {10089#(<= 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; {10090#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:45,455 INFO L273 TraceCheckUtils]: 17: Hoare triple {10090#(<= 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; {10091#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:45,456 INFO L273 TraceCheckUtils]: 18: Hoare triple {10091#(<= 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; {10092#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:45,457 INFO L273 TraceCheckUtils]: 19: Hoare triple {10092#(<= 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; {10093#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:45,458 INFO L273 TraceCheckUtils]: 20: Hoare triple {10093#(<= 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; {10094#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:45,459 INFO L273 TraceCheckUtils]: 21: Hoare triple {10094#(<= 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; {10095#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:45,460 INFO L273 TraceCheckUtils]: 22: Hoare triple {10095#(<= 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; {10096#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:45,461 INFO L273 TraceCheckUtils]: 23: Hoare triple {10096#(<= 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; {10097#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:45,462 INFO L273 TraceCheckUtils]: 24: Hoare triple {10097#(<= 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; {10098#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:45,463 INFO L273 TraceCheckUtils]: 25: Hoare triple {10098#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10099#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:45,464 INFO L273 TraceCheckUtils]: 26: Hoare triple {10099#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10100#(<= main_~i~0 21)} is VALID [2018-11-23 12:03:45,464 INFO L273 TraceCheckUtils]: 27: Hoare triple {10100#(<= main_~i~0 21)} assume !(~i~0 < 100000); {10078#false} is VALID [2018-11-23 12:03:45,464 INFO L273 TraceCheckUtils]: 28: Hoare triple {10078#false} ~i~0 := 0; {10078#false} is VALID [2018-11-23 12:03:45,465 INFO L273 TraceCheckUtils]: 29: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:45,465 INFO L273 TraceCheckUtils]: 30: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:45,465 INFO L273 TraceCheckUtils]: 31: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:45,465 INFO L273 TraceCheckUtils]: 32: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:45,465 INFO L273 TraceCheckUtils]: 33: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:45,466 INFO L273 TraceCheckUtils]: 34: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:45,466 INFO L273 TraceCheckUtils]: 35: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:45,466 INFO L273 TraceCheckUtils]: 36: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:45,466 INFO L273 TraceCheckUtils]: 37: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:45,466 INFO L273 TraceCheckUtils]: 38: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:45,467 INFO L273 TraceCheckUtils]: 39: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:45,467 INFO L273 TraceCheckUtils]: 40: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:45,467 INFO L273 TraceCheckUtils]: 41: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:45,467 INFO L273 TraceCheckUtils]: 42: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:45,467 INFO L273 TraceCheckUtils]: 43: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:45,467 INFO L273 TraceCheckUtils]: 44: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:45,468 INFO L273 TraceCheckUtils]: 45: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:45,468 INFO L273 TraceCheckUtils]: 46: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:45,468 INFO L273 TraceCheckUtils]: 47: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:45,468 INFO L273 TraceCheckUtils]: 48: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:45,468 INFO L273 TraceCheckUtils]: 49: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:45,469 INFO L273 TraceCheckUtils]: 50: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:45,469 INFO L273 TraceCheckUtils]: 51: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:45,469 INFO L273 TraceCheckUtils]: 52: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:45,469 INFO L273 TraceCheckUtils]: 53: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:45,469 INFO L273 TraceCheckUtils]: 54: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:45,469 INFO L273 TraceCheckUtils]: 55: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:45,469 INFO L273 TraceCheckUtils]: 56: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:45,469 INFO L273 TraceCheckUtils]: 57: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:45,469 INFO L273 TraceCheckUtils]: 58: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:45,470 INFO L273 TraceCheckUtils]: 59: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:45,470 INFO L273 TraceCheckUtils]: 60: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:45,470 INFO L273 TraceCheckUtils]: 61: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:45,470 INFO L273 TraceCheckUtils]: 62: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:45,470 INFO L273 TraceCheckUtils]: 63: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:45,470 INFO L273 TraceCheckUtils]: 64: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:45,470 INFO L273 TraceCheckUtils]: 65: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:45,470 INFO L273 TraceCheckUtils]: 66: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:45,470 INFO L273 TraceCheckUtils]: 67: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:45,471 INFO L273 TraceCheckUtils]: 68: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:45,471 INFO L273 TraceCheckUtils]: 69: Hoare triple {10078#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10078#false} is VALID [2018-11-23 12:03:45,471 INFO L273 TraceCheckUtils]: 70: Hoare triple {10078#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10078#false} is VALID [2018-11-23 12:03:45,471 INFO L273 TraceCheckUtils]: 71: Hoare triple {10078#false} assume !(~i~0 < 100000); {10078#false} is VALID [2018-11-23 12:03:45,471 INFO L273 TraceCheckUtils]: 72: Hoare triple {10078#false} havoc ~x~0;~x~0 := 0; {10078#false} is VALID [2018-11-23 12:03:45,471 INFO L273 TraceCheckUtils]: 73: Hoare triple {10078#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {10078#false} is VALID [2018-11-23 12:03:45,471 INFO L256 TraceCheckUtils]: 74: Hoare triple {10078#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {10078#false} is VALID [2018-11-23 12:03:45,471 INFO L273 TraceCheckUtils]: 75: Hoare triple {10078#false} ~cond := #in~cond; {10078#false} is VALID [2018-11-23 12:03:45,472 INFO L273 TraceCheckUtils]: 76: Hoare triple {10078#false} assume 0 == ~cond; {10078#false} is VALID [2018-11-23 12:03:45,472 INFO L273 TraceCheckUtils]: 77: Hoare triple {10078#false} assume !false; {10078#false} is VALID [2018-11-23 12:03:45,475 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2018-11-23 12:03:45,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:45,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-23 12:03:45,497 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 78 [2018-11-23 12:03:45,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:45,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 12:03:45,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:45,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 12:03:45,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 12:03:45,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:03:45,528 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 25 states. [2018-11-23 12:03:46,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:46,092 INFO L93 Difference]: Finished difference Result 142 states and 147 transitions. [2018-11-23 12:03:46,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 12:03:46,092 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 78 [2018-11-23 12:03:46,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:46,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:03:46,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 106 transitions. [2018-11-23 12:03:46,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:03:46,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 106 transitions. [2018-11-23 12:03:46,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 106 transitions. [2018-11-23 12:03:46,249 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:46,251 INFO L225 Difference]: With dead ends: 142 [2018-11-23 12:03:46,251 INFO L226 Difference]: Without dead ends: 87 [2018-11-23 12:03:46,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:03:46,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-23 12:03:46,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-11-23 12:03:46,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:46,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 86 states. [2018-11-23 12:03:46,297 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 86 states. [2018-11-23 12:03:46,297 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 86 states. [2018-11-23 12:03:46,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:46,299 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2018-11-23 12:03:46,299 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2018-11-23 12:03:46,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:46,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:46,300 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 87 states. [2018-11-23 12:03:46,300 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 87 states. [2018-11-23 12:03:46,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:46,301 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2018-11-23 12:03:46,301 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2018-11-23 12:03:46,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:46,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:46,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:46,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:46,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 12:03:46,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2018-11-23 12:03:46,304 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 78 [2018-11-23 12:03:46,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:46,304 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2018-11-23 12:03:46,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 12:03:46,304 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2018-11-23 12:03:46,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 12:03:46,305 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:46,305 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:46,305 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:46,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:46,306 INFO L82 PathProgramCache]: Analyzing trace with hash -2097923046, now seen corresponding path program 22 times [2018-11-23 12:03:46,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:46,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:46,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:46,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:46,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:47,022 INFO L256 TraceCheckUtils]: 0: Hoare triple {10868#true} call ULTIMATE.init(); {10868#true} is VALID [2018-11-23 12:03:47,022 INFO L273 TraceCheckUtils]: 1: Hoare triple {10868#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10868#true} is VALID [2018-11-23 12:03:47,022 INFO L273 TraceCheckUtils]: 2: Hoare triple {10868#true} assume true; {10868#true} is VALID [2018-11-23 12:03:47,022 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10868#true} {10868#true} #62#return; {10868#true} is VALID [2018-11-23 12:03:47,022 INFO L256 TraceCheckUtils]: 4: Hoare triple {10868#true} call #t~ret4 := main(); {10868#true} is VALID [2018-11-23 12:03:47,023 INFO L273 TraceCheckUtils]: 5: Hoare triple {10868#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10870#(= main_~i~0 0)} is VALID [2018-11-23 12:03:47,024 INFO L273 TraceCheckUtils]: 6: Hoare triple {10870#(= 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; {10871#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:47,025 INFO L273 TraceCheckUtils]: 7: Hoare triple {10871#(<= 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; {10872#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:47,025 INFO L273 TraceCheckUtils]: 8: Hoare triple {10872#(<= 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; {10873#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:47,026 INFO L273 TraceCheckUtils]: 9: Hoare triple {10873#(<= 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; {10874#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:47,027 INFO L273 TraceCheckUtils]: 10: Hoare triple {10874#(<= 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; {10875#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:47,028 INFO L273 TraceCheckUtils]: 11: Hoare triple {10875#(<= 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; {10876#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:47,029 INFO L273 TraceCheckUtils]: 12: Hoare triple {10876#(<= 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; {10877#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:47,030 INFO L273 TraceCheckUtils]: 13: Hoare triple {10877#(<= 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; {10878#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:47,031 INFO L273 TraceCheckUtils]: 14: Hoare triple {10878#(<= 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; {10879#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:47,032 INFO L273 TraceCheckUtils]: 15: Hoare triple {10879#(<= 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; {10880#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:47,032 INFO L273 TraceCheckUtils]: 16: Hoare triple {10880#(<= 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; {10881#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:47,033 INFO L273 TraceCheckUtils]: 17: Hoare triple {10881#(<= 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; {10882#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:47,034 INFO L273 TraceCheckUtils]: 18: Hoare triple {10882#(<= 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; {10883#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:47,035 INFO L273 TraceCheckUtils]: 19: Hoare triple {10883#(<= 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; {10884#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:47,036 INFO L273 TraceCheckUtils]: 20: Hoare triple {10884#(<= 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; {10885#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:47,037 INFO L273 TraceCheckUtils]: 21: Hoare triple {10885#(<= 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; {10886#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:47,038 INFO L273 TraceCheckUtils]: 22: Hoare triple {10886#(<= 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; {10887#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:47,038 INFO L273 TraceCheckUtils]: 23: Hoare triple {10887#(<= 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; {10888#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:47,039 INFO L273 TraceCheckUtils]: 24: Hoare triple {10888#(<= 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; {10889#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:47,040 INFO L273 TraceCheckUtils]: 25: Hoare triple {10889#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10890#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:47,041 INFO L273 TraceCheckUtils]: 26: Hoare triple {10890#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10891#(<= main_~i~0 21)} is VALID [2018-11-23 12:03:47,042 INFO L273 TraceCheckUtils]: 27: Hoare triple {10891#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10892#(<= main_~i~0 22)} is VALID [2018-11-23 12:03:47,043 INFO L273 TraceCheckUtils]: 28: Hoare triple {10892#(<= main_~i~0 22)} assume !(~i~0 < 100000); {10869#false} is VALID [2018-11-23 12:03:47,043 INFO L273 TraceCheckUtils]: 29: Hoare triple {10869#false} ~i~0 := 0; {10869#false} is VALID [2018-11-23 12:03:47,043 INFO L273 TraceCheckUtils]: 30: Hoare triple {10869#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10869#false} is VALID [2018-11-23 12:03:47,043 INFO L273 TraceCheckUtils]: 31: Hoare triple {10869#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10869#false} is VALID [2018-11-23 12:03:47,043 INFO L273 TraceCheckUtils]: 32: Hoare triple {10869#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10869#false} is VALID [2018-11-23 12:03:47,044 INFO L273 TraceCheckUtils]: 33: Hoare triple {10869#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10869#false} is VALID [2018-11-23 12:03:47,044 INFO L273 TraceCheckUtils]: 34: Hoare triple {10869#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10869#false} is VALID [2018-11-23 12:03:47,044 INFO L273 TraceCheckUtils]: 35: Hoare triple {10869#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10869#false} is VALID [2018-11-23 12:03:47,044 INFO L273 TraceCheckUtils]: 36: Hoare triple {10869#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10869#false} is VALID [2018-11-23 12:03:47,044 INFO L273 TraceCheckUtils]: 37: Hoare triple {10869#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10869#false} is VALID [2018-11-23 12:03:47,045 INFO L273 TraceCheckUtils]: 38: Hoare triple {10869#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10869#false} is VALID [2018-11-23 12:03:47,045 INFO L273 TraceCheckUtils]: 39: Hoare triple {10869#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10869#false} is VALID [2018-11-23 12:03:47,045 INFO L273 TraceCheckUtils]: 40: Hoare triple {10869#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10869#false} is VALID [2018-11-23 12:03:47,045 INFO L273 TraceCheckUtils]: 41: Hoare triple {10869#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10869#false} is VALID [2018-11-23 12:03:47,045 INFO L273 TraceCheckUtils]: 42: Hoare triple {10869#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10869#false} is VALID [2018-11-23 12:03:47,046 INFO L273 TraceCheckUtils]: 43: Hoare triple {10869#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10869#false} is VALID [2018-11-23 12:03:47,046 INFO L273 TraceCheckUtils]: 44: Hoare triple {10869#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10869#false} is VALID [2018-11-23 12:03:47,046 INFO L273 TraceCheckUtils]: 45: Hoare triple {10869#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10869#false} is VALID [2018-11-23 12:03:47,046 INFO L273 TraceCheckUtils]: 46: Hoare triple {10869#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10869#false} is VALID [2018-11-23 12:03:47,046 INFO L273 TraceCheckUtils]: 47: Hoare triple {10869#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10869#false} is VALID [2018-11-23 12:03:47,047 INFO L273 TraceCheckUtils]: 48: Hoare triple {10869#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10869#false} is VALID [2018-11-23 12:03:47,047 INFO L273 TraceCheckUtils]: 49: Hoare triple {10869#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10869#false} is VALID [2018-11-23 12:03:47,047 INFO L273 TraceCheckUtils]: 50: Hoare triple {10869#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10869#false} is VALID [2018-11-23 12:03:47,047 INFO L273 TraceCheckUtils]: 51: Hoare triple {10869#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10869#false} is VALID [2018-11-23 12:03:47,047 INFO L273 TraceCheckUtils]: 52: Hoare triple {10869#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10869#false} is VALID [2018-11-23 12:03:47,047 INFO L273 TraceCheckUtils]: 53: Hoare triple {10869#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10869#false} is VALID [2018-11-23 12:03:47,048 INFO L273 TraceCheckUtils]: 54: Hoare triple {10869#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10869#false} is VALID [2018-11-23 12:03:47,048 INFO L273 TraceCheckUtils]: 55: Hoare triple {10869#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10869#false} is VALID [2018-11-23 12:03:47,048 INFO L273 TraceCheckUtils]: 56: Hoare triple {10869#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10869#false} is VALID [2018-11-23 12:03:47,048 INFO L273 TraceCheckUtils]: 57: Hoare triple {10869#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10869#false} is VALID [2018-11-23 12:03:47,048 INFO L273 TraceCheckUtils]: 58: Hoare triple {10869#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10869#false} is VALID [2018-11-23 12:03:47,048 INFO L273 TraceCheckUtils]: 59: Hoare triple {10869#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10869#false} is VALID [2018-11-23 12:03:47,048 INFO L273 TraceCheckUtils]: 60: Hoare triple {10869#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10869#false} is VALID [2018-11-23 12:03:47,048 INFO L273 TraceCheckUtils]: 61: Hoare triple {10869#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10869#false} is VALID [2018-11-23 12:03:47,049 INFO L273 TraceCheckUtils]: 62: Hoare triple {10869#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10869#false} is VALID [2018-11-23 12:03:47,049 INFO L273 TraceCheckUtils]: 63: Hoare triple {10869#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10869#false} is VALID [2018-11-23 12:03:47,049 INFO L273 TraceCheckUtils]: 64: Hoare triple {10869#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10869#false} is VALID [2018-11-23 12:03:47,049 INFO L273 TraceCheckUtils]: 65: Hoare triple {10869#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10869#false} is VALID [2018-11-23 12:03:47,049 INFO L273 TraceCheckUtils]: 66: Hoare triple {10869#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10869#false} is VALID [2018-11-23 12:03:47,049 INFO L273 TraceCheckUtils]: 67: Hoare triple {10869#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10869#false} is VALID [2018-11-23 12:03:47,049 INFO L273 TraceCheckUtils]: 68: Hoare triple {10869#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10869#false} is VALID [2018-11-23 12:03:47,049 INFO L273 TraceCheckUtils]: 69: Hoare triple {10869#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10869#false} is VALID [2018-11-23 12:03:47,049 INFO L273 TraceCheckUtils]: 70: Hoare triple {10869#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10869#false} is VALID [2018-11-23 12:03:47,050 INFO L273 TraceCheckUtils]: 71: Hoare triple {10869#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10869#false} is VALID [2018-11-23 12:03:47,050 INFO L273 TraceCheckUtils]: 72: Hoare triple {10869#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10869#false} is VALID [2018-11-23 12:03:47,050 INFO L273 TraceCheckUtils]: 73: Hoare triple {10869#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10869#false} is VALID [2018-11-23 12:03:47,050 INFO L273 TraceCheckUtils]: 74: Hoare triple {10869#false} assume !(~i~0 < 100000); {10869#false} is VALID [2018-11-23 12:03:47,050 INFO L273 TraceCheckUtils]: 75: Hoare triple {10869#false} havoc ~x~0;~x~0 := 0; {10869#false} is VALID [2018-11-23 12:03:47,050 INFO L273 TraceCheckUtils]: 76: Hoare triple {10869#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {10869#false} is VALID [2018-11-23 12:03:47,050 INFO L256 TraceCheckUtils]: 77: Hoare triple {10869#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {10869#false} is VALID [2018-11-23 12:03:47,050 INFO L273 TraceCheckUtils]: 78: Hoare triple {10869#false} ~cond := #in~cond; {10869#false} is VALID [2018-11-23 12:03:47,050 INFO L273 TraceCheckUtils]: 79: Hoare triple {10869#false} assume 0 == ~cond; {10869#false} is VALID [2018-11-23 12:03:47,051 INFO L273 TraceCheckUtils]: 80: Hoare triple {10869#false} assume !false; {10869#false} is VALID [2018-11-23 12:03:47,054 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2018-11-23 12:03:47,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:47,054 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:47,062 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:03:47,101 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:03:47,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:47,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:47,300 INFO L256 TraceCheckUtils]: 0: Hoare triple {10868#true} call ULTIMATE.init(); {10868#true} is VALID [2018-11-23 12:03:47,300 INFO L273 TraceCheckUtils]: 1: Hoare triple {10868#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10868#true} is VALID [2018-11-23 12:03:47,301 INFO L273 TraceCheckUtils]: 2: Hoare triple {10868#true} assume true; {10868#true} is VALID [2018-11-23 12:03:47,301 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10868#true} {10868#true} #62#return; {10868#true} is VALID [2018-11-23 12:03:47,301 INFO L256 TraceCheckUtils]: 4: Hoare triple {10868#true} call #t~ret4 := main(); {10868#true} is VALID [2018-11-23 12:03:47,301 INFO L273 TraceCheckUtils]: 5: Hoare triple {10868#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10868#true} is VALID [2018-11-23 12:03:47,301 INFO L273 TraceCheckUtils]: 6: Hoare triple {10868#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10868#true} is VALID [2018-11-23 12:03:47,302 INFO L273 TraceCheckUtils]: 7: Hoare triple {10868#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10868#true} is VALID [2018-11-23 12:03:47,302 INFO L273 TraceCheckUtils]: 8: Hoare triple {10868#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10868#true} is VALID [2018-11-23 12:03:47,302 INFO L273 TraceCheckUtils]: 9: Hoare triple {10868#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10868#true} is VALID [2018-11-23 12:03:47,302 INFO L273 TraceCheckUtils]: 10: Hoare triple {10868#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10868#true} is VALID [2018-11-23 12:03:47,302 INFO L273 TraceCheckUtils]: 11: Hoare triple {10868#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10868#true} is VALID [2018-11-23 12:03:47,303 INFO L273 TraceCheckUtils]: 12: Hoare triple {10868#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10868#true} is VALID [2018-11-23 12:03:47,303 INFO L273 TraceCheckUtils]: 13: Hoare triple {10868#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10868#true} is VALID [2018-11-23 12:03:47,303 INFO L273 TraceCheckUtils]: 14: Hoare triple {10868#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10868#true} is VALID [2018-11-23 12:03:47,303 INFO L273 TraceCheckUtils]: 15: Hoare triple {10868#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10868#true} is VALID [2018-11-23 12:03:47,303 INFO L273 TraceCheckUtils]: 16: Hoare triple {10868#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10868#true} is VALID [2018-11-23 12:03:47,303 INFO L273 TraceCheckUtils]: 17: Hoare triple {10868#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10868#true} is VALID [2018-11-23 12:03:47,303 INFO L273 TraceCheckUtils]: 18: Hoare triple {10868#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10868#true} is VALID [2018-11-23 12:03:47,303 INFO L273 TraceCheckUtils]: 19: Hoare triple {10868#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10868#true} is VALID [2018-11-23 12:03:47,304 INFO L273 TraceCheckUtils]: 20: Hoare triple {10868#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10868#true} is VALID [2018-11-23 12:03:47,304 INFO L273 TraceCheckUtils]: 21: Hoare triple {10868#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10868#true} is VALID [2018-11-23 12:03:47,304 INFO L273 TraceCheckUtils]: 22: Hoare triple {10868#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10868#true} is VALID [2018-11-23 12:03:47,304 INFO L273 TraceCheckUtils]: 23: Hoare triple {10868#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10868#true} is VALID [2018-11-23 12:03:47,304 INFO L273 TraceCheckUtils]: 24: Hoare triple {10868#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10868#true} is VALID [2018-11-23 12:03:47,304 INFO L273 TraceCheckUtils]: 25: Hoare triple {10868#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10868#true} is VALID [2018-11-23 12:03:47,304 INFO L273 TraceCheckUtils]: 26: Hoare triple {10868#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10868#true} is VALID [2018-11-23 12:03:47,304 INFO L273 TraceCheckUtils]: 27: Hoare triple {10868#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10868#true} is VALID [2018-11-23 12:03:47,304 INFO L273 TraceCheckUtils]: 28: Hoare triple {10868#true} assume !(~i~0 < 100000); {10868#true} is VALID [2018-11-23 12:03:47,305 INFO L273 TraceCheckUtils]: 29: Hoare triple {10868#true} ~i~0 := 0; {10983#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:47,305 INFO L273 TraceCheckUtils]: 30: Hoare triple {10983#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10983#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:47,306 INFO L273 TraceCheckUtils]: 31: Hoare triple {10983#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10871#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:47,306 INFO L273 TraceCheckUtils]: 32: Hoare triple {10871#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10871#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:47,306 INFO L273 TraceCheckUtils]: 33: Hoare triple {10871#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10872#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:47,307 INFO L273 TraceCheckUtils]: 34: Hoare triple {10872#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10872#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:47,307 INFO L273 TraceCheckUtils]: 35: Hoare triple {10872#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10873#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:47,308 INFO L273 TraceCheckUtils]: 36: Hoare triple {10873#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10873#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:47,308 INFO L273 TraceCheckUtils]: 37: Hoare triple {10873#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10874#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:47,308 INFO L273 TraceCheckUtils]: 38: Hoare triple {10874#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10874#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:47,309 INFO L273 TraceCheckUtils]: 39: Hoare triple {10874#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10875#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:47,310 INFO L273 TraceCheckUtils]: 40: Hoare triple {10875#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10875#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:47,310 INFO L273 TraceCheckUtils]: 41: Hoare triple {10875#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10876#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:47,311 INFO L273 TraceCheckUtils]: 42: Hoare triple {10876#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10876#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:47,312 INFO L273 TraceCheckUtils]: 43: Hoare triple {10876#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10877#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:47,312 INFO L273 TraceCheckUtils]: 44: Hoare triple {10877#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10877#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:47,313 INFO L273 TraceCheckUtils]: 45: Hoare triple {10877#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10878#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:47,313 INFO L273 TraceCheckUtils]: 46: Hoare triple {10878#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10878#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:47,314 INFO L273 TraceCheckUtils]: 47: Hoare triple {10878#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10879#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:47,314 INFO L273 TraceCheckUtils]: 48: Hoare triple {10879#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10879#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:47,315 INFO L273 TraceCheckUtils]: 49: Hoare triple {10879#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10880#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:47,316 INFO L273 TraceCheckUtils]: 50: Hoare triple {10880#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10880#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:47,316 INFO L273 TraceCheckUtils]: 51: Hoare triple {10880#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10881#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:47,317 INFO L273 TraceCheckUtils]: 52: Hoare triple {10881#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10881#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:47,318 INFO L273 TraceCheckUtils]: 53: Hoare triple {10881#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10882#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:47,318 INFO L273 TraceCheckUtils]: 54: Hoare triple {10882#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10882#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:47,319 INFO L273 TraceCheckUtils]: 55: Hoare triple {10882#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10883#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:47,319 INFO L273 TraceCheckUtils]: 56: Hoare triple {10883#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10883#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:47,320 INFO L273 TraceCheckUtils]: 57: Hoare triple {10883#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10884#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:47,320 INFO L273 TraceCheckUtils]: 58: Hoare triple {10884#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10884#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:47,321 INFO L273 TraceCheckUtils]: 59: Hoare triple {10884#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10885#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:47,322 INFO L273 TraceCheckUtils]: 60: Hoare triple {10885#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10885#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:47,323 INFO L273 TraceCheckUtils]: 61: Hoare triple {10885#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10886#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:47,324 INFO L273 TraceCheckUtils]: 62: Hoare triple {10886#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10886#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:47,324 INFO L273 TraceCheckUtils]: 63: Hoare triple {10886#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10887#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:47,324 INFO L273 TraceCheckUtils]: 64: Hoare triple {10887#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10887#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:47,325 INFO L273 TraceCheckUtils]: 65: Hoare triple {10887#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10888#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:47,325 INFO L273 TraceCheckUtils]: 66: Hoare triple {10888#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10888#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:47,326 INFO L273 TraceCheckUtils]: 67: Hoare triple {10888#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10889#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:47,326 INFO L273 TraceCheckUtils]: 68: Hoare triple {10889#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10889#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:47,326 INFO L273 TraceCheckUtils]: 69: Hoare triple {10889#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10890#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:47,327 INFO L273 TraceCheckUtils]: 70: Hoare triple {10890#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10890#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:47,327 INFO L273 TraceCheckUtils]: 71: Hoare triple {10890#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10891#(<= main_~i~0 21)} is VALID [2018-11-23 12:03:47,328 INFO L273 TraceCheckUtils]: 72: Hoare triple {10891#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10891#(<= main_~i~0 21)} is VALID [2018-11-23 12:03:47,329 INFO L273 TraceCheckUtils]: 73: Hoare triple {10891#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10892#(<= main_~i~0 22)} is VALID [2018-11-23 12:03:47,329 INFO L273 TraceCheckUtils]: 74: Hoare triple {10892#(<= main_~i~0 22)} assume !(~i~0 < 100000); {10869#false} is VALID [2018-11-23 12:03:47,329 INFO L273 TraceCheckUtils]: 75: Hoare triple {10869#false} havoc ~x~0;~x~0 := 0; {10869#false} is VALID [2018-11-23 12:03:47,330 INFO L273 TraceCheckUtils]: 76: Hoare triple {10869#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {10869#false} is VALID [2018-11-23 12:03:47,330 INFO L256 TraceCheckUtils]: 77: Hoare triple {10869#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {10869#false} is VALID [2018-11-23 12:03:47,330 INFO L273 TraceCheckUtils]: 78: Hoare triple {10869#false} ~cond := #in~cond; {10869#false} is VALID [2018-11-23 12:03:47,330 INFO L273 TraceCheckUtils]: 79: Hoare triple {10869#false} assume 0 == ~cond; {10869#false} is VALID [2018-11-23 12:03:47,330 INFO L273 TraceCheckUtils]: 80: Hoare triple {10869#false} assume !false; {10869#false} is VALID [2018-11-23 12:03:47,335 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-23 12:03:47,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:47,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 12:03:47,355 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 81 [2018-11-23 12:03:47,355 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:47,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:03:47,440 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:47,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:03:47,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:03:47,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:03:47,442 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 26 states. [2018-11-23 12:03:47,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:47,921 INFO L93 Difference]: Finished difference Result 147 states and 152 transitions. [2018-11-23 12:03:47,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 12:03:47,921 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 81 [2018-11-23 12:03:47,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:47,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:03:47,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 109 transitions. [2018-11-23 12:03:47,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:03:47,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 109 transitions. [2018-11-23 12:03:47,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 109 transitions. [2018-11-23 12:03:48,025 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:03:48,027 INFO L225 Difference]: With dead ends: 147 [2018-11-23 12:03:48,027 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 12:03:48,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:03:48,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 12:03:48,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-11-23 12:03:48,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:48,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 89 states. [2018-11-23 12:03:48,063 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 89 states. [2018-11-23 12:03:48,063 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 89 states. [2018-11-23 12:03:48,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:48,065 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-11-23 12:03:48,065 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2018-11-23 12:03:48,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:48,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:48,065 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 90 states. [2018-11-23 12:03:48,065 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 90 states. [2018-11-23 12:03:48,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:48,066 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-11-23 12:03:48,067 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2018-11-23 12:03:48,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:48,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:48,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:48,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:48,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 12:03:48,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2018-11-23 12:03:48,068 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 81 [2018-11-23 12:03:48,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:48,068 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2018-11-23 12:03:48,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:03:48,069 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2018-11-23 12:03:48,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-23 12:03:48,069 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:48,069 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:48,069 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:48,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:48,070 INFO L82 PathProgramCache]: Analyzing trace with hash 322516920, now seen corresponding path program 23 times [2018-11-23 12:03:48,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:48,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:48,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:48,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:48,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:48,650 INFO L256 TraceCheckUtils]: 0: Hoare triple {11688#true} call ULTIMATE.init(); {11688#true} is VALID [2018-11-23 12:03:48,651 INFO L273 TraceCheckUtils]: 1: Hoare triple {11688#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11688#true} is VALID [2018-11-23 12:03:48,651 INFO L273 TraceCheckUtils]: 2: Hoare triple {11688#true} assume true; {11688#true} is VALID [2018-11-23 12:03:48,651 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11688#true} {11688#true} #62#return; {11688#true} is VALID [2018-11-23 12:03:48,651 INFO L256 TraceCheckUtils]: 4: Hoare triple {11688#true} call #t~ret4 := main(); {11688#true} is VALID [2018-11-23 12:03:48,652 INFO L273 TraceCheckUtils]: 5: Hoare triple {11688#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11690#(= main_~i~0 0)} is VALID [2018-11-23 12:03:48,653 INFO L273 TraceCheckUtils]: 6: Hoare triple {11690#(= 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; {11691#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:48,653 INFO L273 TraceCheckUtils]: 7: Hoare triple {11691#(<= 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; {11692#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:48,654 INFO L273 TraceCheckUtils]: 8: Hoare triple {11692#(<= 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; {11693#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:48,655 INFO L273 TraceCheckUtils]: 9: Hoare triple {11693#(<= 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; {11694#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:48,656 INFO L273 TraceCheckUtils]: 10: Hoare triple {11694#(<= 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; {11695#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:48,657 INFO L273 TraceCheckUtils]: 11: Hoare triple {11695#(<= 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; {11696#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:48,658 INFO L273 TraceCheckUtils]: 12: Hoare triple {11696#(<= 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; {11697#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:48,659 INFO L273 TraceCheckUtils]: 13: Hoare triple {11697#(<= 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; {11698#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:48,660 INFO L273 TraceCheckUtils]: 14: Hoare triple {11698#(<= 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; {11699#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:48,660 INFO L273 TraceCheckUtils]: 15: Hoare triple {11699#(<= 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; {11700#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:48,661 INFO L273 TraceCheckUtils]: 16: Hoare triple {11700#(<= 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; {11701#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:48,662 INFO L273 TraceCheckUtils]: 17: Hoare triple {11701#(<= 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; {11702#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:48,663 INFO L273 TraceCheckUtils]: 18: Hoare triple {11702#(<= 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; {11703#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:48,664 INFO L273 TraceCheckUtils]: 19: Hoare triple {11703#(<= 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; {11704#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:48,665 INFO L273 TraceCheckUtils]: 20: Hoare triple {11704#(<= 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; {11705#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:48,666 INFO L273 TraceCheckUtils]: 21: Hoare triple {11705#(<= 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; {11706#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:48,666 INFO L273 TraceCheckUtils]: 22: Hoare triple {11706#(<= 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; {11707#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:48,667 INFO L273 TraceCheckUtils]: 23: Hoare triple {11707#(<= 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; {11708#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:48,668 INFO L273 TraceCheckUtils]: 24: Hoare triple {11708#(<= 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; {11709#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:48,669 INFO L273 TraceCheckUtils]: 25: Hoare triple {11709#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11710#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:48,670 INFO L273 TraceCheckUtils]: 26: Hoare triple {11710#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11711#(<= main_~i~0 21)} is VALID [2018-11-23 12:03:48,671 INFO L273 TraceCheckUtils]: 27: Hoare triple {11711#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11712#(<= main_~i~0 22)} is VALID [2018-11-23 12:03:48,672 INFO L273 TraceCheckUtils]: 28: Hoare triple {11712#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11713#(<= main_~i~0 23)} is VALID [2018-11-23 12:03:48,672 INFO L273 TraceCheckUtils]: 29: Hoare triple {11713#(<= main_~i~0 23)} assume !(~i~0 < 100000); {11689#false} is VALID [2018-11-23 12:03:48,672 INFO L273 TraceCheckUtils]: 30: Hoare triple {11689#false} ~i~0 := 0; {11689#false} is VALID [2018-11-23 12:03:48,673 INFO L273 TraceCheckUtils]: 31: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:03:48,673 INFO L273 TraceCheckUtils]: 32: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:03:48,673 INFO L273 TraceCheckUtils]: 33: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:03:48,673 INFO L273 TraceCheckUtils]: 34: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:03:48,673 INFO L273 TraceCheckUtils]: 35: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:03:48,674 INFO L273 TraceCheckUtils]: 36: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:03:48,674 INFO L273 TraceCheckUtils]: 37: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:03:48,674 INFO L273 TraceCheckUtils]: 38: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:03:48,674 INFO L273 TraceCheckUtils]: 39: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:03:48,674 INFO L273 TraceCheckUtils]: 40: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:03:48,675 INFO L273 TraceCheckUtils]: 41: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:03:48,675 INFO L273 TraceCheckUtils]: 42: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:03:48,675 INFO L273 TraceCheckUtils]: 43: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:03:48,675 INFO L273 TraceCheckUtils]: 44: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:03:48,675 INFO L273 TraceCheckUtils]: 45: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:03:48,675 INFO L273 TraceCheckUtils]: 46: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:03:48,675 INFO L273 TraceCheckUtils]: 47: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:03:48,675 INFO L273 TraceCheckUtils]: 48: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:03:48,675 INFO L273 TraceCheckUtils]: 49: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:03:48,676 INFO L273 TraceCheckUtils]: 50: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:03:48,676 INFO L273 TraceCheckUtils]: 51: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:03:48,676 INFO L273 TraceCheckUtils]: 52: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:03:48,676 INFO L273 TraceCheckUtils]: 53: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:03:48,676 INFO L273 TraceCheckUtils]: 54: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:03:48,676 INFO L273 TraceCheckUtils]: 55: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:03:48,676 INFO L273 TraceCheckUtils]: 56: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:03:48,676 INFO L273 TraceCheckUtils]: 57: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:03:48,676 INFO L273 TraceCheckUtils]: 58: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:03:48,677 INFO L273 TraceCheckUtils]: 59: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:03:48,677 INFO L273 TraceCheckUtils]: 60: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:03:48,677 INFO L273 TraceCheckUtils]: 61: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:03:48,677 INFO L273 TraceCheckUtils]: 62: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:03:48,677 INFO L273 TraceCheckUtils]: 63: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:03:48,677 INFO L273 TraceCheckUtils]: 64: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:03:48,677 INFO L273 TraceCheckUtils]: 65: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:03:48,677 INFO L273 TraceCheckUtils]: 66: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:03:48,677 INFO L273 TraceCheckUtils]: 67: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:03:48,678 INFO L273 TraceCheckUtils]: 68: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:03:48,678 INFO L273 TraceCheckUtils]: 69: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:03:48,678 INFO L273 TraceCheckUtils]: 70: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:03:48,678 INFO L273 TraceCheckUtils]: 71: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:03:48,678 INFO L273 TraceCheckUtils]: 72: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:03:48,678 INFO L273 TraceCheckUtils]: 73: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:03:48,678 INFO L273 TraceCheckUtils]: 74: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:03:48,678 INFO L273 TraceCheckUtils]: 75: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:03:48,679 INFO L273 TraceCheckUtils]: 76: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:03:48,679 INFO L273 TraceCheckUtils]: 77: Hoare triple {11689#false} assume !(~i~0 < 100000); {11689#false} is VALID [2018-11-23 12:03:48,679 INFO L273 TraceCheckUtils]: 78: Hoare triple {11689#false} havoc ~x~0;~x~0 := 0; {11689#false} is VALID [2018-11-23 12:03:48,679 INFO L273 TraceCheckUtils]: 79: Hoare triple {11689#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {11689#false} is VALID [2018-11-23 12:03:48,679 INFO L256 TraceCheckUtils]: 80: Hoare triple {11689#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {11689#false} is VALID [2018-11-23 12:03:48,679 INFO L273 TraceCheckUtils]: 81: Hoare triple {11689#false} ~cond := #in~cond; {11689#false} is VALID [2018-11-23 12:03:48,679 INFO L273 TraceCheckUtils]: 82: Hoare triple {11689#false} assume 0 == ~cond; {11689#false} is VALID [2018-11-23 12:03:48,679 INFO L273 TraceCheckUtils]: 83: Hoare triple {11689#false} assume !false; {11689#false} is VALID [2018-11-23 12:03:48,683 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2018-11-23 12:03:48,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:48,683 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:48,692 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:05:00,585 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-23 12:05:00,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:00,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:00,820 INFO L256 TraceCheckUtils]: 0: Hoare triple {11688#true} call ULTIMATE.init(); {11688#true} is VALID [2018-11-23 12:05:00,820 INFO L273 TraceCheckUtils]: 1: Hoare triple {11688#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11688#true} is VALID [2018-11-23 12:05:00,820 INFO L273 TraceCheckUtils]: 2: Hoare triple {11688#true} assume true; {11688#true} is VALID [2018-11-23 12:05:00,820 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11688#true} {11688#true} #62#return; {11688#true} is VALID [2018-11-23 12:05:00,821 INFO L256 TraceCheckUtils]: 4: Hoare triple {11688#true} call #t~ret4 := main(); {11688#true} is VALID [2018-11-23 12:05:00,822 INFO L273 TraceCheckUtils]: 5: Hoare triple {11688#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11732#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:00,822 INFO L273 TraceCheckUtils]: 6: Hoare triple {11732#(<= 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; {11691#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:00,823 INFO L273 TraceCheckUtils]: 7: Hoare triple {11691#(<= 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; {11692#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:00,823 INFO L273 TraceCheckUtils]: 8: Hoare triple {11692#(<= 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; {11693#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:00,824 INFO L273 TraceCheckUtils]: 9: Hoare triple {11693#(<= 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; {11694#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:00,825 INFO L273 TraceCheckUtils]: 10: Hoare triple {11694#(<= 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; {11695#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:00,826 INFO L273 TraceCheckUtils]: 11: Hoare triple {11695#(<= 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; {11696#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:00,827 INFO L273 TraceCheckUtils]: 12: Hoare triple {11696#(<= 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; {11697#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:00,828 INFO L273 TraceCheckUtils]: 13: Hoare triple {11697#(<= 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; {11698#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:00,829 INFO L273 TraceCheckUtils]: 14: Hoare triple {11698#(<= 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; {11699#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:00,830 INFO L273 TraceCheckUtils]: 15: Hoare triple {11699#(<= 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; {11700#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:00,831 INFO L273 TraceCheckUtils]: 16: Hoare triple {11700#(<= 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; {11701#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:00,831 INFO L273 TraceCheckUtils]: 17: Hoare triple {11701#(<= 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; {11702#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:00,832 INFO L273 TraceCheckUtils]: 18: Hoare triple {11702#(<= 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; {11703#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:00,833 INFO L273 TraceCheckUtils]: 19: Hoare triple {11703#(<= 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; {11704#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:00,834 INFO L273 TraceCheckUtils]: 20: Hoare triple {11704#(<= 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; {11705#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:00,835 INFO L273 TraceCheckUtils]: 21: Hoare triple {11705#(<= 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; {11706#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:00,836 INFO L273 TraceCheckUtils]: 22: Hoare triple {11706#(<= 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; {11707#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:00,837 INFO L273 TraceCheckUtils]: 23: Hoare triple {11707#(<= 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; {11708#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:00,838 INFO L273 TraceCheckUtils]: 24: Hoare triple {11708#(<= 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; {11709#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:00,839 INFO L273 TraceCheckUtils]: 25: Hoare triple {11709#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11710#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:00,840 INFO L273 TraceCheckUtils]: 26: Hoare triple {11710#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11711#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:00,841 INFO L273 TraceCheckUtils]: 27: Hoare triple {11711#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11712#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:00,842 INFO L273 TraceCheckUtils]: 28: Hoare triple {11712#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11713#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:00,842 INFO L273 TraceCheckUtils]: 29: Hoare triple {11713#(<= main_~i~0 23)} assume !(~i~0 < 100000); {11689#false} is VALID [2018-11-23 12:05:00,843 INFO L273 TraceCheckUtils]: 30: Hoare triple {11689#false} ~i~0 := 0; {11689#false} is VALID [2018-11-23 12:05:00,843 INFO L273 TraceCheckUtils]: 31: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:05:00,843 INFO L273 TraceCheckUtils]: 32: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:05:00,843 INFO L273 TraceCheckUtils]: 33: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:05:00,843 INFO L273 TraceCheckUtils]: 34: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:05:00,844 INFO L273 TraceCheckUtils]: 35: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:05:00,844 INFO L273 TraceCheckUtils]: 36: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:05:00,844 INFO L273 TraceCheckUtils]: 37: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:05:00,844 INFO L273 TraceCheckUtils]: 38: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:05:00,844 INFO L273 TraceCheckUtils]: 39: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:05:00,845 INFO L273 TraceCheckUtils]: 40: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:05:00,845 INFO L273 TraceCheckUtils]: 41: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:05:00,845 INFO L273 TraceCheckUtils]: 42: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:05:00,845 INFO L273 TraceCheckUtils]: 43: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:05:00,845 INFO L273 TraceCheckUtils]: 44: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:05:00,846 INFO L273 TraceCheckUtils]: 45: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:05:00,846 INFO L273 TraceCheckUtils]: 46: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:05:00,846 INFO L273 TraceCheckUtils]: 47: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:05:00,846 INFO L273 TraceCheckUtils]: 48: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:05:00,846 INFO L273 TraceCheckUtils]: 49: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:05:00,847 INFO L273 TraceCheckUtils]: 50: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:05:00,847 INFO L273 TraceCheckUtils]: 51: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:05:00,847 INFO L273 TraceCheckUtils]: 52: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:05:00,847 INFO L273 TraceCheckUtils]: 53: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:05:00,847 INFO L273 TraceCheckUtils]: 54: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:05:00,848 INFO L273 TraceCheckUtils]: 55: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:05:00,848 INFO L273 TraceCheckUtils]: 56: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:05:00,848 INFO L273 TraceCheckUtils]: 57: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:05:00,848 INFO L273 TraceCheckUtils]: 58: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:05:00,848 INFO L273 TraceCheckUtils]: 59: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:05:00,848 INFO L273 TraceCheckUtils]: 60: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:05:00,848 INFO L273 TraceCheckUtils]: 61: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:05:00,849 INFO L273 TraceCheckUtils]: 62: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:05:00,849 INFO L273 TraceCheckUtils]: 63: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:05:00,849 INFO L273 TraceCheckUtils]: 64: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:05:00,849 INFO L273 TraceCheckUtils]: 65: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:05:00,849 INFO L273 TraceCheckUtils]: 66: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:05:00,849 INFO L273 TraceCheckUtils]: 67: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:05:00,849 INFO L273 TraceCheckUtils]: 68: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:05:00,849 INFO L273 TraceCheckUtils]: 69: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:05:00,849 INFO L273 TraceCheckUtils]: 70: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:05:00,850 INFO L273 TraceCheckUtils]: 71: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:05:00,850 INFO L273 TraceCheckUtils]: 72: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:05:00,850 INFO L273 TraceCheckUtils]: 73: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:05:00,850 INFO L273 TraceCheckUtils]: 74: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:05:00,850 INFO L273 TraceCheckUtils]: 75: Hoare triple {11689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11689#false} is VALID [2018-11-23 12:05:00,850 INFO L273 TraceCheckUtils]: 76: Hoare triple {11689#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11689#false} is VALID [2018-11-23 12:05:00,850 INFO L273 TraceCheckUtils]: 77: Hoare triple {11689#false} assume !(~i~0 < 100000); {11689#false} is VALID [2018-11-23 12:05:00,850 INFO L273 TraceCheckUtils]: 78: Hoare triple {11689#false} havoc ~x~0;~x~0 := 0; {11689#false} is VALID [2018-11-23 12:05:00,850 INFO L273 TraceCheckUtils]: 79: Hoare triple {11689#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {11689#false} is VALID [2018-11-23 12:05:00,851 INFO L256 TraceCheckUtils]: 80: Hoare triple {11689#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {11689#false} is VALID [2018-11-23 12:05:00,851 INFO L273 TraceCheckUtils]: 81: Hoare triple {11689#false} ~cond := #in~cond; {11689#false} is VALID [2018-11-23 12:05:00,851 INFO L273 TraceCheckUtils]: 82: Hoare triple {11689#false} assume 0 == ~cond; {11689#false} is VALID [2018-11-23 12:05:00,851 INFO L273 TraceCheckUtils]: 83: Hoare triple {11689#false} assume !false; {11689#false} is VALID [2018-11-23 12:05:00,854 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2018-11-23 12:05:00,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:00,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-23 12:05:00,884 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 84 [2018-11-23 12:05:00,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:00,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 12:05:00,934 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:00,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 12:05:00,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 12:05:00,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:05:00,935 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand 27 states. [2018-11-23 12:05:01,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:01,409 INFO L93 Difference]: Finished difference Result 152 states and 157 transitions. [2018-11-23 12:05:01,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 12:05:01,409 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 84 [2018-11-23 12:05:01,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:01,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:05:01,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 112 transitions. [2018-11-23 12:05:01,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:05:01,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 112 transitions. [2018-11-23 12:05:01,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 112 transitions. [2018-11-23 12:05:01,566 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:01,568 INFO L225 Difference]: With dead ends: 152 [2018-11-23 12:05:01,568 INFO L226 Difference]: Without dead ends: 93 [2018-11-23 12:05:01,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:05:01,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-23 12:05:01,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-11-23 12:05:01,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:01,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 92 states. [2018-11-23 12:05:01,643 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 92 states. [2018-11-23 12:05:01,643 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 92 states. [2018-11-23 12:05:01,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:01,644 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2018-11-23 12:05:01,644 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2018-11-23 12:05:01,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:01,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:01,645 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 93 states. [2018-11-23 12:05:01,645 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 93 states. [2018-11-23 12:05:01,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:01,646 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2018-11-23 12:05:01,646 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2018-11-23 12:05:01,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:01,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:01,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:01,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:01,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-23 12:05:01,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2018-11-23 12:05:01,648 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 84 [2018-11-23 12:05:01,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:01,648 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2018-11-23 12:05:01,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 12:05:01,649 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2018-11-23 12:05:01,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-23 12:05:01,649 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:01,649 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:01,650 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:01,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:01,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1250086378, now seen corresponding path program 24 times [2018-11-23 12:05:01,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:01,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:01,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:01,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:01,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:02,514 INFO L256 TraceCheckUtils]: 0: Hoare triple {12537#true} call ULTIMATE.init(); {12537#true} is VALID [2018-11-23 12:05:02,514 INFO L273 TraceCheckUtils]: 1: Hoare triple {12537#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12537#true} is VALID [2018-11-23 12:05:02,514 INFO L273 TraceCheckUtils]: 2: Hoare triple {12537#true} assume true; {12537#true} is VALID [2018-11-23 12:05:02,514 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12537#true} {12537#true} #62#return; {12537#true} is VALID [2018-11-23 12:05:02,515 INFO L256 TraceCheckUtils]: 4: Hoare triple {12537#true} call #t~ret4 := main(); {12537#true} is VALID [2018-11-23 12:05:02,515 INFO L273 TraceCheckUtils]: 5: Hoare triple {12537#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12539#(= main_~i~0 0)} is VALID [2018-11-23 12:05:02,516 INFO L273 TraceCheckUtils]: 6: Hoare triple {12539#(= 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; {12540#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:02,517 INFO L273 TraceCheckUtils]: 7: Hoare triple {12540#(<= 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; {12541#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:02,517 INFO L273 TraceCheckUtils]: 8: Hoare triple {12541#(<= 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; {12542#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:02,518 INFO L273 TraceCheckUtils]: 9: Hoare triple {12542#(<= 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; {12543#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:02,518 INFO L273 TraceCheckUtils]: 10: Hoare triple {12543#(<= 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; {12544#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:02,519 INFO L273 TraceCheckUtils]: 11: Hoare triple {12544#(<= 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; {12545#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:02,519 INFO L273 TraceCheckUtils]: 12: Hoare triple {12545#(<= 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; {12546#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:02,520 INFO L273 TraceCheckUtils]: 13: Hoare triple {12546#(<= 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; {12547#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:02,521 INFO L273 TraceCheckUtils]: 14: Hoare triple {12547#(<= 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; {12548#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:02,522 INFO L273 TraceCheckUtils]: 15: Hoare triple {12548#(<= 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; {12549#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:02,523 INFO L273 TraceCheckUtils]: 16: Hoare triple {12549#(<= 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; {12550#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:02,524 INFO L273 TraceCheckUtils]: 17: Hoare triple {12550#(<= 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; {12551#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:02,525 INFO L273 TraceCheckUtils]: 18: Hoare triple {12551#(<= 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; {12552#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:02,525 INFO L273 TraceCheckUtils]: 19: Hoare triple {12552#(<= 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; {12553#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:02,526 INFO L273 TraceCheckUtils]: 20: Hoare triple {12553#(<= 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; {12554#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:02,527 INFO L273 TraceCheckUtils]: 21: Hoare triple {12554#(<= 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; {12555#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:02,528 INFO L273 TraceCheckUtils]: 22: Hoare triple {12555#(<= 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; {12556#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:02,529 INFO L273 TraceCheckUtils]: 23: Hoare triple {12556#(<= 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; {12557#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:02,530 INFO L273 TraceCheckUtils]: 24: Hoare triple {12557#(<= 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; {12558#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:02,531 INFO L273 TraceCheckUtils]: 25: Hoare triple {12558#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12559#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:02,531 INFO L273 TraceCheckUtils]: 26: Hoare triple {12559#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12560#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:02,532 INFO L273 TraceCheckUtils]: 27: Hoare triple {12560#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12561#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:02,533 INFO L273 TraceCheckUtils]: 28: Hoare triple {12561#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12562#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:02,534 INFO L273 TraceCheckUtils]: 29: Hoare triple {12562#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12563#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:02,535 INFO L273 TraceCheckUtils]: 30: Hoare triple {12563#(<= main_~i~0 24)} assume !(~i~0 < 100000); {12538#false} is VALID [2018-11-23 12:05:02,535 INFO L273 TraceCheckUtils]: 31: Hoare triple {12538#false} ~i~0 := 0; {12538#false} is VALID [2018-11-23 12:05:02,535 INFO L273 TraceCheckUtils]: 32: Hoare triple {12538#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12538#false} is VALID [2018-11-23 12:05:02,535 INFO L273 TraceCheckUtils]: 33: Hoare triple {12538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12538#false} is VALID [2018-11-23 12:05:02,535 INFO L273 TraceCheckUtils]: 34: Hoare triple {12538#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12538#false} is VALID [2018-11-23 12:05:02,536 INFO L273 TraceCheckUtils]: 35: Hoare triple {12538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12538#false} is VALID [2018-11-23 12:05:02,536 INFO L273 TraceCheckUtils]: 36: Hoare triple {12538#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12538#false} is VALID [2018-11-23 12:05:02,536 INFO L273 TraceCheckUtils]: 37: Hoare triple {12538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12538#false} is VALID [2018-11-23 12:05:02,536 INFO L273 TraceCheckUtils]: 38: Hoare triple {12538#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12538#false} is VALID [2018-11-23 12:05:02,536 INFO L273 TraceCheckUtils]: 39: Hoare triple {12538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12538#false} is VALID [2018-11-23 12:05:02,537 INFO L273 TraceCheckUtils]: 40: Hoare triple {12538#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12538#false} is VALID [2018-11-23 12:05:02,537 INFO L273 TraceCheckUtils]: 41: Hoare triple {12538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12538#false} is VALID [2018-11-23 12:05:02,537 INFO L273 TraceCheckUtils]: 42: Hoare triple {12538#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12538#false} is VALID [2018-11-23 12:05:02,537 INFO L273 TraceCheckUtils]: 43: Hoare triple {12538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12538#false} is VALID [2018-11-23 12:05:02,537 INFO L273 TraceCheckUtils]: 44: Hoare triple {12538#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12538#false} is VALID [2018-11-23 12:05:02,537 INFO L273 TraceCheckUtils]: 45: Hoare triple {12538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12538#false} is VALID [2018-11-23 12:05:02,538 INFO L273 TraceCheckUtils]: 46: Hoare triple {12538#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12538#false} is VALID [2018-11-23 12:05:02,538 INFO L273 TraceCheckUtils]: 47: Hoare triple {12538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12538#false} is VALID [2018-11-23 12:05:02,538 INFO L273 TraceCheckUtils]: 48: Hoare triple {12538#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12538#false} is VALID [2018-11-23 12:05:02,538 INFO L273 TraceCheckUtils]: 49: Hoare triple {12538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12538#false} is VALID [2018-11-23 12:05:02,538 INFO L273 TraceCheckUtils]: 50: Hoare triple {12538#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12538#false} is VALID [2018-11-23 12:05:02,539 INFO L273 TraceCheckUtils]: 51: Hoare triple {12538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12538#false} is VALID [2018-11-23 12:05:02,539 INFO L273 TraceCheckUtils]: 52: Hoare triple {12538#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12538#false} is VALID [2018-11-23 12:05:02,539 INFO L273 TraceCheckUtils]: 53: Hoare triple {12538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12538#false} is VALID [2018-11-23 12:05:02,539 INFO L273 TraceCheckUtils]: 54: Hoare triple {12538#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12538#false} is VALID [2018-11-23 12:05:02,539 INFO L273 TraceCheckUtils]: 55: Hoare triple {12538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12538#false} is VALID [2018-11-23 12:05:02,539 INFO L273 TraceCheckUtils]: 56: Hoare triple {12538#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12538#false} is VALID [2018-11-23 12:05:02,540 INFO L273 TraceCheckUtils]: 57: Hoare triple {12538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12538#false} is VALID [2018-11-23 12:05:02,540 INFO L273 TraceCheckUtils]: 58: Hoare triple {12538#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12538#false} is VALID [2018-11-23 12:05:02,540 INFO L273 TraceCheckUtils]: 59: Hoare triple {12538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12538#false} is VALID [2018-11-23 12:05:02,540 INFO L273 TraceCheckUtils]: 60: Hoare triple {12538#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12538#false} is VALID [2018-11-23 12:05:02,540 INFO L273 TraceCheckUtils]: 61: Hoare triple {12538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12538#false} is VALID [2018-11-23 12:05:02,540 INFO L273 TraceCheckUtils]: 62: Hoare triple {12538#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12538#false} is VALID [2018-11-23 12:05:02,541 INFO L273 TraceCheckUtils]: 63: Hoare triple {12538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12538#false} is VALID [2018-11-23 12:05:02,541 INFO L273 TraceCheckUtils]: 64: Hoare triple {12538#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12538#false} is VALID [2018-11-23 12:05:02,541 INFO L273 TraceCheckUtils]: 65: Hoare triple {12538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12538#false} is VALID [2018-11-23 12:05:02,541 INFO L273 TraceCheckUtils]: 66: Hoare triple {12538#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12538#false} is VALID [2018-11-23 12:05:02,541 INFO L273 TraceCheckUtils]: 67: Hoare triple {12538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12538#false} is VALID [2018-11-23 12:05:02,541 INFO L273 TraceCheckUtils]: 68: Hoare triple {12538#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12538#false} is VALID [2018-11-23 12:05:02,541 INFO L273 TraceCheckUtils]: 69: Hoare triple {12538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12538#false} is VALID [2018-11-23 12:05:02,541 INFO L273 TraceCheckUtils]: 70: Hoare triple {12538#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12538#false} is VALID [2018-11-23 12:05:02,541 INFO L273 TraceCheckUtils]: 71: Hoare triple {12538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12538#false} is VALID [2018-11-23 12:05:02,542 INFO L273 TraceCheckUtils]: 72: Hoare triple {12538#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12538#false} is VALID [2018-11-23 12:05:02,542 INFO L273 TraceCheckUtils]: 73: Hoare triple {12538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12538#false} is VALID [2018-11-23 12:05:02,542 INFO L273 TraceCheckUtils]: 74: Hoare triple {12538#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12538#false} is VALID [2018-11-23 12:05:02,542 INFO L273 TraceCheckUtils]: 75: Hoare triple {12538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12538#false} is VALID [2018-11-23 12:05:02,542 INFO L273 TraceCheckUtils]: 76: Hoare triple {12538#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12538#false} is VALID [2018-11-23 12:05:02,542 INFO L273 TraceCheckUtils]: 77: Hoare triple {12538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12538#false} is VALID [2018-11-23 12:05:02,542 INFO L273 TraceCheckUtils]: 78: Hoare triple {12538#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12538#false} is VALID [2018-11-23 12:05:02,542 INFO L273 TraceCheckUtils]: 79: Hoare triple {12538#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12538#false} is VALID [2018-11-23 12:05:02,543 INFO L273 TraceCheckUtils]: 80: Hoare triple {12538#false} assume !(~i~0 < 100000); {12538#false} is VALID [2018-11-23 12:05:02,543 INFO L273 TraceCheckUtils]: 81: Hoare triple {12538#false} havoc ~x~0;~x~0 := 0; {12538#false} is VALID [2018-11-23 12:05:02,543 INFO L273 TraceCheckUtils]: 82: Hoare triple {12538#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {12538#false} is VALID [2018-11-23 12:05:02,543 INFO L256 TraceCheckUtils]: 83: Hoare triple {12538#false} call __VERIFIER_assert((if 42 == #t~mem3 then 1 else 0)); {12538#false} is VALID [2018-11-23 12:05:02,543 INFO L273 TraceCheckUtils]: 84: Hoare triple {12538#false} ~cond := #in~cond; {12538#false} is VALID [2018-11-23 12:05:02,543 INFO L273 TraceCheckUtils]: 85: Hoare triple {12538#false} assume 0 == ~cond; {12538#false} is VALID [2018-11-23 12:05:02,543 INFO L273 TraceCheckUtils]: 86: Hoare triple {12538#false} assume !false; {12538#false} is VALID [2018-11-23 12:05:02,547 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2018-11-23 12:05:02,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:02,547 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:02,556 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE