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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_init4_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 22:53:52,550 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:53:52,552 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:53:52,567 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:53:52,567 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:53:52,569 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:53:52,571 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:53:52,573 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:53:52,575 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:53:52,578 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:53:52,581 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:53:52,581 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:53:52,582 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:53:52,583 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:53:52,587 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:53:52,587 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:53:52,588 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:53:52,591 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:53:52,601 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:53:52,604 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:53:52,606 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:53:52,607 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:53:52,612 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:53:52,612 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:53:52,612 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:53:52,613 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:53:52,616 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:53:52,617 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:53:52,617 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:53:52,618 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:53:52,621 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:53:52,621 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:53:52,623 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:53:52,623 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:53:52,624 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:53:52,624 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:53:52,625 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-18 22:53:52,653 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:53:52,653 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:53:52,655 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:53:52,655 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:53:52,655 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:53:52,656 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:53:52,657 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:53:52,657 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:53:52,657 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:53:52,657 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 22:53:52,657 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:53:52,658 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:53:52,658 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:53:52,658 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:53:52,659 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:53:52,659 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:53:52,659 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:53:52,659 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:53:52,660 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:53:52,660 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:53:52,660 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:53:52,660 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:53:52,661 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:53:52,661 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:53:52,661 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:53:52,661 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:53:52,661 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:53:52,662 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 22:53:52,662 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:53:52,662 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 22:53:52,662 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:53:52,714 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:53:52,732 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:53:52,736 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:53:52,737 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:53:52,738 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:53:52,739 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init4_true-unreach-call_ground.i [2018-11-18 22:53:52,806 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e3e2119d/ffc236bf152548f0ab57bdab66301225/FLAG276729c73 [2018-11-18 22:53:53,271 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:53:53,271 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init4_true-unreach-call_ground.i [2018-11-18 22:53:53,277 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e3e2119d/ffc236bf152548f0ab57bdab66301225/FLAG276729c73 [2018-11-18 22:53:53,614 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e3e2119d/ffc236bf152548f0ab57bdab66301225 [2018-11-18 22:53:53,625 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:53:53,627 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:53:53,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:53:53,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:53:53,631 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:53:53,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:53:53" (1/1) ... [2018-11-18 22:53:53,636 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7267dd98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:53:53, skipping insertion in model container [2018-11-18 22:53:53,636 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:53:53" (1/1) ... [2018-11-18 22:53:53,646 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:53:53,669 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:53:53,886 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:53:53,891 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:53:53,922 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:53:53,948 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:53:53,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:53:53 WrapperNode [2018-11-18 22:53:53,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:53:53,950 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:53:53,950 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:53:53,950 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:53:53,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:53:53" (1/1) ... [2018-11-18 22:53:53,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:53:53" (1/1) ... [2018-11-18 22:53:53,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:53:53" (1/1) ... [2018-11-18 22:53:53,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:53:53" (1/1) ... [2018-11-18 22:53:53,980 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:53:53" (1/1) ... [2018-11-18 22:53:53,988 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:53:53" (1/1) ... [2018-11-18 22:53:53,989 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:53:53" (1/1) ... [2018-11-18 22:53:53,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:53:53,992 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:53:53,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:53:53,992 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:53:53,993 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:53:53" (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-18 22:53:54,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:53:54,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:53:54,114 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 22:53:54,114 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:53:54,114 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:53:54,114 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 22:53:54,115 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:53:54,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 22:53:54,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 22:53:54,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 22:53:54,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 22:53:54,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:53:54,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:53:54,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 22:53:54,667 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:53:54,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:53:54 BoogieIcfgContainer [2018-11-18 22:53:54,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:53:54,668 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:53:54,668 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:53:54,672 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:53:54,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:53:53" (1/3) ... [2018-11-18 22:53:54,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e9957f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:53:54, skipping insertion in model container [2018-11-18 22:53:54,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:53:53" (2/3) ... [2018-11-18 22:53:54,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e9957f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:53:54, skipping insertion in model container [2018-11-18 22:53:54,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:53:54" (3/3) ... [2018-11-18 22:53:54,675 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_init4_true-unreach-call_ground.i [2018-11-18 22:53:54,685 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:53:54,693 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 22:53:54,707 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 22:53:54,739 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:53:54,740 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:53:54,740 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:53:54,740 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:53:54,741 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:53:54,742 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:53:54,742 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:53:54,742 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:53:54,743 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:53:54,762 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-18 22:53:54,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 22:53:54,769 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:54,770 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:53:54,772 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:54,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:54,779 INFO L82 PathProgramCache]: Analyzing trace with hash -744292695, now seen corresponding path program 1 times [2018-11-18 22:53:54,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:54,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:54,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:54,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:53:54,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:54,915 INFO L256 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2018-11-18 22:53:54,919 INFO L273 TraceCheckUtils]: 1: Hoare triple {37#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {37#true} is VALID [2018-11-18 22:53:54,920 INFO L273 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-18 22:53:54,920 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #92#return; {37#true} is VALID [2018-11-18 22:53:54,921 INFO L256 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret2 := main(); {37#true} is VALID [2018-11-18 22:53:54,921 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {37#true} is VALID [2018-11-18 22:53:54,924 INFO L273 TraceCheckUtils]: 6: Hoare triple {37#true} assume !true; {38#false} is VALID [2018-11-18 22:53:54,925 INFO L273 TraceCheckUtils]: 7: Hoare triple {38#false} ~i~0 := 0; {38#false} is VALID [2018-11-18 22:53:54,925 INFO L273 TraceCheckUtils]: 8: Hoare triple {38#false} assume !true; {38#false} is VALID [2018-11-18 22:53:54,926 INFO L273 TraceCheckUtils]: 9: Hoare triple {38#false} ~i~0 := 0; {38#false} is VALID [2018-11-18 22:53:54,926 INFO L273 TraceCheckUtils]: 10: Hoare triple {38#false} assume !true; {38#false} is VALID [2018-11-18 22:53:54,926 INFO L273 TraceCheckUtils]: 11: Hoare triple {38#false} ~i~0 := 0; {38#false} is VALID [2018-11-18 22:53:54,927 INFO L273 TraceCheckUtils]: 12: Hoare triple {38#false} assume !true; {38#false} is VALID [2018-11-18 22:53:54,927 INFO L273 TraceCheckUtils]: 13: Hoare triple {38#false} havoc ~x~0;~x~0 := 0; {38#false} is VALID [2018-11-18 22:53:54,927 INFO L273 TraceCheckUtils]: 14: Hoare triple {38#false} assume true; {38#false} is VALID [2018-11-18 22:53:54,928 INFO L273 TraceCheckUtils]: 15: Hoare triple {38#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {38#false} is VALID [2018-11-18 22:53:54,928 INFO L256 TraceCheckUtils]: 16: Hoare triple {38#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {38#false} is VALID [2018-11-18 22:53:54,929 INFO L273 TraceCheckUtils]: 17: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2018-11-18 22:53:54,929 INFO L273 TraceCheckUtils]: 18: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2018-11-18 22:53:54,929 INFO L273 TraceCheckUtils]: 19: Hoare triple {38#false} assume !false; {38#false} is VALID [2018-11-18 22:53:54,933 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-18 22:53:54,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:53:54,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 22:53:54,941 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-18 22:53:54,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:54,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 22:53:55,111 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-18 22:53:55,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 22:53:55,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 22:53:55,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:53:55,125 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-18 22:53:55,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:55,403 INFO L93 Difference]: Finished difference Result 60 states and 79 transitions. [2018-11-18 22:53:55,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 22:53:55,403 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-18 22:53:55,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:55,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:53:55,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 79 transitions. [2018-11-18 22:53:55,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:53:55,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 79 transitions. [2018-11-18 22:53:55,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 79 transitions. [2018-11-18 22:53:55,680 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:55,691 INFO L225 Difference]: With dead ends: 60 [2018-11-18 22:53:55,691 INFO L226 Difference]: Without dead ends: 29 [2018-11-18 22:53:55,695 INFO L604 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-18 22:53:55,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-18 22:53:55,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-18 22:53:55,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:55,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-18 22:53:55,736 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-18 22:53:55,736 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-18 22:53:55,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:55,740 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-18 22:53:55,740 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-18 22:53:55,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:55,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:55,741 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-18 22:53:55,742 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-18 22:53:55,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:55,746 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-18 22:53:55,746 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-18 22:53:55,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:55,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:55,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:55,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:55,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 22:53:55,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-18 22:53:55,752 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 20 [2018-11-18 22:53:55,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:55,752 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-18 22:53:55,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 22:53:55,752 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-18 22:53:55,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 22:53:55,754 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:55,754 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:53:55,754 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:55,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:55,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1804086013, now seen corresponding path program 1 times [2018-11-18 22:53:55,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:55,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:55,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:55,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:53:55,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:55,880 INFO L256 TraceCheckUtils]: 0: Hoare triple {216#true} call ULTIMATE.init(); {216#true} is VALID [2018-11-18 22:53:55,880 INFO L273 TraceCheckUtils]: 1: Hoare triple {216#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {216#true} is VALID [2018-11-18 22:53:55,880 INFO L273 TraceCheckUtils]: 2: Hoare triple {216#true} assume true; {216#true} is VALID [2018-11-18 22:53:55,881 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {216#true} {216#true} #92#return; {216#true} is VALID [2018-11-18 22:53:55,881 INFO L256 TraceCheckUtils]: 4: Hoare triple {216#true} call #t~ret2 := main(); {216#true} is VALID [2018-11-18 22:53:55,882 INFO L273 TraceCheckUtils]: 5: Hoare triple {216#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {218#(= main_~i~0 0)} is VALID [2018-11-18 22:53:55,883 INFO L273 TraceCheckUtils]: 6: Hoare triple {218#(= main_~i~0 0)} assume true; {218#(= main_~i~0 0)} is VALID [2018-11-18 22:53:55,883 INFO L273 TraceCheckUtils]: 7: Hoare triple {218#(= main_~i~0 0)} assume !(~i~0 < 100000); {217#false} is VALID [2018-11-18 22:53:55,884 INFO L273 TraceCheckUtils]: 8: Hoare triple {217#false} ~i~0 := 0; {217#false} is VALID [2018-11-18 22:53:55,884 INFO L273 TraceCheckUtils]: 9: Hoare triple {217#false} assume true; {217#false} is VALID [2018-11-18 22:53:55,884 INFO L273 TraceCheckUtils]: 10: Hoare triple {217#false} assume !(~i~0 < 100000); {217#false} is VALID [2018-11-18 22:53:55,885 INFO L273 TraceCheckUtils]: 11: Hoare triple {217#false} ~i~0 := 0; {217#false} is VALID [2018-11-18 22:53:55,885 INFO L273 TraceCheckUtils]: 12: Hoare triple {217#false} assume true; {217#false} is VALID [2018-11-18 22:53:55,885 INFO L273 TraceCheckUtils]: 13: Hoare triple {217#false} assume !(~i~0 < 100000); {217#false} is VALID [2018-11-18 22:53:55,885 INFO L273 TraceCheckUtils]: 14: Hoare triple {217#false} ~i~0 := 0; {217#false} is VALID [2018-11-18 22:53:55,886 INFO L273 TraceCheckUtils]: 15: Hoare triple {217#false} assume true; {217#false} is VALID [2018-11-18 22:53:55,886 INFO L273 TraceCheckUtils]: 16: Hoare triple {217#false} assume !(~i~0 < 100000); {217#false} is VALID [2018-11-18 22:53:55,886 INFO L273 TraceCheckUtils]: 17: Hoare triple {217#false} havoc ~x~0;~x~0 := 0; {217#false} is VALID [2018-11-18 22:53:55,887 INFO L273 TraceCheckUtils]: 18: Hoare triple {217#false} assume true; {217#false} is VALID [2018-11-18 22:53:55,887 INFO L273 TraceCheckUtils]: 19: Hoare triple {217#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {217#false} is VALID [2018-11-18 22:53:55,887 INFO L256 TraceCheckUtils]: 20: Hoare triple {217#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {217#false} is VALID [2018-11-18 22:53:55,887 INFO L273 TraceCheckUtils]: 21: Hoare triple {217#false} ~cond := #in~cond; {217#false} is VALID [2018-11-18 22:53:55,887 INFO L273 TraceCheckUtils]: 22: Hoare triple {217#false} assume 0 == ~cond; {217#false} is VALID [2018-11-18 22:53:55,888 INFO L273 TraceCheckUtils]: 23: Hoare triple {217#false} assume !false; {217#false} is VALID [2018-11-18 22:53:55,890 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-18 22:53:55,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:53:55,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 22:53:55,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 22:53:55,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:55,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 22:53:55,945 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:55,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 22:53:55,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 22:53:55,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:53:55,946 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2018-11-18 22:53:56,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:56,431 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2018-11-18 22:53:56,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 22:53:56,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 22:53:56,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:56,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:53:56,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2018-11-18 22:53:56,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:53:56,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2018-11-18 22:53:56,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2018-11-18 22:53:56,582 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:56,586 INFO L225 Difference]: With dead ends: 58 [2018-11-18 22:53:56,586 INFO L226 Difference]: Without dead ends: 37 [2018-11-18 22:53:56,587 INFO L604 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-18 22:53:56,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-18 22:53:56,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-18 22:53:56,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:56,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-18 22:53:56,621 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-18 22:53:56,621 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-18 22:53:56,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:56,625 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-18 22:53:56,625 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-18 22:53:56,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:56,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:56,626 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-18 22:53:56,626 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-18 22:53:56,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:56,630 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-18 22:53:56,630 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-18 22:53:56,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:56,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:56,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:56,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:56,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 22:53:56,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-18 22:53:56,634 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 24 [2018-11-18 22:53:56,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:56,634 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-18 22:53:56,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 22:53:56,635 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-18 22:53:56,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 22:53:56,636 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:56,636 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:53:56,637 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:56,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:56,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1411719555, now seen corresponding path program 1 times [2018-11-18 22:53:56,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:56,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:56,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:56,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:53:56,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:56,791 INFO L256 TraceCheckUtils]: 0: Hoare triple {426#true} call ULTIMATE.init(); {426#true} is VALID [2018-11-18 22:53:56,792 INFO L273 TraceCheckUtils]: 1: Hoare triple {426#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {426#true} is VALID [2018-11-18 22:53:56,792 INFO L273 TraceCheckUtils]: 2: Hoare triple {426#true} assume true; {426#true} is VALID [2018-11-18 22:53:56,793 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {426#true} {426#true} #92#return; {426#true} is VALID [2018-11-18 22:53:56,793 INFO L256 TraceCheckUtils]: 4: Hoare triple {426#true} call #t~ret2 := main(); {426#true} is VALID [2018-11-18 22:53:56,794 INFO L273 TraceCheckUtils]: 5: Hoare triple {426#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {428#(= main_~i~0 0)} is VALID [2018-11-18 22:53:56,795 INFO L273 TraceCheckUtils]: 6: Hoare triple {428#(= main_~i~0 0)} assume true; {428#(= main_~i~0 0)} is VALID [2018-11-18 22:53:56,801 INFO L273 TraceCheckUtils]: 7: Hoare triple {428#(= 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; {429#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:56,801 INFO L273 TraceCheckUtils]: 8: Hoare triple {429#(<= main_~i~0 1)} assume true; {429#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:56,803 INFO L273 TraceCheckUtils]: 9: Hoare triple {429#(<= main_~i~0 1)} assume !(~i~0 < 100000); {427#false} is VALID [2018-11-18 22:53:56,803 INFO L273 TraceCheckUtils]: 10: Hoare triple {427#false} ~i~0 := 0; {427#false} is VALID [2018-11-18 22:53:56,803 INFO L273 TraceCheckUtils]: 11: Hoare triple {427#false} assume true; {427#false} is VALID [2018-11-18 22:53:56,804 INFO L273 TraceCheckUtils]: 12: Hoare triple {427#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {427#false} is VALID [2018-11-18 22:53:56,804 INFO L273 TraceCheckUtils]: 13: Hoare triple {427#false} assume true; {427#false} is VALID [2018-11-18 22:53:56,804 INFO L273 TraceCheckUtils]: 14: Hoare triple {427#false} assume !(~i~0 < 100000); {427#false} is VALID [2018-11-18 22:53:56,805 INFO L273 TraceCheckUtils]: 15: Hoare triple {427#false} ~i~0 := 0; {427#false} is VALID [2018-11-18 22:53:56,805 INFO L273 TraceCheckUtils]: 16: Hoare triple {427#false} assume true; {427#false} is VALID [2018-11-18 22:53:56,805 INFO L273 TraceCheckUtils]: 17: Hoare triple {427#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {427#false} is VALID [2018-11-18 22:53:56,806 INFO L273 TraceCheckUtils]: 18: Hoare triple {427#false} assume true; {427#false} is VALID [2018-11-18 22:53:56,806 INFO L273 TraceCheckUtils]: 19: Hoare triple {427#false} assume !(~i~0 < 100000); {427#false} is VALID [2018-11-18 22:53:56,806 INFO L273 TraceCheckUtils]: 20: Hoare triple {427#false} ~i~0 := 0; {427#false} is VALID [2018-11-18 22:53:56,807 INFO L273 TraceCheckUtils]: 21: Hoare triple {427#false} assume true; {427#false} is VALID [2018-11-18 22:53:56,807 INFO L273 TraceCheckUtils]: 22: Hoare triple {427#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {427#false} is VALID [2018-11-18 22:53:56,807 INFO L273 TraceCheckUtils]: 23: Hoare triple {427#false} assume true; {427#false} is VALID [2018-11-18 22:53:56,808 INFO L273 TraceCheckUtils]: 24: Hoare triple {427#false} assume !(~i~0 < 100000); {427#false} is VALID [2018-11-18 22:53:56,808 INFO L273 TraceCheckUtils]: 25: Hoare triple {427#false} havoc ~x~0;~x~0 := 0; {427#false} is VALID [2018-11-18 22:53:56,808 INFO L273 TraceCheckUtils]: 26: Hoare triple {427#false} assume true; {427#false} is VALID [2018-11-18 22:53:56,809 INFO L273 TraceCheckUtils]: 27: Hoare triple {427#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {427#false} is VALID [2018-11-18 22:53:56,809 INFO L256 TraceCheckUtils]: 28: Hoare triple {427#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {427#false} is VALID [2018-11-18 22:53:56,809 INFO L273 TraceCheckUtils]: 29: Hoare triple {427#false} ~cond := #in~cond; {427#false} is VALID [2018-11-18 22:53:56,809 INFO L273 TraceCheckUtils]: 30: Hoare triple {427#false} assume 0 == ~cond; {427#false} is VALID [2018-11-18 22:53:56,810 INFO L273 TraceCheckUtils]: 31: Hoare triple {427#false} assume !false; {427#false} is VALID [2018-11-18 22:53:56,812 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 22:53:56,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:56,813 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-18 22:53:56,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:53:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:56,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:57,222 INFO L256 TraceCheckUtils]: 0: Hoare triple {426#true} call ULTIMATE.init(); {426#true} is VALID [2018-11-18 22:53:57,222 INFO L273 TraceCheckUtils]: 1: Hoare triple {426#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {426#true} is VALID [2018-11-18 22:53:57,223 INFO L273 TraceCheckUtils]: 2: Hoare triple {426#true} assume true; {426#true} is VALID [2018-11-18 22:53:57,223 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {426#true} {426#true} #92#return; {426#true} is VALID [2018-11-18 22:53:57,223 INFO L256 TraceCheckUtils]: 4: Hoare triple {426#true} call #t~ret2 := main(); {426#true} is VALID [2018-11-18 22:53:57,224 INFO L273 TraceCheckUtils]: 5: Hoare triple {426#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {448#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:57,227 INFO L273 TraceCheckUtils]: 6: Hoare triple {448#(<= main_~i~0 0)} assume true; {448#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:57,228 INFO L273 TraceCheckUtils]: 7: Hoare triple {448#(<= 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; {429#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:57,231 INFO L273 TraceCheckUtils]: 8: Hoare triple {429#(<= main_~i~0 1)} assume true; {429#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:57,231 INFO L273 TraceCheckUtils]: 9: Hoare triple {429#(<= main_~i~0 1)} assume !(~i~0 < 100000); {427#false} is VALID [2018-11-18 22:53:57,232 INFO L273 TraceCheckUtils]: 10: Hoare triple {427#false} ~i~0 := 0; {427#false} is VALID [2018-11-18 22:53:57,232 INFO L273 TraceCheckUtils]: 11: Hoare triple {427#false} assume true; {427#false} is VALID [2018-11-18 22:53:57,232 INFO L273 TraceCheckUtils]: 12: Hoare triple {427#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {427#false} is VALID [2018-11-18 22:53:57,233 INFO L273 TraceCheckUtils]: 13: Hoare triple {427#false} assume true; {427#false} is VALID [2018-11-18 22:53:57,233 INFO L273 TraceCheckUtils]: 14: Hoare triple {427#false} assume !(~i~0 < 100000); {427#false} is VALID [2018-11-18 22:53:57,234 INFO L273 TraceCheckUtils]: 15: Hoare triple {427#false} ~i~0 := 0; {427#false} is VALID [2018-11-18 22:53:57,234 INFO L273 TraceCheckUtils]: 16: Hoare triple {427#false} assume true; {427#false} is VALID [2018-11-18 22:53:57,235 INFO L273 TraceCheckUtils]: 17: Hoare triple {427#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {427#false} is VALID [2018-11-18 22:53:57,235 INFO L273 TraceCheckUtils]: 18: Hoare triple {427#false} assume true; {427#false} is VALID [2018-11-18 22:53:57,236 INFO L273 TraceCheckUtils]: 19: Hoare triple {427#false} assume !(~i~0 < 100000); {427#false} is VALID [2018-11-18 22:53:57,236 INFO L273 TraceCheckUtils]: 20: Hoare triple {427#false} ~i~0 := 0; {427#false} is VALID [2018-11-18 22:53:57,236 INFO L273 TraceCheckUtils]: 21: Hoare triple {427#false} assume true; {427#false} is VALID [2018-11-18 22:53:57,236 INFO L273 TraceCheckUtils]: 22: Hoare triple {427#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {427#false} is VALID [2018-11-18 22:53:57,237 INFO L273 TraceCheckUtils]: 23: Hoare triple {427#false} assume true; {427#false} is VALID [2018-11-18 22:53:57,237 INFO L273 TraceCheckUtils]: 24: Hoare triple {427#false} assume !(~i~0 < 100000); {427#false} is VALID [2018-11-18 22:53:57,237 INFO L273 TraceCheckUtils]: 25: Hoare triple {427#false} havoc ~x~0;~x~0 := 0; {427#false} is VALID [2018-11-18 22:53:57,238 INFO L273 TraceCheckUtils]: 26: Hoare triple {427#false} assume true; {427#false} is VALID [2018-11-18 22:53:57,238 INFO L273 TraceCheckUtils]: 27: Hoare triple {427#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {427#false} is VALID [2018-11-18 22:53:57,238 INFO L256 TraceCheckUtils]: 28: Hoare triple {427#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {427#false} is VALID [2018-11-18 22:53:57,239 INFO L273 TraceCheckUtils]: 29: Hoare triple {427#false} ~cond := #in~cond; {427#false} is VALID [2018-11-18 22:53:57,239 INFO L273 TraceCheckUtils]: 30: Hoare triple {427#false} assume 0 == ~cond; {427#false} is VALID [2018-11-18 22:53:57,239 INFO L273 TraceCheckUtils]: 31: Hoare triple {427#false} assume !false; {427#false} is VALID [2018-11-18 22:53:57,241 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 22:53:57,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:57,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 22:53:57,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-18 22:53:57,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:57,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:53:57,362 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-18 22:53:57,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:53:57,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:53:57,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:53:57,363 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 5 states. [2018-11-18 22:53:57,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:57,765 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2018-11-18 22:53:57,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 22:53:57,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-18 22:53:57,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:57,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:53:57,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2018-11-18 22:53:57,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:53:57,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2018-11-18 22:53:57,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 77 transitions. [2018-11-18 22:53:57,913 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-18 22:53:57,915 INFO L225 Difference]: With dead ends: 72 [2018-11-18 22:53:57,916 INFO L226 Difference]: Without dead ends: 45 [2018-11-18 22:53:57,916 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-18 22:53:57,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-18 22:53:57,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-18 22:53:57,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:57,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 45 states. [2018-11-18 22:53:57,942 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-18 22:53:57,942 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-18 22:53:57,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:57,944 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-18 22:53:57,945 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-18 22:53:57,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:57,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:57,946 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-18 22:53:57,946 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-18 22:53:57,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:57,949 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-18 22:53:57,949 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-18 22:53:57,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:57,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:57,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:57,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:57,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-18 22:53:57,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-11-18 22:53:57,953 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 32 [2018-11-18 22:53:57,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:57,953 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-18 22:53:57,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 22:53:57,954 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-18 22:53:57,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 22:53:57,955 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:57,955 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:53:57,956 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:57,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:57,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1602425859, now seen corresponding path program 2 times [2018-11-18 22:53:57,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:57,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:57,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:57,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:53:57,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:58,083 INFO L256 TraceCheckUtils]: 0: Hoare triple {780#true} call ULTIMATE.init(); {780#true} is VALID [2018-11-18 22:53:58,084 INFO L273 TraceCheckUtils]: 1: Hoare triple {780#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {780#true} is VALID [2018-11-18 22:53:58,084 INFO L273 TraceCheckUtils]: 2: Hoare triple {780#true} assume true; {780#true} is VALID [2018-11-18 22:53:58,085 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {780#true} {780#true} #92#return; {780#true} is VALID [2018-11-18 22:53:58,085 INFO L256 TraceCheckUtils]: 4: Hoare triple {780#true} call #t~ret2 := main(); {780#true} is VALID [2018-11-18 22:53:58,086 INFO L273 TraceCheckUtils]: 5: Hoare triple {780#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {782#(= main_~i~0 0)} is VALID [2018-11-18 22:53:58,090 INFO L273 TraceCheckUtils]: 6: Hoare triple {782#(= main_~i~0 0)} assume true; {782#(= main_~i~0 0)} is VALID [2018-11-18 22:53:58,090 INFO L273 TraceCheckUtils]: 7: Hoare triple {782#(= 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; {783#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:58,092 INFO L273 TraceCheckUtils]: 8: Hoare triple {783#(<= main_~i~0 1)} assume true; {783#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:58,092 INFO L273 TraceCheckUtils]: 9: Hoare triple {783#(<= 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; {784#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:58,094 INFO L273 TraceCheckUtils]: 10: Hoare triple {784#(<= main_~i~0 2)} assume true; {784#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:58,095 INFO L273 TraceCheckUtils]: 11: Hoare triple {784#(<= main_~i~0 2)} assume !(~i~0 < 100000); {781#false} is VALID [2018-11-18 22:53:58,095 INFO L273 TraceCheckUtils]: 12: Hoare triple {781#false} ~i~0 := 0; {781#false} is VALID [2018-11-18 22:53:58,095 INFO L273 TraceCheckUtils]: 13: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-18 22:53:58,096 INFO L273 TraceCheckUtils]: 14: Hoare triple {781#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {781#false} is VALID [2018-11-18 22:53:58,096 INFO L273 TraceCheckUtils]: 15: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-18 22:53:58,097 INFO L273 TraceCheckUtils]: 16: Hoare triple {781#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {781#false} is VALID [2018-11-18 22:53:58,097 INFO L273 TraceCheckUtils]: 17: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-18 22:53:58,098 INFO L273 TraceCheckUtils]: 18: Hoare triple {781#false} assume !(~i~0 < 100000); {781#false} is VALID [2018-11-18 22:53:58,098 INFO L273 TraceCheckUtils]: 19: Hoare triple {781#false} ~i~0 := 0; {781#false} is VALID [2018-11-18 22:53:58,098 INFO L273 TraceCheckUtils]: 20: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-18 22:53:58,099 INFO L273 TraceCheckUtils]: 21: Hoare triple {781#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {781#false} is VALID [2018-11-18 22:53:58,099 INFO L273 TraceCheckUtils]: 22: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-18 22:53:58,099 INFO L273 TraceCheckUtils]: 23: Hoare triple {781#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {781#false} is VALID [2018-11-18 22:53:58,100 INFO L273 TraceCheckUtils]: 24: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-18 22:53:58,100 INFO L273 TraceCheckUtils]: 25: Hoare triple {781#false} assume !(~i~0 < 100000); {781#false} is VALID [2018-11-18 22:53:58,100 INFO L273 TraceCheckUtils]: 26: Hoare triple {781#false} ~i~0 := 0; {781#false} is VALID [2018-11-18 22:53:58,100 INFO L273 TraceCheckUtils]: 27: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-18 22:53:58,101 INFO L273 TraceCheckUtils]: 28: Hoare triple {781#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {781#false} is VALID [2018-11-18 22:53:58,101 INFO L273 TraceCheckUtils]: 29: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-18 22:53:58,101 INFO L273 TraceCheckUtils]: 30: Hoare triple {781#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {781#false} is VALID [2018-11-18 22:53:58,102 INFO L273 TraceCheckUtils]: 31: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-18 22:53:58,102 INFO L273 TraceCheckUtils]: 32: Hoare triple {781#false} assume !(~i~0 < 100000); {781#false} is VALID [2018-11-18 22:53:58,102 INFO L273 TraceCheckUtils]: 33: Hoare triple {781#false} havoc ~x~0;~x~0 := 0; {781#false} is VALID [2018-11-18 22:53:58,102 INFO L273 TraceCheckUtils]: 34: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-18 22:53:58,103 INFO L273 TraceCheckUtils]: 35: Hoare triple {781#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {781#false} is VALID [2018-11-18 22:53:58,103 INFO L256 TraceCheckUtils]: 36: Hoare triple {781#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {781#false} is VALID [2018-11-18 22:53:58,103 INFO L273 TraceCheckUtils]: 37: Hoare triple {781#false} ~cond := #in~cond; {781#false} is VALID [2018-11-18 22:53:58,104 INFO L273 TraceCheckUtils]: 38: Hoare triple {781#false} assume 0 == ~cond; {781#false} is VALID [2018-11-18 22:53:58,104 INFO L273 TraceCheckUtils]: 39: Hoare triple {781#false} assume !false; {781#false} is VALID [2018-11-18 22:53:58,107 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 22:53:58,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:58,108 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-18 22:53:58,120 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:53:58,143 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:53:58,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:53:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:58,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:58,306 INFO L256 TraceCheckUtils]: 0: Hoare triple {780#true} call ULTIMATE.init(); {780#true} is VALID [2018-11-18 22:53:58,306 INFO L273 TraceCheckUtils]: 1: Hoare triple {780#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {780#true} is VALID [2018-11-18 22:53:58,307 INFO L273 TraceCheckUtils]: 2: Hoare triple {780#true} assume true; {780#true} is VALID [2018-11-18 22:53:58,307 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {780#true} {780#true} #92#return; {780#true} is VALID [2018-11-18 22:53:58,307 INFO L256 TraceCheckUtils]: 4: Hoare triple {780#true} call #t~ret2 := main(); {780#true} is VALID [2018-11-18 22:53:58,308 INFO L273 TraceCheckUtils]: 5: Hoare triple {780#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {803#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:58,309 INFO L273 TraceCheckUtils]: 6: Hoare triple {803#(<= main_~i~0 0)} assume true; {803#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:58,310 INFO L273 TraceCheckUtils]: 7: Hoare triple {803#(<= 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; {783#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:58,310 INFO L273 TraceCheckUtils]: 8: Hoare triple {783#(<= main_~i~0 1)} assume true; {783#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:58,311 INFO L273 TraceCheckUtils]: 9: Hoare triple {783#(<= 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; {784#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:58,312 INFO L273 TraceCheckUtils]: 10: Hoare triple {784#(<= main_~i~0 2)} assume true; {784#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:58,313 INFO L273 TraceCheckUtils]: 11: Hoare triple {784#(<= main_~i~0 2)} assume !(~i~0 < 100000); {781#false} is VALID [2018-11-18 22:53:58,313 INFO L273 TraceCheckUtils]: 12: Hoare triple {781#false} ~i~0 := 0; {781#false} is VALID [2018-11-18 22:53:58,314 INFO L273 TraceCheckUtils]: 13: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-18 22:53:58,314 INFO L273 TraceCheckUtils]: 14: Hoare triple {781#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {781#false} is VALID [2018-11-18 22:53:58,314 INFO L273 TraceCheckUtils]: 15: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-18 22:53:58,315 INFO L273 TraceCheckUtils]: 16: Hoare triple {781#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {781#false} is VALID [2018-11-18 22:53:58,315 INFO L273 TraceCheckUtils]: 17: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-18 22:53:58,316 INFO L273 TraceCheckUtils]: 18: Hoare triple {781#false} assume !(~i~0 < 100000); {781#false} is VALID [2018-11-18 22:53:58,316 INFO L273 TraceCheckUtils]: 19: Hoare triple {781#false} ~i~0 := 0; {781#false} is VALID [2018-11-18 22:53:58,316 INFO L273 TraceCheckUtils]: 20: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-18 22:53:58,316 INFO L273 TraceCheckUtils]: 21: Hoare triple {781#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {781#false} is VALID [2018-11-18 22:53:58,317 INFO L273 TraceCheckUtils]: 22: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-18 22:53:58,317 INFO L273 TraceCheckUtils]: 23: Hoare triple {781#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {781#false} is VALID [2018-11-18 22:53:58,317 INFO L273 TraceCheckUtils]: 24: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-18 22:53:58,318 INFO L273 TraceCheckUtils]: 25: Hoare triple {781#false} assume !(~i~0 < 100000); {781#false} is VALID [2018-11-18 22:53:58,318 INFO L273 TraceCheckUtils]: 26: Hoare triple {781#false} ~i~0 := 0; {781#false} is VALID [2018-11-18 22:53:58,318 INFO L273 TraceCheckUtils]: 27: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-18 22:53:58,318 INFO L273 TraceCheckUtils]: 28: Hoare triple {781#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {781#false} is VALID [2018-11-18 22:53:58,319 INFO L273 TraceCheckUtils]: 29: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-18 22:53:58,319 INFO L273 TraceCheckUtils]: 30: Hoare triple {781#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {781#false} is VALID [2018-11-18 22:53:58,319 INFO L273 TraceCheckUtils]: 31: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-18 22:53:58,320 INFO L273 TraceCheckUtils]: 32: Hoare triple {781#false} assume !(~i~0 < 100000); {781#false} is VALID [2018-11-18 22:53:58,320 INFO L273 TraceCheckUtils]: 33: Hoare triple {781#false} havoc ~x~0;~x~0 := 0; {781#false} is VALID [2018-11-18 22:53:58,320 INFO L273 TraceCheckUtils]: 34: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-18 22:53:58,320 INFO L273 TraceCheckUtils]: 35: Hoare triple {781#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {781#false} is VALID [2018-11-18 22:53:58,321 INFO L256 TraceCheckUtils]: 36: Hoare triple {781#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {781#false} is VALID [2018-11-18 22:53:58,321 INFO L273 TraceCheckUtils]: 37: Hoare triple {781#false} ~cond := #in~cond; {781#false} is VALID [2018-11-18 22:53:58,321 INFO L273 TraceCheckUtils]: 38: Hoare triple {781#false} assume 0 == ~cond; {781#false} is VALID [2018-11-18 22:53:58,322 INFO L273 TraceCheckUtils]: 39: Hoare triple {781#false} assume !false; {781#false} is VALID [2018-11-18 22:53:58,324 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 22:53:58,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:58,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-18 22:53:58,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-11-18 22:53:58,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:58,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 22:53:58,412 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-18 22:53:58,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 22:53:58,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 22:53:58,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:53:58,413 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2018-11-18 22:53:58,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:58,707 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2018-11-18 22:53:58,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 22:53:58,707 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-11-18 22:53:58,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:58,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:53:58,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2018-11-18 22:53:58,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:53:58,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2018-11-18 22:53:58,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 85 transitions. [2018-11-18 22:53:58,919 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-18 22:53:58,922 INFO L225 Difference]: With dead ends: 86 [2018-11-18 22:53:58,922 INFO L226 Difference]: Without dead ends: 53 [2018-11-18 22:53:58,923 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 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-18 22:53:58,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-18 22:53:58,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-11-18 22:53:58,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:58,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 53 states. [2018-11-18 22:53:58,969 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2018-11-18 22:53:58,970 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2018-11-18 22:53:58,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:58,973 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-11-18 22:53:58,973 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-11-18 22:53:58,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:58,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:58,974 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2018-11-18 22:53:58,974 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2018-11-18 22:53:58,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:58,977 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-11-18 22:53:58,977 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-11-18 22:53:58,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:58,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:58,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:58,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:58,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-18 22:53:58,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-11-18 22:53:58,981 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 40 [2018-11-18 22:53:58,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:58,982 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-11-18 22:53:58,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 22:53:58,982 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-11-18 22:53:58,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 22:53:58,983 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:58,983 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:53:58,984 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:58,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:58,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1961405571, now seen corresponding path program 3 times [2018-11-18 22:53:58,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:58,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:58,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:58,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:53:58,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:59,178 INFO L256 TraceCheckUtils]: 0: Hoare triple {1208#true} call ULTIMATE.init(); {1208#true} is VALID [2018-11-18 22:53:59,178 INFO L273 TraceCheckUtils]: 1: Hoare triple {1208#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1208#true} is VALID [2018-11-18 22:53:59,179 INFO L273 TraceCheckUtils]: 2: Hoare triple {1208#true} assume true; {1208#true} is VALID [2018-11-18 22:53:59,179 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1208#true} {1208#true} #92#return; {1208#true} is VALID [2018-11-18 22:53:59,179 INFO L256 TraceCheckUtils]: 4: Hoare triple {1208#true} call #t~ret2 := main(); {1208#true} is VALID [2018-11-18 22:53:59,182 INFO L273 TraceCheckUtils]: 5: Hoare triple {1208#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1210#(= main_~i~0 0)} is VALID [2018-11-18 22:53:59,184 INFO L273 TraceCheckUtils]: 6: Hoare triple {1210#(= main_~i~0 0)} assume true; {1210#(= main_~i~0 0)} is VALID [2018-11-18 22:53:59,184 INFO L273 TraceCheckUtils]: 7: Hoare triple {1210#(= 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; {1211#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:59,186 INFO L273 TraceCheckUtils]: 8: Hoare triple {1211#(<= main_~i~0 1)} assume true; {1211#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:59,188 INFO L273 TraceCheckUtils]: 9: Hoare triple {1211#(<= 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; {1212#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:59,190 INFO L273 TraceCheckUtils]: 10: Hoare triple {1212#(<= main_~i~0 2)} assume true; {1212#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:59,191 INFO L273 TraceCheckUtils]: 11: Hoare triple {1212#(<= 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; {1213#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:59,192 INFO L273 TraceCheckUtils]: 12: Hoare triple {1213#(<= main_~i~0 3)} assume true; {1213#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:59,192 INFO L273 TraceCheckUtils]: 13: Hoare triple {1213#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1209#false} is VALID [2018-11-18 22:53:59,192 INFO L273 TraceCheckUtils]: 14: Hoare triple {1209#false} ~i~0 := 0; {1209#false} is VALID [2018-11-18 22:53:59,193 INFO L273 TraceCheckUtils]: 15: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-18 22:53:59,193 INFO L273 TraceCheckUtils]: 16: Hoare triple {1209#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1209#false} is VALID [2018-11-18 22:53:59,193 INFO L273 TraceCheckUtils]: 17: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-18 22:53:59,193 INFO L273 TraceCheckUtils]: 18: Hoare triple {1209#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1209#false} is VALID [2018-11-18 22:53:59,194 INFO L273 TraceCheckUtils]: 19: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-18 22:53:59,194 INFO L273 TraceCheckUtils]: 20: Hoare triple {1209#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1209#false} is VALID [2018-11-18 22:53:59,194 INFO L273 TraceCheckUtils]: 21: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-18 22:53:59,194 INFO L273 TraceCheckUtils]: 22: Hoare triple {1209#false} assume !(~i~0 < 100000); {1209#false} is VALID [2018-11-18 22:53:59,195 INFO L273 TraceCheckUtils]: 23: Hoare triple {1209#false} ~i~0 := 0; {1209#false} is VALID [2018-11-18 22:53:59,195 INFO L273 TraceCheckUtils]: 24: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-18 22:53:59,196 INFO L273 TraceCheckUtils]: 25: Hoare triple {1209#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1209#false} is VALID [2018-11-18 22:53:59,196 INFO L273 TraceCheckUtils]: 26: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-18 22:53:59,197 INFO L273 TraceCheckUtils]: 27: Hoare triple {1209#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1209#false} is VALID [2018-11-18 22:53:59,197 INFO L273 TraceCheckUtils]: 28: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-18 22:53:59,197 INFO L273 TraceCheckUtils]: 29: Hoare triple {1209#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1209#false} is VALID [2018-11-18 22:53:59,197 INFO L273 TraceCheckUtils]: 30: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-18 22:53:59,198 INFO L273 TraceCheckUtils]: 31: Hoare triple {1209#false} assume !(~i~0 < 100000); {1209#false} is VALID [2018-11-18 22:53:59,198 INFO L273 TraceCheckUtils]: 32: Hoare triple {1209#false} ~i~0 := 0; {1209#false} is VALID [2018-11-18 22:53:59,198 INFO L273 TraceCheckUtils]: 33: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-18 22:53:59,198 INFO L273 TraceCheckUtils]: 34: Hoare triple {1209#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1209#false} is VALID [2018-11-18 22:53:59,199 INFO L273 TraceCheckUtils]: 35: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-18 22:53:59,199 INFO L273 TraceCheckUtils]: 36: Hoare triple {1209#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1209#false} is VALID [2018-11-18 22:53:59,199 INFO L273 TraceCheckUtils]: 37: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-18 22:53:59,199 INFO L273 TraceCheckUtils]: 38: Hoare triple {1209#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1209#false} is VALID [2018-11-18 22:53:59,200 INFO L273 TraceCheckUtils]: 39: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-18 22:53:59,201 INFO L273 TraceCheckUtils]: 40: Hoare triple {1209#false} assume !(~i~0 < 100000); {1209#false} is VALID [2018-11-18 22:53:59,201 INFO L273 TraceCheckUtils]: 41: Hoare triple {1209#false} havoc ~x~0;~x~0 := 0; {1209#false} is VALID [2018-11-18 22:53:59,201 INFO L273 TraceCheckUtils]: 42: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-18 22:53:59,201 INFO L273 TraceCheckUtils]: 43: Hoare triple {1209#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1209#false} is VALID [2018-11-18 22:53:59,202 INFO L256 TraceCheckUtils]: 44: Hoare triple {1209#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {1209#false} is VALID [2018-11-18 22:53:59,202 INFO L273 TraceCheckUtils]: 45: Hoare triple {1209#false} ~cond := #in~cond; {1209#false} is VALID [2018-11-18 22:53:59,202 INFO L273 TraceCheckUtils]: 46: Hoare triple {1209#false} assume 0 == ~cond; {1209#false} is VALID [2018-11-18 22:53:59,202 INFO L273 TraceCheckUtils]: 47: Hoare triple {1209#false} assume !false; {1209#false} is VALID [2018-11-18 22:53:59,206 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-18 22:53:59,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:59,206 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-18 22:53:59,226 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:53:59,267 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 22:53:59,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:53:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:59,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:59,424 INFO L256 TraceCheckUtils]: 0: Hoare triple {1208#true} call ULTIMATE.init(); {1208#true} is VALID [2018-11-18 22:53:59,424 INFO L273 TraceCheckUtils]: 1: Hoare triple {1208#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1208#true} is VALID [2018-11-18 22:53:59,425 INFO L273 TraceCheckUtils]: 2: Hoare triple {1208#true} assume true; {1208#true} is VALID [2018-11-18 22:53:59,425 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1208#true} {1208#true} #92#return; {1208#true} is VALID [2018-11-18 22:53:59,425 INFO L256 TraceCheckUtils]: 4: Hoare triple {1208#true} call #t~ret2 := main(); {1208#true} is VALID [2018-11-18 22:53:59,425 INFO L273 TraceCheckUtils]: 5: Hoare triple {1208#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1208#true} is VALID [2018-11-18 22:53:59,425 INFO L273 TraceCheckUtils]: 6: Hoare triple {1208#true} assume true; {1208#true} is VALID [2018-11-18 22:53:59,426 INFO L273 TraceCheckUtils]: 7: Hoare triple {1208#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1208#true} is VALID [2018-11-18 22:53:59,426 INFO L273 TraceCheckUtils]: 8: Hoare triple {1208#true} assume true; {1208#true} is VALID [2018-11-18 22:53:59,426 INFO L273 TraceCheckUtils]: 9: Hoare triple {1208#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1208#true} is VALID [2018-11-18 22:53:59,426 INFO L273 TraceCheckUtils]: 10: Hoare triple {1208#true} assume true; {1208#true} is VALID [2018-11-18 22:53:59,426 INFO L273 TraceCheckUtils]: 11: Hoare triple {1208#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1208#true} is VALID [2018-11-18 22:53:59,427 INFO L273 TraceCheckUtils]: 12: Hoare triple {1208#true} assume true; {1208#true} is VALID [2018-11-18 22:53:59,427 INFO L273 TraceCheckUtils]: 13: Hoare triple {1208#true} assume !(~i~0 < 100000); {1208#true} is VALID [2018-11-18 22:53:59,427 INFO L273 TraceCheckUtils]: 14: Hoare triple {1208#true} ~i~0 := 0; {1259#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:59,428 INFO L273 TraceCheckUtils]: 15: Hoare triple {1259#(<= main_~i~0 0)} assume true; {1259#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:59,429 INFO L273 TraceCheckUtils]: 16: Hoare triple {1259#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1211#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:59,430 INFO L273 TraceCheckUtils]: 17: Hoare triple {1211#(<= main_~i~0 1)} assume true; {1211#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:59,433 INFO L273 TraceCheckUtils]: 18: Hoare triple {1211#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1212#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:59,436 INFO L273 TraceCheckUtils]: 19: Hoare triple {1212#(<= main_~i~0 2)} assume true; {1212#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:59,439 INFO L273 TraceCheckUtils]: 20: Hoare triple {1212#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1213#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:59,456 INFO L273 TraceCheckUtils]: 21: Hoare triple {1213#(<= main_~i~0 3)} assume true; {1213#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:59,471 INFO L273 TraceCheckUtils]: 22: Hoare triple {1213#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1209#false} is VALID [2018-11-18 22:53:59,471 INFO L273 TraceCheckUtils]: 23: Hoare triple {1209#false} ~i~0 := 0; {1209#false} is VALID [2018-11-18 22:53:59,471 INFO L273 TraceCheckUtils]: 24: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-18 22:53:59,472 INFO L273 TraceCheckUtils]: 25: Hoare triple {1209#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1209#false} is VALID [2018-11-18 22:53:59,472 INFO L273 TraceCheckUtils]: 26: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-18 22:53:59,472 INFO L273 TraceCheckUtils]: 27: Hoare triple {1209#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1209#false} is VALID [2018-11-18 22:53:59,472 INFO L273 TraceCheckUtils]: 28: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-18 22:53:59,473 INFO L273 TraceCheckUtils]: 29: Hoare triple {1209#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1209#false} is VALID [2018-11-18 22:53:59,474 INFO L273 TraceCheckUtils]: 30: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-18 22:53:59,474 INFO L273 TraceCheckUtils]: 31: Hoare triple {1209#false} assume !(~i~0 < 100000); {1209#false} is VALID [2018-11-18 22:53:59,474 INFO L273 TraceCheckUtils]: 32: Hoare triple {1209#false} ~i~0 := 0; {1209#false} is VALID [2018-11-18 22:53:59,474 INFO L273 TraceCheckUtils]: 33: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-18 22:53:59,475 INFO L273 TraceCheckUtils]: 34: Hoare triple {1209#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1209#false} is VALID [2018-11-18 22:53:59,475 INFO L273 TraceCheckUtils]: 35: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-18 22:53:59,475 INFO L273 TraceCheckUtils]: 36: Hoare triple {1209#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1209#false} is VALID [2018-11-18 22:53:59,475 INFO L273 TraceCheckUtils]: 37: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-18 22:53:59,476 INFO L273 TraceCheckUtils]: 38: Hoare triple {1209#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1209#false} is VALID [2018-11-18 22:53:59,479 INFO L273 TraceCheckUtils]: 39: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-18 22:53:59,479 INFO L273 TraceCheckUtils]: 40: Hoare triple {1209#false} assume !(~i~0 < 100000); {1209#false} is VALID [2018-11-18 22:53:59,480 INFO L273 TraceCheckUtils]: 41: Hoare triple {1209#false} havoc ~x~0;~x~0 := 0; {1209#false} is VALID [2018-11-18 22:53:59,480 INFO L273 TraceCheckUtils]: 42: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-18 22:53:59,480 INFO L273 TraceCheckUtils]: 43: Hoare triple {1209#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1209#false} is VALID [2018-11-18 22:53:59,480 INFO L256 TraceCheckUtils]: 44: Hoare triple {1209#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {1209#false} is VALID [2018-11-18 22:53:59,480 INFO L273 TraceCheckUtils]: 45: Hoare triple {1209#false} ~cond := #in~cond; {1209#false} is VALID [2018-11-18 22:53:59,481 INFO L273 TraceCheckUtils]: 46: Hoare triple {1209#false} assume 0 == ~cond; {1209#false} is VALID [2018-11-18 22:53:59,481 INFO L273 TraceCheckUtils]: 47: Hoare triple {1209#false} assume !false; {1209#false} is VALID [2018-11-18 22:53:59,484 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-18 22:53:59,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:59,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-18 22:53:59,505 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-11-18 22:53:59,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:59,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 22:53:59,558 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-18 22:53:59,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 22:53:59,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 22:53:59,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:53:59,559 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 7 states. [2018-11-18 22:53:59,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:59,822 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2018-11-18 22:53:59,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 22:53:59,822 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-11-18 22:53:59,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:59,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:53:59,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2018-11-18 22:53:59,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:53:59,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2018-11-18 22:53:59,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 93 transitions. [2018-11-18 22:53:59,966 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:59,968 INFO L225 Difference]: With dead ends: 100 [2018-11-18 22:53:59,969 INFO L226 Difference]: Without dead ends: 61 [2018-11-18 22:53:59,970 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 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-18 22:53:59,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-18 22:54:00,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-18 22:54:00,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:54:00,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 61 states. [2018-11-18 22:54:00,002 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2018-11-18 22:54:00,003 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2018-11-18 22:54:00,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:00,005 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-18 22:54:00,005 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-18 22:54:00,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:00,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:00,006 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2018-11-18 22:54:00,007 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2018-11-18 22:54:00,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:00,009 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-18 22:54:00,010 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-18 22:54:00,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:00,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:00,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:54:00,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:54:00,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-18 22:54:00,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-11-18 22:54:00,014 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 48 [2018-11-18 22:54:00,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:54:00,014 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-11-18 22:54:00,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 22:54:00,014 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-18 22:54:00,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-18 22:54:00,016 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:54:00,016 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:54:00,016 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:54:00,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:54:00,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1068700925, now seen corresponding path program 4 times [2018-11-18 22:54:00,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:54:00,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:54:00,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:00,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:54:00,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:00,159 INFO L256 TraceCheckUtils]: 0: Hoare triple {1710#true} call ULTIMATE.init(); {1710#true} is VALID [2018-11-18 22:54:00,159 INFO L273 TraceCheckUtils]: 1: Hoare triple {1710#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1710#true} is VALID [2018-11-18 22:54:00,160 INFO L273 TraceCheckUtils]: 2: Hoare triple {1710#true} assume true; {1710#true} is VALID [2018-11-18 22:54:00,160 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1710#true} {1710#true} #92#return; {1710#true} is VALID [2018-11-18 22:54:00,160 INFO L256 TraceCheckUtils]: 4: Hoare triple {1710#true} call #t~ret2 := main(); {1710#true} is VALID [2018-11-18 22:54:00,161 INFO L273 TraceCheckUtils]: 5: Hoare triple {1710#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1712#(= main_~i~0 0)} is VALID [2018-11-18 22:54:00,161 INFO L273 TraceCheckUtils]: 6: Hoare triple {1712#(= main_~i~0 0)} assume true; {1712#(= main_~i~0 0)} is VALID [2018-11-18 22:54:00,165 INFO L273 TraceCheckUtils]: 7: Hoare triple {1712#(= 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; {1713#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:00,165 INFO L273 TraceCheckUtils]: 8: Hoare triple {1713#(<= main_~i~0 1)} assume true; {1713#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:00,166 INFO L273 TraceCheckUtils]: 9: Hoare triple {1713#(<= 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; {1714#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:00,166 INFO L273 TraceCheckUtils]: 10: Hoare triple {1714#(<= main_~i~0 2)} assume true; {1714#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:00,168 INFO L273 TraceCheckUtils]: 11: Hoare triple {1714#(<= 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; {1715#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:00,169 INFO L273 TraceCheckUtils]: 12: Hoare triple {1715#(<= main_~i~0 3)} assume true; {1715#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:00,172 INFO L273 TraceCheckUtils]: 13: Hoare triple {1715#(<= 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; {1716#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:00,176 INFO L273 TraceCheckUtils]: 14: Hoare triple {1716#(<= main_~i~0 4)} assume true; {1716#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:00,178 INFO L273 TraceCheckUtils]: 15: Hoare triple {1716#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1711#false} is VALID [2018-11-18 22:54:00,178 INFO L273 TraceCheckUtils]: 16: Hoare triple {1711#false} ~i~0 := 0; {1711#false} is VALID [2018-11-18 22:54:00,178 INFO L273 TraceCheckUtils]: 17: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-18 22:54:00,178 INFO L273 TraceCheckUtils]: 18: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1711#false} is VALID [2018-11-18 22:54:00,179 INFO L273 TraceCheckUtils]: 19: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-18 22:54:00,179 INFO L273 TraceCheckUtils]: 20: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1711#false} is VALID [2018-11-18 22:54:00,179 INFO L273 TraceCheckUtils]: 21: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-18 22:54:00,179 INFO L273 TraceCheckUtils]: 22: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1711#false} is VALID [2018-11-18 22:54:00,180 INFO L273 TraceCheckUtils]: 23: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-18 22:54:00,180 INFO L273 TraceCheckUtils]: 24: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1711#false} is VALID [2018-11-18 22:54:00,180 INFO L273 TraceCheckUtils]: 25: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-18 22:54:00,180 INFO L273 TraceCheckUtils]: 26: Hoare triple {1711#false} assume !(~i~0 < 100000); {1711#false} is VALID [2018-11-18 22:54:00,181 INFO L273 TraceCheckUtils]: 27: Hoare triple {1711#false} ~i~0 := 0; {1711#false} is VALID [2018-11-18 22:54:00,181 INFO L273 TraceCheckUtils]: 28: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-18 22:54:00,181 INFO L273 TraceCheckUtils]: 29: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1711#false} is VALID [2018-11-18 22:54:00,181 INFO L273 TraceCheckUtils]: 30: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-18 22:54:00,182 INFO L273 TraceCheckUtils]: 31: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1711#false} is VALID [2018-11-18 22:54:00,182 INFO L273 TraceCheckUtils]: 32: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-18 22:54:00,182 INFO L273 TraceCheckUtils]: 33: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1711#false} is VALID [2018-11-18 22:54:00,182 INFO L273 TraceCheckUtils]: 34: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-18 22:54:00,182 INFO L273 TraceCheckUtils]: 35: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1711#false} is VALID [2018-11-18 22:54:00,182 INFO L273 TraceCheckUtils]: 36: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-18 22:54:00,183 INFO L273 TraceCheckUtils]: 37: Hoare triple {1711#false} assume !(~i~0 < 100000); {1711#false} is VALID [2018-11-18 22:54:00,183 INFO L273 TraceCheckUtils]: 38: Hoare triple {1711#false} ~i~0 := 0; {1711#false} is VALID [2018-11-18 22:54:00,183 INFO L273 TraceCheckUtils]: 39: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-18 22:54:00,183 INFO L273 TraceCheckUtils]: 40: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1711#false} is VALID [2018-11-18 22:54:00,183 INFO L273 TraceCheckUtils]: 41: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-18 22:54:00,184 INFO L273 TraceCheckUtils]: 42: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1711#false} is VALID [2018-11-18 22:54:00,184 INFO L273 TraceCheckUtils]: 43: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-18 22:54:00,184 INFO L273 TraceCheckUtils]: 44: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1711#false} is VALID [2018-11-18 22:54:00,184 INFO L273 TraceCheckUtils]: 45: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-18 22:54:00,184 INFO L273 TraceCheckUtils]: 46: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1711#false} is VALID [2018-11-18 22:54:00,185 INFO L273 TraceCheckUtils]: 47: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-18 22:54:00,185 INFO L273 TraceCheckUtils]: 48: Hoare triple {1711#false} assume !(~i~0 < 100000); {1711#false} is VALID [2018-11-18 22:54:00,185 INFO L273 TraceCheckUtils]: 49: Hoare triple {1711#false} havoc ~x~0;~x~0 := 0; {1711#false} is VALID [2018-11-18 22:54:00,185 INFO L273 TraceCheckUtils]: 50: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-18 22:54:00,185 INFO L273 TraceCheckUtils]: 51: Hoare triple {1711#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1711#false} is VALID [2018-11-18 22:54:00,186 INFO L256 TraceCheckUtils]: 52: Hoare triple {1711#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {1711#false} is VALID [2018-11-18 22:54:00,186 INFO L273 TraceCheckUtils]: 53: Hoare triple {1711#false} ~cond := #in~cond; {1711#false} is VALID [2018-11-18 22:54:00,186 INFO L273 TraceCheckUtils]: 54: Hoare triple {1711#false} assume 0 == ~cond; {1711#false} is VALID [2018-11-18 22:54:00,186 INFO L273 TraceCheckUtils]: 55: Hoare triple {1711#false} assume !false; {1711#false} is VALID [2018-11-18 22:54:00,190 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-18 22:54:00,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:54:00,190 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-18 22:54:00,200 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:54:00,253 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:54:00,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:54:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:00,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:54:00,444 INFO L256 TraceCheckUtils]: 0: Hoare triple {1710#true} call ULTIMATE.init(); {1710#true} is VALID [2018-11-18 22:54:00,444 INFO L273 TraceCheckUtils]: 1: Hoare triple {1710#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1710#true} is VALID [2018-11-18 22:54:00,445 INFO L273 TraceCheckUtils]: 2: Hoare triple {1710#true} assume true; {1710#true} is VALID [2018-11-18 22:54:00,445 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1710#true} {1710#true} #92#return; {1710#true} is VALID [2018-11-18 22:54:00,445 INFO L256 TraceCheckUtils]: 4: Hoare triple {1710#true} call #t~ret2 := main(); {1710#true} is VALID [2018-11-18 22:54:00,446 INFO L273 TraceCheckUtils]: 5: Hoare triple {1710#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1735#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:00,447 INFO L273 TraceCheckUtils]: 6: Hoare triple {1735#(<= main_~i~0 0)} assume true; {1735#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:00,448 INFO L273 TraceCheckUtils]: 7: Hoare triple {1735#(<= 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; {1713#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:00,448 INFO L273 TraceCheckUtils]: 8: Hoare triple {1713#(<= main_~i~0 1)} assume true; {1713#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:00,449 INFO L273 TraceCheckUtils]: 9: Hoare triple {1713#(<= 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; {1714#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:00,450 INFO L273 TraceCheckUtils]: 10: Hoare triple {1714#(<= main_~i~0 2)} assume true; {1714#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:00,451 INFO L273 TraceCheckUtils]: 11: Hoare triple {1714#(<= 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; {1715#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:00,452 INFO L273 TraceCheckUtils]: 12: Hoare triple {1715#(<= main_~i~0 3)} assume true; {1715#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:00,453 INFO L273 TraceCheckUtils]: 13: Hoare triple {1715#(<= 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; {1716#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:00,454 INFO L273 TraceCheckUtils]: 14: Hoare triple {1716#(<= main_~i~0 4)} assume true; {1716#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:00,455 INFO L273 TraceCheckUtils]: 15: Hoare triple {1716#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1711#false} is VALID [2018-11-18 22:54:00,455 INFO L273 TraceCheckUtils]: 16: Hoare triple {1711#false} ~i~0 := 0; {1711#false} is VALID [2018-11-18 22:54:00,455 INFO L273 TraceCheckUtils]: 17: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-18 22:54:00,456 INFO L273 TraceCheckUtils]: 18: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1711#false} is VALID [2018-11-18 22:54:00,456 INFO L273 TraceCheckUtils]: 19: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-18 22:54:00,456 INFO L273 TraceCheckUtils]: 20: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1711#false} is VALID [2018-11-18 22:54:00,457 INFO L273 TraceCheckUtils]: 21: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-18 22:54:00,457 INFO L273 TraceCheckUtils]: 22: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1711#false} is VALID [2018-11-18 22:54:00,458 INFO L273 TraceCheckUtils]: 23: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-18 22:54:00,458 INFO L273 TraceCheckUtils]: 24: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1711#false} is VALID [2018-11-18 22:54:00,458 INFO L273 TraceCheckUtils]: 25: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-18 22:54:00,459 INFO L273 TraceCheckUtils]: 26: Hoare triple {1711#false} assume !(~i~0 < 100000); {1711#false} is VALID [2018-11-18 22:54:00,459 INFO L273 TraceCheckUtils]: 27: Hoare triple {1711#false} ~i~0 := 0; {1711#false} is VALID [2018-11-18 22:54:00,460 INFO L273 TraceCheckUtils]: 28: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-18 22:54:00,460 INFO L273 TraceCheckUtils]: 29: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1711#false} is VALID [2018-11-18 22:54:00,460 INFO L273 TraceCheckUtils]: 30: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-18 22:54:00,461 INFO L273 TraceCheckUtils]: 31: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1711#false} is VALID [2018-11-18 22:54:00,461 INFO L273 TraceCheckUtils]: 32: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-18 22:54:00,461 INFO L273 TraceCheckUtils]: 33: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1711#false} is VALID [2018-11-18 22:54:00,461 INFO L273 TraceCheckUtils]: 34: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-18 22:54:00,462 INFO L273 TraceCheckUtils]: 35: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1711#false} is VALID [2018-11-18 22:54:00,462 INFO L273 TraceCheckUtils]: 36: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-18 22:54:00,462 INFO L273 TraceCheckUtils]: 37: Hoare triple {1711#false} assume !(~i~0 < 100000); {1711#false} is VALID [2018-11-18 22:54:00,462 INFO L273 TraceCheckUtils]: 38: Hoare triple {1711#false} ~i~0 := 0; {1711#false} is VALID [2018-11-18 22:54:00,463 INFO L273 TraceCheckUtils]: 39: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-18 22:54:00,463 INFO L273 TraceCheckUtils]: 40: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1711#false} is VALID [2018-11-18 22:54:00,463 INFO L273 TraceCheckUtils]: 41: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-18 22:54:00,463 INFO L273 TraceCheckUtils]: 42: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1711#false} is VALID [2018-11-18 22:54:00,464 INFO L273 TraceCheckUtils]: 43: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-18 22:54:00,464 INFO L273 TraceCheckUtils]: 44: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1711#false} is VALID [2018-11-18 22:54:00,464 INFO L273 TraceCheckUtils]: 45: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-18 22:54:00,464 INFO L273 TraceCheckUtils]: 46: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1711#false} is VALID [2018-11-18 22:54:00,465 INFO L273 TraceCheckUtils]: 47: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-18 22:54:00,465 INFO L273 TraceCheckUtils]: 48: Hoare triple {1711#false} assume !(~i~0 < 100000); {1711#false} is VALID [2018-11-18 22:54:00,465 INFO L273 TraceCheckUtils]: 49: Hoare triple {1711#false} havoc ~x~0;~x~0 := 0; {1711#false} is VALID [2018-11-18 22:54:00,465 INFO L273 TraceCheckUtils]: 50: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-18 22:54:00,466 INFO L273 TraceCheckUtils]: 51: Hoare triple {1711#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1711#false} is VALID [2018-11-18 22:54:00,466 INFO L256 TraceCheckUtils]: 52: Hoare triple {1711#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {1711#false} is VALID [2018-11-18 22:54:00,466 INFO L273 TraceCheckUtils]: 53: Hoare triple {1711#false} ~cond := #in~cond; {1711#false} is VALID [2018-11-18 22:54:00,466 INFO L273 TraceCheckUtils]: 54: Hoare triple {1711#false} assume 0 == ~cond; {1711#false} is VALID [2018-11-18 22:54:00,467 INFO L273 TraceCheckUtils]: 55: Hoare triple {1711#false} assume !false; {1711#false} is VALID [2018-11-18 22:54:00,470 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-18 22:54:00,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:54:00,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-18 22:54:00,490 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-11-18 22:54:00,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:54:00,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 22:54:00,563 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-18 22:54:00,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 22:54:00,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 22:54:00,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:54:00,565 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 8 states. [2018-11-18 22:54:01,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:01,289 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2018-11-18 22:54:01,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 22:54:01,290 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-11-18 22:54:01,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:54:01,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:54:01,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2018-11-18 22:54:01,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:54:01,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2018-11-18 22:54:01,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 101 transitions. [2018-11-18 22:54:01,542 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:54:01,544 INFO L225 Difference]: With dead ends: 114 [2018-11-18 22:54:01,544 INFO L226 Difference]: Without dead ends: 69 [2018-11-18 22:54:01,545 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:54:01,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-18 22:54:01,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-11-18 22:54:01,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:54:01,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 69 states. [2018-11-18 22:54:01,586 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 69 states. [2018-11-18 22:54:01,586 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 69 states. [2018-11-18 22:54:01,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:01,589 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-18 22:54:01,589 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-18 22:54:01,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:01,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:01,589 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 69 states. [2018-11-18 22:54:01,589 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 69 states. [2018-11-18 22:54:01,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:01,592 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-18 22:54:01,592 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-18 22:54:01,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:01,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:01,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:54:01,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:54:01,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-18 22:54:01,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-11-18 22:54:01,596 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 56 [2018-11-18 22:54:01,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:54:01,596 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-11-18 22:54:01,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 22:54:01,596 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-18 22:54:01,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-18 22:54:01,598 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:54:01,598 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:54:01,598 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:54:01,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:54:01,598 INFO L82 PathProgramCache]: Analyzing trace with hash 884551805, now seen corresponding path program 5 times [2018-11-18 22:54:01,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:54:01,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:54:01,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:01,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:54:01,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:01,765 INFO L256 TraceCheckUtils]: 0: Hoare triple {2286#true} call ULTIMATE.init(); {2286#true} is VALID [2018-11-18 22:54:01,765 INFO L273 TraceCheckUtils]: 1: Hoare triple {2286#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2286#true} is VALID [2018-11-18 22:54:01,766 INFO L273 TraceCheckUtils]: 2: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-18 22:54:01,766 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2286#true} {2286#true} #92#return; {2286#true} is VALID [2018-11-18 22:54:01,766 INFO L256 TraceCheckUtils]: 4: Hoare triple {2286#true} call #t~ret2 := main(); {2286#true} is VALID [2018-11-18 22:54:01,767 INFO L273 TraceCheckUtils]: 5: Hoare triple {2286#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2288#(= main_~i~0 0)} is VALID [2018-11-18 22:54:01,769 INFO L273 TraceCheckUtils]: 6: Hoare triple {2288#(= main_~i~0 0)} assume true; {2288#(= main_~i~0 0)} is VALID [2018-11-18 22:54:01,769 INFO L273 TraceCheckUtils]: 7: Hoare triple {2288#(= 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; {2289#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:01,770 INFO L273 TraceCheckUtils]: 8: Hoare triple {2289#(<= main_~i~0 1)} assume true; {2289#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:01,775 INFO L273 TraceCheckUtils]: 9: Hoare triple {2289#(<= 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; {2290#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:01,776 INFO L273 TraceCheckUtils]: 10: Hoare triple {2290#(<= main_~i~0 2)} assume true; {2290#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:01,777 INFO L273 TraceCheckUtils]: 11: Hoare triple {2290#(<= 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; {2291#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:01,777 INFO L273 TraceCheckUtils]: 12: Hoare triple {2291#(<= main_~i~0 3)} assume true; {2291#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:01,796 INFO L273 TraceCheckUtils]: 13: Hoare triple {2291#(<= 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; {2292#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:01,805 INFO L273 TraceCheckUtils]: 14: Hoare triple {2292#(<= main_~i~0 4)} assume true; {2292#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:01,814 INFO L273 TraceCheckUtils]: 15: Hoare triple {2292#(<= 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; {2293#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:01,815 INFO L273 TraceCheckUtils]: 16: Hoare triple {2293#(<= main_~i~0 5)} assume true; {2293#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:01,819 INFO L273 TraceCheckUtils]: 17: Hoare triple {2293#(<= main_~i~0 5)} assume !(~i~0 < 100000); {2287#false} is VALID [2018-11-18 22:54:01,819 INFO L273 TraceCheckUtils]: 18: Hoare triple {2287#false} ~i~0 := 0; {2287#false} is VALID [2018-11-18 22:54:01,819 INFO L273 TraceCheckUtils]: 19: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-18 22:54:01,819 INFO L273 TraceCheckUtils]: 20: Hoare triple {2287#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2287#false} is VALID [2018-11-18 22:54:01,819 INFO L273 TraceCheckUtils]: 21: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-18 22:54:01,820 INFO L273 TraceCheckUtils]: 22: Hoare triple {2287#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2287#false} is VALID [2018-11-18 22:54:01,820 INFO L273 TraceCheckUtils]: 23: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-18 22:54:01,820 INFO L273 TraceCheckUtils]: 24: Hoare triple {2287#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2287#false} is VALID [2018-11-18 22:54:01,820 INFO L273 TraceCheckUtils]: 25: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-18 22:54:01,820 INFO L273 TraceCheckUtils]: 26: Hoare triple {2287#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2287#false} is VALID [2018-11-18 22:54:01,820 INFO L273 TraceCheckUtils]: 27: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-18 22:54:01,821 INFO L273 TraceCheckUtils]: 28: Hoare triple {2287#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2287#false} is VALID [2018-11-18 22:54:01,821 INFO L273 TraceCheckUtils]: 29: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-18 22:54:01,821 INFO L273 TraceCheckUtils]: 30: Hoare triple {2287#false} assume !(~i~0 < 100000); {2287#false} is VALID [2018-11-18 22:54:01,821 INFO L273 TraceCheckUtils]: 31: Hoare triple {2287#false} ~i~0 := 0; {2287#false} is VALID [2018-11-18 22:54:01,821 INFO L273 TraceCheckUtils]: 32: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-18 22:54:01,822 INFO L273 TraceCheckUtils]: 33: Hoare triple {2287#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2287#false} is VALID [2018-11-18 22:54:01,822 INFO L273 TraceCheckUtils]: 34: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-18 22:54:01,822 INFO L273 TraceCheckUtils]: 35: Hoare triple {2287#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2287#false} is VALID [2018-11-18 22:54:01,822 INFO L273 TraceCheckUtils]: 36: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-18 22:54:01,822 INFO L273 TraceCheckUtils]: 37: Hoare triple {2287#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2287#false} is VALID [2018-11-18 22:54:01,822 INFO L273 TraceCheckUtils]: 38: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-18 22:54:01,823 INFO L273 TraceCheckUtils]: 39: Hoare triple {2287#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2287#false} is VALID [2018-11-18 22:54:01,823 INFO L273 TraceCheckUtils]: 40: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-18 22:54:01,823 INFO L273 TraceCheckUtils]: 41: Hoare triple {2287#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2287#false} is VALID [2018-11-18 22:54:01,823 INFO L273 TraceCheckUtils]: 42: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-18 22:54:01,823 INFO L273 TraceCheckUtils]: 43: Hoare triple {2287#false} assume !(~i~0 < 100000); {2287#false} is VALID [2018-11-18 22:54:01,823 INFO L273 TraceCheckUtils]: 44: Hoare triple {2287#false} ~i~0 := 0; {2287#false} is VALID [2018-11-18 22:54:01,824 INFO L273 TraceCheckUtils]: 45: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-18 22:54:01,824 INFO L273 TraceCheckUtils]: 46: Hoare triple {2287#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2287#false} is VALID [2018-11-18 22:54:01,824 INFO L273 TraceCheckUtils]: 47: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-18 22:54:01,824 INFO L273 TraceCheckUtils]: 48: Hoare triple {2287#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2287#false} is VALID [2018-11-18 22:54:01,824 INFO L273 TraceCheckUtils]: 49: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-18 22:54:01,824 INFO L273 TraceCheckUtils]: 50: Hoare triple {2287#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2287#false} is VALID [2018-11-18 22:54:01,825 INFO L273 TraceCheckUtils]: 51: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-18 22:54:01,825 INFO L273 TraceCheckUtils]: 52: Hoare triple {2287#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2287#false} is VALID [2018-11-18 22:54:01,825 INFO L273 TraceCheckUtils]: 53: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-18 22:54:01,825 INFO L273 TraceCheckUtils]: 54: Hoare triple {2287#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2287#false} is VALID [2018-11-18 22:54:01,825 INFO L273 TraceCheckUtils]: 55: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-18 22:54:01,825 INFO L273 TraceCheckUtils]: 56: Hoare triple {2287#false} assume !(~i~0 < 100000); {2287#false} is VALID [2018-11-18 22:54:01,826 INFO L273 TraceCheckUtils]: 57: Hoare triple {2287#false} havoc ~x~0;~x~0 := 0; {2287#false} is VALID [2018-11-18 22:54:01,826 INFO L273 TraceCheckUtils]: 58: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-18 22:54:01,826 INFO L273 TraceCheckUtils]: 59: Hoare triple {2287#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2287#false} is VALID [2018-11-18 22:54:01,826 INFO L256 TraceCheckUtils]: 60: Hoare triple {2287#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {2287#false} is VALID [2018-11-18 22:54:01,826 INFO L273 TraceCheckUtils]: 61: Hoare triple {2287#false} ~cond := #in~cond; {2287#false} is VALID [2018-11-18 22:54:01,827 INFO L273 TraceCheckUtils]: 62: Hoare triple {2287#false} assume 0 == ~cond; {2287#false} is VALID [2018-11-18 22:54:01,827 INFO L273 TraceCheckUtils]: 63: Hoare triple {2287#false} assume !false; {2287#false} is VALID [2018-11-18 22:54:01,831 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-18 22:54:01,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:54:01,831 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-18 22:54:01,840 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:54:03,384 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-18 22:54:03,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:54:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:03,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:54:03,531 INFO L256 TraceCheckUtils]: 0: Hoare triple {2286#true} call ULTIMATE.init(); {2286#true} is VALID [2018-11-18 22:54:03,531 INFO L273 TraceCheckUtils]: 1: Hoare triple {2286#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2286#true} is VALID [2018-11-18 22:54:03,531 INFO L273 TraceCheckUtils]: 2: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-18 22:54:03,531 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2286#true} {2286#true} #92#return; {2286#true} is VALID [2018-11-18 22:54:03,532 INFO L256 TraceCheckUtils]: 4: Hoare triple {2286#true} call #t~ret2 := main(); {2286#true} is VALID [2018-11-18 22:54:03,532 INFO L273 TraceCheckUtils]: 5: Hoare triple {2286#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2286#true} is VALID [2018-11-18 22:54:03,532 INFO L273 TraceCheckUtils]: 6: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-18 22:54:03,532 INFO L273 TraceCheckUtils]: 7: Hoare triple {2286#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2286#true} is VALID [2018-11-18 22:54:03,532 INFO L273 TraceCheckUtils]: 8: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-18 22:54:03,532 INFO L273 TraceCheckUtils]: 9: Hoare triple {2286#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2286#true} is VALID [2018-11-18 22:54:03,533 INFO L273 TraceCheckUtils]: 10: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-18 22:54:03,533 INFO L273 TraceCheckUtils]: 11: Hoare triple {2286#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2286#true} is VALID [2018-11-18 22:54:03,533 INFO L273 TraceCheckUtils]: 12: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-18 22:54:03,533 INFO L273 TraceCheckUtils]: 13: Hoare triple {2286#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2286#true} is VALID [2018-11-18 22:54:03,533 INFO L273 TraceCheckUtils]: 14: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-18 22:54:03,533 INFO L273 TraceCheckUtils]: 15: Hoare triple {2286#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2286#true} is VALID [2018-11-18 22:54:03,534 INFO L273 TraceCheckUtils]: 16: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-18 22:54:03,534 INFO L273 TraceCheckUtils]: 17: Hoare triple {2286#true} assume !(~i~0 < 100000); {2286#true} is VALID [2018-11-18 22:54:03,534 INFO L273 TraceCheckUtils]: 18: Hoare triple {2286#true} ~i~0 := 0; {2286#true} is VALID [2018-11-18 22:54:03,534 INFO L273 TraceCheckUtils]: 19: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-18 22:54:03,534 INFO L273 TraceCheckUtils]: 20: Hoare triple {2286#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2286#true} is VALID [2018-11-18 22:54:03,534 INFO L273 TraceCheckUtils]: 21: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-18 22:54:03,535 INFO L273 TraceCheckUtils]: 22: Hoare triple {2286#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2286#true} is VALID [2018-11-18 22:54:03,535 INFO L273 TraceCheckUtils]: 23: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-18 22:54:03,535 INFO L273 TraceCheckUtils]: 24: Hoare triple {2286#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2286#true} is VALID [2018-11-18 22:54:03,535 INFO L273 TraceCheckUtils]: 25: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-18 22:54:03,535 INFO L273 TraceCheckUtils]: 26: Hoare triple {2286#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2286#true} is VALID [2018-11-18 22:54:03,535 INFO L273 TraceCheckUtils]: 27: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-18 22:54:03,536 INFO L273 TraceCheckUtils]: 28: Hoare triple {2286#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2286#true} is VALID [2018-11-18 22:54:03,536 INFO L273 TraceCheckUtils]: 29: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-18 22:54:03,536 INFO L273 TraceCheckUtils]: 30: Hoare triple {2286#true} assume !(~i~0 < 100000); {2286#true} is VALID [2018-11-18 22:54:03,536 INFO L273 TraceCheckUtils]: 31: Hoare triple {2286#true} ~i~0 := 0; {2286#true} is VALID [2018-11-18 22:54:03,536 INFO L273 TraceCheckUtils]: 32: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-18 22:54:03,536 INFO L273 TraceCheckUtils]: 33: Hoare triple {2286#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2286#true} is VALID [2018-11-18 22:54:03,537 INFO L273 TraceCheckUtils]: 34: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-18 22:54:03,537 INFO L273 TraceCheckUtils]: 35: Hoare triple {2286#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2286#true} is VALID [2018-11-18 22:54:03,537 INFO L273 TraceCheckUtils]: 36: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-18 22:54:03,537 INFO L273 TraceCheckUtils]: 37: Hoare triple {2286#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2286#true} is VALID [2018-11-18 22:54:03,537 INFO L273 TraceCheckUtils]: 38: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-18 22:54:03,537 INFO L273 TraceCheckUtils]: 39: Hoare triple {2286#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2286#true} is VALID [2018-11-18 22:54:03,552 INFO L273 TraceCheckUtils]: 40: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-18 22:54:03,552 INFO L273 TraceCheckUtils]: 41: Hoare triple {2286#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2286#true} is VALID [2018-11-18 22:54:03,553 INFO L273 TraceCheckUtils]: 42: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-18 22:54:03,553 INFO L273 TraceCheckUtils]: 43: Hoare triple {2286#true} assume !(~i~0 < 100000); {2286#true} is VALID [2018-11-18 22:54:03,559 INFO L273 TraceCheckUtils]: 44: Hoare triple {2286#true} ~i~0 := 0; {2429#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:03,563 INFO L273 TraceCheckUtils]: 45: Hoare triple {2429#(<= main_~i~0 0)} assume true; {2429#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:03,572 INFO L273 TraceCheckUtils]: 46: Hoare triple {2429#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2289#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:03,574 INFO L273 TraceCheckUtils]: 47: Hoare triple {2289#(<= main_~i~0 1)} assume true; {2289#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:03,574 INFO L273 TraceCheckUtils]: 48: Hoare triple {2289#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2290#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:03,576 INFO L273 TraceCheckUtils]: 49: Hoare triple {2290#(<= main_~i~0 2)} assume true; {2290#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:03,576 INFO L273 TraceCheckUtils]: 50: Hoare triple {2290#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2291#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:03,578 INFO L273 TraceCheckUtils]: 51: Hoare triple {2291#(<= main_~i~0 3)} assume true; {2291#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:03,587 INFO L273 TraceCheckUtils]: 52: Hoare triple {2291#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2292#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:03,597 INFO L273 TraceCheckUtils]: 53: Hoare triple {2292#(<= main_~i~0 4)} assume true; {2292#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:03,598 INFO L273 TraceCheckUtils]: 54: Hoare triple {2292#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2293#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:03,599 INFO L273 TraceCheckUtils]: 55: Hoare triple {2293#(<= main_~i~0 5)} assume true; {2293#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:03,599 INFO L273 TraceCheckUtils]: 56: Hoare triple {2293#(<= main_~i~0 5)} assume !(~i~0 < 100000); {2287#false} is VALID [2018-11-18 22:54:03,600 INFO L273 TraceCheckUtils]: 57: Hoare triple {2287#false} havoc ~x~0;~x~0 := 0; {2287#false} is VALID [2018-11-18 22:54:03,600 INFO L273 TraceCheckUtils]: 58: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-18 22:54:03,600 INFO L273 TraceCheckUtils]: 59: Hoare triple {2287#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2287#false} is VALID [2018-11-18 22:54:03,600 INFO L256 TraceCheckUtils]: 60: Hoare triple {2287#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {2287#false} is VALID [2018-11-18 22:54:03,600 INFO L273 TraceCheckUtils]: 61: Hoare triple {2287#false} ~cond := #in~cond; {2287#false} is VALID [2018-11-18 22:54:03,600 INFO L273 TraceCheckUtils]: 62: Hoare triple {2287#false} assume 0 == ~cond; {2287#false} is VALID [2018-11-18 22:54:03,600 INFO L273 TraceCheckUtils]: 63: Hoare triple {2287#false} assume !false; {2287#false} is VALID [2018-11-18 22:54:03,603 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-18 22:54:03,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:54:03,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-18 22:54:03,624 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2018-11-18 22:54:03,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:54:03,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 22:54:03,798 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:54:03,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 22:54:03,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 22:54:03,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:54:03,800 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 9 states. [2018-11-18 22:54:04,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:04,255 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2018-11-18 22:54:04,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:54:04,255 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2018-11-18 22:54:04,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:54:04,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:54:04,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2018-11-18 22:54:04,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:54:04,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2018-11-18 22:54:04,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 109 transitions. [2018-11-18 22:54:04,397 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-18 22:54:04,399 INFO L225 Difference]: With dead ends: 128 [2018-11-18 22:54:04,399 INFO L226 Difference]: Without dead ends: 77 [2018-11-18 22:54:04,402 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 64 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-18 22:54:04,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-18 22:54:04,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-11-18 22:54:04,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:54:04,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 77 states. [2018-11-18 22:54:04,449 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 77 states. [2018-11-18 22:54:04,450 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 77 states. [2018-11-18 22:54:04,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:04,452 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-11-18 22:54:04,452 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-18 22:54:04,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:04,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:04,453 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 77 states. [2018-11-18 22:54:04,453 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 77 states. [2018-11-18 22:54:04,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:04,456 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-11-18 22:54:04,456 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-18 22:54:04,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:04,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:04,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:54:04,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:54:04,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-18 22:54:04,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-11-18 22:54:04,459 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 64 [2018-11-18 22:54:04,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:54:04,459 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-11-18 22:54:04,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 22:54:04,460 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-18 22:54:04,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 22:54:04,460 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:54:04,461 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:54:04,461 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:54:04,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:54:04,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1829591555, now seen corresponding path program 6 times [2018-11-18 22:54:04,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:54:04,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:54:04,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:04,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:54:04,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:04,671 INFO L256 TraceCheckUtils]: 0: Hoare triple {2936#true} call ULTIMATE.init(); {2936#true} is VALID [2018-11-18 22:54:04,671 INFO L273 TraceCheckUtils]: 1: Hoare triple {2936#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2936#true} is VALID [2018-11-18 22:54:04,671 INFO L273 TraceCheckUtils]: 2: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-18 22:54:04,672 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2936#true} {2936#true} #92#return; {2936#true} is VALID [2018-11-18 22:54:04,672 INFO L256 TraceCheckUtils]: 4: Hoare triple {2936#true} call #t~ret2 := main(); {2936#true} is VALID [2018-11-18 22:54:04,672 INFO L273 TraceCheckUtils]: 5: Hoare triple {2936#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2938#(= main_~i~0 0)} is VALID [2018-11-18 22:54:04,673 INFO L273 TraceCheckUtils]: 6: Hoare triple {2938#(= main_~i~0 0)} assume true; {2938#(= main_~i~0 0)} is VALID [2018-11-18 22:54:04,673 INFO L273 TraceCheckUtils]: 7: Hoare triple {2938#(= 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; {2939#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:04,674 INFO L273 TraceCheckUtils]: 8: Hoare triple {2939#(<= main_~i~0 1)} assume true; {2939#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:04,674 INFO L273 TraceCheckUtils]: 9: Hoare triple {2939#(<= 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; {2940#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:04,675 INFO L273 TraceCheckUtils]: 10: Hoare triple {2940#(<= main_~i~0 2)} assume true; {2940#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:04,676 INFO L273 TraceCheckUtils]: 11: Hoare triple {2940#(<= 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; {2941#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:04,676 INFO L273 TraceCheckUtils]: 12: Hoare triple {2941#(<= main_~i~0 3)} assume true; {2941#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:04,677 INFO L273 TraceCheckUtils]: 13: Hoare triple {2941#(<= 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; {2942#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:04,677 INFO L273 TraceCheckUtils]: 14: Hoare triple {2942#(<= main_~i~0 4)} assume true; {2942#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:04,678 INFO L273 TraceCheckUtils]: 15: Hoare triple {2942#(<= 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; {2943#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:04,679 INFO L273 TraceCheckUtils]: 16: Hoare triple {2943#(<= main_~i~0 5)} assume true; {2943#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:04,680 INFO L273 TraceCheckUtils]: 17: Hoare triple {2943#(<= 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; {2944#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:04,680 INFO L273 TraceCheckUtils]: 18: Hoare triple {2944#(<= main_~i~0 6)} assume true; {2944#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:04,681 INFO L273 TraceCheckUtils]: 19: Hoare triple {2944#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2937#false} is VALID [2018-11-18 22:54:04,681 INFO L273 TraceCheckUtils]: 20: Hoare triple {2937#false} ~i~0 := 0; {2937#false} is VALID [2018-11-18 22:54:04,681 INFO L273 TraceCheckUtils]: 21: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-18 22:54:04,682 INFO L273 TraceCheckUtils]: 22: Hoare triple {2937#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2937#false} is VALID [2018-11-18 22:54:04,682 INFO L273 TraceCheckUtils]: 23: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-18 22:54:04,682 INFO L273 TraceCheckUtils]: 24: Hoare triple {2937#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2937#false} is VALID [2018-11-18 22:54:04,683 INFO L273 TraceCheckUtils]: 25: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-18 22:54:04,683 INFO L273 TraceCheckUtils]: 26: Hoare triple {2937#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2937#false} is VALID [2018-11-18 22:54:04,683 INFO L273 TraceCheckUtils]: 27: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-18 22:54:04,683 INFO L273 TraceCheckUtils]: 28: Hoare triple {2937#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2937#false} is VALID [2018-11-18 22:54:04,684 INFO L273 TraceCheckUtils]: 29: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-18 22:54:04,684 INFO L273 TraceCheckUtils]: 30: Hoare triple {2937#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2937#false} is VALID [2018-11-18 22:54:04,684 INFO L273 TraceCheckUtils]: 31: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-18 22:54:04,684 INFO L273 TraceCheckUtils]: 32: Hoare triple {2937#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2937#false} is VALID [2018-11-18 22:54:04,685 INFO L273 TraceCheckUtils]: 33: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-18 22:54:04,685 INFO L273 TraceCheckUtils]: 34: Hoare triple {2937#false} assume !(~i~0 < 100000); {2937#false} is VALID [2018-11-18 22:54:04,685 INFO L273 TraceCheckUtils]: 35: Hoare triple {2937#false} ~i~0 := 0; {2937#false} is VALID [2018-11-18 22:54:04,685 INFO L273 TraceCheckUtils]: 36: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-18 22:54:04,685 INFO L273 TraceCheckUtils]: 37: Hoare triple {2937#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2937#false} is VALID [2018-11-18 22:54:04,685 INFO L273 TraceCheckUtils]: 38: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-18 22:54:04,686 INFO L273 TraceCheckUtils]: 39: Hoare triple {2937#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2937#false} is VALID [2018-11-18 22:54:04,686 INFO L273 TraceCheckUtils]: 40: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-18 22:54:04,686 INFO L273 TraceCheckUtils]: 41: Hoare triple {2937#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2937#false} is VALID [2018-11-18 22:54:04,686 INFO L273 TraceCheckUtils]: 42: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-18 22:54:04,686 INFO L273 TraceCheckUtils]: 43: Hoare triple {2937#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2937#false} is VALID [2018-11-18 22:54:04,686 INFO L273 TraceCheckUtils]: 44: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-18 22:54:04,687 INFO L273 TraceCheckUtils]: 45: Hoare triple {2937#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2937#false} is VALID [2018-11-18 22:54:04,687 INFO L273 TraceCheckUtils]: 46: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-18 22:54:04,687 INFO L273 TraceCheckUtils]: 47: Hoare triple {2937#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2937#false} is VALID [2018-11-18 22:54:04,687 INFO L273 TraceCheckUtils]: 48: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-18 22:54:04,687 INFO L273 TraceCheckUtils]: 49: Hoare triple {2937#false} assume !(~i~0 < 100000); {2937#false} is VALID [2018-11-18 22:54:04,687 INFO L273 TraceCheckUtils]: 50: Hoare triple {2937#false} ~i~0 := 0; {2937#false} is VALID [2018-11-18 22:54:04,688 INFO L273 TraceCheckUtils]: 51: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-18 22:54:04,688 INFO L273 TraceCheckUtils]: 52: Hoare triple {2937#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2937#false} is VALID [2018-11-18 22:54:04,688 INFO L273 TraceCheckUtils]: 53: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-18 22:54:04,688 INFO L273 TraceCheckUtils]: 54: Hoare triple {2937#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2937#false} is VALID [2018-11-18 22:54:04,688 INFO L273 TraceCheckUtils]: 55: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-18 22:54:04,688 INFO L273 TraceCheckUtils]: 56: Hoare triple {2937#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2937#false} is VALID [2018-11-18 22:54:04,689 INFO L273 TraceCheckUtils]: 57: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-18 22:54:04,689 INFO L273 TraceCheckUtils]: 58: Hoare triple {2937#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2937#false} is VALID [2018-11-18 22:54:04,689 INFO L273 TraceCheckUtils]: 59: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-18 22:54:04,689 INFO L273 TraceCheckUtils]: 60: Hoare triple {2937#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2937#false} is VALID [2018-11-18 22:54:04,689 INFO L273 TraceCheckUtils]: 61: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-18 22:54:04,690 INFO L273 TraceCheckUtils]: 62: Hoare triple {2937#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2937#false} is VALID [2018-11-18 22:54:04,690 INFO L273 TraceCheckUtils]: 63: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-18 22:54:04,690 INFO L273 TraceCheckUtils]: 64: Hoare triple {2937#false} assume !(~i~0 < 100000); {2937#false} is VALID [2018-11-18 22:54:04,690 INFO L273 TraceCheckUtils]: 65: Hoare triple {2937#false} havoc ~x~0;~x~0 := 0; {2937#false} is VALID [2018-11-18 22:54:04,690 INFO L273 TraceCheckUtils]: 66: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-18 22:54:04,690 INFO L273 TraceCheckUtils]: 67: Hoare triple {2937#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2937#false} is VALID [2018-11-18 22:54:04,690 INFO L256 TraceCheckUtils]: 68: Hoare triple {2937#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {2937#false} is VALID [2018-11-18 22:54:04,690 INFO L273 TraceCheckUtils]: 69: Hoare triple {2937#false} ~cond := #in~cond; {2937#false} is VALID [2018-11-18 22:54:04,691 INFO L273 TraceCheckUtils]: 70: Hoare triple {2937#false} assume 0 == ~cond; {2937#false} is VALID [2018-11-18 22:54:04,691 INFO L273 TraceCheckUtils]: 71: Hoare triple {2937#false} assume !false; {2937#false} is VALID [2018-11-18 22:54:04,693 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-18 22:54:04,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:54:04,693 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-18 22:54:04,706 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:54:05,137 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-18 22:54:05,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:54:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:05,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:54:05,290 INFO L256 TraceCheckUtils]: 0: Hoare triple {2936#true} call ULTIMATE.init(); {2936#true} is VALID [2018-11-18 22:54:05,290 INFO L273 TraceCheckUtils]: 1: Hoare triple {2936#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2936#true} is VALID [2018-11-18 22:54:05,291 INFO L273 TraceCheckUtils]: 2: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-18 22:54:05,291 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2936#true} {2936#true} #92#return; {2936#true} is VALID [2018-11-18 22:54:05,291 INFO L256 TraceCheckUtils]: 4: Hoare triple {2936#true} call #t~ret2 := main(); {2936#true} is VALID [2018-11-18 22:54:05,291 INFO L273 TraceCheckUtils]: 5: Hoare triple {2936#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2936#true} is VALID [2018-11-18 22:54:05,291 INFO L273 TraceCheckUtils]: 6: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-18 22:54:05,292 INFO L273 TraceCheckUtils]: 7: Hoare triple {2936#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2936#true} is VALID [2018-11-18 22:54:05,292 INFO L273 TraceCheckUtils]: 8: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-18 22:54:05,292 INFO L273 TraceCheckUtils]: 9: Hoare triple {2936#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2936#true} is VALID [2018-11-18 22:54:05,292 INFO L273 TraceCheckUtils]: 10: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-18 22:54:05,292 INFO L273 TraceCheckUtils]: 11: Hoare triple {2936#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2936#true} is VALID [2018-11-18 22:54:05,292 INFO L273 TraceCheckUtils]: 12: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-18 22:54:05,293 INFO L273 TraceCheckUtils]: 13: Hoare triple {2936#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2936#true} is VALID [2018-11-18 22:54:05,293 INFO L273 TraceCheckUtils]: 14: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-18 22:54:05,293 INFO L273 TraceCheckUtils]: 15: Hoare triple {2936#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2936#true} is VALID [2018-11-18 22:54:05,293 INFO L273 TraceCheckUtils]: 16: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-18 22:54:05,293 INFO L273 TraceCheckUtils]: 17: Hoare triple {2936#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2936#true} is VALID [2018-11-18 22:54:05,293 INFO L273 TraceCheckUtils]: 18: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-18 22:54:05,293 INFO L273 TraceCheckUtils]: 19: Hoare triple {2936#true} assume !(~i~0 < 100000); {2936#true} is VALID [2018-11-18 22:54:05,293 INFO L273 TraceCheckUtils]: 20: Hoare triple {2936#true} ~i~0 := 0; {2936#true} is VALID [2018-11-18 22:54:05,294 INFO L273 TraceCheckUtils]: 21: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-18 22:54:05,294 INFO L273 TraceCheckUtils]: 22: Hoare triple {2936#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2936#true} is VALID [2018-11-18 22:54:05,294 INFO L273 TraceCheckUtils]: 23: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-18 22:54:05,294 INFO L273 TraceCheckUtils]: 24: Hoare triple {2936#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2936#true} is VALID [2018-11-18 22:54:05,294 INFO L273 TraceCheckUtils]: 25: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-18 22:54:05,294 INFO L273 TraceCheckUtils]: 26: Hoare triple {2936#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2936#true} is VALID [2018-11-18 22:54:05,294 INFO L273 TraceCheckUtils]: 27: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-18 22:54:05,294 INFO L273 TraceCheckUtils]: 28: Hoare triple {2936#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2936#true} is VALID [2018-11-18 22:54:05,295 INFO L273 TraceCheckUtils]: 29: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-18 22:54:05,295 INFO L273 TraceCheckUtils]: 30: Hoare triple {2936#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2936#true} is VALID [2018-11-18 22:54:05,295 INFO L273 TraceCheckUtils]: 31: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-18 22:54:05,295 INFO L273 TraceCheckUtils]: 32: Hoare triple {2936#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2936#true} is VALID [2018-11-18 22:54:05,295 INFO L273 TraceCheckUtils]: 33: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-18 22:54:05,295 INFO L273 TraceCheckUtils]: 34: Hoare triple {2936#true} assume !(~i~0 < 100000); {2936#true} is VALID [2018-11-18 22:54:05,295 INFO L273 TraceCheckUtils]: 35: Hoare triple {2936#true} ~i~0 := 0; {2936#true} is VALID [2018-11-18 22:54:05,295 INFO L273 TraceCheckUtils]: 36: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-18 22:54:05,296 INFO L273 TraceCheckUtils]: 37: Hoare triple {2936#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2936#true} is VALID [2018-11-18 22:54:05,296 INFO L273 TraceCheckUtils]: 38: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-18 22:54:05,296 INFO L273 TraceCheckUtils]: 39: Hoare triple {2936#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2936#true} is VALID [2018-11-18 22:54:05,296 INFO L273 TraceCheckUtils]: 40: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-18 22:54:05,296 INFO L273 TraceCheckUtils]: 41: Hoare triple {2936#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2936#true} is VALID [2018-11-18 22:54:05,296 INFO L273 TraceCheckUtils]: 42: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-18 22:54:05,296 INFO L273 TraceCheckUtils]: 43: Hoare triple {2936#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2936#true} is VALID [2018-11-18 22:54:05,296 INFO L273 TraceCheckUtils]: 44: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-18 22:54:05,297 INFO L273 TraceCheckUtils]: 45: Hoare triple {2936#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2936#true} is VALID [2018-11-18 22:54:05,297 INFO L273 TraceCheckUtils]: 46: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-18 22:54:05,297 INFO L273 TraceCheckUtils]: 47: Hoare triple {2936#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2936#true} is VALID [2018-11-18 22:54:05,297 INFO L273 TraceCheckUtils]: 48: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-18 22:54:05,297 INFO L273 TraceCheckUtils]: 49: Hoare triple {2936#true} assume !(~i~0 < 100000); {2936#true} is VALID [2018-11-18 22:54:05,298 INFO L273 TraceCheckUtils]: 50: Hoare triple {2936#true} ~i~0 := 0; {3098#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:05,298 INFO L273 TraceCheckUtils]: 51: Hoare triple {3098#(<= main_~i~0 0)} assume true; {3098#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:05,299 INFO L273 TraceCheckUtils]: 52: Hoare triple {3098#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2939#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:05,299 INFO L273 TraceCheckUtils]: 53: Hoare triple {2939#(<= main_~i~0 1)} assume true; {2939#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:05,299 INFO L273 TraceCheckUtils]: 54: Hoare triple {2939#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2940#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:05,300 INFO L273 TraceCheckUtils]: 55: Hoare triple {2940#(<= main_~i~0 2)} assume true; {2940#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:05,300 INFO L273 TraceCheckUtils]: 56: Hoare triple {2940#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2941#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:05,301 INFO L273 TraceCheckUtils]: 57: Hoare triple {2941#(<= main_~i~0 3)} assume true; {2941#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:05,301 INFO L273 TraceCheckUtils]: 58: Hoare triple {2941#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2942#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:05,302 INFO L273 TraceCheckUtils]: 59: Hoare triple {2942#(<= main_~i~0 4)} assume true; {2942#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:05,302 INFO L273 TraceCheckUtils]: 60: Hoare triple {2942#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2943#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:05,303 INFO L273 TraceCheckUtils]: 61: Hoare triple {2943#(<= main_~i~0 5)} assume true; {2943#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:05,304 INFO L273 TraceCheckUtils]: 62: Hoare triple {2943#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2944#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:05,304 INFO L273 TraceCheckUtils]: 63: Hoare triple {2944#(<= main_~i~0 6)} assume true; {2944#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:05,305 INFO L273 TraceCheckUtils]: 64: Hoare triple {2944#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2937#false} is VALID [2018-11-18 22:54:05,305 INFO L273 TraceCheckUtils]: 65: Hoare triple {2937#false} havoc ~x~0;~x~0 := 0; {2937#false} is VALID [2018-11-18 22:54:05,305 INFO L273 TraceCheckUtils]: 66: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-18 22:54:05,305 INFO L273 TraceCheckUtils]: 67: Hoare triple {2937#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2937#false} is VALID [2018-11-18 22:54:05,306 INFO L256 TraceCheckUtils]: 68: Hoare triple {2937#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {2937#false} is VALID [2018-11-18 22:54:05,306 INFO L273 TraceCheckUtils]: 69: Hoare triple {2937#false} ~cond := #in~cond; {2937#false} is VALID [2018-11-18 22:54:05,306 INFO L273 TraceCheckUtils]: 70: Hoare triple {2937#false} assume 0 == ~cond; {2937#false} is VALID [2018-11-18 22:54:05,307 INFO L273 TraceCheckUtils]: 71: Hoare triple {2937#false} assume !false; {2937#false} is VALID [2018-11-18 22:54:05,310 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-18 22:54:05,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:54:05,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-18 22:54:05,335 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2018-11-18 22:54:05,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:54:05,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-18 22:54:05,397 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:54:05,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 22:54:05,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 22:54:05,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:54:05,398 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 10 states. [2018-11-18 22:54:05,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:05,765 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2018-11-18 22:54:05,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 22:54:05,765 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2018-11-18 22:54:05,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:54:05,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:54:05,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2018-11-18 22:54:05,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:54:05,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2018-11-18 22:54:05,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 117 transitions. [2018-11-18 22:54:05,894 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:54:05,896 INFO L225 Difference]: With dead ends: 142 [2018-11-18 22:54:05,896 INFO L226 Difference]: Without dead ends: 85 [2018-11-18 22:54:05,897 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:54:05,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-18 22:54:05,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-11-18 22:54:05,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:54:05,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 85 states. [2018-11-18 22:54:05,940 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 85 states. [2018-11-18 22:54:05,940 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 85 states. [2018-11-18 22:54:05,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:05,943 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-11-18 22:54:05,943 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-11-18 22:54:05,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:05,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:05,944 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 85 states. [2018-11-18 22:54:05,944 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 85 states. [2018-11-18 22:54:05,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:05,946 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-11-18 22:54:05,947 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-11-18 22:54:05,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:05,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:05,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:54:05,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:54:05,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-18 22:54:05,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-11-18 22:54:05,950 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 72 [2018-11-18 22:54:05,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:54:05,950 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-11-18 22:54:05,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 22:54:05,950 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-11-18 22:54:05,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 22:54:05,951 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:54:05,951 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:54:05,951 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:54:05,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:54:05,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1166570877, now seen corresponding path program 7 times [2018-11-18 22:54:05,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:54:05,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:54:05,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:05,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:54:05,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:06,101 INFO L256 TraceCheckUtils]: 0: Hoare triple {3660#true} call ULTIMATE.init(); {3660#true} is VALID [2018-11-18 22:54:06,102 INFO L273 TraceCheckUtils]: 1: Hoare triple {3660#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3660#true} is VALID [2018-11-18 22:54:06,102 INFO L273 TraceCheckUtils]: 2: Hoare triple {3660#true} assume true; {3660#true} is VALID [2018-11-18 22:54:06,102 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3660#true} {3660#true} #92#return; {3660#true} is VALID [2018-11-18 22:54:06,103 INFO L256 TraceCheckUtils]: 4: Hoare triple {3660#true} call #t~ret2 := main(); {3660#true} is VALID [2018-11-18 22:54:06,103 INFO L273 TraceCheckUtils]: 5: Hoare triple {3660#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3662#(= main_~i~0 0)} is VALID [2018-11-18 22:54:06,104 INFO L273 TraceCheckUtils]: 6: Hoare triple {3662#(= main_~i~0 0)} assume true; {3662#(= main_~i~0 0)} is VALID [2018-11-18 22:54:06,104 INFO L273 TraceCheckUtils]: 7: Hoare triple {3662#(= 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; {3663#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:06,105 INFO L273 TraceCheckUtils]: 8: Hoare triple {3663#(<= main_~i~0 1)} assume true; {3663#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:06,105 INFO L273 TraceCheckUtils]: 9: Hoare triple {3663#(<= 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; {3664#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:06,105 INFO L273 TraceCheckUtils]: 10: Hoare triple {3664#(<= main_~i~0 2)} assume true; {3664#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:06,106 INFO L273 TraceCheckUtils]: 11: Hoare triple {3664#(<= 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; {3665#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:06,107 INFO L273 TraceCheckUtils]: 12: Hoare triple {3665#(<= main_~i~0 3)} assume true; {3665#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:06,108 INFO L273 TraceCheckUtils]: 13: Hoare triple {3665#(<= 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; {3666#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:06,108 INFO L273 TraceCheckUtils]: 14: Hoare triple {3666#(<= main_~i~0 4)} assume true; {3666#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:06,109 INFO L273 TraceCheckUtils]: 15: Hoare triple {3666#(<= 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; {3667#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:06,110 INFO L273 TraceCheckUtils]: 16: Hoare triple {3667#(<= main_~i~0 5)} assume true; {3667#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:06,110 INFO L273 TraceCheckUtils]: 17: Hoare triple {3667#(<= 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; {3668#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:06,111 INFO L273 TraceCheckUtils]: 18: Hoare triple {3668#(<= main_~i~0 6)} assume true; {3668#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:06,112 INFO L273 TraceCheckUtils]: 19: Hoare triple {3668#(<= 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; {3669#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:06,112 INFO L273 TraceCheckUtils]: 20: Hoare triple {3669#(<= main_~i~0 7)} assume true; {3669#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:06,113 INFO L273 TraceCheckUtils]: 21: Hoare triple {3669#(<= main_~i~0 7)} assume !(~i~0 < 100000); {3661#false} is VALID [2018-11-18 22:54:06,113 INFO L273 TraceCheckUtils]: 22: Hoare triple {3661#false} ~i~0 := 0; {3661#false} is VALID [2018-11-18 22:54:06,113 INFO L273 TraceCheckUtils]: 23: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,114 INFO L273 TraceCheckUtils]: 24: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,114 INFO L273 TraceCheckUtils]: 25: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,114 INFO L273 TraceCheckUtils]: 26: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,114 INFO L273 TraceCheckUtils]: 27: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,114 INFO L273 TraceCheckUtils]: 28: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,115 INFO L273 TraceCheckUtils]: 29: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,115 INFO L273 TraceCheckUtils]: 30: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,115 INFO L273 TraceCheckUtils]: 31: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,115 INFO L273 TraceCheckUtils]: 32: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,115 INFO L273 TraceCheckUtils]: 33: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,116 INFO L273 TraceCheckUtils]: 34: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,116 INFO L273 TraceCheckUtils]: 35: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,116 INFO L273 TraceCheckUtils]: 36: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,116 INFO L273 TraceCheckUtils]: 37: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,116 INFO L273 TraceCheckUtils]: 38: Hoare triple {3661#false} assume !(~i~0 < 100000); {3661#false} is VALID [2018-11-18 22:54:06,116 INFO L273 TraceCheckUtils]: 39: Hoare triple {3661#false} ~i~0 := 0; {3661#false} is VALID [2018-11-18 22:54:06,116 INFO L273 TraceCheckUtils]: 40: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,117 INFO L273 TraceCheckUtils]: 41: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,117 INFO L273 TraceCheckUtils]: 42: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,117 INFO L273 TraceCheckUtils]: 43: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,117 INFO L273 TraceCheckUtils]: 44: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,117 INFO L273 TraceCheckUtils]: 45: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,117 INFO L273 TraceCheckUtils]: 46: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,117 INFO L273 TraceCheckUtils]: 47: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,118 INFO L273 TraceCheckUtils]: 48: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,118 INFO L273 TraceCheckUtils]: 49: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,118 INFO L273 TraceCheckUtils]: 50: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,118 INFO L273 TraceCheckUtils]: 51: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,118 INFO L273 TraceCheckUtils]: 52: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,118 INFO L273 TraceCheckUtils]: 53: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,119 INFO L273 TraceCheckUtils]: 54: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,119 INFO L273 TraceCheckUtils]: 55: Hoare triple {3661#false} assume !(~i~0 < 100000); {3661#false} is VALID [2018-11-18 22:54:06,119 INFO L273 TraceCheckUtils]: 56: Hoare triple {3661#false} ~i~0 := 0; {3661#false} is VALID [2018-11-18 22:54:06,119 INFO L273 TraceCheckUtils]: 57: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,119 INFO L273 TraceCheckUtils]: 58: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,120 INFO L273 TraceCheckUtils]: 59: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,120 INFO L273 TraceCheckUtils]: 60: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,120 INFO L273 TraceCheckUtils]: 61: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,120 INFO L273 TraceCheckUtils]: 62: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,120 INFO L273 TraceCheckUtils]: 63: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,121 INFO L273 TraceCheckUtils]: 64: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,121 INFO L273 TraceCheckUtils]: 65: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,121 INFO L273 TraceCheckUtils]: 66: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,121 INFO L273 TraceCheckUtils]: 67: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,121 INFO L273 TraceCheckUtils]: 68: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,121 INFO L273 TraceCheckUtils]: 69: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,122 INFO L273 TraceCheckUtils]: 70: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,122 INFO L273 TraceCheckUtils]: 71: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,122 INFO L273 TraceCheckUtils]: 72: Hoare triple {3661#false} assume !(~i~0 < 100000); {3661#false} is VALID [2018-11-18 22:54:06,122 INFO L273 TraceCheckUtils]: 73: Hoare triple {3661#false} havoc ~x~0;~x~0 := 0; {3661#false} is VALID [2018-11-18 22:54:06,122 INFO L273 TraceCheckUtils]: 74: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,122 INFO L273 TraceCheckUtils]: 75: Hoare triple {3661#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3661#false} is VALID [2018-11-18 22:54:06,123 INFO L256 TraceCheckUtils]: 76: Hoare triple {3661#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {3661#false} is VALID [2018-11-18 22:54:06,123 INFO L273 TraceCheckUtils]: 77: Hoare triple {3661#false} ~cond := #in~cond; {3661#false} is VALID [2018-11-18 22:54:06,123 INFO L273 TraceCheckUtils]: 78: Hoare triple {3661#false} assume 0 == ~cond; {3661#false} is VALID [2018-11-18 22:54:06,123 INFO L273 TraceCheckUtils]: 79: Hoare triple {3661#false} assume !false; {3661#false} is VALID [2018-11-18 22:54:06,127 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-11-18 22:54:06,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:54:06,127 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-18 22:54:06,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:54:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:06,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:54:06,394 INFO L256 TraceCheckUtils]: 0: Hoare triple {3660#true} call ULTIMATE.init(); {3660#true} is VALID [2018-11-18 22:54:06,394 INFO L273 TraceCheckUtils]: 1: Hoare triple {3660#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3660#true} is VALID [2018-11-18 22:54:06,394 INFO L273 TraceCheckUtils]: 2: Hoare triple {3660#true} assume true; {3660#true} is VALID [2018-11-18 22:54:06,395 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3660#true} {3660#true} #92#return; {3660#true} is VALID [2018-11-18 22:54:06,395 INFO L256 TraceCheckUtils]: 4: Hoare triple {3660#true} call #t~ret2 := main(); {3660#true} is VALID [2018-11-18 22:54:06,395 INFO L273 TraceCheckUtils]: 5: Hoare triple {3660#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3688#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:06,396 INFO L273 TraceCheckUtils]: 6: Hoare triple {3688#(<= main_~i~0 0)} assume true; {3688#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:06,396 INFO L273 TraceCheckUtils]: 7: Hoare triple {3688#(<= 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; {3663#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:06,397 INFO L273 TraceCheckUtils]: 8: Hoare triple {3663#(<= main_~i~0 1)} assume true; {3663#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:06,397 INFO L273 TraceCheckUtils]: 9: Hoare triple {3663#(<= 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; {3664#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:06,398 INFO L273 TraceCheckUtils]: 10: Hoare triple {3664#(<= main_~i~0 2)} assume true; {3664#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:06,398 INFO L273 TraceCheckUtils]: 11: Hoare triple {3664#(<= 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; {3665#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:06,399 INFO L273 TraceCheckUtils]: 12: Hoare triple {3665#(<= main_~i~0 3)} assume true; {3665#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:06,399 INFO L273 TraceCheckUtils]: 13: Hoare triple {3665#(<= 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; {3666#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:06,400 INFO L273 TraceCheckUtils]: 14: Hoare triple {3666#(<= main_~i~0 4)} assume true; {3666#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:06,401 INFO L273 TraceCheckUtils]: 15: Hoare triple {3666#(<= 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; {3667#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:06,401 INFO L273 TraceCheckUtils]: 16: Hoare triple {3667#(<= main_~i~0 5)} assume true; {3667#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:06,402 INFO L273 TraceCheckUtils]: 17: Hoare triple {3667#(<= 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; {3668#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:06,403 INFO L273 TraceCheckUtils]: 18: Hoare triple {3668#(<= main_~i~0 6)} assume true; {3668#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:06,404 INFO L273 TraceCheckUtils]: 19: Hoare triple {3668#(<= 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; {3669#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:06,404 INFO L273 TraceCheckUtils]: 20: Hoare triple {3669#(<= main_~i~0 7)} assume true; {3669#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:06,405 INFO L273 TraceCheckUtils]: 21: Hoare triple {3669#(<= main_~i~0 7)} assume !(~i~0 < 100000); {3661#false} is VALID [2018-11-18 22:54:06,405 INFO L273 TraceCheckUtils]: 22: Hoare triple {3661#false} ~i~0 := 0; {3661#false} is VALID [2018-11-18 22:54:06,405 INFO L273 TraceCheckUtils]: 23: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,405 INFO L273 TraceCheckUtils]: 24: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,406 INFO L273 TraceCheckUtils]: 25: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,406 INFO L273 TraceCheckUtils]: 26: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,406 INFO L273 TraceCheckUtils]: 27: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,406 INFO L273 TraceCheckUtils]: 28: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,407 INFO L273 TraceCheckUtils]: 29: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,407 INFO L273 TraceCheckUtils]: 30: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,407 INFO L273 TraceCheckUtils]: 31: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,407 INFO L273 TraceCheckUtils]: 32: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,407 INFO L273 TraceCheckUtils]: 33: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,408 INFO L273 TraceCheckUtils]: 34: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,408 INFO L273 TraceCheckUtils]: 35: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,408 INFO L273 TraceCheckUtils]: 36: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,408 INFO L273 TraceCheckUtils]: 37: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,408 INFO L273 TraceCheckUtils]: 38: Hoare triple {3661#false} assume !(~i~0 < 100000); {3661#false} is VALID [2018-11-18 22:54:06,409 INFO L273 TraceCheckUtils]: 39: Hoare triple {3661#false} ~i~0 := 0; {3661#false} is VALID [2018-11-18 22:54:06,409 INFO L273 TraceCheckUtils]: 40: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,409 INFO L273 TraceCheckUtils]: 41: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,409 INFO L273 TraceCheckUtils]: 42: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,409 INFO L273 TraceCheckUtils]: 43: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,409 INFO L273 TraceCheckUtils]: 44: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,410 INFO L273 TraceCheckUtils]: 45: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,410 INFO L273 TraceCheckUtils]: 46: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,410 INFO L273 TraceCheckUtils]: 47: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,410 INFO L273 TraceCheckUtils]: 48: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,410 INFO L273 TraceCheckUtils]: 49: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,411 INFO L273 TraceCheckUtils]: 50: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,411 INFO L273 TraceCheckUtils]: 51: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,411 INFO L273 TraceCheckUtils]: 52: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,411 INFO L273 TraceCheckUtils]: 53: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,411 INFO L273 TraceCheckUtils]: 54: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,411 INFO L273 TraceCheckUtils]: 55: Hoare triple {3661#false} assume !(~i~0 < 100000); {3661#false} is VALID [2018-11-18 22:54:06,412 INFO L273 TraceCheckUtils]: 56: Hoare triple {3661#false} ~i~0 := 0; {3661#false} is VALID [2018-11-18 22:54:06,412 INFO L273 TraceCheckUtils]: 57: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,412 INFO L273 TraceCheckUtils]: 58: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,412 INFO L273 TraceCheckUtils]: 59: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,412 INFO L273 TraceCheckUtils]: 60: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,412 INFO L273 TraceCheckUtils]: 61: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,413 INFO L273 TraceCheckUtils]: 62: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,413 INFO L273 TraceCheckUtils]: 63: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,413 INFO L273 TraceCheckUtils]: 64: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,413 INFO L273 TraceCheckUtils]: 65: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,413 INFO L273 TraceCheckUtils]: 66: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,414 INFO L273 TraceCheckUtils]: 67: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,414 INFO L273 TraceCheckUtils]: 68: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,414 INFO L273 TraceCheckUtils]: 69: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,414 INFO L273 TraceCheckUtils]: 70: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3661#false} is VALID [2018-11-18 22:54:06,414 INFO L273 TraceCheckUtils]: 71: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,414 INFO L273 TraceCheckUtils]: 72: Hoare triple {3661#false} assume !(~i~0 < 100000); {3661#false} is VALID [2018-11-18 22:54:06,415 INFO L273 TraceCheckUtils]: 73: Hoare triple {3661#false} havoc ~x~0;~x~0 := 0; {3661#false} is VALID [2018-11-18 22:54:06,415 INFO L273 TraceCheckUtils]: 74: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-18 22:54:06,415 INFO L273 TraceCheckUtils]: 75: Hoare triple {3661#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3661#false} is VALID [2018-11-18 22:54:06,415 INFO L256 TraceCheckUtils]: 76: Hoare triple {3661#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {3661#false} is VALID [2018-11-18 22:54:06,415 INFO L273 TraceCheckUtils]: 77: Hoare triple {3661#false} ~cond := #in~cond; {3661#false} is VALID [2018-11-18 22:54:06,415 INFO L273 TraceCheckUtils]: 78: Hoare triple {3661#false} assume 0 == ~cond; {3661#false} is VALID [2018-11-18 22:54:06,416 INFO L273 TraceCheckUtils]: 79: Hoare triple {3661#false} assume !false; {3661#false} is VALID [2018-11-18 22:54:06,420 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-11-18 22:54:06,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:54:06,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-18 22:54:06,447 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 80 [2018-11-18 22:54:06,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:54:06,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-18 22:54:06,525 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:54:06,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 22:54:06,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 22:54:06,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:54:06,526 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 11 states. [2018-11-18 22:54:06,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:06,879 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2018-11-18 22:54:06,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 22:54:06,879 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 80 [2018-11-18 22:54:06,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:54:06,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:54:06,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2018-11-18 22:54:06,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:54:06,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2018-11-18 22:54:06,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 125 transitions. [2018-11-18 22:54:07,016 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:54:07,018 INFO L225 Difference]: With dead ends: 156 [2018-11-18 22:54:07,018 INFO L226 Difference]: Without dead ends: 93 [2018-11-18 22:54:07,019 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:54:07,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-18 22:54:07,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-11-18 22:54:07,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:54:07,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 93 states. [2018-11-18 22:54:07,063 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 93 states. [2018-11-18 22:54:07,063 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 93 states. [2018-11-18 22:54:07,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:07,066 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-11-18 22:54:07,066 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-11-18 22:54:07,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:07,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:07,067 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 93 states. [2018-11-18 22:54:07,067 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 93 states. [2018-11-18 22:54:07,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:07,070 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-11-18 22:54:07,070 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-11-18 22:54:07,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:07,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:07,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:54:07,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:54:07,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-18 22:54:07,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2018-11-18 22:54:07,073 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 80 [2018-11-18 22:54:07,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:54:07,074 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2018-11-18 22:54:07,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 22:54:07,074 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-11-18 22:54:07,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-18 22:54:07,075 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:54:07,075 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:54:07,075 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:54:07,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:54:07,076 INFO L82 PathProgramCache]: Analyzing trace with hash 168009469, now seen corresponding path program 8 times [2018-11-18 22:54:07,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:54:07,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:54:07,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:07,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:54:07,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:07,359 INFO L256 TraceCheckUtils]: 0: Hoare triple {4458#true} call ULTIMATE.init(); {4458#true} is VALID [2018-11-18 22:54:07,359 INFO L273 TraceCheckUtils]: 1: Hoare triple {4458#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4458#true} is VALID [2018-11-18 22:54:07,359 INFO L273 TraceCheckUtils]: 2: Hoare triple {4458#true} assume true; {4458#true} is VALID [2018-11-18 22:54:07,359 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4458#true} {4458#true} #92#return; {4458#true} is VALID [2018-11-18 22:54:07,360 INFO L256 TraceCheckUtils]: 4: Hoare triple {4458#true} call #t~ret2 := main(); {4458#true} is VALID [2018-11-18 22:54:07,360 INFO L273 TraceCheckUtils]: 5: Hoare triple {4458#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4460#(= main_~i~0 0)} is VALID [2018-11-18 22:54:07,361 INFO L273 TraceCheckUtils]: 6: Hoare triple {4460#(= main_~i~0 0)} assume true; {4460#(= main_~i~0 0)} is VALID [2018-11-18 22:54:07,361 INFO L273 TraceCheckUtils]: 7: Hoare triple {4460#(= 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; {4461#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:07,362 INFO L273 TraceCheckUtils]: 8: Hoare triple {4461#(<= main_~i~0 1)} assume true; {4461#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:07,362 INFO L273 TraceCheckUtils]: 9: Hoare triple {4461#(<= 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; {4462#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:07,363 INFO L273 TraceCheckUtils]: 10: Hoare triple {4462#(<= main_~i~0 2)} assume true; {4462#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:07,363 INFO L273 TraceCheckUtils]: 11: Hoare triple {4462#(<= 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; {4463#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:07,364 INFO L273 TraceCheckUtils]: 12: Hoare triple {4463#(<= main_~i~0 3)} assume true; {4463#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:07,365 INFO L273 TraceCheckUtils]: 13: Hoare triple {4463#(<= 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; {4464#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:07,365 INFO L273 TraceCheckUtils]: 14: Hoare triple {4464#(<= main_~i~0 4)} assume true; {4464#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:07,366 INFO L273 TraceCheckUtils]: 15: Hoare triple {4464#(<= 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; {4465#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:07,366 INFO L273 TraceCheckUtils]: 16: Hoare triple {4465#(<= main_~i~0 5)} assume true; {4465#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:07,367 INFO L273 TraceCheckUtils]: 17: Hoare triple {4465#(<= 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; {4466#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:07,368 INFO L273 TraceCheckUtils]: 18: Hoare triple {4466#(<= main_~i~0 6)} assume true; {4466#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:07,369 INFO L273 TraceCheckUtils]: 19: Hoare triple {4466#(<= 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; {4467#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:07,369 INFO L273 TraceCheckUtils]: 20: Hoare triple {4467#(<= main_~i~0 7)} assume true; {4467#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:07,370 INFO L273 TraceCheckUtils]: 21: Hoare triple {4467#(<= 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; {4468#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:07,391 INFO L273 TraceCheckUtils]: 22: Hoare triple {4468#(<= main_~i~0 8)} assume true; {4468#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:07,406 INFO L273 TraceCheckUtils]: 23: Hoare triple {4468#(<= main_~i~0 8)} assume !(~i~0 < 100000); {4459#false} is VALID [2018-11-18 22:54:07,406 INFO L273 TraceCheckUtils]: 24: Hoare triple {4459#false} ~i~0 := 0; {4459#false} is VALID [2018-11-18 22:54:07,406 INFO L273 TraceCheckUtils]: 25: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,406 INFO L273 TraceCheckUtils]: 26: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,406 INFO L273 TraceCheckUtils]: 27: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,406 INFO L273 TraceCheckUtils]: 28: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,407 INFO L273 TraceCheckUtils]: 29: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,407 INFO L273 TraceCheckUtils]: 30: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,407 INFO L273 TraceCheckUtils]: 31: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,407 INFO L273 TraceCheckUtils]: 32: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,407 INFO L273 TraceCheckUtils]: 33: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,407 INFO L273 TraceCheckUtils]: 34: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,407 INFO L273 TraceCheckUtils]: 35: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,408 INFO L273 TraceCheckUtils]: 36: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,408 INFO L273 TraceCheckUtils]: 37: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,408 INFO L273 TraceCheckUtils]: 38: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,408 INFO L273 TraceCheckUtils]: 39: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,408 INFO L273 TraceCheckUtils]: 40: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,409 INFO L273 TraceCheckUtils]: 41: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,409 INFO L273 TraceCheckUtils]: 42: Hoare triple {4459#false} assume !(~i~0 < 100000); {4459#false} is VALID [2018-11-18 22:54:07,409 INFO L273 TraceCheckUtils]: 43: Hoare triple {4459#false} ~i~0 := 0; {4459#false} is VALID [2018-11-18 22:54:07,409 INFO L273 TraceCheckUtils]: 44: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,409 INFO L273 TraceCheckUtils]: 45: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,409 INFO L273 TraceCheckUtils]: 46: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,410 INFO L273 TraceCheckUtils]: 47: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,410 INFO L273 TraceCheckUtils]: 48: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,410 INFO L273 TraceCheckUtils]: 49: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,410 INFO L273 TraceCheckUtils]: 50: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,410 INFO L273 TraceCheckUtils]: 51: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,410 INFO L273 TraceCheckUtils]: 52: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,410 INFO L273 TraceCheckUtils]: 53: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,410 INFO L273 TraceCheckUtils]: 54: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,411 INFO L273 TraceCheckUtils]: 55: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,411 INFO L273 TraceCheckUtils]: 56: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,411 INFO L273 TraceCheckUtils]: 57: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,411 INFO L273 TraceCheckUtils]: 58: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,411 INFO L273 TraceCheckUtils]: 59: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,411 INFO L273 TraceCheckUtils]: 60: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,412 INFO L273 TraceCheckUtils]: 61: Hoare triple {4459#false} assume !(~i~0 < 100000); {4459#false} is VALID [2018-11-18 22:54:07,412 INFO L273 TraceCheckUtils]: 62: Hoare triple {4459#false} ~i~0 := 0; {4459#false} is VALID [2018-11-18 22:54:07,412 INFO L273 TraceCheckUtils]: 63: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,412 INFO L273 TraceCheckUtils]: 64: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,412 INFO L273 TraceCheckUtils]: 65: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,412 INFO L273 TraceCheckUtils]: 66: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,413 INFO L273 TraceCheckUtils]: 67: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,413 INFO L273 TraceCheckUtils]: 68: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,413 INFO L273 TraceCheckUtils]: 69: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,413 INFO L273 TraceCheckUtils]: 70: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,413 INFO L273 TraceCheckUtils]: 71: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,413 INFO L273 TraceCheckUtils]: 72: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,414 INFO L273 TraceCheckUtils]: 73: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,414 INFO L273 TraceCheckUtils]: 74: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,414 INFO L273 TraceCheckUtils]: 75: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,414 INFO L273 TraceCheckUtils]: 76: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,414 INFO L273 TraceCheckUtils]: 77: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,414 INFO L273 TraceCheckUtils]: 78: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,415 INFO L273 TraceCheckUtils]: 79: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,415 INFO L273 TraceCheckUtils]: 80: Hoare triple {4459#false} assume !(~i~0 < 100000); {4459#false} is VALID [2018-11-18 22:54:07,415 INFO L273 TraceCheckUtils]: 81: Hoare triple {4459#false} havoc ~x~0;~x~0 := 0; {4459#false} is VALID [2018-11-18 22:54:07,415 INFO L273 TraceCheckUtils]: 82: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,415 INFO L273 TraceCheckUtils]: 83: Hoare triple {4459#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4459#false} is VALID [2018-11-18 22:54:07,415 INFO L256 TraceCheckUtils]: 84: Hoare triple {4459#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {4459#false} is VALID [2018-11-18 22:54:07,416 INFO L273 TraceCheckUtils]: 85: Hoare triple {4459#false} ~cond := #in~cond; {4459#false} is VALID [2018-11-18 22:54:07,416 INFO L273 TraceCheckUtils]: 86: Hoare triple {4459#false} assume 0 == ~cond; {4459#false} is VALID [2018-11-18 22:54:07,416 INFO L273 TraceCheckUtils]: 87: Hoare triple {4459#false} assume !false; {4459#false} is VALID [2018-11-18 22:54:07,420 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-11-18 22:54:07,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:54:07,421 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-18 22:54:07,433 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:54:07,488 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:54:07,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:54:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:07,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:54:07,728 INFO L256 TraceCheckUtils]: 0: Hoare triple {4458#true} call ULTIMATE.init(); {4458#true} is VALID [2018-11-18 22:54:07,728 INFO L273 TraceCheckUtils]: 1: Hoare triple {4458#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4458#true} is VALID [2018-11-18 22:54:07,728 INFO L273 TraceCheckUtils]: 2: Hoare triple {4458#true} assume true; {4458#true} is VALID [2018-11-18 22:54:07,729 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4458#true} {4458#true} #92#return; {4458#true} is VALID [2018-11-18 22:54:07,729 INFO L256 TraceCheckUtils]: 4: Hoare triple {4458#true} call #t~ret2 := main(); {4458#true} is VALID [2018-11-18 22:54:07,729 INFO L273 TraceCheckUtils]: 5: Hoare triple {4458#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4487#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:07,730 INFO L273 TraceCheckUtils]: 6: Hoare triple {4487#(<= main_~i~0 0)} assume true; {4487#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:07,731 INFO L273 TraceCheckUtils]: 7: Hoare triple {4487#(<= 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; {4461#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:07,731 INFO L273 TraceCheckUtils]: 8: Hoare triple {4461#(<= main_~i~0 1)} assume true; {4461#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:07,731 INFO L273 TraceCheckUtils]: 9: Hoare triple {4461#(<= 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; {4462#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:07,732 INFO L273 TraceCheckUtils]: 10: Hoare triple {4462#(<= main_~i~0 2)} assume true; {4462#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:07,732 INFO L273 TraceCheckUtils]: 11: Hoare triple {4462#(<= 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; {4463#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:07,733 INFO L273 TraceCheckUtils]: 12: Hoare triple {4463#(<= main_~i~0 3)} assume true; {4463#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:07,733 INFO L273 TraceCheckUtils]: 13: Hoare triple {4463#(<= 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; {4464#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:07,734 INFO L273 TraceCheckUtils]: 14: Hoare triple {4464#(<= main_~i~0 4)} assume true; {4464#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:07,735 INFO L273 TraceCheckUtils]: 15: Hoare triple {4464#(<= 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; {4465#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:07,735 INFO L273 TraceCheckUtils]: 16: Hoare triple {4465#(<= main_~i~0 5)} assume true; {4465#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:07,736 INFO L273 TraceCheckUtils]: 17: Hoare triple {4465#(<= 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; {4466#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:07,737 INFO L273 TraceCheckUtils]: 18: Hoare triple {4466#(<= main_~i~0 6)} assume true; {4466#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:07,738 INFO L273 TraceCheckUtils]: 19: Hoare triple {4466#(<= 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; {4467#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:07,738 INFO L273 TraceCheckUtils]: 20: Hoare triple {4467#(<= main_~i~0 7)} assume true; {4467#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:07,739 INFO L273 TraceCheckUtils]: 21: Hoare triple {4467#(<= 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; {4468#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:07,740 INFO L273 TraceCheckUtils]: 22: Hoare triple {4468#(<= main_~i~0 8)} assume true; {4468#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:07,740 INFO L273 TraceCheckUtils]: 23: Hoare triple {4468#(<= main_~i~0 8)} assume !(~i~0 < 100000); {4459#false} is VALID [2018-11-18 22:54:07,740 INFO L273 TraceCheckUtils]: 24: Hoare triple {4459#false} ~i~0 := 0; {4459#false} is VALID [2018-11-18 22:54:07,741 INFO L273 TraceCheckUtils]: 25: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,741 INFO L273 TraceCheckUtils]: 26: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,741 INFO L273 TraceCheckUtils]: 27: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,741 INFO L273 TraceCheckUtils]: 28: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,741 INFO L273 TraceCheckUtils]: 29: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,742 INFO L273 TraceCheckUtils]: 30: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,742 INFO L273 TraceCheckUtils]: 31: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,742 INFO L273 TraceCheckUtils]: 32: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,742 INFO L273 TraceCheckUtils]: 33: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,743 INFO L273 TraceCheckUtils]: 34: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,743 INFO L273 TraceCheckUtils]: 35: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,743 INFO L273 TraceCheckUtils]: 36: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,743 INFO L273 TraceCheckUtils]: 37: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,743 INFO L273 TraceCheckUtils]: 38: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,743 INFO L273 TraceCheckUtils]: 39: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,744 INFO L273 TraceCheckUtils]: 40: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,744 INFO L273 TraceCheckUtils]: 41: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,744 INFO L273 TraceCheckUtils]: 42: Hoare triple {4459#false} assume !(~i~0 < 100000); {4459#false} is VALID [2018-11-18 22:54:07,744 INFO L273 TraceCheckUtils]: 43: Hoare triple {4459#false} ~i~0 := 0; {4459#false} is VALID [2018-11-18 22:54:07,744 INFO L273 TraceCheckUtils]: 44: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,744 INFO L273 TraceCheckUtils]: 45: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,745 INFO L273 TraceCheckUtils]: 46: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,745 INFO L273 TraceCheckUtils]: 47: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,745 INFO L273 TraceCheckUtils]: 48: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,745 INFO L273 TraceCheckUtils]: 49: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,745 INFO L273 TraceCheckUtils]: 50: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,745 INFO L273 TraceCheckUtils]: 51: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,746 INFO L273 TraceCheckUtils]: 52: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,746 INFO L273 TraceCheckUtils]: 53: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,746 INFO L273 TraceCheckUtils]: 54: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,746 INFO L273 TraceCheckUtils]: 55: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,746 INFO L273 TraceCheckUtils]: 56: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,746 INFO L273 TraceCheckUtils]: 57: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,747 INFO L273 TraceCheckUtils]: 58: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,747 INFO L273 TraceCheckUtils]: 59: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,747 INFO L273 TraceCheckUtils]: 60: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,747 INFO L273 TraceCheckUtils]: 61: Hoare triple {4459#false} assume !(~i~0 < 100000); {4459#false} is VALID [2018-11-18 22:54:07,747 INFO L273 TraceCheckUtils]: 62: Hoare triple {4459#false} ~i~0 := 0; {4459#false} is VALID [2018-11-18 22:54:07,747 INFO L273 TraceCheckUtils]: 63: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,748 INFO L273 TraceCheckUtils]: 64: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,748 INFO L273 TraceCheckUtils]: 65: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,748 INFO L273 TraceCheckUtils]: 66: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,748 INFO L273 TraceCheckUtils]: 67: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,748 INFO L273 TraceCheckUtils]: 68: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,749 INFO L273 TraceCheckUtils]: 69: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,749 INFO L273 TraceCheckUtils]: 70: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,749 INFO L273 TraceCheckUtils]: 71: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,749 INFO L273 TraceCheckUtils]: 72: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,749 INFO L273 TraceCheckUtils]: 73: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,749 INFO L273 TraceCheckUtils]: 74: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,750 INFO L273 TraceCheckUtils]: 75: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,750 INFO L273 TraceCheckUtils]: 76: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,750 INFO L273 TraceCheckUtils]: 77: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,750 INFO L273 TraceCheckUtils]: 78: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4459#false} is VALID [2018-11-18 22:54:07,750 INFO L273 TraceCheckUtils]: 79: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,750 INFO L273 TraceCheckUtils]: 80: Hoare triple {4459#false} assume !(~i~0 < 100000); {4459#false} is VALID [2018-11-18 22:54:07,751 INFO L273 TraceCheckUtils]: 81: Hoare triple {4459#false} havoc ~x~0;~x~0 := 0; {4459#false} is VALID [2018-11-18 22:54:07,751 INFO L273 TraceCheckUtils]: 82: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-18 22:54:07,751 INFO L273 TraceCheckUtils]: 83: Hoare triple {4459#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4459#false} is VALID [2018-11-18 22:54:07,751 INFO L256 TraceCheckUtils]: 84: Hoare triple {4459#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {4459#false} is VALID [2018-11-18 22:54:07,751 INFO L273 TraceCheckUtils]: 85: Hoare triple {4459#false} ~cond := #in~cond; {4459#false} is VALID [2018-11-18 22:54:07,751 INFO L273 TraceCheckUtils]: 86: Hoare triple {4459#false} assume 0 == ~cond; {4459#false} is VALID [2018-11-18 22:54:07,752 INFO L273 TraceCheckUtils]: 87: Hoare triple {4459#false} assume !false; {4459#false} is VALID [2018-11-18 22:54:07,756 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-11-18 22:54:07,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:54:07,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-18 22:54:07,777 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 88 [2018-11-18 22:54:07,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:54:07,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-18 22:54:07,822 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-18 22:54:07,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 22:54:07,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 22:54:07,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:54:07,823 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 12 states. [2018-11-18 22:54:08,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:08,201 INFO L93 Difference]: Finished difference Result 170 states and 181 transitions. [2018-11-18 22:54:08,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 22:54:08,201 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 88 [2018-11-18 22:54:08,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:54:08,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:54:08,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2018-11-18 22:54:08,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:54:08,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2018-11-18 22:54:08,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 133 transitions. [2018-11-18 22:54:08,350 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:54:08,352 INFO L225 Difference]: With dead ends: 170 [2018-11-18 22:54:08,353 INFO L226 Difference]: Without dead ends: 101 [2018-11-18 22:54:08,353 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 88 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-18 22:54:08,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-18 22:54:08,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-11-18 22:54:08,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:54:08,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 101 states. [2018-11-18 22:54:08,403 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 101 states. [2018-11-18 22:54:08,403 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 101 states. [2018-11-18 22:54:08,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:08,406 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-11-18 22:54:08,406 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-18 22:54:08,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:08,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:08,407 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 101 states. [2018-11-18 22:54:08,407 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 101 states. [2018-11-18 22:54:08,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:08,410 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-11-18 22:54:08,410 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-18 22:54:08,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:08,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:08,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:54:08,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:54:08,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-18 22:54:08,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2018-11-18 22:54:08,414 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 88 [2018-11-18 22:54:08,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:54:08,414 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2018-11-18 22:54:08,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 22:54:08,414 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-18 22:54:08,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-18 22:54:08,415 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:54:08,416 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:54:08,416 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:54:08,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:54:08,416 INFO L82 PathProgramCache]: Analyzing trace with hash -2142428547, now seen corresponding path program 9 times [2018-11-18 22:54:08,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:54:08,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:54:08,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:08,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:54:08,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:08,718 INFO L256 TraceCheckUtils]: 0: Hoare triple {5330#true} call ULTIMATE.init(); {5330#true} is VALID [2018-11-18 22:54:08,718 INFO L273 TraceCheckUtils]: 1: Hoare triple {5330#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5330#true} is VALID [2018-11-18 22:54:08,719 INFO L273 TraceCheckUtils]: 2: Hoare triple {5330#true} assume true; {5330#true} is VALID [2018-11-18 22:54:08,719 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5330#true} {5330#true} #92#return; {5330#true} is VALID [2018-11-18 22:54:08,719 INFO L256 TraceCheckUtils]: 4: Hoare triple {5330#true} call #t~ret2 := main(); {5330#true} is VALID [2018-11-18 22:54:08,720 INFO L273 TraceCheckUtils]: 5: Hoare triple {5330#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5332#(= main_~i~0 0)} is VALID [2018-11-18 22:54:08,720 INFO L273 TraceCheckUtils]: 6: Hoare triple {5332#(= main_~i~0 0)} assume true; {5332#(= main_~i~0 0)} is VALID [2018-11-18 22:54:08,721 INFO L273 TraceCheckUtils]: 7: 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-18 22:54:08,721 INFO L273 TraceCheckUtils]: 8: Hoare triple {5333#(<= main_~i~0 1)} assume true; {5333#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:08,722 INFO L273 TraceCheckUtils]: 9: 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-18 22:54:08,722 INFO L273 TraceCheckUtils]: 10: Hoare triple {5334#(<= main_~i~0 2)} assume true; {5334#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:08,723 INFO L273 TraceCheckUtils]: 11: 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-18 22:54:08,724 INFO L273 TraceCheckUtils]: 12: Hoare triple {5335#(<= main_~i~0 3)} assume true; {5335#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:08,725 INFO L273 TraceCheckUtils]: 13: 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-18 22:54:08,726 INFO L273 TraceCheckUtils]: 14: Hoare triple {5336#(<= main_~i~0 4)} assume true; {5336#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:08,727 INFO L273 TraceCheckUtils]: 15: 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-18 22:54:08,727 INFO L273 TraceCheckUtils]: 16: Hoare triple {5337#(<= main_~i~0 5)} assume true; {5337#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:08,728 INFO L273 TraceCheckUtils]: 17: 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-18 22:54:08,729 INFO L273 TraceCheckUtils]: 18: Hoare triple {5338#(<= main_~i~0 6)} assume true; {5338#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:08,730 INFO L273 TraceCheckUtils]: 19: 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-18 22:54:08,730 INFO L273 TraceCheckUtils]: 20: Hoare triple {5339#(<= main_~i~0 7)} assume true; {5339#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:08,731 INFO L273 TraceCheckUtils]: 21: 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-18 22:54:08,732 INFO L273 TraceCheckUtils]: 22: Hoare triple {5340#(<= main_~i~0 8)} assume true; {5340#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:08,733 INFO L273 TraceCheckUtils]: 23: 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-18 22:54:08,734 INFO L273 TraceCheckUtils]: 24: Hoare triple {5341#(<= main_~i~0 9)} assume true; {5341#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:08,734 INFO L273 TraceCheckUtils]: 25: Hoare triple {5341#(<= main_~i~0 9)} assume !(~i~0 < 100000); {5331#false} is VALID [2018-11-18 22:54:08,735 INFO L273 TraceCheckUtils]: 26: Hoare triple {5331#false} ~i~0 := 0; {5331#false} is VALID [2018-11-18 22:54:08,735 INFO L273 TraceCheckUtils]: 27: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:08,735 INFO L273 TraceCheckUtils]: 28: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:08,735 INFO L273 TraceCheckUtils]: 29: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:08,736 INFO L273 TraceCheckUtils]: 30: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:08,736 INFO L273 TraceCheckUtils]: 31: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:08,736 INFO L273 TraceCheckUtils]: 32: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:08,736 INFO L273 TraceCheckUtils]: 33: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:08,737 INFO L273 TraceCheckUtils]: 34: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:08,737 INFO L273 TraceCheckUtils]: 35: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:08,737 INFO L273 TraceCheckUtils]: 36: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:08,737 INFO L273 TraceCheckUtils]: 37: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:08,738 INFO L273 TraceCheckUtils]: 38: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:08,738 INFO L273 TraceCheckUtils]: 39: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:08,738 INFO L273 TraceCheckUtils]: 40: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:08,738 INFO L273 TraceCheckUtils]: 41: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:08,739 INFO L273 TraceCheckUtils]: 42: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:08,739 INFO L273 TraceCheckUtils]: 43: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:08,739 INFO L273 TraceCheckUtils]: 44: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:08,739 INFO L273 TraceCheckUtils]: 45: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:08,739 INFO L273 TraceCheckUtils]: 46: Hoare triple {5331#false} assume !(~i~0 < 100000); {5331#false} is VALID [2018-11-18 22:54:08,739 INFO L273 TraceCheckUtils]: 47: Hoare triple {5331#false} ~i~0 := 0; {5331#false} is VALID [2018-11-18 22:54:08,740 INFO L273 TraceCheckUtils]: 48: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:08,740 INFO L273 TraceCheckUtils]: 49: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:08,740 INFO L273 TraceCheckUtils]: 50: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:08,740 INFO L273 TraceCheckUtils]: 51: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:08,740 INFO L273 TraceCheckUtils]: 52: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:08,740 INFO L273 TraceCheckUtils]: 53: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:08,740 INFO L273 TraceCheckUtils]: 54: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:08,741 INFO L273 TraceCheckUtils]: 55: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:08,741 INFO L273 TraceCheckUtils]: 56: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:08,741 INFO L273 TraceCheckUtils]: 57: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:08,741 INFO L273 TraceCheckUtils]: 58: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:08,741 INFO L273 TraceCheckUtils]: 59: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:08,741 INFO L273 TraceCheckUtils]: 60: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:08,742 INFO L273 TraceCheckUtils]: 61: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:08,742 INFO L273 TraceCheckUtils]: 62: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:08,742 INFO L273 TraceCheckUtils]: 63: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:08,742 INFO L273 TraceCheckUtils]: 64: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:08,742 INFO L273 TraceCheckUtils]: 65: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:08,742 INFO L273 TraceCheckUtils]: 66: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:08,742 INFO L273 TraceCheckUtils]: 67: Hoare triple {5331#false} assume !(~i~0 < 100000); {5331#false} is VALID [2018-11-18 22:54:08,743 INFO L273 TraceCheckUtils]: 68: Hoare triple {5331#false} ~i~0 := 0; {5331#false} is VALID [2018-11-18 22:54:08,743 INFO L273 TraceCheckUtils]: 69: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:08,743 INFO L273 TraceCheckUtils]: 70: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:08,743 INFO L273 TraceCheckUtils]: 71: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:08,743 INFO L273 TraceCheckUtils]: 72: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:08,743 INFO L273 TraceCheckUtils]: 73: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:08,744 INFO L273 TraceCheckUtils]: 74: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:08,744 INFO L273 TraceCheckUtils]: 75: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:08,744 INFO L273 TraceCheckUtils]: 76: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:08,744 INFO L273 TraceCheckUtils]: 77: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:08,744 INFO L273 TraceCheckUtils]: 78: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:08,744 INFO L273 TraceCheckUtils]: 79: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:08,744 INFO L273 TraceCheckUtils]: 80: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:08,745 INFO L273 TraceCheckUtils]: 81: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:08,745 INFO L273 TraceCheckUtils]: 82: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:08,745 INFO L273 TraceCheckUtils]: 83: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:08,745 INFO L273 TraceCheckUtils]: 84: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:08,745 INFO L273 TraceCheckUtils]: 85: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:08,745 INFO L273 TraceCheckUtils]: 86: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:08,746 INFO L273 TraceCheckUtils]: 87: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:08,746 INFO L273 TraceCheckUtils]: 88: Hoare triple {5331#false} assume !(~i~0 < 100000); {5331#false} is VALID [2018-11-18 22:54:08,746 INFO L273 TraceCheckUtils]: 89: Hoare triple {5331#false} havoc ~x~0;~x~0 := 0; {5331#false} is VALID [2018-11-18 22:54:08,746 INFO L273 TraceCheckUtils]: 90: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:08,746 INFO L273 TraceCheckUtils]: 91: Hoare triple {5331#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5331#false} is VALID [2018-11-18 22:54:08,746 INFO L256 TraceCheckUtils]: 92: Hoare triple {5331#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {5331#false} is VALID [2018-11-18 22:54:08,746 INFO L273 TraceCheckUtils]: 93: Hoare triple {5331#false} ~cond := #in~cond; {5331#false} is VALID [2018-11-18 22:54:08,747 INFO L273 TraceCheckUtils]: 94: Hoare triple {5331#false} assume 0 == ~cond; {5331#false} is VALID [2018-11-18 22:54:08,747 INFO L273 TraceCheckUtils]: 95: Hoare triple {5331#false} assume !false; {5331#false} is VALID [2018-11-18 22:54:08,756 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-11-18 22:54:08,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:54:08,757 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-18 22:54:08,766 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:54:11,214 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-18 22:54:11,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:54:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:11,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:54:11,387 INFO L256 TraceCheckUtils]: 0: Hoare triple {5330#true} call ULTIMATE.init(); {5330#true} is VALID [2018-11-18 22:54:11,388 INFO L273 TraceCheckUtils]: 1: Hoare triple {5330#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5330#true} is VALID [2018-11-18 22:54:11,388 INFO L273 TraceCheckUtils]: 2: Hoare triple {5330#true} assume true; {5330#true} is VALID [2018-11-18 22:54:11,388 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5330#true} {5330#true} #92#return; {5330#true} is VALID [2018-11-18 22:54:11,389 INFO L256 TraceCheckUtils]: 4: Hoare triple {5330#true} call #t~ret2 := main(); {5330#true} is VALID [2018-11-18 22:54:11,389 INFO L273 TraceCheckUtils]: 5: Hoare triple {5330#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5330#true} is VALID [2018-11-18 22:54:11,389 INFO L273 TraceCheckUtils]: 6: Hoare triple {5330#true} assume true; {5330#true} is VALID [2018-11-18 22:54:11,389 INFO L273 TraceCheckUtils]: 7: Hoare triple {5330#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5330#true} is VALID [2018-11-18 22:54:11,390 INFO L273 TraceCheckUtils]: 8: Hoare triple {5330#true} assume true; {5330#true} is VALID [2018-11-18 22:54:11,390 INFO L273 TraceCheckUtils]: 9: Hoare triple {5330#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5330#true} is VALID [2018-11-18 22:54:11,390 INFO L273 TraceCheckUtils]: 10: Hoare triple {5330#true} assume true; {5330#true} is VALID [2018-11-18 22:54:11,390 INFO L273 TraceCheckUtils]: 11: Hoare triple {5330#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5330#true} is VALID [2018-11-18 22:54:11,390 INFO L273 TraceCheckUtils]: 12: Hoare triple {5330#true} assume true; {5330#true} is VALID [2018-11-18 22:54:11,391 INFO L273 TraceCheckUtils]: 13: Hoare triple {5330#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5330#true} is VALID [2018-11-18 22:54:11,391 INFO L273 TraceCheckUtils]: 14: Hoare triple {5330#true} assume true; {5330#true} is VALID [2018-11-18 22:54:11,391 INFO L273 TraceCheckUtils]: 15: Hoare triple {5330#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5330#true} is VALID [2018-11-18 22:54:11,391 INFO L273 TraceCheckUtils]: 16: Hoare triple {5330#true} assume true; {5330#true} is VALID [2018-11-18 22:54:11,391 INFO L273 TraceCheckUtils]: 17: Hoare triple {5330#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5330#true} is VALID [2018-11-18 22:54:11,391 INFO L273 TraceCheckUtils]: 18: Hoare triple {5330#true} assume true; {5330#true} is VALID [2018-11-18 22:54:11,392 INFO L273 TraceCheckUtils]: 19: Hoare triple {5330#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5330#true} is VALID [2018-11-18 22:54:11,392 INFO L273 TraceCheckUtils]: 20: Hoare triple {5330#true} assume true; {5330#true} is VALID [2018-11-18 22:54:11,392 INFO L273 TraceCheckUtils]: 21: Hoare triple {5330#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5330#true} is VALID [2018-11-18 22:54:11,392 INFO L273 TraceCheckUtils]: 22: Hoare triple {5330#true} assume true; {5330#true} is VALID [2018-11-18 22:54:11,392 INFO L273 TraceCheckUtils]: 23: Hoare triple {5330#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5330#true} is VALID [2018-11-18 22:54:11,392 INFO L273 TraceCheckUtils]: 24: Hoare triple {5330#true} assume true; {5330#true} is VALID [2018-11-18 22:54:11,393 INFO L273 TraceCheckUtils]: 25: Hoare triple {5330#true} assume !(~i~0 < 100000); {5330#true} is VALID [2018-11-18 22:54:11,393 INFO L273 TraceCheckUtils]: 26: Hoare triple {5330#true} ~i~0 := 0; {5423#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:11,393 INFO L273 TraceCheckUtils]: 27: Hoare triple {5423#(<= main_~i~0 0)} assume true; {5423#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:11,394 INFO L273 TraceCheckUtils]: 28: Hoare triple {5423#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5333#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:11,395 INFO L273 TraceCheckUtils]: 29: Hoare triple {5333#(<= main_~i~0 1)} assume true; {5333#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:11,396 INFO L273 TraceCheckUtils]: 30: Hoare triple {5333#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5334#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:11,396 INFO L273 TraceCheckUtils]: 31: Hoare triple {5334#(<= main_~i~0 2)} assume true; {5334#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:11,397 INFO L273 TraceCheckUtils]: 32: Hoare triple {5334#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5335#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:11,398 INFO L273 TraceCheckUtils]: 33: Hoare triple {5335#(<= main_~i~0 3)} assume true; {5335#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:11,399 INFO L273 TraceCheckUtils]: 34: Hoare triple {5335#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5336#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:11,399 INFO L273 TraceCheckUtils]: 35: Hoare triple {5336#(<= main_~i~0 4)} assume true; {5336#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:11,400 INFO L273 TraceCheckUtils]: 36: Hoare triple {5336#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5337#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:11,404 INFO L273 TraceCheckUtils]: 37: Hoare triple {5337#(<= main_~i~0 5)} assume true; {5337#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:11,407 INFO L273 TraceCheckUtils]: 38: Hoare triple {5337#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5338#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:11,407 INFO L273 TraceCheckUtils]: 39: Hoare triple {5338#(<= main_~i~0 6)} assume true; {5338#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:11,408 INFO L273 TraceCheckUtils]: 40: Hoare triple {5338#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5339#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:11,408 INFO L273 TraceCheckUtils]: 41: Hoare triple {5339#(<= main_~i~0 7)} assume true; {5339#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:11,409 INFO L273 TraceCheckUtils]: 42: Hoare triple {5339#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5340#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:11,409 INFO L273 TraceCheckUtils]: 43: Hoare triple {5340#(<= main_~i~0 8)} assume true; {5340#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:11,410 INFO L273 TraceCheckUtils]: 44: Hoare triple {5340#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5341#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:11,411 INFO L273 TraceCheckUtils]: 45: Hoare triple {5341#(<= main_~i~0 9)} assume true; {5341#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:11,411 INFO L273 TraceCheckUtils]: 46: Hoare triple {5341#(<= main_~i~0 9)} assume !(~i~0 < 100000); {5331#false} is VALID [2018-11-18 22:54:11,412 INFO L273 TraceCheckUtils]: 47: Hoare triple {5331#false} ~i~0 := 0; {5331#false} is VALID [2018-11-18 22:54:11,412 INFO L273 TraceCheckUtils]: 48: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:11,412 INFO L273 TraceCheckUtils]: 49: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:11,412 INFO L273 TraceCheckUtils]: 50: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:11,413 INFO L273 TraceCheckUtils]: 51: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:11,413 INFO L273 TraceCheckUtils]: 52: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:11,413 INFO L273 TraceCheckUtils]: 53: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:11,413 INFO L273 TraceCheckUtils]: 54: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:11,414 INFO L273 TraceCheckUtils]: 55: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:11,414 INFO L273 TraceCheckUtils]: 56: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:11,414 INFO L273 TraceCheckUtils]: 57: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:11,414 INFO L273 TraceCheckUtils]: 58: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:11,414 INFO L273 TraceCheckUtils]: 59: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:11,414 INFO L273 TraceCheckUtils]: 60: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:11,415 INFO L273 TraceCheckUtils]: 61: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:11,415 INFO L273 TraceCheckUtils]: 62: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:11,415 INFO L273 TraceCheckUtils]: 63: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:11,415 INFO L273 TraceCheckUtils]: 64: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:11,415 INFO L273 TraceCheckUtils]: 65: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:11,416 INFO L273 TraceCheckUtils]: 66: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:11,416 INFO L273 TraceCheckUtils]: 67: Hoare triple {5331#false} assume !(~i~0 < 100000); {5331#false} is VALID [2018-11-18 22:54:11,416 INFO L273 TraceCheckUtils]: 68: Hoare triple {5331#false} ~i~0 := 0; {5331#false} is VALID [2018-11-18 22:54:11,416 INFO L273 TraceCheckUtils]: 69: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:11,416 INFO L273 TraceCheckUtils]: 70: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:11,416 INFO L273 TraceCheckUtils]: 71: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:11,417 INFO L273 TraceCheckUtils]: 72: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:11,417 INFO L273 TraceCheckUtils]: 73: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:11,417 INFO L273 TraceCheckUtils]: 74: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:11,417 INFO L273 TraceCheckUtils]: 75: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:11,417 INFO L273 TraceCheckUtils]: 76: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:11,417 INFO L273 TraceCheckUtils]: 77: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:11,417 INFO L273 TraceCheckUtils]: 78: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:11,418 INFO L273 TraceCheckUtils]: 79: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:11,418 INFO L273 TraceCheckUtils]: 80: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:11,418 INFO L273 TraceCheckUtils]: 81: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:11,418 INFO L273 TraceCheckUtils]: 82: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:11,418 INFO L273 TraceCheckUtils]: 83: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:11,418 INFO L273 TraceCheckUtils]: 84: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:11,418 INFO L273 TraceCheckUtils]: 85: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:11,419 INFO L273 TraceCheckUtils]: 86: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5331#false} is VALID [2018-11-18 22:54:11,419 INFO L273 TraceCheckUtils]: 87: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:11,419 INFO L273 TraceCheckUtils]: 88: Hoare triple {5331#false} assume !(~i~0 < 100000); {5331#false} is VALID [2018-11-18 22:54:11,419 INFO L273 TraceCheckUtils]: 89: Hoare triple {5331#false} havoc ~x~0;~x~0 := 0; {5331#false} is VALID [2018-11-18 22:54:11,419 INFO L273 TraceCheckUtils]: 90: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-18 22:54:11,419 INFO L273 TraceCheckUtils]: 91: Hoare triple {5331#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5331#false} is VALID [2018-11-18 22:54:11,420 INFO L256 TraceCheckUtils]: 92: Hoare triple {5331#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {5331#false} is VALID [2018-11-18 22:54:11,420 INFO L273 TraceCheckUtils]: 93: Hoare triple {5331#false} ~cond := #in~cond; {5331#false} is VALID [2018-11-18 22:54:11,420 INFO L273 TraceCheckUtils]: 94: Hoare triple {5331#false} assume 0 == ~cond; {5331#false} is VALID [2018-11-18 22:54:11,420 INFO L273 TraceCheckUtils]: 95: Hoare triple {5331#false} assume !false; {5331#false} is VALID [2018-11-18 22:54:11,439 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-11-18 22:54:11,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:54:11,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-18 22:54:11,460 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2018-11-18 22:54:11,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:54:11,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-18 22:54:11,525 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-18 22:54:11,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 22:54:11,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 22:54:11,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-18 22:54:11,526 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand 13 states. [2018-11-18 22:54:12,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:12,436 INFO L93 Difference]: Finished difference Result 184 states and 195 transitions. [2018-11-18 22:54:12,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 22:54:12,436 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2018-11-18 22:54:12,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:54:12,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 22:54:12,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2018-11-18 22:54:12,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 22:54:12,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2018-11-18 22:54:12,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 141 transitions. [2018-11-18 22:54:12,957 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:54:12,960 INFO L225 Difference]: With dead ends: 184 [2018-11-18 22:54:12,960 INFO L226 Difference]: Without dead ends: 109 [2018-11-18 22:54:12,961 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 96 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-18 22:54:12,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-18 22:54:12,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-11-18 22:54:12,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:54:12,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 109 states. [2018-11-18 22:54:12,999 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 109 states. [2018-11-18 22:54:12,999 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 109 states. [2018-11-18 22:54:13,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:13,001 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-11-18 22:54:13,001 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-11-18 22:54:13,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:13,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:13,002 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 109 states. [2018-11-18 22:54:13,002 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 109 states. [2018-11-18 22:54:13,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:13,003 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-11-18 22:54:13,004 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-11-18 22:54:13,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:13,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:13,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:54:13,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:54:13,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-18 22:54:13,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2018-11-18 22:54:13,006 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 96 [2018-11-18 22:54:13,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:54:13,007 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2018-11-18 22:54:13,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 22:54:13,007 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-11-18 22:54:13,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-18 22:54:13,008 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:54:13,008 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:54:13,008 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:54:13,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:54:13,009 INFO L82 PathProgramCache]: Analyzing trace with hash 984481789, now seen corresponding path program 10 times [2018-11-18 22:54:13,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:54:13,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:54:13,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:13,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:54:13,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:13,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:13,719 INFO L256 TraceCheckUtils]: 0: Hoare triple {6276#true} call ULTIMATE.init(); {6276#true} is VALID [2018-11-18 22:54:13,719 INFO L273 TraceCheckUtils]: 1: Hoare triple {6276#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6276#true} is VALID [2018-11-18 22:54:13,719 INFO L273 TraceCheckUtils]: 2: Hoare triple {6276#true} assume true; {6276#true} is VALID [2018-11-18 22:54:13,719 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6276#true} {6276#true} #92#return; {6276#true} is VALID [2018-11-18 22:54:13,720 INFO L256 TraceCheckUtils]: 4: Hoare triple {6276#true} call #t~ret2 := main(); {6276#true} is VALID [2018-11-18 22:54:13,720 INFO L273 TraceCheckUtils]: 5: Hoare triple {6276#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6278#(= main_~i~0 0)} is VALID [2018-11-18 22:54:13,721 INFO L273 TraceCheckUtils]: 6: Hoare triple {6278#(= main_~i~0 0)} assume true; {6278#(= main_~i~0 0)} is VALID [2018-11-18 22:54:13,721 INFO L273 TraceCheckUtils]: 7: Hoare triple {6278#(= 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; {6279#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:13,722 INFO L273 TraceCheckUtils]: 8: Hoare triple {6279#(<= main_~i~0 1)} assume true; {6279#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:13,722 INFO L273 TraceCheckUtils]: 9: Hoare triple {6279#(<= 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; {6280#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:13,723 INFO L273 TraceCheckUtils]: 10: Hoare triple {6280#(<= main_~i~0 2)} assume true; {6280#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:13,723 INFO L273 TraceCheckUtils]: 11: Hoare triple {6280#(<= 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; {6281#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:13,724 INFO L273 TraceCheckUtils]: 12: Hoare triple {6281#(<= main_~i~0 3)} assume true; {6281#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:13,725 INFO L273 TraceCheckUtils]: 13: Hoare triple {6281#(<= 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; {6282#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:13,725 INFO L273 TraceCheckUtils]: 14: Hoare triple {6282#(<= main_~i~0 4)} assume true; {6282#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:13,726 INFO L273 TraceCheckUtils]: 15: Hoare triple {6282#(<= 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; {6283#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:13,726 INFO L273 TraceCheckUtils]: 16: Hoare triple {6283#(<= main_~i~0 5)} assume true; {6283#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:13,727 INFO L273 TraceCheckUtils]: 17: Hoare triple {6283#(<= 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; {6284#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:13,728 INFO L273 TraceCheckUtils]: 18: Hoare triple {6284#(<= main_~i~0 6)} assume true; {6284#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:13,729 INFO L273 TraceCheckUtils]: 19: Hoare triple {6284#(<= 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; {6285#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:13,729 INFO L273 TraceCheckUtils]: 20: Hoare triple {6285#(<= main_~i~0 7)} assume true; {6285#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:13,730 INFO L273 TraceCheckUtils]: 21: Hoare triple {6285#(<= 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; {6286#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:13,731 INFO L273 TraceCheckUtils]: 22: Hoare triple {6286#(<= main_~i~0 8)} assume true; {6286#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:13,732 INFO L273 TraceCheckUtils]: 23: Hoare triple {6286#(<= 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; {6287#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:13,732 INFO L273 TraceCheckUtils]: 24: Hoare triple {6287#(<= main_~i~0 9)} assume true; {6287#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:13,733 INFO L273 TraceCheckUtils]: 25: Hoare triple {6287#(<= 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; {6288#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:13,733 INFO L273 TraceCheckUtils]: 26: Hoare triple {6288#(<= main_~i~0 10)} assume true; {6288#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:13,734 INFO L273 TraceCheckUtils]: 27: Hoare triple {6288#(<= main_~i~0 10)} assume !(~i~0 < 100000); {6277#false} is VALID [2018-11-18 22:54:13,734 INFO L273 TraceCheckUtils]: 28: Hoare triple {6277#false} ~i~0 := 0; {6277#false} is VALID [2018-11-18 22:54:13,734 INFO L273 TraceCheckUtils]: 29: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,735 INFO L273 TraceCheckUtils]: 30: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,735 INFO L273 TraceCheckUtils]: 31: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,735 INFO L273 TraceCheckUtils]: 32: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,735 INFO L273 TraceCheckUtils]: 33: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,735 INFO L273 TraceCheckUtils]: 34: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,736 INFO L273 TraceCheckUtils]: 35: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,736 INFO L273 TraceCheckUtils]: 36: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,736 INFO L273 TraceCheckUtils]: 37: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,736 INFO L273 TraceCheckUtils]: 38: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,736 INFO L273 TraceCheckUtils]: 39: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,737 INFO L273 TraceCheckUtils]: 40: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,737 INFO L273 TraceCheckUtils]: 41: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,737 INFO L273 TraceCheckUtils]: 42: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,737 INFO L273 TraceCheckUtils]: 43: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,737 INFO L273 TraceCheckUtils]: 44: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,737 INFO L273 TraceCheckUtils]: 45: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,737 INFO L273 TraceCheckUtils]: 46: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,738 INFO L273 TraceCheckUtils]: 47: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,738 INFO L273 TraceCheckUtils]: 48: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,738 INFO L273 TraceCheckUtils]: 49: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,738 INFO L273 TraceCheckUtils]: 50: Hoare triple {6277#false} assume !(~i~0 < 100000); {6277#false} is VALID [2018-11-18 22:54:13,738 INFO L273 TraceCheckUtils]: 51: Hoare triple {6277#false} ~i~0 := 0; {6277#false} is VALID [2018-11-18 22:54:13,738 INFO L273 TraceCheckUtils]: 52: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,738 INFO L273 TraceCheckUtils]: 53: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,738 INFO L273 TraceCheckUtils]: 54: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,739 INFO L273 TraceCheckUtils]: 55: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,739 INFO L273 TraceCheckUtils]: 56: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,739 INFO L273 TraceCheckUtils]: 57: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,739 INFO L273 TraceCheckUtils]: 58: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,739 INFO L273 TraceCheckUtils]: 59: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,739 INFO L273 TraceCheckUtils]: 60: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,739 INFO L273 TraceCheckUtils]: 61: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,739 INFO L273 TraceCheckUtils]: 62: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,739 INFO L273 TraceCheckUtils]: 63: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,740 INFO L273 TraceCheckUtils]: 64: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,740 INFO L273 TraceCheckUtils]: 65: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,740 INFO L273 TraceCheckUtils]: 66: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,740 INFO L273 TraceCheckUtils]: 67: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,740 INFO L273 TraceCheckUtils]: 68: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,740 INFO L273 TraceCheckUtils]: 69: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,740 INFO L273 TraceCheckUtils]: 70: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,740 INFO L273 TraceCheckUtils]: 71: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,741 INFO L273 TraceCheckUtils]: 72: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,741 INFO L273 TraceCheckUtils]: 73: Hoare triple {6277#false} assume !(~i~0 < 100000); {6277#false} is VALID [2018-11-18 22:54:13,741 INFO L273 TraceCheckUtils]: 74: Hoare triple {6277#false} ~i~0 := 0; {6277#false} is VALID [2018-11-18 22:54:13,741 INFO L273 TraceCheckUtils]: 75: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,741 INFO L273 TraceCheckUtils]: 76: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,741 INFO L273 TraceCheckUtils]: 77: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,741 INFO L273 TraceCheckUtils]: 78: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,741 INFO L273 TraceCheckUtils]: 79: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,741 INFO L273 TraceCheckUtils]: 80: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,742 INFO L273 TraceCheckUtils]: 81: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,742 INFO L273 TraceCheckUtils]: 82: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,742 INFO L273 TraceCheckUtils]: 83: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,742 INFO L273 TraceCheckUtils]: 84: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,742 INFO L273 TraceCheckUtils]: 85: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,742 INFO L273 TraceCheckUtils]: 86: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,742 INFO L273 TraceCheckUtils]: 87: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,742 INFO L273 TraceCheckUtils]: 88: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,743 INFO L273 TraceCheckUtils]: 89: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,743 INFO L273 TraceCheckUtils]: 90: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,743 INFO L273 TraceCheckUtils]: 91: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,743 INFO L273 TraceCheckUtils]: 92: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,743 INFO L273 TraceCheckUtils]: 93: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,743 INFO L273 TraceCheckUtils]: 94: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,743 INFO L273 TraceCheckUtils]: 95: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,743 INFO L273 TraceCheckUtils]: 96: Hoare triple {6277#false} assume !(~i~0 < 100000); {6277#false} is VALID [2018-11-18 22:54:13,744 INFO L273 TraceCheckUtils]: 97: Hoare triple {6277#false} havoc ~x~0;~x~0 := 0; {6277#false} is VALID [2018-11-18 22:54:13,744 INFO L273 TraceCheckUtils]: 98: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,744 INFO L273 TraceCheckUtils]: 99: Hoare triple {6277#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6277#false} is VALID [2018-11-18 22:54:13,744 INFO L256 TraceCheckUtils]: 100: Hoare triple {6277#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {6277#false} is VALID [2018-11-18 22:54:13,744 INFO L273 TraceCheckUtils]: 101: Hoare triple {6277#false} ~cond := #in~cond; {6277#false} is VALID [2018-11-18 22:54:13,744 INFO L273 TraceCheckUtils]: 102: Hoare triple {6277#false} assume 0 == ~cond; {6277#false} is VALID [2018-11-18 22:54:13,744 INFO L273 TraceCheckUtils]: 103: Hoare triple {6277#false} assume !false; {6277#false} is VALID [2018-11-18 22:54:13,749 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-11-18 22:54:13,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:54:13,749 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-18 22:54:13,758 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:54:13,796 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:54:13,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:54:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:13,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:54:13,946 INFO L256 TraceCheckUtils]: 0: Hoare triple {6276#true} call ULTIMATE.init(); {6276#true} is VALID [2018-11-18 22:54:13,947 INFO L273 TraceCheckUtils]: 1: Hoare triple {6276#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6276#true} is VALID [2018-11-18 22:54:13,947 INFO L273 TraceCheckUtils]: 2: Hoare triple {6276#true} assume true; {6276#true} is VALID [2018-11-18 22:54:13,947 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6276#true} {6276#true} #92#return; {6276#true} is VALID [2018-11-18 22:54:13,947 INFO L256 TraceCheckUtils]: 4: Hoare triple {6276#true} call #t~ret2 := main(); {6276#true} is VALID [2018-11-18 22:54:13,948 INFO L273 TraceCheckUtils]: 5: Hoare triple {6276#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6307#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:13,948 INFO L273 TraceCheckUtils]: 6: Hoare triple {6307#(<= main_~i~0 0)} assume true; {6307#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:13,949 INFO L273 TraceCheckUtils]: 7: Hoare triple {6307#(<= 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; {6279#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:13,949 INFO L273 TraceCheckUtils]: 8: Hoare triple {6279#(<= main_~i~0 1)} assume true; {6279#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:13,950 INFO L273 TraceCheckUtils]: 9: Hoare triple {6279#(<= 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; {6280#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:13,950 INFO L273 TraceCheckUtils]: 10: Hoare triple {6280#(<= main_~i~0 2)} assume true; {6280#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:13,951 INFO L273 TraceCheckUtils]: 11: Hoare triple {6280#(<= 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; {6281#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:13,952 INFO L273 TraceCheckUtils]: 12: Hoare triple {6281#(<= main_~i~0 3)} assume true; {6281#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:13,952 INFO L273 TraceCheckUtils]: 13: Hoare triple {6281#(<= 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; {6282#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:13,953 INFO L273 TraceCheckUtils]: 14: Hoare triple {6282#(<= main_~i~0 4)} assume true; {6282#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:13,954 INFO L273 TraceCheckUtils]: 15: Hoare triple {6282#(<= 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; {6283#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:13,954 INFO L273 TraceCheckUtils]: 16: Hoare triple {6283#(<= main_~i~0 5)} assume true; {6283#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:13,955 INFO L273 TraceCheckUtils]: 17: Hoare triple {6283#(<= 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; {6284#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:13,956 INFO L273 TraceCheckUtils]: 18: Hoare triple {6284#(<= main_~i~0 6)} assume true; {6284#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:13,957 INFO L273 TraceCheckUtils]: 19: Hoare triple {6284#(<= 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; {6285#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:13,957 INFO L273 TraceCheckUtils]: 20: Hoare triple {6285#(<= main_~i~0 7)} assume true; {6285#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:13,958 INFO L273 TraceCheckUtils]: 21: Hoare triple {6285#(<= 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; {6286#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:13,958 INFO L273 TraceCheckUtils]: 22: Hoare triple {6286#(<= main_~i~0 8)} assume true; {6286#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:13,959 INFO L273 TraceCheckUtils]: 23: Hoare triple {6286#(<= 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; {6287#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:13,960 INFO L273 TraceCheckUtils]: 24: Hoare triple {6287#(<= main_~i~0 9)} assume true; {6287#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:13,961 INFO L273 TraceCheckUtils]: 25: Hoare triple {6287#(<= 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; {6288#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:13,961 INFO L273 TraceCheckUtils]: 26: Hoare triple {6288#(<= main_~i~0 10)} assume true; {6288#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:13,962 INFO L273 TraceCheckUtils]: 27: Hoare triple {6288#(<= main_~i~0 10)} assume !(~i~0 < 100000); {6277#false} is VALID [2018-11-18 22:54:13,962 INFO L273 TraceCheckUtils]: 28: Hoare triple {6277#false} ~i~0 := 0; {6277#false} is VALID [2018-11-18 22:54:13,962 INFO L273 TraceCheckUtils]: 29: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,962 INFO L273 TraceCheckUtils]: 30: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,963 INFO L273 TraceCheckUtils]: 31: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,963 INFO L273 TraceCheckUtils]: 32: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,963 INFO L273 TraceCheckUtils]: 33: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,963 INFO L273 TraceCheckUtils]: 34: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,963 INFO L273 TraceCheckUtils]: 35: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,964 INFO L273 TraceCheckUtils]: 36: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,964 INFO L273 TraceCheckUtils]: 37: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,964 INFO L273 TraceCheckUtils]: 38: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,964 INFO L273 TraceCheckUtils]: 39: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,964 INFO L273 TraceCheckUtils]: 40: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,965 INFO L273 TraceCheckUtils]: 41: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,965 INFO L273 TraceCheckUtils]: 42: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,965 INFO L273 TraceCheckUtils]: 43: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,965 INFO L273 TraceCheckUtils]: 44: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,965 INFO L273 TraceCheckUtils]: 45: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,965 INFO L273 TraceCheckUtils]: 46: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,965 INFO L273 TraceCheckUtils]: 47: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,966 INFO L273 TraceCheckUtils]: 48: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,966 INFO L273 TraceCheckUtils]: 49: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,966 INFO L273 TraceCheckUtils]: 50: Hoare triple {6277#false} assume !(~i~0 < 100000); {6277#false} is VALID [2018-11-18 22:54:13,966 INFO L273 TraceCheckUtils]: 51: Hoare triple {6277#false} ~i~0 := 0; {6277#false} is VALID [2018-11-18 22:54:13,966 INFO L273 TraceCheckUtils]: 52: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,967 INFO L273 TraceCheckUtils]: 53: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,967 INFO L273 TraceCheckUtils]: 54: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,967 INFO L273 TraceCheckUtils]: 55: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,967 INFO L273 TraceCheckUtils]: 56: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,967 INFO L273 TraceCheckUtils]: 57: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,967 INFO L273 TraceCheckUtils]: 58: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,968 INFO L273 TraceCheckUtils]: 59: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,968 INFO L273 TraceCheckUtils]: 60: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,968 INFO L273 TraceCheckUtils]: 61: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,968 INFO L273 TraceCheckUtils]: 62: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,968 INFO L273 TraceCheckUtils]: 63: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,968 INFO L273 TraceCheckUtils]: 64: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,969 INFO L273 TraceCheckUtils]: 65: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,969 INFO L273 TraceCheckUtils]: 66: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,969 INFO L273 TraceCheckUtils]: 67: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,969 INFO L273 TraceCheckUtils]: 68: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,969 INFO L273 TraceCheckUtils]: 69: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,969 INFO L273 TraceCheckUtils]: 70: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,970 INFO L273 TraceCheckUtils]: 71: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,970 INFO L273 TraceCheckUtils]: 72: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,970 INFO L273 TraceCheckUtils]: 73: Hoare triple {6277#false} assume !(~i~0 < 100000); {6277#false} is VALID [2018-11-18 22:54:13,970 INFO L273 TraceCheckUtils]: 74: Hoare triple {6277#false} ~i~0 := 0; {6277#false} is VALID [2018-11-18 22:54:13,970 INFO L273 TraceCheckUtils]: 75: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,970 INFO L273 TraceCheckUtils]: 76: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,971 INFO L273 TraceCheckUtils]: 77: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,971 INFO L273 TraceCheckUtils]: 78: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,971 INFO L273 TraceCheckUtils]: 79: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,971 INFO L273 TraceCheckUtils]: 80: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,971 INFO L273 TraceCheckUtils]: 81: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,971 INFO L273 TraceCheckUtils]: 82: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,972 INFO L273 TraceCheckUtils]: 83: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,972 INFO L273 TraceCheckUtils]: 84: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,972 INFO L273 TraceCheckUtils]: 85: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,972 INFO L273 TraceCheckUtils]: 86: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,972 INFO L273 TraceCheckUtils]: 87: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,972 INFO L273 TraceCheckUtils]: 88: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,973 INFO L273 TraceCheckUtils]: 89: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,973 INFO L273 TraceCheckUtils]: 90: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,973 INFO L273 TraceCheckUtils]: 91: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,973 INFO L273 TraceCheckUtils]: 92: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,973 INFO L273 TraceCheckUtils]: 93: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,973 INFO L273 TraceCheckUtils]: 94: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6277#false} is VALID [2018-11-18 22:54:13,973 INFO L273 TraceCheckUtils]: 95: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,974 INFO L273 TraceCheckUtils]: 96: Hoare triple {6277#false} assume !(~i~0 < 100000); {6277#false} is VALID [2018-11-18 22:54:13,974 INFO L273 TraceCheckUtils]: 97: Hoare triple {6277#false} havoc ~x~0;~x~0 := 0; {6277#false} is VALID [2018-11-18 22:54:13,974 INFO L273 TraceCheckUtils]: 98: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-18 22:54:13,974 INFO L273 TraceCheckUtils]: 99: Hoare triple {6277#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6277#false} is VALID [2018-11-18 22:54:13,974 INFO L256 TraceCheckUtils]: 100: Hoare triple {6277#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {6277#false} is VALID [2018-11-18 22:54:13,974 INFO L273 TraceCheckUtils]: 101: Hoare triple {6277#false} ~cond := #in~cond; {6277#false} is VALID [2018-11-18 22:54:13,975 INFO L273 TraceCheckUtils]: 102: Hoare triple {6277#false} assume 0 == ~cond; {6277#false} is VALID [2018-11-18 22:54:13,975 INFO L273 TraceCheckUtils]: 103: Hoare triple {6277#false} assume !false; {6277#false} is VALID [2018-11-18 22:54:13,981 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-11-18 22:54:14,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:54:14,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-18 22:54:14,001 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 104 [2018-11-18 22:54:14,002 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:54:14,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-18 22:54:14,047 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:54:14,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 22:54:14,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 22:54:14,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-18 22:54:14,048 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand 14 states. [2018-11-18 22:54:14,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:14,408 INFO L93 Difference]: Finished difference Result 198 states and 209 transitions. [2018-11-18 22:54:14,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 22:54:14,409 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 104 [2018-11-18 22:54:14,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:54:14,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:54:14,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 149 transitions. [2018-11-18 22:54:14,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:54:14,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 149 transitions. [2018-11-18 22:54:14,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 149 transitions. [2018-11-18 22:54:14,945 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:54:14,949 INFO L225 Difference]: With dead ends: 198 [2018-11-18 22:54:14,949 INFO L226 Difference]: Without dead ends: 117 [2018-11-18 22:54:14,950 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-18 22:54:14,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-18 22:54:15,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-11-18 22:54:15,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:54:15,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 117 states. [2018-11-18 22:54:15,087 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 117 states. [2018-11-18 22:54:15,087 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 117 states. [2018-11-18 22:54:15,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:15,089 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-11-18 22:54:15,089 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-11-18 22:54:15,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:15,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:15,090 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 117 states. [2018-11-18 22:54:15,090 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 117 states. [2018-11-18 22:54:15,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:15,092 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-11-18 22:54:15,092 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-11-18 22:54:15,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:15,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:15,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:54:15,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:54:15,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-18 22:54:15,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2018-11-18 22:54:15,095 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 104 [2018-11-18 22:54:15,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:54:15,095 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2018-11-18 22:54:15,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 22:54:15,096 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-11-18 22:54:15,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-18 22:54:15,097 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:54:15,097 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:54:15,097 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:54:15,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:54:15,098 INFO L82 PathProgramCache]: Analyzing trace with hash -842057859, now seen corresponding path program 11 times [2018-11-18 22:54:15,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:54:15,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:54:15,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:15,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:54:15,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:15,600 INFO L256 TraceCheckUtils]: 0: Hoare triple {7296#true} call ULTIMATE.init(); {7296#true} is VALID [2018-11-18 22:54:15,601 INFO L273 TraceCheckUtils]: 1: Hoare triple {7296#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7296#true} is VALID [2018-11-18 22:54:15,601 INFO L273 TraceCheckUtils]: 2: Hoare triple {7296#true} assume true; {7296#true} is VALID [2018-11-18 22:54:15,601 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7296#true} {7296#true} #92#return; {7296#true} is VALID [2018-11-18 22:54:15,601 INFO L256 TraceCheckUtils]: 4: Hoare triple {7296#true} call #t~ret2 := main(); {7296#true} is VALID [2018-11-18 22:54:15,602 INFO L273 TraceCheckUtils]: 5: Hoare triple {7296#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7298#(= main_~i~0 0)} is VALID [2018-11-18 22:54:15,602 INFO L273 TraceCheckUtils]: 6: Hoare triple {7298#(= main_~i~0 0)} assume true; {7298#(= main_~i~0 0)} is VALID [2018-11-18 22:54:15,603 INFO L273 TraceCheckUtils]: 7: Hoare triple {7298#(= 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; {7299#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:15,603 INFO L273 TraceCheckUtils]: 8: Hoare triple {7299#(<= main_~i~0 1)} assume true; {7299#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:15,604 INFO L273 TraceCheckUtils]: 9: Hoare triple {7299#(<= 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; {7300#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:15,604 INFO L273 TraceCheckUtils]: 10: Hoare triple {7300#(<= main_~i~0 2)} assume true; {7300#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:15,605 INFO L273 TraceCheckUtils]: 11: Hoare triple {7300#(<= 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; {7301#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:15,606 INFO L273 TraceCheckUtils]: 12: Hoare triple {7301#(<= main_~i~0 3)} assume true; {7301#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:15,606 INFO L273 TraceCheckUtils]: 13: Hoare triple {7301#(<= 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; {7302#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:15,607 INFO L273 TraceCheckUtils]: 14: Hoare triple {7302#(<= main_~i~0 4)} assume true; {7302#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:15,608 INFO L273 TraceCheckUtils]: 15: Hoare triple {7302#(<= 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; {7303#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:15,608 INFO L273 TraceCheckUtils]: 16: Hoare triple {7303#(<= main_~i~0 5)} assume true; {7303#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:15,609 INFO L273 TraceCheckUtils]: 17: Hoare triple {7303#(<= 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; {7304#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:15,610 INFO L273 TraceCheckUtils]: 18: Hoare triple {7304#(<= main_~i~0 6)} assume true; {7304#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:15,611 INFO L273 TraceCheckUtils]: 19: Hoare triple {7304#(<= 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; {7305#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:15,611 INFO L273 TraceCheckUtils]: 20: Hoare triple {7305#(<= main_~i~0 7)} assume true; {7305#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:15,612 INFO L273 TraceCheckUtils]: 21: Hoare triple {7305#(<= 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; {7306#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:15,613 INFO L273 TraceCheckUtils]: 22: Hoare triple {7306#(<= main_~i~0 8)} assume true; {7306#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:15,613 INFO L273 TraceCheckUtils]: 23: Hoare triple {7306#(<= 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; {7307#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:15,614 INFO L273 TraceCheckUtils]: 24: Hoare triple {7307#(<= main_~i~0 9)} assume true; {7307#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:15,615 INFO L273 TraceCheckUtils]: 25: Hoare triple {7307#(<= 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; {7308#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:15,615 INFO L273 TraceCheckUtils]: 26: Hoare triple {7308#(<= main_~i~0 10)} assume true; {7308#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:15,616 INFO L273 TraceCheckUtils]: 27: Hoare triple {7308#(<= 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; {7309#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:15,617 INFO L273 TraceCheckUtils]: 28: Hoare triple {7309#(<= main_~i~0 11)} assume true; {7309#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:15,617 INFO L273 TraceCheckUtils]: 29: Hoare triple {7309#(<= main_~i~0 11)} assume !(~i~0 < 100000); {7297#false} is VALID [2018-11-18 22:54:15,618 INFO L273 TraceCheckUtils]: 30: Hoare triple {7297#false} ~i~0 := 0; {7297#false} is VALID [2018-11-18 22:54:15,618 INFO L273 TraceCheckUtils]: 31: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,618 INFO L273 TraceCheckUtils]: 32: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:54:15,618 INFO L273 TraceCheckUtils]: 33: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,618 INFO L273 TraceCheckUtils]: 34: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:54:15,619 INFO L273 TraceCheckUtils]: 35: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,619 INFO L273 TraceCheckUtils]: 36: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:54:15,619 INFO L273 TraceCheckUtils]: 37: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,619 INFO L273 TraceCheckUtils]: 38: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:54:15,619 INFO L273 TraceCheckUtils]: 39: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,620 INFO L273 TraceCheckUtils]: 40: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:54:15,620 INFO L273 TraceCheckUtils]: 41: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,620 INFO L273 TraceCheckUtils]: 42: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:54:15,620 INFO L273 TraceCheckUtils]: 43: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,620 INFO L273 TraceCheckUtils]: 44: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:54:15,620 INFO L273 TraceCheckUtils]: 45: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,621 INFO L273 TraceCheckUtils]: 46: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:54:15,621 INFO L273 TraceCheckUtils]: 47: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,621 INFO L273 TraceCheckUtils]: 48: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:54:15,621 INFO L273 TraceCheckUtils]: 49: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,621 INFO L273 TraceCheckUtils]: 50: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:54:15,622 INFO L273 TraceCheckUtils]: 51: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,622 INFO L273 TraceCheckUtils]: 52: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:54:15,622 INFO L273 TraceCheckUtils]: 53: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,622 INFO L273 TraceCheckUtils]: 54: Hoare triple {7297#false} assume !(~i~0 < 100000); {7297#false} is VALID [2018-11-18 22:54:15,622 INFO L273 TraceCheckUtils]: 55: Hoare triple {7297#false} ~i~0 := 0; {7297#false} is VALID [2018-11-18 22:54:15,622 INFO L273 TraceCheckUtils]: 56: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,622 INFO L273 TraceCheckUtils]: 57: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:54:15,622 INFO L273 TraceCheckUtils]: 58: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,623 INFO L273 TraceCheckUtils]: 59: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:54:15,623 INFO L273 TraceCheckUtils]: 60: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,623 INFO L273 TraceCheckUtils]: 61: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:54:15,623 INFO L273 TraceCheckUtils]: 62: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,623 INFO L273 TraceCheckUtils]: 63: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:54:15,623 INFO L273 TraceCheckUtils]: 64: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,623 INFO L273 TraceCheckUtils]: 65: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:54:15,623 INFO L273 TraceCheckUtils]: 66: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,624 INFO L273 TraceCheckUtils]: 67: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:54:15,624 INFO L273 TraceCheckUtils]: 68: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,624 INFO L273 TraceCheckUtils]: 69: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:54:15,624 INFO L273 TraceCheckUtils]: 70: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,624 INFO L273 TraceCheckUtils]: 71: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:54:15,624 INFO L273 TraceCheckUtils]: 72: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,624 INFO L273 TraceCheckUtils]: 73: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:54:15,624 INFO L273 TraceCheckUtils]: 74: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,624 INFO L273 TraceCheckUtils]: 75: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:54:15,625 INFO L273 TraceCheckUtils]: 76: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,625 INFO L273 TraceCheckUtils]: 77: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:54:15,625 INFO L273 TraceCheckUtils]: 78: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,625 INFO L273 TraceCheckUtils]: 79: Hoare triple {7297#false} assume !(~i~0 < 100000); {7297#false} is VALID [2018-11-18 22:54:15,625 INFO L273 TraceCheckUtils]: 80: Hoare triple {7297#false} ~i~0 := 0; {7297#false} is VALID [2018-11-18 22:54:15,625 INFO L273 TraceCheckUtils]: 81: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,625 INFO L273 TraceCheckUtils]: 82: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:54:15,625 INFO L273 TraceCheckUtils]: 83: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,626 INFO L273 TraceCheckUtils]: 84: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:54:15,626 INFO L273 TraceCheckUtils]: 85: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,626 INFO L273 TraceCheckUtils]: 86: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:54:15,626 INFO L273 TraceCheckUtils]: 87: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,626 INFO L273 TraceCheckUtils]: 88: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:54:15,626 INFO L273 TraceCheckUtils]: 89: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,626 INFO L273 TraceCheckUtils]: 90: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:54:15,626 INFO L273 TraceCheckUtils]: 91: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,626 INFO L273 TraceCheckUtils]: 92: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:54:15,627 INFO L273 TraceCheckUtils]: 93: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,627 INFO L273 TraceCheckUtils]: 94: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:54:15,627 INFO L273 TraceCheckUtils]: 95: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,627 INFO L273 TraceCheckUtils]: 96: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:54:15,627 INFO L273 TraceCheckUtils]: 97: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,627 INFO L273 TraceCheckUtils]: 98: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:54:15,627 INFO L273 TraceCheckUtils]: 99: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,627 INFO L273 TraceCheckUtils]: 100: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:54:15,628 INFO L273 TraceCheckUtils]: 101: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,628 INFO L273 TraceCheckUtils]: 102: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:54:15,628 INFO L273 TraceCheckUtils]: 103: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,628 INFO L273 TraceCheckUtils]: 104: Hoare triple {7297#false} assume !(~i~0 < 100000); {7297#false} is VALID [2018-11-18 22:54:15,628 INFO L273 TraceCheckUtils]: 105: Hoare triple {7297#false} havoc ~x~0;~x~0 := 0; {7297#false} is VALID [2018-11-18 22:54:15,628 INFO L273 TraceCheckUtils]: 106: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:54:15,628 INFO L273 TraceCheckUtils]: 107: Hoare triple {7297#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7297#false} is VALID [2018-11-18 22:54:15,628 INFO L256 TraceCheckUtils]: 108: Hoare triple {7297#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {7297#false} is VALID [2018-11-18 22:54:15,628 INFO L273 TraceCheckUtils]: 109: Hoare triple {7297#false} ~cond := #in~cond; {7297#false} is VALID [2018-11-18 22:54:15,629 INFO L273 TraceCheckUtils]: 110: Hoare triple {7297#false} assume 0 == ~cond; {7297#false} is VALID [2018-11-18 22:54:15,629 INFO L273 TraceCheckUtils]: 111: Hoare triple {7297#false} assume !false; {7297#false} is VALID [2018-11-18 22:54:15,634 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2018-11-18 22:54:15,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:54:15,634 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-18 22:54:15,644 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:55:00,738 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-18 22:55:00,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:55:00,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:55:00,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:55:01,042 INFO L256 TraceCheckUtils]: 0: Hoare triple {7296#true} call ULTIMATE.init(); {7296#true} is VALID [2018-11-18 22:55:01,043 INFO L273 TraceCheckUtils]: 1: Hoare triple {7296#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7296#true} is VALID [2018-11-18 22:55:01,043 INFO L273 TraceCheckUtils]: 2: Hoare triple {7296#true} assume true; {7296#true} is VALID [2018-11-18 22:55:01,043 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7296#true} {7296#true} #92#return; {7296#true} is VALID [2018-11-18 22:55:01,044 INFO L256 TraceCheckUtils]: 4: Hoare triple {7296#true} call #t~ret2 := main(); {7296#true} is VALID [2018-11-18 22:55:01,044 INFO L273 TraceCheckUtils]: 5: Hoare triple {7296#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7296#true} is VALID [2018-11-18 22:55:01,044 INFO L273 TraceCheckUtils]: 6: Hoare triple {7296#true} assume true; {7296#true} is VALID [2018-11-18 22:55:01,045 INFO L273 TraceCheckUtils]: 7: Hoare triple {7296#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7296#true} is VALID [2018-11-18 22:55:01,045 INFO L273 TraceCheckUtils]: 8: Hoare triple {7296#true} assume true; {7296#true} is VALID [2018-11-18 22:55:01,045 INFO L273 TraceCheckUtils]: 9: Hoare triple {7296#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7296#true} is VALID [2018-11-18 22:55:01,045 INFO L273 TraceCheckUtils]: 10: Hoare triple {7296#true} assume true; {7296#true} is VALID [2018-11-18 22:55:01,045 INFO L273 TraceCheckUtils]: 11: Hoare triple {7296#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7296#true} is VALID [2018-11-18 22:55:01,045 INFO L273 TraceCheckUtils]: 12: Hoare triple {7296#true} assume true; {7296#true} is VALID [2018-11-18 22:55:01,045 INFO L273 TraceCheckUtils]: 13: Hoare triple {7296#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7296#true} is VALID [2018-11-18 22:55:01,045 INFO L273 TraceCheckUtils]: 14: Hoare triple {7296#true} assume true; {7296#true} is VALID [2018-11-18 22:55:01,046 INFO L273 TraceCheckUtils]: 15: Hoare triple {7296#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7296#true} is VALID [2018-11-18 22:55:01,046 INFO L273 TraceCheckUtils]: 16: Hoare triple {7296#true} assume true; {7296#true} is VALID [2018-11-18 22:55:01,046 INFO L273 TraceCheckUtils]: 17: Hoare triple {7296#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7296#true} is VALID [2018-11-18 22:55:01,046 INFO L273 TraceCheckUtils]: 18: Hoare triple {7296#true} assume true; {7296#true} is VALID [2018-11-18 22:55:01,046 INFO L273 TraceCheckUtils]: 19: Hoare triple {7296#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7296#true} is VALID [2018-11-18 22:55:01,046 INFO L273 TraceCheckUtils]: 20: Hoare triple {7296#true} assume true; {7296#true} is VALID [2018-11-18 22:55:01,046 INFO L273 TraceCheckUtils]: 21: Hoare triple {7296#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7296#true} is VALID [2018-11-18 22:55:01,046 INFO L273 TraceCheckUtils]: 22: Hoare triple {7296#true} assume true; {7296#true} is VALID [2018-11-18 22:55:01,047 INFO L273 TraceCheckUtils]: 23: Hoare triple {7296#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7296#true} is VALID [2018-11-18 22:55:01,047 INFO L273 TraceCheckUtils]: 24: Hoare triple {7296#true} assume true; {7296#true} is VALID [2018-11-18 22:55:01,047 INFO L273 TraceCheckUtils]: 25: Hoare triple {7296#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7296#true} is VALID [2018-11-18 22:55:01,047 INFO L273 TraceCheckUtils]: 26: Hoare triple {7296#true} assume true; {7296#true} is VALID [2018-11-18 22:55:01,047 INFO L273 TraceCheckUtils]: 27: Hoare triple {7296#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7296#true} is VALID [2018-11-18 22:55:01,047 INFO L273 TraceCheckUtils]: 28: Hoare triple {7296#true} assume true; {7296#true} is VALID [2018-11-18 22:55:01,047 INFO L273 TraceCheckUtils]: 29: Hoare triple {7296#true} assume !(~i~0 < 100000); {7296#true} is VALID [2018-11-18 22:55:01,048 INFO L273 TraceCheckUtils]: 30: Hoare triple {7296#true} ~i~0 := 0; {7403#(<= main_~i~0 0)} is VALID [2018-11-18 22:55:01,048 INFO L273 TraceCheckUtils]: 31: Hoare triple {7403#(<= main_~i~0 0)} assume true; {7403#(<= main_~i~0 0)} is VALID [2018-11-18 22:55:01,049 INFO L273 TraceCheckUtils]: 32: Hoare triple {7403#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7299#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:01,049 INFO L273 TraceCheckUtils]: 33: Hoare triple {7299#(<= main_~i~0 1)} assume true; {7299#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:01,050 INFO L273 TraceCheckUtils]: 34: Hoare triple {7299#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7300#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:01,050 INFO L273 TraceCheckUtils]: 35: Hoare triple {7300#(<= main_~i~0 2)} assume true; {7300#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:01,051 INFO L273 TraceCheckUtils]: 36: Hoare triple {7300#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7301#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:01,051 INFO L273 TraceCheckUtils]: 37: Hoare triple {7301#(<= main_~i~0 3)} assume true; {7301#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:01,052 INFO L273 TraceCheckUtils]: 38: Hoare triple {7301#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7302#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:01,053 INFO L273 TraceCheckUtils]: 39: Hoare triple {7302#(<= main_~i~0 4)} assume true; {7302#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:01,054 INFO L273 TraceCheckUtils]: 40: Hoare triple {7302#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7303#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:01,054 INFO L273 TraceCheckUtils]: 41: Hoare triple {7303#(<= main_~i~0 5)} assume true; {7303#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:01,055 INFO L273 TraceCheckUtils]: 42: Hoare triple {7303#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7304#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:01,056 INFO L273 TraceCheckUtils]: 43: Hoare triple {7304#(<= main_~i~0 6)} assume true; {7304#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:01,056 INFO L273 TraceCheckUtils]: 44: Hoare triple {7304#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7305#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:01,057 INFO L273 TraceCheckUtils]: 45: Hoare triple {7305#(<= main_~i~0 7)} assume true; {7305#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:01,058 INFO L273 TraceCheckUtils]: 46: Hoare triple {7305#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7306#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:01,058 INFO L273 TraceCheckUtils]: 47: Hoare triple {7306#(<= main_~i~0 8)} assume true; {7306#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:01,059 INFO L273 TraceCheckUtils]: 48: Hoare triple {7306#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7307#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:01,060 INFO L273 TraceCheckUtils]: 49: Hoare triple {7307#(<= main_~i~0 9)} assume true; {7307#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:01,061 INFO L273 TraceCheckUtils]: 50: Hoare triple {7307#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7308#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:01,061 INFO L273 TraceCheckUtils]: 51: Hoare triple {7308#(<= main_~i~0 10)} assume true; {7308#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:01,062 INFO L273 TraceCheckUtils]: 52: Hoare triple {7308#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7309#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:01,062 INFO L273 TraceCheckUtils]: 53: Hoare triple {7309#(<= main_~i~0 11)} assume true; {7309#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:01,063 INFO L273 TraceCheckUtils]: 54: Hoare triple {7309#(<= main_~i~0 11)} assume !(~i~0 < 100000); {7297#false} is VALID [2018-11-18 22:55:01,063 INFO L273 TraceCheckUtils]: 55: Hoare triple {7297#false} ~i~0 := 0; {7297#false} is VALID [2018-11-18 22:55:01,063 INFO L273 TraceCheckUtils]: 56: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:55:01,064 INFO L273 TraceCheckUtils]: 57: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:55:01,064 INFO L273 TraceCheckUtils]: 58: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:55:01,064 INFO L273 TraceCheckUtils]: 59: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:55:01,064 INFO L273 TraceCheckUtils]: 60: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:55:01,064 INFO L273 TraceCheckUtils]: 61: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:55:01,065 INFO L273 TraceCheckUtils]: 62: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:55:01,065 INFO L273 TraceCheckUtils]: 63: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:55:01,065 INFO L273 TraceCheckUtils]: 64: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:55:01,065 INFO L273 TraceCheckUtils]: 65: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:55:01,065 INFO L273 TraceCheckUtils]: 66: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:55:01,066 INFO L273 TraceCheckUtils]: 67: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:55:01,066 INFO L273 TraceCheckUtils]: 68: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:55:01,066 INFO L273 TraceCheckUtils]: 69: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:55:01,066 INFO L273 TraceCheckUtils]: 70: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:55:01,066 INFO L273 TraceCheckUtils]: 71: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:55:01,067 INFO L273 TraceCheckUtils]: 72: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:55:01,067 INFO L273 TraceCheckUtils]: 73: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:55:01,067 INFO L273 TraceCheckUtils]: 74: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:55:01,067 INFO L273 TraceCheckUtils]: 75: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:55:01,067 INFO L273 TraceCheckUtils]: 76: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:55:01,067 INFO L273 TraceCheckUtils]: 77: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:55:01,067 INFO L273 TraceCheckUtils]: 78: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:55:01,067 INFO L273 TraceCheckUtils]: 79: Hoare triple {7297#false} assume !(~i~0 < 100000); {7297#false} is VALID [2018-11-18 22:55:01,067 INFO L273 TraceCheckUtils]: 80: Hoare triple {7297#false} ~i~0 := 0; {7297#false} is VALID [2018-11-18 22:55:01,068 INFO L273 TraceCheckUtils]: 81: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:55:01,068 INFO L273 TraceCheckUtils]: 82: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:55:01,068 INFO L273 TraceCheckUtils]: 83: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:55:01,068 INFO L273 TraceCheckUtils]: 84: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:55:01,068 INFO L273 TraceCheckUtils]: 85: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:55:01,068 INFO L273 TraceCheckUtils]: 86: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:55:01,068 INFO L273 TraceCheckUtils]: 87: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:55:01,068 INFO L273 TraceCheckUtils]: 88: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:55:01,068 INFO L273 TraceCheckUtils]: 89: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:55:01,069 INFO L273 TraceCheckUtils]: 90: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:55:01,069 INFO L273 TraceCheckUtils]: 91: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:55:01,069 INFO L273 TraceCheckUtils]: 92: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:55:01,069 INFO L273 TraceCheckUtils]: 93: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:55:01,069 INFO L273 TraceCheckUtils]: 94: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:55:01,069 INFO L273 TraceCheckUtils]: 95: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:55:01,069 INFO L273 TraceCheckUtils]: 96: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:55:01,069 INFO L273 TraceCheckUtils]: 97: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:55:01,070 INFO L273 TraceCheckUtils]: 98: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:55:01,070 INFO L273 TraceCheckUtils]: 99: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:55:01,070 INFO L273 TraceCheckUtils]: 100: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:55:01,070 INFO L273 TraceCheckUtils]: 101: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:55:01,070 INFO L273 TraceCheckUtils]: 102: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7297#false} is VALID [2018-11-18 22:55:01,070 INFO L273 TraceCheckUtils]: 103: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:55:01,070 INFO L273 TraceCheckUtils]: 104: Hoare triple {7297#false} assume !(~i~0 < 100000); {7297#false} is VALID [2018-11-18 22:55:01,070 INFO L273 TraceCheckUtils]: 105: Hoare triple {7297#false} havoc ~x~0;~x~0 := 0; {7297#false} is VALID [2018-11-18 22:55:01,071 INFO L273 TraceCheckUtils]: 106: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-18 22:55:01,071 INFO L273 TraceCheckUtils]: 107: Hoare triple {7297#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7297#false} is VALID [2018-11-18 22:55:01,071 INFO L256 TraceCheckUtils]: 108: Hoare triple {7297#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {7297#false} is VALID [2018-11-18 22:55:01,071 INFO L273 TraceCheckUtils]: 109: Hoare triple {7297#false} ~cond := #in~cond; {7297#false} is VALID [2018-11-18 22:55:01,071 INFO L273 TraceCheckUtils]: 110: Hoare triple {7297#false} assume 0 == ~cond; {7297#false} is VALID [2018-11-18 22:55:01,071 INFO L273 TraceCheckUtils]: 111: Hoare triple {7297#false} assume !false; {7297#false} is VALID [2018-11-18 22:55:01,076 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2018-11-18 22:55:01,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:55:01,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-18 22:55:01,105 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 112 [2018-11-18 22:55:01,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:55:01,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-18 22:55:01,170 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:55:01,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 22:55:01,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 22:55:01,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-18 22:55:01,171 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 15 states. [2018-11-18 22:55:02,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:55:02,184 INFO L93 Difference]: Finished difference Result 212 states and 223 transitions. [2018-11-18 22:55:02,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 22:55:02,185 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 112 [2018-11-18 22:55:02,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:55:02,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:55:02,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 157 transitions. [2018-11-18 22:55:02,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:55:02,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 157 transitions. [2018-11-18 22:55:02,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 157 transitions. [2018-11-18 22:55:02,808 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:55:02,810 INFO L225 Difference]: With dead ends: 212 [2018-11-18 22:55:02,810 INFO L226 Difference]: Without dead ends: 125 [2018-11-18 22:55:02,811 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-18 22:55:02,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-18 22:55:02,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-11-18 22:55:02,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:55:02,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 125 states. [2018-11-18 22:55:02,893 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 125 states. [2018-11-18 22:55:02,893 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 125 states. [2018-11-18 22:55:02,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:55:02,896 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-11-18 22:55:02,896 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-18 22:55:02,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:55:02,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:55:02,897 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 125 states. [2018-11-18 22:55:02,897 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 125 states. [2018-11-18 22:55:02,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:55:02,899 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-11-18 22:55:02,900 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-18 22:55:02,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:55:02,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:55:02,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:55:02,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:55:02,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-18 22:55:02,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2018-11-18 22:55:02,903 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 112 [2018-11-18 22:55:02,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:55:02,903 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2018-11-18 22:55:02,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 22:55:02,903 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-18 22:55:02,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-18 22:55:02,905 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:55:02,905 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:55:02,905 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:55:02,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:55:02,905 INFO L82 PathProgramCache]: Analyzing trace with hash -524695299, now seen corresponding path program 12 times [2018-11-18 22:55:02,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:55:02,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:55:02,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:55:02,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:55:02,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:55:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:55:03,509 INFO L256 TraceCheckUtils]: 0: Hoare triple {8390#true} call ULTIMATE.init(); {8390#true} is VALID [2018-11-18 22:55:03,509 INFO L273 TraceCheckUtils]: 1: Hoare triple {8390#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8390#true} is VALID [2018-11-18 22:55:03,510 INFO L273 TraceCheckUtils]: 2: Hoare triple {8390#true} assume true; {8390#true} is VALID [2018-11-18 22:55:03,510 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8390#true} {8390#true} #92#return; {8390#true} is VALID [2018-11-18 22:55:03,510 INFO L256 TraceCheckUtils]: 4: Hoare triple {8390#true} call #t~ret2 := main(); {8390#true} is VALID [2018-11-18 22:55:03,511 INFO L273 TraceCheckUtils]: 5: Hoare triple {8390#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8392#(= main_~i~0 0)} is VALID [2018-11-18 22:55:03,511 INFO L273 TraceCheckUtils]: 6: Hoare triple {8392#(= main_~i~0 0)} assume true; {8392#(= main_~i~0 0)} is VALID [2018-11-18 22:55:03,512 INFO L273 TraceCheckUtils]: 7: Hoare triple {8392#(= 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; {8393#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:03,512 INFO L273 TraceCheckUtils]: 8: Hoare triple {8393#(<= main_~i~0 1)} assume true; {8393#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:03,513 INFO L273 TraceCheckUtils]: 9: Hoare triple {8393#(<= 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; {8394#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:03,514 INFO L273 TraceCheckUtils]: 10: Hoare triple {8394#(<= main_~i~0 2)} assume true; {8394#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:03,515 INFO L273 TraceCheckUtils]: 11: Hoare triple {8394#(<= 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; {8395#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:03,515 INFO L273 TraceCheckUtils]: 12: Hoare triple {8395#(<= main_~i~0 3)} assume true; {8395#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:03,516 INFO L273 TraceCheckUtils]: 13: Hoare triple {8395#(<= 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; {8396#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:03,517 INFO L273 TraceCheckUtils]: 14: Hoare triple {8396#(<= main_~i~0 4)} assume true; {8396#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:03,517 INFO L273 TraceCheckUtils]: 15: Hoare triple {8396#(<= 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; {8397#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:03,518 INFO L273 TraceCheckUtils]: 16: Hoare triple {8397#(<= main_~i~0 5)} assume true; {8397#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:03,519 INFO L273 TraceCheckUtils]: 17: Hoare triple {8397#(<= 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; {8398#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:03,519 INFO L273 TraceCheckUtils]: 18: Hoare triple {8398#(<= main_~i~0 6)} assume true; {8398#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:03,520 INFO L273 TraceCheckUtils]: 19: Hoare triple {8398#(<= 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; {8399#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:03,521 INFO L273 TraceCheckUtils]: 20: Hoare triple {8399#(<= main_~i~0 7)} assume true; {8399#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:03,522 INFO L273 TraceCheckUtils]: 21: Hoare triple {8399#(<= 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; {8400#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:03,522 INFO L273 TraceCheckUtils]: 22: Hoare triple {8400#(<= main_~i~0 8)} assume true; {8400#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:03,523 INFO L273 TraceCheckUtils]: 23: Hoare triple {8400#(<= 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; {8401#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:03,523 INFO L273 TraceCheckUtils]: 24: Hoare triple {8401#(<= main_~i~0 9)} assume true; {8401#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:03,524 INFO L273 TraceCheckUtils]: 25: Hoare triple {8401#(<= 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; {8402#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:03,525 INFO L273 TraceCheckUtils]: 26: Hoare triple {8402#(<= main_~i~0 10)} assume true; {8402#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:03,526 INFO L273 TraceCheckUtils]: 27: Hoare triple {8402#(<= 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; {8403#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:03,526 INFO L273 TraceCheckUtils]: 28: Hoare triple {8403#(<= main_~i~0 11)} assume true; {8403#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:03,527 INFO L273 TraceCheckUtils]: 29: Hoare triple {8403#(<= 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; {8404#(<= main_~i~0 12)} is VALID [2018-11-18 22:55:03,528 INFO L273 TraceCheckUtils]: 30: Hoare triple {8404#(<= main_~i~0 12)} assume true; {8404#(<= main_~i~0 12)} is VALID [2018-11-18 22:55:03,528 INFO L273 TraceCheckUtils]: 31: Hoare triple {8404#(<= main_~i~0 12)} assume !(~i~0 < 100000); {8391#false} is VALID [2018-11-18 22:55:03,528 INFO L273 TraceCheckUtils]: 32: Hoare triple {8391#false} ~i~0 := 0; {8391#false} is VALID [2018-11-18 22:55:03,529 INFO L273 TraceCheckUtils]: 33: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,529 INFO L273 TraceCheckUtils]: 34: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:03,529 INFO L273 TraceCheckUtils]: 35: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,529 INFO L273 TraceCheckUtils]: 36: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:03,529 INFO L273 TraceCheckUtils]: 37: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,530 INFO L273 TraceCheckUtils]: 38: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:03,530 INFO L273 TraceCheckUtils]: 39: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,530 INFO L273 TraceCheckUtils]: 40: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:03,530 INFO L273 TraceCheckUtils]: 41: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,530 INFO L273 TraceCheckUtils]: 42: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:03,530 INFO L273 TraceCheckUtils]: 43: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,530 INFO L273 TraceCheckUtils]: 44: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:03,531 INFO L273 TraceCheckUtils]: 45: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,531 INFO L273 TraceCheckUtils]: 46: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:03,531 INFO L273 TraceCheckUtils]: 47: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,531 INFO L273 TraceCheckUtils]: 48: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:03,531 INFO L273 TraceCheckUtils]: 49: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,531 INFO L273 TraceCheckUtils]: 50: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:03,531 INFO L273 TraceCheckUtils]: 51: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,531 INFO L273 TraceCheckUtils]: 52: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:03,532 INFO L273 TraceCheckUtils]: 53: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,532 INFO L273 TraceCheckUtils]: 54: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:03,532 INFO L273 TraceCheckUtils]: 55: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,532 INFO L273 TraceCheckUtils]: 56: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:03,532 INFO L273 TraceCheckUtils]: 57: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,532 INFO L273 TraceCheckUtils]: 58: Hoare triple {8391#false} assume !(~i~0 < 100000); {8391#false} is VALID [2018-11-18 22:55:03,532 INFO L273 TraceCheckUtils]: 59: Hoare triple {8391#false} ~i~0 := 0; {8391#false} is VALID [2018-11-18 22:55:03,532 INFO L273 TraceCheckUtils]: 60: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,532 INFO L273 TraceCheckUtils]: 61: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:03,533 INFO L273 TraceCheckUtils]: 62: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,533 INFO L273 TraceCheckUtils]: 63: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:03,533 INFO L273 TraceCheckUtils]: 64: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,533 INFO L273 TraceCheckUtils]: 65: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:03,533 INFO L273 TraceCheckUtils]: 66: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,533 INFO L273 TraceCheckUtils]: 67: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:03,533 INFO L273 TraceCheckUtils]: 68: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,533 INFO L273 TraceCheckUtils]: 69: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:03,533 INFO L273 TraceCheckUtils]: 70: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,534 INFO L273 TraceCheckUtils]: 71: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:03,534 INFO L273 TraceCheckUtils]: 72: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,534 INFO L273 TraceCheckUtils]: 73: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:03,534 INFO L273 TraceCheckUtils]: 74: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,534 INFO L273 TraceCheckUtils]: 75: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:03,534 INFO L273 TraceCheckUtils]: 76: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,534 INFO L273 TraceCheckUtils]: 77: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:03,534 INFO L273 TraceCheckUtils]: 78: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,535 INFO L273 TraceCheckUtils]: 79: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:03,535 INFO L273 TraceCheckUtils]: 80: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,535 INFO L273 TraceCheckUtils]: 81: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:03,535 INFO L273 TraceCheckUtils]: 82: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,535 INFO L273 TraceCheckUtils]: 83: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:03,535 INFO L273 TraceCheckUtils]: 84: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,536 INFO L273 TraceCheckUtils]: 85: Hoare triple {8391#false} assume !(~i~0 < 100000); {8391#false} is VALID [2018-11-18 22:55:03,536 INFO L273 TraceCheckUtils]: 86: Hoare triple {8391#false} ~i~0 := 0; {8391#false} is VALID [2018-11-18 22:55:03,536 INFO L273 TraceCheckUtils]: 87: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,536 INFO L273 TraceCheckUtils]: 88: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:03,536 INFO L273 TraceCheckUtils]: 89: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,536 INFO L273 TraceCheckUtils]: 90: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:03,537 INFO L273 TraceCheckUtils]: 91: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,537 INFO L273 TraceCheckUtils]: 92: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:03,537 INFO L273 TraceCheckUtils]: 93: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,537 INFO L273 TraceCheckUtils]: 94: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:03,537 INFO L273 TraceCheckUtils]: 95: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,537 INFO L273 TraceCheckUtils]: 96: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:03,538 INFO L273 TraceCheckUtils]: 97: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,538 INFO L273 TraceCheckUtils]: 98: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:03,538 INFO L273 TraceCheckUtils]: 99: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,538 INFO L273 TraceCheckUtils]: 100: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:03,538 INFO L273 TraceCheckUtils]: 101: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,538 INFO L273 TraceCheckUtils]: 102: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:03,539 INFO L273 TraceCheckUtils]: 103: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,539 INFO L273 TraceCheckUtils]: 104: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:03,539 INFO L273 TraceCheckUtils]: 105: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,539 INFO L273 TraceCheckUtils]: 106: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:03,539 INFO L273 TraceCheckUtils]: 107: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,539 INFO L273 TraceCheckUtils]: 108: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:03,539 INFO L273 TraceCheckUtils]: 109: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,540 INFO L273 TraceCheckUtils]: 110: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:03,540 INFO L273 TraceCheckUtils]: 111: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,540 INFO L273 TraceCheckUtils]: 112: Hoare triple {8391#false} assume !(~i~0 < 100000); {8391#false} is VALID [2018-11-18 22:55:03,540 INFO L273 TraceCheckUtils]: 113: Hoare triple {8391#false} havoc ~x~0;~x~0 := 0; {8391#false} is VALID [2018-11-18 22:55:03,540 INFO L273 TraceCheckUtils]: 114: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:03,540 INFO L273 TraceCheckUtils]: 115: Hoare triple {8391#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8391#false} is VALID [2018-11-18 22:55:03,541 INFO L256 TraceCheckUtils]: 116: Hoare triple {8391#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {8391#false} is VALID [2018-11-18 22:55:03,541 INFO L273 TraceCheckUtils]: 117: Hoare triple {8391#false} ~cond := #in~cond; {8391#false} is VALID [2018-11-18 22:55:03,541 INFO L273 TraceCheckUtils]: 118: Hoare triple {8391#false} assume 0 == ~cond; {8391#false} is VALID [2018-11-18 22:55:03,541 INFO L273 TraceCheckUtils]: 119: Hoare triple {8391#false} assume !false; {8391#false} is VALID [2018-11-18 22:55:03,550 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2018-11-18 22:55:03,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:55:03,550 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-18 22:55:03,559 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:55:35,063 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-18 22:55:35,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:55:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:55:35,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:55:35,320 INFO L256 TraceCheckUtils]: 0: Hoare triple {8390#true} call ULTIMATE.init(); {8390#true} is VALID [2018-11-18 22:55:35,320 INFO L273 TraceCheckUtils]: 1: Hoare triple {8390#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8390#true} is VALID [2018-11-18 22:55:35,320 INFO L273 TraceCheckUtils]: 2: Hoare triple {8390#true} assume true; {8390#true} is VALID [2018-11-18 22:55:35,321 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8390#true} {8390#true} #92#return; {8390#true} is VALID [2018-11-18 22:55:35,321 INFO L256 TraceCheckUtils]: 4: Hoare triple {8390#true} call #t~ret2 := main(); {8390#true} is VALID [2018-11-18 22:55:35,321 INFO L273 TraceCheckUtils]: 5: Hoare triple {8390#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8390#true} is VALID [2018-11-18 22:55:35,321 INFO L273 TraceCheckUtils]: 6: Hoare triple {8390#true} assume true; {8390#true} is VALID [2018-11-18 22:55:35,321 INFO L273 TraceCheckUtils]: 7: Hoare triple {8390#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8390#true} is VALID [2018-11-18 22:55:35,322 INFO L273 TraceCheckUtils]: 8: Hoare triple {8390#true} assume true; {8390#true} is VALID [2018-11-18 22:55:35,322 INFO L273 TraceCheckUtils]: 9: Hoare triple {8390#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8390#true} is VALID [2018-11-18 22:55:35,322 INFO L273 TraceCheckUtils]: 10: Hoare triple {8390#true} assume true; {8390#true} is VALID [2018-11-18 22:55:35,322 INFO L273 TraceCheckUtils]: 11: Hoare triple {8390#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8390#true} is VALID [2018-11-18 22:55:35,322 INFO L273 TraceCheckUtils]: 12: Hoare triple {8390#true} assume true; {8390#true} is VALID [2018-11-18 22:55:35,322 INFO L273 TraceCheckUtils]: 13: Hoare triple {8390#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8390#true} is VALID [2018-11-18 22:55:35,322 INFO L273 TraceCheckUtils]: 14: Hoare triple {8390#true} assume true; {8390#true} is VALID [2018-11-18 22:55:35,323 INFO L273 TraceCheckUtils]: 15: Hoare triple {8390#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8390#true} is VALID [2018-11-18 22:55:35,323 INFO L273 TraceCheckUtils]: 16: Hoare triple {8390#true} assume true; {8390#true} is VALID [2018-11-18 22:55:35,323 INFO L273 TraceCheckUtils]: 17: Hoare triple {8390#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8390#true} is VALID [2018-11-18 22:55:35,323 INFO L273 TraceCheckUtils]: 18: Hoare triple {8390#true} assume true; {8390#true} is VALID [2018-11-18 22:55:35,323 INFO L273 TraceCheckUtils]: 19: Hoare triple {8390#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8390#true} is VALID [2018-11-18 22:55:35,323 INFO L273 TraceCheckUtils]: 20: Hoare triple {8390#true} assume true; {8390#true} is VALID [2018-11-18 22:55:35,324 INFO L273 TraceCheckUtils]: 21: Hoare triple {8390#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8390#true} is VALID [2018-11-18 22:55:35,324 INFO L273 TraceCheckUtils]: 22: Hoare triple {8390#true} assume true; {8390#true} is VALID [2018-11-18 22:55:35,324 INFO L273 TraceCheckUtils]: 23: Hoare triple {8390#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8390#true} is VALID [2018-11-18 22:55:35,324 INFO L273 TraceCheckUtils]: 24: Hoare triple {8390#true} assume true; {8390#true} is VALID [2018-11-18 22:55:35,324 INFO L273 TraceCheckUtils]: 25: Hoare triple {8390#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8390#true} is VALID [2018-11-18 22:55:35,324 INFO L273 TraceCheckUtils]: 26: Hoare triple {8390#true} assume true; {8390#true} is VALID [2018-11-18 22:55:35,324 INFO L273 TraceCheckUtils]: 27: Hoare triple {8390#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8390#true} is VALID [2018-11-18 22:55:35,325 INFO L273 TraceCheckUtils]: 28: Hoare triple {8390#true} assume true; {8390#true} is VALID [2018-11-18 22:55:35,325 INFO L273 TraceCheckUtils]: 29: Hoare triple {8390#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8390#true} is VALID [2018-11-18 22:55:35,325 INFO L273 TraceCheckUtils]: 30: Hoare triple {8390#true} assume true; {8390#true} is VALID [2018-11-18 22:55:35,325 INFO L273 TraceCheckUtils]: 31: Hoare triple {8390#true} assume !(~i~0 < 100000); {8390#true} is VALID [2018-11-18 22:55:35,325 INFO L273 TraceCheckUtils]: 32: Hoare triple {8390#true} ~i~0 := 0; {8390#true} is VALID [2018-11-18 22:55:35,325 INFO L273 TraceCheckUtils]: 33: Hoare triple {8390#true} assume true; {8390#true} is VALID [2018-11-18 22:55:35,325 INFO L273 TraceCheckUtils]: 34: Hoare triple {8390#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8390#true} is VALID [2018-11-18 22:55:35,326 INFO L273 TraceCheckUtils]: 35: Hoare triple {8390#true} assume true; {8390#true} is VALID [2018-11-18 22:55:35,326 INFO L273 TraceCheckUtils]: 36: Hoare triple {8390#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8390#true} is VALID [2018-11-18 22:55:35,326 INFO L273 TraceCheckUtils]: 37: Hoare triple {8390#true} assume true; {8390#true} is VALID [2018-11-18 22:55:35,326 INFO L273 TraceCheckUtils]: 38: Hoare triple {8390#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8390#true} is VALID [2018-11-18 22:55:35,326 INFO L273 TraceCheckUtils]: 39: Hoare triple {8390#true} assume true; {8390#true} is VALID [2018-11-18 22:55:35,326 INFO L273 TraceCheckUtils]: 40: Hoare triple {8390#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8390#true} is VALID [2018-11-18 22:55:35,326 INFO L273 TraceCheckUtils]: 41: Hoare triple {8390#true} assume true; {8390#true} is VALID [2018-11-18 22:55:35,327 INFO L273 TraceCheckUtils]: 42: Hoare triple {8390#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8390#true} is VALID [2018-11-18 22:55:35,327 INFO L273 TraceCheckUtils]: 43: Hoare triple {8390#true} assume true; {8390#true} is VALID [2018-11-18 22:55:35,327 INFO L273 TraceCheckUtils]: 44: Hoare triple {8390#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8390#true} is VALID [2018-11-18 22:55:35,327 INFO L273 TraceCheckUtils]: 45: Hoare triple {8390#true} assume true; {8390#true} is VALID [2018-11-18 22:55:35,327 INFO L273 TraceCheckUtils]: 46: Hoare triple {8390#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8390#true} is VALID [2018-11-18 22:55:35,327 INFO L273 TraceCheckUtils]: 47: Hoare triple {8390#true} assume true; {8390#true} is VALID [2018-11-18 22:55:35,328 INFO L273 TraceCheckUtils]: 48: Hoare triple {8390#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8390#true} is VALID [2018-11-18 22:55:35,328 INFO L273 TraceCheckUtils]: 49: Hoare triple {8390#true} assume true; {8390#true} is VALID [2018-11-18 22:55:35,328 INFO L273 TraceCheckUtils]: 50: Hoare triple {8390#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8390#true} is VALID [2018-11-18 22:55:35,328 INFO L273 TraceCheckUtils]: 51: Hoare triple {8390#true} assume true; {8390#true} is VALID [2018-11-18 22:55:35,328 INFO L273 TraceCheckUtils]: 52: Hoare triple {8390#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8390#true} is VALID [2018-11-18 22:55:35,328 INFO L273 TraceCheckUtils]: 53: Hoare triple {8390#true} assume true; {8390#true} is VALID [2018-11-18 22:55:35,328 INFO L273 TraceCheckUtils]: 54: Hoare triple {8390#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8390#true} is VALID [2018-11-18 22:55:35,329 INFO L273 TraceCheckUtils]: 55: Hoare triple {8390#true} assume true; {8390#true} is VALID [2018-11-18 22:55:35,329 INFO L273 TraceCheckUtils]: 56: Hoare triple {8390#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8390#true} is VALID [2018-11-18 22:55:35,329 INFO L273 TraceCheckUtils]: 57: Hoare triple {8390#true} assume true; {8390#true} is VALID [2018-11-18 22:55:35,329 INFO L273 TraceCheckUtils]: 58: Hoare triple {8390#true} assume !(~i~0 < 100000); {8390#true} is VALID [2018-11-18 22:55:35,329 INFO L273 TraceCheckUtils]: 59: Hoare triple {8390#true} ~i~0 := 0; {8585#(<= main_~i~0 0)} is VALID [2018-11-18 22:55:35,330 INFO L273 TraceCheckUtils]: 60: Hoare triple {8585#(<= main_~i~0 0)} assume true; {8585#(<= main_~i~0 0)} is VALID [2018-11-18 22:55:35,331 INFO L273 TraceCheckUtils]: 61: Hoare triple {8585#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8393#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:35,331 INFO L273 TraceCheckUtils]: 62: Hoare triple {8393#(<= main_~i~0 1)} assume true; {8393#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:35,332 INFO L273 TraceCheckUtils]: 63: Hoare triple {8393#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8394#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:35,332 INFO L273 TraceCheckUtils]: 64: Hoare triple {8394#(<= main_~i~0 2)} assume true; {8394#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:35,333 INFO L273 TraceCheckUtils]: 65: Hoare triple {8394#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8395#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:35,333 INFO L273 TraceCheckUtils]: 66: Hoare triple {8395#(<= main_~i~0 3)} assume true; {8395#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:35,334 INFO L273 TraceCheckUtils]: 67: Hoare triple {8395#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8396#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:35,335 INFO L273 TraceCheckUtils]: 68: Hoare triple {8396#(<= main_~i~0 4)} assume true; {8396#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:35,336 INFO L273 TraceCheckUtils]: 69: Hoare triple {8396#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8397#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:35,337 INFO L273 TraceCheckUtils]: 70: Hoare triple {8397#(<= main_~i~0 5)} assume true; {8397#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:35,338 INFO L273 TraceCheckUtils]: 71: Hoare triple {8397#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8398#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:35,338 INFO L273 TraceCheckUtils]: 72: Hoare triple {8398#(<= main_~i~0 6)} assume true; {8398#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:35,339 INFO L273 TraceCheckUtils]: 73: Hoare triple {8398#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8399#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:35,340 INFO L273 TraceCheckUtils]: 74: Hoare triple {8399#(<= main_~i~0 7)} assume true; {8399#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:35,341 INFO L273 TraceCheckUtils]: 75: Hoare triple {8399#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8400#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:35,341 INFO L273 TraceCheckUtils]: 76: Hoare triple {8400#(<= main_~i~0 8)} assume true; {8400#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:35,342 INFO L273 TraceCheckUtils]: 77: Hoare triple {8400#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8401#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:35,343 INFO L273 TraceCheckUtils]: 78: Hoare triple {8401#(<= main_~i~0 9)} assume true; {8401#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:35,344 INFO L273 TraceCheckUtils]: 79: Hoare triple {8401#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8402#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:35,344 INFO L273 TraceCheckUtils]: 80: Hoare triple {8402#(<= main_~i~0 10)} assume true; {8402#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:35,345 INFO L273 TraceCheckUtils]: 81: Hoare triple {8402#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8403#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:35,346 INFO L273 TraceCheckUtils]: 82: Hoare triple {8403#(<= main_~i~0 11)} assume true; {8403#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:35,347 INFO L273 TraceCheckUtils]: 83: Hoare triple {8403#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8404#(<= main_~i~0 12)} is VALID [2018-11-18 22:55:35,348 INFO L273 TraceCheckUtils]: 84: Hoare triple {8404#(<= main_~i~0 12)} assume true; {8404#(<= main_~i~0 12)} is VALID [2018-11-18 22:55:35,348 INFO L273 TraceCheckUtils]: 85: Hoare triple {8404#(<= main_~i~0 12)} assume !(~i~0 < 100000); {8391#false} is VALID [2018-11-18 22:55:35,349 INFO L273 TraceCheckUtils]: 86: Hoare triple {8391#false} ~i~0 := 0; {8391#false} is VALID [2018-11-18 22:55:35,349 INFO L273 TraceCheckUtils]: 87: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:35,349 INFO L273 TraceCheckUtils]: 88: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:35,349 INFO L273 TraceCheckUtils]: 89: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:35,350 INFO L273 TraceCheckUtils]: 90: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:35,350 INFO L273 TraceCheckUtils]: 91: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:35,350 INFO L273 TraceCheckUtils]: 92: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:35,350 INFO L273 TraceCheckUtils]: 93: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:35,351 INFO L273 TraceCheckUtils]: 94: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:35,351 INFO L273 TraceCheckUtils]: 95: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:35,351 INFO L273 TraceCheckUtils]: 96: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:35,351 INFO L273 TraceCheckUtils]: 97: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:35,351 INFO L273 TraceCheckUtils]: 98: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:35,352 INFO L273 TraceCheckUtils]: 99: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:35,352 INFO L273 TraceCheckUtils]: 100: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:35,352 INFO L273 TraceCheckUtils]: 101: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:35,352 INFO L273 TraceCheckUtils]: 102: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:35,352 INFO L273 TraceCheckUtils]: 103: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:35,352 INFO L273 TraceCheckUtils]: 104: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:35,352 INFO L273 TraceCheckUtils]: 105: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:35,353 INFO L273 TraceCheckUtils]: 106: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:35,353 INFO L273 TraceCheckUtils]: 107: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:35,353 INFO L273 TraceCheckUtils]: 108: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:35,353 INFO L273 TraceCheckUtils]: 109: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:35,353 INFO L273 TraceCheckUtils]: 110: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#false} is VALID [2018-11-18 22:55:35,353 INFO L273 TraceCheckUtils]: 111: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:35,353 INFO L273 TraceCheckUtils]: 112: Hoare triple {8391#false} assume !(~i~0 < 100000); {8391#false} is VALID [2018-11-18 22:55:35,354 INFO L273 TraceCheckUtils]: 113: Hoare triple {8391#false} havoc ~x~0;~x~0 := 0; {8391#false} is VALID [2018-11-18 22:55:35,354 INFO L273 TraceCheckUtils]: 114: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-18 22:55:35,354 INFO L273 TraceCheckUtils]: 115: Hoare triple {8391#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8391#false} is VALID [2018-11-18 22:55:35,354 INFO L256 TraceCheckUtils]: 116: Hoare triple {8391#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {8391#false} is VALID [2018-11-18 22:55:35,354 INFO L273 TraceCheckUtils]: 117: Hoare triple {8391#false} ~cond := #in~cond; {8391#false} is VALID [2018-11-18 22:55:35,354 INFO L273 TraceCheckUtils]: 118: Hoare triple {8391#false} assume 0 == ~cond; {8391#false} is VALID [2018-11-18 22:55:35,354 INFO L273 TraceCheckUtils]: 119: Hoare triple {8391#false} assume !false; {8391#false} is VALID [2018-11-18 22:55:35,367 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2018-11-18 22:55:35,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:55:35,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-18 22:55:35,395 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 120 [2018-11-18 22:55:35,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:55:35,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-18 22:55:35,482 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:55:35,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 22:55:35,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 22:55:35,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-18 22:55:35,484 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 16 states. [2018-11-18 22:55:36,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:55:36,056 INFO L93 Difference]: Finished difference Result 226 states and 237 transitions. [2018-11-18 22:55:36,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 22:55:36,056 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 120 [2018-11-18 22:55:36,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:55:36,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 22:55:36,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 165 transitions. [2018-11-18 22:55:36,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 22:55:36,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 165 transitions. [2018-11-18 22:55:36,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 165 transitions. [2018-11-18 22:55:36,673 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:55:36,676 INFO L225 Difference]: With dead ends: 226 [2018-11-18 22:55:36,676 INFO L226 Difference]: Without dead ends: 133 [2018-11-18 22:55:36,677 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-18 22:55:36,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-18 22:55:36,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-11-18 22:55:36,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:55:36,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 133 states. [2018-11-18 22:55:36,725 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 133 states. [2018-11-18 22:55:36,725 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 133 states. [2018-11-18 22:55:36,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:55:36,729 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2018-11-18 22:55:36,729 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2018-11-18 22:55:36,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:55:36,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:55:36,730 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 133 states. [2018-11-18 22:55:36,730 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 133 states. [2018-11-18 22:55:36,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:55:36,732 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2018-11-18 22:55:36,732 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2018-11-18 22:55:36,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:55:36,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:55:36,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:55:36,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:55:36,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-18 22:55:36,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 137 transitions. [2018-11-18 22:55:36,736 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 137 transitions. Word has length 120 [2018-11-18 22:55:36,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:55:36,736 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 137 transitions. [2018-11-18 22:55:36,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 22:55:36,736 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2018-11-18 22:55:36,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-18 22:55:36,738 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:55:36,738 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:55:36,738 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:55:36,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:55:36,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1020703869, now seen corresponding path program 13 times [2018-11-18 22:55:36,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:55:36,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:55:36,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:55:36,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:55:36,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:55:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:55:37,750 INFO L256 TraceCheckUtils]: 0: Hoare triple {9558#true} call ULTIMATE.init(); {9558#true} is VALID [2018-11-18 22:55:37,751 INFO L273 TraceCheckUtils]: 1: Hoare triple {9558#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9558#true} is VALID [2018-11-18 22:55:37,751 INFO L273 TraceCheckUtils]: 2: Hoare triple {9558#true} assume true; {9558#true} is VALID [2018-11-18 22:55:37,751 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9558#true} {9558#true} #92#return; {9558#true} is VALID [2018-11-18 22:55:37,751 INFO L256 TraceCheckUtils]: 4: Hoare triple {9558#true} call #t~ret2 := main(); {9558#true} is VALID [2018-11-18 22:55:37,752 INFO L273 TraceCheckUtils]: 5: Hoare triple {9558#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9560#(= main_~i~0 0)} is VALID [2018-11-18 22:55:37,752 INFO L273 TraceCheckUtils]: 6: Hoare triple {9560#(= main_~i~0 0)} assume true; {9560#(= main_~i~0 0)} is VALID [2018-11-18 22:55:37,753 INFO L273 TraceCheckUtils]: 7: Hoare triple {9560#(= 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; {9561#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:37,754 INFO L273 TraceCheckUtils]: 8: Hoare triple {9561#(<= main_~i~0 1)} assume true; {9561#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:37,754 INFO L273 TraceCheckUtils]: 9: Hoare triple {9561#(<= 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; {9562#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:37,754 INFO L273 TraceCheckUtils]: 10: Hoare triple {9562#(<= main_~i~0 2)} assume true; {9562#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:37,755 INFO L273 TraceCheckUtils]: 11: Hoare triple {9562#(<= 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; {9563#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:37,755 INFO L273 TraceCheckUtils]: 12: Hoare triple {9563#(<= main_~i~0 3)} assume true; {9563#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:37,756 INFO L273 TraceCheckUtils]: 13: Hoare triple {9563#(<= 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; {9564#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:37,757 INFO L273 TraceCheckUtils]: 14: Hoare triple {9564#(<= main_~i~0 4)} assume true; {9564#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:37,758 INFO L273 TraceCheckUtils]: 15: Hoare triple {9564#(<= 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; {9565#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:37,758 INFO L273 TraceCheckUtils]: 16: Hoare triple {9565#(<= main_~i~0 5)} assume true; {9565#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:37,759 INFO L273 TraceCheckUtils]: 17: Hoare triple {9565#(<= 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; {9566#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:37,760 INFO L273 TraceCheckUtils]: 18: Hoare triple {9566#(<= main_~i~0 6)} assume true; {9566#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:37,760 INFO L273 TraceCheckUtils]: 19: Hoare triple {9566#(<= 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; {9567#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:37,761 INFO L273 TraceCheckUtils]: 20: Hoare triple {9567#(<= main_~i~0 7)} assume true; {9567#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:37,762 INFO L273 TraceCheckUtils]: 21: Hoare triple {9567#(<= 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; {9568#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:37,762 INFO L273 TraceCheckUtils]: 22: Hoare triple {9568#(<= main_~i~0 8)} assume true; {9568#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:37,763 INFO L273 TraceCheckUtils]: 23: Hoare triple {9568#(<= 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; {9569#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:37,764 INFO L273 TraceCheckUtils]: 24: Hoare triple {9569#(<= main_~i~0 9)} assume true; {9569#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:37,764 INFO L273 TraceCheckUtils]: 25: Hoare triple {9569#(<= 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; {9570#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:37,765 INFO L273 TraceCheckUtils]: 26: Hoare triple {9570#(<= main_~i~0 10)} assume true; {9570#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:37,766 INFO L273 TraceCheckUtils]: 27: Hoare triple {9570#(<= 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; {9571#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:37,766 INFO L273 TraceCheckUtils]: 28: Hoare triple {9571#(<= main_~i~0 11)} assume true; {9571#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:37,767 INFO L273 TraceCheckUtils]: 29: Hoare triple {9571#(<= 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; {9572#(<= main_~i~0 12)} is VALID [2018-11-18 22:55:37,768 INFO L273 TraceCheckUtils]: 30: Hoare triple {9572#(<= main_~i~0 12)} assume true; {9572#(<= main_~i~0 12)} is VALID [2018-11-18 22:55:37,769 INFO L273 TraceCheckUtils]: 31: Hoare triple {9572#(<= 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; {9573#(<= main_~i~0 13)} is VALID [2018-11-18 22:55:37,769 INFO L273 TraceCheckUtils]: 32: Hoare triple {9573#(<= main_~i~0 13)} assume true; {9573#(<= main_~i~0 13)} is VALID [2018-11-18 22:55:37,770 INFO L273 TraceCheckUtils]: 33: Hoare triple {9573#(<= main_~i~0 13)} assume !(~i~0 < 100000); {9559#false} is VALID [2018-11-18 22:55:37,770 INFO L273 TraceCheckUtils]: 34: Hoare triple {9559#false} ~i~0 := 0; {9559#false} is VALID [2018-11-18 22:55:37,770 INFO L273 TraceCheckUtils]: 35: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,770 INFO L273 TraceCheckUtils]: 36: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,770 INFO L273 TraceCheckUtils]: 37: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,771 INFO L273 TraceCheckUtils]: 38: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,771 INFO L273 TraceCheckUtils]: 39: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,771 INFO L273 TraceCheckUtils]: 40: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,771 INFO L273 TraceCheckUtils]: 41: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,771 INFO L273 TraceCheckUtils]: 42: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,772 INFO L273 TraceCheckUtils]: 43: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,772 INFO L273 TraceCheckUtils]: 44: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,772 INFO L273 TraceCheckUtils]: 45: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,772 INFO L273 TraceCheckUtils]: 46: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,772 INFO L273 TraceCheckUtils]: 47: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,773 INFO L273 TraceCheckUtils]: 48: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,773 INFO L273 TraceCheckUtils]: 49: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,773 INFO L273 TraceCheckUtils]: 50: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,773 INFO L273 TraceCheckUtils]: 51: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,773 INFO L273 TraceCheckUtils]: 52: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,773 INFO L273 TraceCheckUtils]: 53: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,774 INFO L273 TraceCheckUtils]: 54: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,774 INFO L273 TraceCheckUtils]: 55: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,774 INFO L273 TraceCheckUtils]: 56: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,774 INFO L273 TraceCheckUtils]: 57: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,774 INFO L273 TraceCheckUtils]: 58: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,775 INFO L273 TraceCheckUtils]: 59: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,775 INFO L273 TraceCheckUtils]: 60: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,775 INFO L273 TraceCheckUtils]: 61: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,775 INFO L273 TraceCheckUtils]: 62: Hoare triple {9559#false} assume !(~i~0 < 100000); {9559#false} is VALID [2018-11-18 22:55:37,775 INFO L273 TraceCheckUtils]: 63: Hoare triple {9559#false} ~i~0 := 0; {9559#false} is VALID [2018-11-18 22:55:37,775 INFO L273 TraceCheckUtils]: 64: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,775 INFO L273 TraceCheckUtils]: 65: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,775 INFO L273 TraceCheckUtils]: 66: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,776 INFO L273 TraceCheckUtils]: 67: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,776 INFO L273 TraceCheckUtils]: 68: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,776 INFO L273 TraceCheckUtils]: 69: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,776 INFO L273 TraceCheckUtils]: 70: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,776 INFO L273 TraceCheckUtils]: 71: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,776 INFO L273 TraceCheckUtils]: 72: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,776 INFO L273 TraceCheckUtils]: 73: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,776 INFO L273 TraceCheckUtils]: 74: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,777 INFO L273 TraceCheckUtils]: 75: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,777 INFO L273 TraceCheckUtils]: 76: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,777 INFO L273 TraceCheckUtils]: 77: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,777 INFO L273 TraceCheckUtils]: 78: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,777 INFO L273 TraceCheckUtils]: 79: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,777 INFO L273 TraceCheckUtils]: 80: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,777 INFO L273 TraceCheckUtils]: 81: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,777 INFO L273 TraceCheckUtils]: 82: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,777 INFO L273 TraceCheckUtils]: 83: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,778 INFO L273 TraceCheckUtils]: 84: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,778 INFO L273 TraceCheckUtils]: 85: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,778 INFO L273 TraceCheckUtils]: 86: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,778 INFO L273 TraceCheckUtils]: 87: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,778 INFO L273 TraceCheckUtils]: 88: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,778 INFO L273 TraceCheckUtils]: 89: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,778 INFO L273 TraceCheckUtils]: 90: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,778 INFO L273 TraceCheckUtils]: 91: Hoare triple {9559#false} assume !(~i~0 < 100000); {9559#false} is VALID [2018-11-18 22:55:37,778 INFO L273 TraceCheckUtils]: 92: Hoare triple {9559#false} ~i~0 := 0; {9559#false} is VALID [2018-11-18 22:55:37,779 INFO L273 TraceCheckUtils]: 93: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,779 INFO L273 TraceCheckUtils]: 94: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,779 INFO L273 TraceCheckUtils]: 95: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,779 INFO L273 TraceCheckUtils]: 96: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,779 INFO L273 TraceCheckUtils]: 97: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,779 INFO L273 TraceCheckUtils]: 98: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,779 INFO L273 TraceCheckUtils]: 99: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,779 INFO L273 TraceCheckUtils]: 100: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,779 INFO L273 TraceCheckUtils]: 101: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,780 INFO L273 TraceCheckUtils]: 102: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,780 INFO L273 TraceCheckUtils]: 103: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,780 INFO L273 TraceCheckUtils]: 104: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,780 INFO L273 TraceCheckUtils]: 105: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,780 INFO L273 TraceCheckUtils]: 106: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,780 INFO L273 TraceCheckUtils]: 107: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,780 INFO L273 TraceCheckUtils]: 108: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,780 INFO L273 TraceCheckUtils]: 109: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,781 INFO L273 TraceCheckUtils]: 110: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,781 INFO L273 TraceCheckUtils]: 111: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,781 INFO L273 TraceCheckUtils]: 112: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,781 INFO L273 TraceCheckUtils]: 113: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,781 INFO L273 TraceCheckUtils]: 114: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,781 INFO L273 TraceCheckUtils]: 115: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,781 INFO L273 TraceCheckUtils]: 116: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,781 INFO L273 TraceCheckUtils]: 117: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,781 INFO L273 TraceCheckUtils]: 118: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:37,782 INFO L273 TraceCheckUtils]: 119: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,782 INFO L273 TraceCheckUtils]: 120: Hoare triple {9559#false} assume !(~i~0 < 100000); {9559#false} is VALID [2018-11-18 22:55:37,782 INFO L273 TraceCheckUtils]: 121: Hoare triple {9559#false} havoc ~x~0;~x~0 := 0; {9559#false} is VALID [2018-11-18 22:55:37,782 INFO L273 TraceCheckUtils]: 122: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:37,782 INFO L273 TraceCheckUtils]: 123: Hoare triple {9559#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9559#false} is VALID [2018-11-18 22:55:37,782 INFO L256 TraceCheckUtils]: 124: Hoare triple {9559#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {9559#false} is VALID [2018-11-18 22:55:37,782 INFO L273 TraceCheckUtils]: 125: Hoare triple {9559#false} ~cond := #in~cond; {9559#false} is VALID [2018-11-18 22:55:37,782 INFO L273 TraceCheckUtils]: 126: Hoare triple {9559#false} assume 0 == ~cond; {9559#false} is VALID [2018-11-18 22:55:37,782 INFO L273 TraceCheckUtils]: 127: Hoare triple {9559#false} assume !false; {9559#false} is VALID [2018-11-18 22:55:37,789 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2018-11-18 22:55:37,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:55:37,789 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 22:55:37,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:55:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:55:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:55:37,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:55:38,043 INFO L256 TraceCheckUtils]: 0: Hoare triple {9558#true} call ULTIMATE.init(); {9558#true} is VALID [2018-11-18 22:55:38,043 INFO L273 TraceCheckUtils]: 1: Hoare triple {9558#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9558#true} is VALID [2018-11-18 22:55:38,044 INFO L273 TraceCheckUtils]: 2: Hoare triple {9558#true} assume true; {9558#true} is VALID [2018-11-18 22:55:38,044 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9558#true} {9558#true} #92#return; {9558#true} is VALID [2018-11-18 22:55:38,044 INFO L256 TraceCheckUtils]: 4: Hoare triple {9558#true} call #t~ret2 := main(); {9558#true} is VALID [2018-11-18 22:55:38,045 INFO L273 TraceCheckUtils]: 5: Hoare triple {9558#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9592#(<= main_~i~0 0)} is VALID [2018-11-18 22:55:38,045 INFO L273 TraceCheckUtils]: 6: Hoare triple {9592#(<= main_~i~0 0)} assume true; {9592#(<= main_~i~0 0)} is VALID [2018-11-18 22:55:38,046 INFO L273 TraceCheckUtils]: 7: Hoare triple {9592#(<= 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; {9561#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:38,046 INFO L273 TraceCheckUtils]: 8: Hoare triple {9561#(<= main_~i~0 1)} assume true; {9561#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:38,047 INFO L273 TraceCheckUtils]: 9: Hoare triple {9561#(<= 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; {9562#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:38,047 INFO L273 TraceCheckUtils]: 10: Hoare triple {9562#(<= main_~i~0 2)} assume true; {9562#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:38,048 INFO L273 TraceCheckUtils]: 11: Hoare triple {9562#(<= 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; {9563#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:38,048 INFO L273 TraceCheckUtils]: 12: Hoare triple {9563#(<= main_~i~0 3)} assume true; {9563#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:38,049 INFO L273 TraceCheckUtils]: 13: Hoare triple {9563#(<= 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; {9564#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:38,050 INFO L273 TraceCheckUtils]: 14: Hoare triple {9564#(<= main_~i~0 4)} assume true; {9564#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:38,051 INFO L273 TraceCheckUtils]: 15: Hoare triple {9564#(<= 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; {9565#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:38,051 INFO L273 TraceCheckUtils]: 16: Hoare triple {9565#(<= main_~i~0 5)} assume true; {9565#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:38,052 INFO L273 TraceCheckUtils]: 17: Hoare triple {9565#(<= 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; {9566#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:38,052 INFO L273 TraceCheckUtils]: 18: Hoare triple {9566#(<= main_~i~0 6)} assume true; {9566#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:38,053 INFO L273 TraceCheckUtils]: 19: Hoare triple {9566#(<= 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; {9567#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:38,054 INFO L273 TraceCheckUtils]: 20: Hoare triple {9567#(<= main_~i~0 7)} assume true; {9567#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:38,055 INFO L273 TraceCheckUtils]: 21: Hoare triple {9567#(<= 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; {9568#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:38,055 INFO L273 TraceCheckUtils]: 22: Hoare triple {9568#(<= main_~i~0 8)} assume true; {9568#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:38,056 INFO L273 TraceCheckUtils]: 23: Hoare triple {9568#(<= 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; {9569#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:38,056 INFO L273 TraceCheckUtils]: 24: Hoare triple {9569#(<= main_~i~0 9)} assume true; {9569#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:38,057 INFO L273 TraceCheckUtils]: 25: Hoare triple {9569#(<= 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; {9570#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:38,058 INFO L273 TraceCheckUtils]: 26: Hoare triple {9570#(<= main_~i~0 10)} assume true; {9570#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:38,059 INFO L273 TraceCheckUtils]: 27: Hoare triple {9570#(<= 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; {9571#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:38,059 INFO L273 TraceCheckUtils]: 28: Hoare triple {9571#(<= main_~i~0 11)} assume true; {9571#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:38,060 INFO L273 TraceCheckUtils]: 29: Hoare triple {9571#(<= 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; {9572#(<= main_~i~0 12)} is VALID [2018-11-18 22:55:38,061 INFO L273 TraceCheckUtils]: 30: Hoare triple {9572#(<= main_~i~0 12)} assume true; {9572#(<= main_~i~0 12)} is VALID [2018-11-18 22:55:38,061 INFO L273 TraceCheckUtils]: 31: Hoare triple {9572#(<= 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; {9573#(<= main_~i~0 13)} is VALID [2018-11-18 22:55:38,062 INFO L273 TraceCheckUtils]: 32: Hoare triple {9573#(<= main_~i~0 13)} assume true; {9573#(<= main_~i~0 13)} is VALID [2018-11-18 22:55:38,062 INFO L273 TraceCheckUtils]: 33: Hoare triple {9573#(<= main_~i~0 13)} assume !(~i~0 < 100000); {9559#false} is VALID [2018-11-18 22:55:38,063 INFO L273 TraceCheckUtils]: 34: Hoare triple {9559#false} ~i~0 := 0; {9559#false} is VALID [2018-11-18 22:55:38,063 INFO L273 TraceCheckUtils]: 35: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,063 INFO L273 TraceCheckUtils]: 36: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,063 INFO L273 TraceCheckUtils]: 37: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,063 INFO L273 TraceCheckUtils]: 38: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,064 INFO L273 TraceCheckUtils]: 39: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,064 INFO L273 TraceCheckUtils]: 40: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,064 INFO L273 TraceCheckUtils]: 41: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,064 INFO L273 TraceCheckUtils]: 42: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,064 INFO L273 TraceCheckUtils]: 43: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,065 INFO L273 TraceCheckUtils]: 44: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,065 INFO L273 TraceCheckUtils]: 45: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,065 INFO L273 TraceCheckUtils]: 46: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,065 INFO L273 TraceCheckUtils]: 47: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,065 INFO L273 TraceCheckUtils]: 48: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,065 INFO L273 TraceCheckUtils]: 49: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,066 INFO L273 TraceCheckUtils]: 50: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,066 INFO L273 TraceCheckUtils]: 51: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,066 INFO L273 TraceCheckUtils]: 52: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,066 INFO L273 TraceCheckUtils]: 53: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,066 INFO L273 TraceCheckUtils]: 54: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,067 INFO L273 TraceCheckUtils]: 55: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,067 INFO L273 TraceCheckUtils]: 56: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,067 INFO L273 TraceCheckUtils]: 57: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,067 INFO L273 TraceCheckUtils]: 58: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,067 INFO L273 TraceCheckUtils]: 59: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,067 INFO L273 TraceCheckUtils]: 60: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,067 INFO L273 TraceCheckUtils]: 61: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,067 INFO L273 TraceCheckUtils]: 62: Hoare triple {9559#false} assume !(~i~0 < 100000); {9559#false} is VALID [2018-11-18 22:55:38,067 INFO L273 TraceCheckUtils]: 63: Hoare triple {9559#false} ~i~0 := 0; {9559#false} is VALID [2018-11-18 22:55:38,068 INFO L273 TraceCheckUtils]: 64: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,068 INFO L273 TraceCheckUtils]: 65: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,068 INFO L273 TraceCheckUtils]: 66: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,068 INFO L273 TraceCheckUtils]: 67: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,068 INFO L273 TraceCheckUtils]: 68: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,068 INFO L273 TraceCheckUtils]: 69: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,068 INFO L273 TraceCheckUtils]: 70: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,068 INFO L273 TraceCheckUtils]: 71: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,068 INFO L273 TraceCheckUtils]: 72: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,069 INFO L273 TraceCheckUtils]: 73: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,069 INFO L273 TraceCheckUtils]: 74: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,069 INFO L273 TraceCheckUtils]: 75: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,069 INFO L273 TraceCheckUtils]: 76: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,069 INFO L273 TraceCheckUtils]: 77: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,069 INFO L273 TraceCheckUtils]: 78: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,069 INFO L273 TraceCheckUtils]: 79: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,069 INFO L273 TraceCheckUtils]: 80: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,070 INFO L273 TraceCheckUtils]: 81: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,070 INFO L273 TraceCheckUtils]: 82: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,070 INFO L273 TraceCheckUtils]: 83: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,070 INFO L273 TraceCheckUtils]: 84: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,070 INFO L273 TraceCheckUtils]: 85: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,070 INFO L273 TraceCheckUtils]: 86: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,070 INFO L273 TraceCheckUtils]: 87: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,070 INFO L273 TraceCheckUtils]: 88: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,070 INFO L273 TraceCheckUtils]: 89: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,071 INFO L273 TraceCheckUtils]: 90: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,071 INFO L273 TraceCheckUtils]: 91: Hoare triple {9559#false} assume !(~i~0 < 100000); {9559#false} is VALID [2018-11-18 22:55:38,071 INFO L273 TraceCheckUtils]: 92: Hoare triple {9559#false} ~i~0 := 0; {9559#false} is VALID [2018-11-18 22:55:38,071 INFO L273 TraceCheckUtils]: 93: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,071 INFO L273 TraceCheckUtils]: 94: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,071 INFO L273 TraceCheckUtils]: 95: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,071 INFO L273 TraceCheckUtils]: 96: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,071 INFO L273 TraceCheckUtils]: 97: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,071 INFO L273 TraceCheckUtils]: 98: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,072 INFO L273 TraceCheckUtils]: 99: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,072 INFO L273 TraceCheckUtils]: 100: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,072 INFO L273 TraceCheckUtils]: 101: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,072 INFO L273 TraceCheckUtils]: 102: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,072 INFO L273 TraceCheckUtils]: 103: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,072 INFO L273 TraceCheckUtils]: 104: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,072 INFO L273 TraceCheckUtils]: 105: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,072 INFO L273 TraceCheckUtils]: 106: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,072 INFO L273 TraceCheckUtils]: 107: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,073 INFO L273 TraceCheckUtils]: 108: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,073 INFO L273 TraceCheckUtils]: 109: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,073 INFO L273 TraceCheckUtils]: 110: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,073 INFO L273 TraceCheckUtils]: 111: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,073 INFO L273 TraceCheckUtils]: 112: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,073 INFO L273 TraceCheckUtils]: 113: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,073 INFO L273 TraceCheckUtils]: 114: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,073 INFO L273 TraceCheckUtils]: 115: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,073 INFO L273 TraceCheckUtils]: 116: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,074 INFO L273 TraceCheckUtils]: 117: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,074 INFO L273 TraceCheckUtils]: 118: Hoare triple {9559#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9559#false} is VALID [2018-11-18 22:55:38,074 INFO L273 TraceCheckUtils]: 119: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,074 INFO L273 TraceCheckUtils]: 120: Hoare triple {9559#false} assume !(~i~0 < 100000); {9559#false} is VALID [2018-11-18 22:55:38,074 INFO L273 TraceCheckUtils]: 121: Hoare triple {9559#false} havoc ~x~0;~x~0 := 0; {9559#false} is VALID [2018-11-18 22:55:38,074 INFO L273 TraceCheckUtils]: 122: Hoare triple {9559#false} assume true; {9559#false} is VALID [2018-11-18 22:55:38,074 INFO L273 TraceCheckUtils]: 123: Hoare triple {9559#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9559#false} is VALID [2018-11-18 22:55:38,074 INFO L256 TraceCheckUtils]: 124: Hoare triple {9559#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {9559#false} is VALID [2018-11-18 22:55:38,075 INFO L273 TraceCheckUtils]: 125: Hoare triple {9559#false} ~cond := #in~cond; {9559#false} is VALID [2018-11-18 22:55:38,075 INFO L273 TraceCheckUtils]: 126: Hoare triple {9559#false} assume 0 == ~cond; {9559#false} is VALID [2018-11-18 22:55:38,075 INFO L273 TraceCheckUtils]: 127: Hoare triple {9559#false} assume !false; {9559#false} is VALID [2018-11-18 22:55:38,081 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2018-11-18 22:55:38,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:55:38,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-18 22:55:38,101 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 128 [2018-11-18 22:55:38,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:55:38,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-18 22:55:38,150 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-18 22:55:38,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 22:55:38,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 22:55:38,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-18 22:55:38,150 INFO L87 Difference]: Start difference. First operand 133 states and 137 transitions. Second operand 17 states. [2018-11-18 22:55:38,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:55:38,750 INFO L93 Difference]: Finished difference Result 240 states and 251 transitions. [2018-11-18 22:55:38,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 22:55:38,750 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 128 [2018-11-18 22:55:38,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:55:38,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:55:38,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 173 transitions. [2018-11-18 22:55:38,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:55:38,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 173 transitions. [2018-11-18 22:55:38,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 173 transitions. [2018-11-18 22:55:38,926 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:55:38,929 INFO L225 Difference]: With dead ends: 240 [2018-11-18 22:55:38,929 INFO L226 Difference]: Without dead ends: 141 [2018-11-18 22:55:38,930 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-18 22:55:38,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-18 22:55:38,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-11-18 22:55:38,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:55:38,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand 141 states. [2018-11-18 22:55:38,998 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 141 states. [2018-11-18 22:55:38,999 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 141 states. [2018-11-18 22:55:39,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:55:39,002 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2018-11-18 22:55:39,002 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2018-11-18 22:55:39,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:55:39,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:55:39,003 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 141 states. [2018-11-18 22:55:39,003 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 141 states. [2018-11-18 22:55:39,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:55:39,005 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2018-11-18 22:55:39,005 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2018-11-18 22:55:39,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:55:39,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:55:39,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:55:39,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:55:39,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-18 22:55:39,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 145 transitions. [2018-11-18 22:55:39,007 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 145 transitions. Word has length 128 [2018-11-18 22:55:39,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:55:39,008 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 145 transitions. [2018-11-18 22:55:39,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 22:55:39,008 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2018-11-18 22:55:39,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-18 22:55:39,009 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:55:39,009 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:55:39,009 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:55:39,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:55:39,010 INFO L82 PathProgramCache]: Analyzing trace with hash -571540995, now seen corresponding path program 14 times [2018-11-18 22:55:39,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:55:39,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:55:39,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:55:39,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:55:39,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:55:39,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:55:39,264 INFO L256 TraceCheckUtils]: 0: Hoare triple {10800#true} call ULTIMATE.init(); {10800#true} is VALID [2018-11-18 22:55:39,265 INFO L273 TraceCheckUtils]: 1: Hoare triple {10800#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10800#true} is VALID [2018-11-18 22:55:39,265 INFO L273 TraceCheckUtils]: 2: Hoare triple {10800#true} assume true; {10800#true} is VALID [2018-11-18 22:55:39,265 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10800#true} {10800#true} #92#return; {10800#true} is VALID [2018-11-18 22:55:39,265 INFO L256 TraceCheckUtils]: 4: Hoare triple {10800#true} call #t~ret2 := main(); {10800#true} is VALID [2018-11-18 22:55:39,265 INFO L273 TraceCheckUtils]: 5: Hoare triple {10800#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10802#(= main_~i~0 0)} is VALID [2018-11-18 22:55:39,266 INFO L273 TraceCheckUtils]: 6: Hoare triple {10802#(= main_~i~0 0)} assume true; {10802#(= main_~i~0 0)} is VALID [2018-11-18 22:55:39,266 INFO L273 TraceCheckUtils]: 7: Hoare triple {10802#(= 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; {10803#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:39,266 INFO L273 TraceCheckUtils]: 8: Hoare triple {10803#(<= main_~i~0 1)} assume true; {10803#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:39,267 INFO L273 TraceCheckUtils]: 9: Hoare triple {10803#(<= 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; {10804#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:39,267 INFO L273 TraceCheckUtils]: 10: Hoare triple {10804#(<= main_~i~0 2)} assume true; {10804#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:39,268 INFO L273 TraceCheckUtils]: 11: Hoare triple {10804#(<= 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; {10805#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:39,268 INFO L273 TraceCheckUtils]: 12: Hoare triple {10805#(<= main_~i~0 3)} assume true; {10805#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:39,269 INFO L273 TraceCheckUtils]: 13: Hoare triple {10805#(<= 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; {10806#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:39,269 INFO L273 TraceCheckUtils]: 14: Hoare triple {10806#(<= main_~i~0 4)} assume true; {10806#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:39,270 INFO L273 TraceCheckUtils]: 15: Hoare triple {10806#(<= 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; {10807#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:39,271 INFO L273 TraceCheckUtils]: 16: Hoare triple {10807#(<= main_~i~0 5)} assume true; {10807#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:39,271 INFO L273 TraceCheckUtils]: 17: Hoare triple {10807#(<= 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; {10808#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:39,272 INFO L273 TraceCheckUtils]: 18: Hoare triple {10808#(<= main_~i~0 6)} assume true; {10808#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:39,273 INFO L273 TraceCheckUtils]: 19: Hoare triple {10808#(<= 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; {10809#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:39,273 INFO L273 TraceCheckUtils]: 20: Hoare triple {10809#(<= main_~i~0 7)} assume true; {10809#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:39,274 INFO L273 TraceCheckUtils]: 21: Hoare triple {10809#(<= 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; {10810#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:39,275 INFO L273 TraceCheckUtils]: 22: Hoare triple {10810#(<= main_~i~0 8)} assume true; {10810#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:39,275 INFO L273 TraceCheckUtils]: 23: Hoare triple {10810#(<= 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; {10811#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:39,276 INFO L273 TraceCheckUtils]: 24: Hoare triple {10811#(<= main_~i~0 9)} assume true; {10811#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:39,277 INFO L273 TraceCheckUtils]: 25: Hoare triple {10811#(<= 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; {10812#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:39,277 INFO L273 TraceCheckUtils]: 26: Hoare triple {10812#(<= main_~i~0 10)} assume true; {10812#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:39,278 INFO L273 TraceCheckUtils]: 27: Hoare triple {10812#(<= 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; {10813#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:39,279 INFO L273 TraceCheckUtils]: 28: Hoare triple {10813#(<= main_~i~0 11)} assume true; {10813#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:39,280 INFO L273 TraceCheckUtils]: 29: Hoare triple {10813#(<= 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; {10814#(<= main_~i~0 12)} is VALID [2018-11-18 22:55:39,280 INFO L273 TraceCheckUtils]: 30: Hoare triple {10814#(<= main_~i~0 12)} assume true; {10814#(<= main_~i~0 12)} is VALID [2018-11-18 22:55:39,281 INFO L273 TraceCheckUtils]: 31: Hoare triple {10814#(<= 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; {10815#(<= main_~i~0 13)} is VALID [2018-11-18 22:55:39,281 INFO L273 TraceCheckUtils]: 32: Hoare triple {10815#(<= main_~i~0 13)} assume true; {10815#(<= main_~i~0 13)} is VALID [2018-11-18 22:55:39,282 INFO L273 TraceCheckUtils]: 33: Hoare triple {10815#(<= 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; {10816#(<= main_~i~0 14)} is VALID [2018-11-18 22:55:39,283 INFO L273 TraceCheckUtils]: 34: Hoare triple {10816#(<= main_~i~0 14)} assume true; {10816#(<= main_~i~0 14)} is VALID [2018-11-18 22:55:39,283 INFO L273 TraceCheckUtils]: 35: Hoare triple {10816#(<= main_~i~0 14)} assume !(~i~0 < 100000); {10801#false} is VALID [2018-11-18 22:55:39,284 INFO L273 TraceCheckUtils]: 36: Hoare triple {10801#false} ~i~0 := 0; {10801#false} is VALID [2018-11-18 22:55:39,284 INFO L273 TraceCheckUtils]: 37: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,284 INFO L273 TraceCheckUtils]: 38: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,284 INFO L273 TraceCheckUtils]: 39: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,284 INFO L273 TraceCheckUtils]: 40: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,285 INFO L273 TraceCheckUtils]: 41: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,285 INFO L273 TraceCheckUtils]: 42: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,285 INFO L273 TraceCheckUtils]: 43: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,285 INFO L273 TraceCheckUtils]: 44: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,285 INFO L273 TraceCheckUtils]: 45: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,285 INFO L273 TraceCheckUtils]: 46: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,286 INFO L273 TraceCheckUtils]: 47: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,286 INFO L273 TraceCheckUtils]: 48: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,286 INFO L273 TraceCheckUtils]: 49: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,286 INFO L273 TraceCheckUtils]: 50: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,286 INFO L273 TraceCheckUtils]: 51: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,287 INFO L273 TraceCheckUtils]: 52: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,287 INFO L273 TraceCheckUtils]: 53: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,287 INFO L273 TraceCheckUtils]: 54: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,287 INFO L273 TraceCheckUtils]: 55: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,287 INFO L273 TraceCheckUtils]: 56: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,287 INFO L273 TraceCheckUtils]: 57: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,287 INFO L273 TraceCheckUtils]: 58: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,287 INFO L273 TraceCheckUtils]: 59: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,288 INFO L273 TraceCheckUtils]: 60: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,288 INFO L273 TraceCheckUtils]: 61: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,288 INFO L273 TraceCheckUtils]: 62: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,288 INFO L273 TraceCheckUtils]: 63: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,288 INFO L273 TraceCheckUtils]: 64: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,288 INFO L273 TraceCheckUtils]: 65: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,288 INFO L273 TraceCheckUtils]: 66: Hoare triple {10801#false} assume !(~i~0 < 100000); {10801#false} is VALID [2018-11-18 22:55:39,288 INFO L273 TraceCheckUtils]: 67: Hoare triple {10801#false} ~i~0 := 0; {10801#false} is VALID [2018-11-18 22:55:39,289 INFO L273 TraceCheckUtils]: 68: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,289 INFO L273 TraceCheckUtils]: 69: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,289 INFO L273 TraceCheckUtils]: 70: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,289 INFO L273 TraceCheckUtils]: 71: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,289 INFO L273 TraceCheckUtils]: 72: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,289 INFO L273 TraceCheckUtils]: 73: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,289 INFO L273 TraceCheckUtils]: 74: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,289 INFO L273 TraceCheckUtils]: 75: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,289 INFO L273 TraceCheckUtils]: 76: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,290 INFO L273 TraceCheckUtils]: 77: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,290 INFO L273 TraceCheckUtils]: 78: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,290 INFO L273 TraceCheckUtils]: 79: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,290 INFO L273 TraceCheckUtils]: 80: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,290 INFO L273 TraceCheckUtils]: 81: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,290 INFO L273 TraceCheckUtils]: 82: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,290 INFO L273 TraceCheckUtils]: 83: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,290 INFO L273 TraceCheckUtils]: 84: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,291 INFO L273 TraceCheckUtils]: 85: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,291 INFO L273 TraceCheckUtils]: 86: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,291 INFO L273 TraceCheckUtils]: 87: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,291 INFO L273 TraceCheckUtils]: 88: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,291 INFO L273 TraceCheckUtils]: 89: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,291 INFO L273 TraceCheckUtils]: 90: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,291 INFO L273 TraceCheckUtils]: 91: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,291 INFO L273 TraceCheckUtils]: 92: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,291 INFO L273 TraceCheckUtils]: 93: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,292 INFO L273 TraceCheckUtils]: 94: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,292 INFO L273 TraceCheckUtils]: 95: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,292 INFO L273 TraceCheckUtils]: 96: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,292 INFO L273 TraceCheckUtils]: 97: Hoare triple {10801#false} assume !(~i~0 < 100000); {10801#false} is VALID [2018-11-18 22:55:39,292 INFO L273 TraceCheckUtils]: 98: Hoare triple {10801#false} ~i~0 := 0; {10801#false} is VALID [2018-11-18 22:55:39,292 INFO L273 TraceCheckUtils]: 99: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,292 INFO L273 TraceCheckUtils]: 100: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,292 INFO L273 TraceCheckUtils]: 101: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,292 INFO L273 TraceCheckUtils]: 102: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,293 INFO L273 TraceCheckUtils]: 103: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,293 INFO L273 TraceCheckUtils]: 104: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,293 INFO L273 TraceCheckUtils]: 105: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,293 INFO L273 TraceCheckUtils]: 106: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,293 INFO L273 TraceCheckUtils]: 107: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,293 INFO L273 TraceCheckUtils]: 108: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,293 INFO L273 TraceCheckUtils]: 109: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,293 INFO L273 TraceCheckUtils]: 110: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,294 INFO L273 TraceCheckUtils]: 111: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,294 INFO L273 TraceCheckUtils]: 112: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,294 INFO L273 TraceCheckUtils]: 113: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,294 INFO L273 TraceCheckUtils]: 114: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,294 INFO L273 TraceCheckUtils]: 115: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,294 INFO L273 TraceCheckUtils]: 116: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,294 INFO L273 TraceCheckUtils]: 117: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,294 INFO L273 TraceCheckUtils]: 118: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,294 INFO L273 TraceCheckUtils]: 119: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,295 INFO L273 TraceCheckUtils]: 120: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,295 INFO L273 TraceCheckUtils]: 121: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,295 INFO L273 TraceCheckUtils]: 122: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,295 INFO L273 TraceCheckUtils]: 123: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,295 INFO L273 TraceCheckUtils]: 124: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,295 INFO L273 TraceCheckUtils]: 125: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,295 INFO L273 TraceCheckUtils]: 126: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,295 INFO L273 TraceCheckUtils]: 127: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,295 INFO L273 TraceCheckUtils]: 128: Hoare triple {10801#false} assume !(~i~0 < 100000); {10801#false} is VALID [2018-11-18 22:55:39,296 INFO L273 TraceCheckUtils]: 129: Hoare triple {10801#false} havoc ~x~0;~x~0 := 0; {10801#false} is VALID [2018-11-18 22:55:39,296 INFO L273 TraceCheckUtils]: 130: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,296 INFO L273 TraceCheckUtils]: 131: Hoare triple {10801#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10801#false} is VALID [2018-11-18 22:55:39,296 INFO L256 TraceCheckUtils]: 132: Hoare triple {10801#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {10801#false} is VALID [2018-11-18 22:55:39,296 INFO L273 TraceCheckUtils]: 133: Hoare triple {10801#false} ~cond := #in~cond; {10801#false} is VALID [2018-11-18 22:55:39,296 INFO L273 TraceCheckUtils]: 134: Hoare triple {10801#false} assume 0 == ~cond; {10801#false} is VALID [2018-11-18 22:55:39,296 INFO L273 TraceCheckUtils]: 135: Hoare triple {10801#false} assume !false; {10801#false} is VALID [2018-11-18 22:55:39,304 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-11-18 22:55:39,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:55:39,304 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-18 22:55:39,313 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:55:39,363 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:55:39,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:55:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:55:39,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:55:39,556 INFO L256 TraceCheckUtils]: 0: Hoare triple {10800#true} call ULTIMATE.init(); {10800#true} is VALID [2018-11-18 22:55:39,557 INFO L273 TraceCheckUtils]: 1: Hoare triple {10800#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10800#true} is VALID [2018-11-18 22:55:39,557 INFO L273 TraceCheckUtils]: 2: Hoare triple {10800#true} assume true; {10800#true} is VALID [2018-11-18 22:55:39,557 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10800#true} {10800#true} #92#return; {10800#true} is VALID [2018-11-18 22:55:39,557 INFO L256 TraceCheckUtils]: 4: Hoare triple {10800#true} call #t~ret2 := main(); {10800#true} is VALID [2018-11-18 22:55:39,558 INFO L273 TraceCheckUtils]: 5: Hoare triple {10800#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10835#(<= main_~i~0 0)} is VALID [2018-11-18 22:55:39,558 INFO L273 TraceCheckUtils]: 6: Hoare triple {10835#(<= main_~i~0 0)} assume true; {10835#(<= main_~i~0 0)} is VALID [2018-11-18 22:55:39,559 INFO L273 TraceCheckUtils]: 7: Hoare triple {10835#(<= 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; {10803#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:39,559 INFO L273 TraceCheckUtils]: 8: Hoare triple {10803#(<= main_~i~0 1)} assume true; {10803#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:39,560 INFO L273 TraceCheckUtils]: 9: Hoare triple {10803#(<= 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; {10804#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:39,560 INFO L273 TraceCheckUtils]: 10: Hoare triple {10804#(<= main_~i~0 2)} assume true; {10804#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:39,561 INFO L273 TraceCheckUtils]: 11: Hoare triple {10804#(<= 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; {10805#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:39,561 INFO L273 TraceCheckUtils]: 12: Hoare triple {10805#(<= main_~i~0 3)} assume true; {10805#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:39,562 INFO L273 TraceCheckUtils]: 13: Hoare triple {10805#(<= 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; {10806#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:39,562 INFO L273 TraceCheckUtils]: 14: Hoare triple {10806#(<= main_~i~0 4)} assume true; {10806#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:39,563 INFO L273 TraceCheckUtils]: 15: Hoare triple {10806#(<= 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; {10807#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:39,564 INFO L273 TraceCheckUtils]: 16: Hoare triple {10807#(<= main_~i~0 5)} assume true; {10807#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:39,565 INFO L273 TraceCheckUtils]: 17: Hoare triple {10807#(<= 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; {10808#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:39,565 INFO L273 TraceCheckUtils]: 18: Hoare triple {10808#(<= main_~i~0 6)} assume true; {10808#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:39,566 INFO L273 TraceCheckUtils]: 19: Hoare triple {10808#(<= 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; {10809#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:39,566 INFO L273 TraceCheckUtils]: 20: Hoare triple {10809#(<= main_~i~0 7)} assume true; {10809#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:39,567 INFO L273 TraceCheckUtils]: 21: Hoare triple {10809#(<= 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; {10810#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:39,568 INFO L273 TraceCheckUtils]: 22: Hoare triple {10810#(<= main_~i~0 8)} assume true; {10810#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:39,569 INFO L273 TraceCheckUtils]: 23: Hoare triple {10810#(<= 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; {10811#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:39,569 INFO L273 TraceCheckUtils]: 24: Hoare triple {10811#(<= main_~i~0 9)} assume true; {10811#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:39,570 INFO L273 TraceCheckUtils]: 25: Hoare triple {10811#(<= 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; {10812#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:39,571 INFO L273 TraceCheckUtils]: 26: Hoare triple {10812#(<= main_~i~0 10)} assume true; {10812#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:39,571 INFO L273 TraceCheckUtils]: 27: Hoare triple {10812#(<= 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; {10813#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:39,572 INFO L273 TraceCheckUtils]: 28: Hoare triple {10813#(<= main_~i~0 11)} assume true; {10813#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:39,573 INFO L273 TraceCheckUtils]: 29: Hoare triple {10813#(<= 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; {10814#(<= main_~i~0 12)} is VALID [2018-11-18 22:55:39,573 INFO L273 TraceCheckUtils]: 30: Hoare triple {10814#(<= main_~i~0 12)} assume true; {10814#(<= main_~i~0 12)} is VALID [2018-11-18 22:55:39,574 INFO L273 TraceCheckUtils]: 31: Hoare triple {10814#(<= 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; {10815#(<= main_~i~0 13)} is VALID [2018-11-18 22:55:39,575 INFO L273 TraceCheckUtils]: 32: Hoare triple {10815#(<= main_~i~0 13)} assume true; {10815#(<= main_~i~0 13)} is VALID [2018-11-18 22:55:39,575 INFO L273 TraceCheckUtils]: 33: Hoare triple {10815#(<= 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; {10816#(<= main_~i~0 14)} is VALID [2018-11-18 22:55:39,576 INFO L273 TraceCheckUtils]: 34: Hoare triple {10816#(<= main_~i~0 14)} assume true; {10816#(<= main_~i~0 14)} is VALID [2018-11-18 22:55:39,577 INFO L273 TraceCheckUtils]: 35: Hoare triple {10816#(<= main_~i~0 14)} assume !(~i~0 < 100000); {10801#false} is VALID [2018-11-18 22:55:39,577 INFO L273 TraceCheckUtils]: 36: Hoare triple {10801#false} ~i~0 := 0; {10801#false} is VALID [2018-11-18 22:55:39,577 INFO L273 TraceCheckUtils]: 37: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,577 INFO L273 TraceCheckUtils]: 38: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,577 INFO L273 TraceCheckUtils]: 39: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,578 INFO L273 TraceCheckUtils]: 40: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,578 INFO L273 TraceCheckUtils]: 41: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,578 INFO L273 TraceCheckUtils]: 42: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,578 INFO L273 TraceCheckUtils]: 43: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,578 INFO L273 TraceCheckUtils]: 44: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,578 INFO L273 TraceCheckUtils]: 45: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,579 INFO L273 TraceCheckUtils]: 46: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,579 INFO L273 TraceCheckUtils]: 47: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,579 INFO L273 TraceCheckUtils]: 48: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,579 INFO L273 TraceCheckUtils]: 49: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,579 INFO L273 TraceCheckUtils]: 50: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,580 INFO L273 TraceCheckUtils]: 51: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,580 INFO L273 TraceCheckUtils]: 52: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,580 INFO L273 TraceCheckUtils]: 53: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,580 INFO L273 TraceCheckUtils]: 54: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,580 INFO L273 TraceCheckUtils]: 55: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,580 INFO L273 TraceCheckUtils]: 56: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,581 INFO L273 TraceCheckUtils]: 57: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,581 INFO L273 TraceCheckUtils]: 58: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,581 INFO L273 TraceCheckUtils]: 59: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,581 INFO L273 TraceCheckUtils]: 60: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,581 INFO L273 TraceCheckUtils]: 61: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,581 INFO L273 TraceCheckUtils]: 62: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,582 INFO L273 TraceCheckUtils]: 63: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,582 INFO L273 TraceCheckUtils]: 64: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,582 INFO L273 TraceCheckUtils]: 65: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,582 INFO L273 TraceCheckUtils]: 66: Hoare triple {10801#false} assume !(~i~0 < 100000); {10801#false} is VALID [2018-11-18 22:55:39,582 INFO L273 TraceCheckUtils]: 67: Hoare triple {10801#false} ~i~0 := 0; {10801#false} is VALID [2018-11-18 22:55:39,582 INFO L273 TraceCheckUtils]: 68: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,582 INFO L273 TraceCheckUtils]: 69: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,582 INFO L273 TraceCheckUtils]: 70: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,583 INFO L273 TraceCheckUtils]: 71: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,583 INFO L273 TraceCheckUtils]: 72: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,583 INFO L273 TraceCheckUtils]: 73: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,583 INFO L273 TraceCheckUtils]: 74: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,583 INFO L273 TraceCheckUtils]: 75: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,583 INFO L273 TraceCheckUtils]: 76: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,583 INFO L273 TraceCheckUtils]: 77: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,583 INFO L273 TraceCheckUtils]: 78: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,583 INFO L273 TraceCheckUtils]: 79: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,584 INFO L273 TraceCheckUtils]: 80: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,584 INFO L273 TraceCheckUtils]: 81: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,584 INFO L273 TraceCheckUtils]: 82: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,584 INFO L273 TraceCheckUtils]: 83: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,584 INFO L273 TraceCheckUtils]: 84: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,584 INFO L273 TraceCheckUtils]: 85: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,584 INFO L273 TraceCheckUtils]: 86: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,584 INFO L273 TraceCheckUtils]: 87: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,584 INFO L273 TraceCheckUtils]: 88: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,585 INFO L273 TraceCheckUtils]: 89: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,585 INFO L273 TraceCheckUtils]: 90: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,585 INFO L273 TraceCheckUtils]: 91: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,585 INFO L273 TraceCheckUtils]: 92: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,585 INFO L273 TraceCheckUtils]: 93: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,585 INFO L273 TraceCheckUtils]: 94: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,585 INFO L273 TraceCheckUtils]: 95: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,585 INFO L273 TraceCheckUtils]: 96: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,585 INFO L273 TraceCheckUtils]: 97: Hoare triple {10801#false} assume !(~i~0 < 100000); {10801#false} is VALID [2018-11-18 22:55:39,586 INFO L273 TraceCheckUtils]: 98: Hoare triple {10801#false} ~i~0 := 0; {10801#false} is VALID [2018-11-18 22:55:39,586 INFO L273 TraceCheckUtils]: 99: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,586 INFO L273 TraceCheckUtils]: 100: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,586 INFO L273 TraceCheckUtils]: 101: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,586 INFO L273 TraceCheckUtils]: 102: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,586 INFO L273 TraceCheckUtils]: 103: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,586 INFO L273 TraceCheckUtils]: 104: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,586 INFO L273 TraceCheckUtils]: 105: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,586 INFO L273 TraceCheckUtils]: 106: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,587 INFO L273 TraceCheckUtils]: 107: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,587 INFO L273 TraceCheckUtils]: 108: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,587 INFO L273 TraceCheckUtils]: 109: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,587 INFO L273 TraceCheckUtils]: 110: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,587 INFO L273 TraceCheckUtils]: 111: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,587 INFO L273 TraceCheckUtils]: 112: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,587 INFO L273 TraceCheckUtils]: 113: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,587 INFO L273 TraceCheckUtils]: 114: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,588 INFO L273 TraceCheckUtils]: 115: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,588 INFO L273 TraceCheckUtils]: 116: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,588 INFO L273 TraceCheckUtils]: 117: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,588 INFO L273 TraceCheckUtils]: 118: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,588 INFO L273 TraceCheckUtils]: 119: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,588 INFO L273 TraceCheckUtils]: 120: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,588 INFO L273 TraceCheckUtils]: 121: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,588 INFO L273 TraceCheckUtils]: 122: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,588 INFO L273 TraceCheckUtils]: 123: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,589 INFO L273 TraceCheckUtils]: 124: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,589 INFO L273 TraceCheckUtils]: 125: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,589 INFO L273 TraceCheckUtils]: 126: Hoare triple {10801#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#false} is VALID [2018-11-18 22:55:39,589 INFO L273 TraceCheckUtils]: 127: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,589 INFO L273 TraceCheckUtils]: 128: Hoare triple {10801#false} assume !(~i~0 < 100000); {10801#false} is VALID [2018-11-18 22:55:39,589 INFO L273 TraceCheckUtils]: 129: Hoare triple {10801#false} havoc ~x~0;~x~0 := 0; {10801#false} is VALID [2018-11-18 22:55:39,589 INFO L273 TraceCheckUtils]: 130: Hoare triple {10801#false} assume true; {10801#false} is VALID [2018-11-18 22:55:39,589 INFO L273 TraceCheckUtils]: 131: Hoare triple {10801#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10801#false} is VALID [2018-11-18 22:55:39,589 INFO L256 TraceCheckUtils]: 132: Hoare triple {10801#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {10801#false} is VALID [2018-11-18 22:55:39,590 INFO L273 TraceCheckUtils]: 133: Hoare triple {10801#false} ~cond := #in~cond; {10801#false} is VALID [2018-11-18 22:55:39,590 INFO L273 TraceCheckUtils]: 134: Hoare triple {10801#false} assume 0 == ~cond; {10801#false} is VALID [2018-11-18 22:55:39,590 INFO L273 TraceCheckUtils]: 135: Hoare triple {10801#false} assume !false; {10801#false} is VALID [2018-11-18 22:55:39,597 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-11-18 22:55:39,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:55:39,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-18 22:55:39,618 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 136 [2018-11-18 22:55:39,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:55:39,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-18 22:55:39,669 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-18 22:55:39,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 22:55:39,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 22:55:39,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-18 22:55:39,670 INFO L87 Difference]: Start difference. First operand 141 states and 145 transitions. Second operand 18 states. [2018-11-18 22:55:40,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:55:40,166 INFO L93 Difference]: Finished difference Result 254 states and 265 transitions. [2018-11-18 22:55:40,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 22:55:40,166 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 136 [2018-11-18 22:55:40,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:55:40,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 22:55:40,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 181 transitions. [2018-11-18 22:55:40,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 22:55:40,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 181 transitions. [2018-11-18 22:55:40,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 181 transitions. [2018-11-18 22:55:40,399 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:55:40,403 INFO L225 Difference]: With dead ends: 254 [2018-11-18 22:55:40,403 INFO L226 Difference]: Without dead ends: 149 [2018-11-18 22:55:40,404 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 136 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-18 22:55:40,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-18 22:55:40,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-11-18 22:55:40,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:55:40,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand 149 states. [2018-11-18 22:55:40,454 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 149 states. [2018-11-18 22:55:40,454 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 149 states. [2018-11-18 22:55:40,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:55:40,456 INFO L93 Difference]: Finished difference Result 149 states and 153 transitions. [2018-11-18 22:55:40,456 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 153 transitions. [2018-11-18 22:55:40,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:55:40,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:55:40,457 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 149 states. [2018-11-18 22:55:40,457 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 149 states. [2018-11-18 22:55:40,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:55:40,459 INFO L93 Difference]: Finished difference Result 149 states and 153 transitions. [2018-11-18 22:55:40,459 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 153 transitions. [2018-11-18 22:55:40,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:55:40,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:55:40,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:55:40,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:55:40,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-18 22:55:40,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 153 transitions. [2018-11-18 22:55:40,462 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 153 transitions. Word has length 136 [2018-11-18 22:55:40,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:55:40,462 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 153 transitions. [2018-11-18 22:55:40,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 22:55:40,462 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 153 transitions. [2018-11-18 22:55:40,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-18 22:55:40,463 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:55:40,464 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:55:40,464 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:55:40,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:55:40,464 INFO L82 PathProgramCache]: Analyzing trace with hash 36411773, now seen corresponding path program 15 times [2018-11-18 22:55:40,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:55:40,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:55:40,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:55:40,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:55:40,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:55:40,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:55:40,916 INFO L256 TraceCheckUtils]: 0: Hoare triple {12116#true} call ULTIMATE.init(); {12116#true} is VALID [2018-11-18 22:55:40,916 INFO L273 TraceCheckUtils]: 1: Hoare triple {12116#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12116#true} is VALID [2018-11-18 22:55:40,917 INFO L273 TraceCheckUtils]: 2: Hoare triple {12116#true} assume true; {12116#true} is VALID [2018-11-18 22:55:40,917 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12116#true} {12116#true} #92#return; {12116#true} is VALID [2018-11-18 22:55:40,917 INFO L256 TraceCheckUtils]: 4: Hoare triple {12116#true} call #t~ret2 := main(); {12116#true} is VALID [2018-11-18 22:55:40,917 INFO L273 TraceCheckUtils]: 5: Hoare triple {12116#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12118#(= main_~i~0 0)} is VALID [2018-11-18 22:55:40,917 INFO L273 TraceCheckUtils]: 6: Hoare triple {12118#(= main_~i~0 0)} assume true; {12118#(= main_~i~0 0)} is VALID [2018-11-18 22:55:40,918 INFO L273 TraceCheckUtils]: 7: Hoare triple {12118#(= 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; {12119#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:40,919 INFO L273 TraceCheckUtils]: 8: Hoare triple {12119#(<= main_~i~0 1)} assume true; {12119#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:40,920 INFO L273 TraceCheckUtils]: 9: Hoare triple {12119#(<= 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; {12120#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:40,920 INFO L273 TraceCheckUtils]: 10: Hoare triple {12120#(<= main_~i~0 2)} assume true; {12120#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:40,921 INFO L273 TraceCheckUtils]: 11: Hoare triple {12120#(<= 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; {12121#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:40,921 INFO L273 TraceCheckUtils]: 12: Hoare triple {12121#(<= main_~i~0 3)} assume true; {12121#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:40,922 INFO L273 TraceCheckUtils]: 13: Hoare triple {12121#(<= 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; {12122#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:40,923 INFO L273 TraceCheckUtils]: 14: Hoare triple {12122#(<= main_~i~0 4)} assume true; {12122#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:40,924 INFO L273 TraceCheckUtils]: 15: Hoare triple {12122#(<= 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; {12123#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:40,924 INFO L273 TraceCheckUtils]: 16: Hoare triple {12123#(<= main_~i~0 5)} assume true; {12123#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:40,925 INFO L273 TraceCheckUtils]: 17: Hoare triple {12123#(<= 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; {12124#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:40,925 INFO L273 TraceCheckUtils]: 18: Hoare triple {12124#(<= main_~i~0 6)} assume true; {12124#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:40,926 INFO L273 TraceCheckUtils]: 19: Hoare triple {12124#(<= 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; {12125#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:40,927 INFO L273 TraceCheckUtils]: 20: Hoare triple {12125#(<= main_~i~0 7)} assume true; {12125#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:40,928 INFO L273 TraceCheckUtils]: 21: Hoare triple {12125#(<= 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; {12126#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:40,928 INFO L273 TraceCheckUtils]: 22: Hoare triple {12126#(<= main_~i~0 8)} assume true; {12126#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:40,929 INFO L273 TraceCheckUtils]: 23: Hoare triple {12126#(<= 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; {12127#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:40,930 INFO L273 TraceCheckUtils]: 24: Hoare triple {12127#(<= main_~i~0 9)} assume true; {12127#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:40,930 INFO L273 TraceCheckUtils]: 25: Hoare triple {12127#(<= 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; {12128#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:40,931 INFO L273 TraceCheckUtils]: 26: Hoare triple {12128#(<= main_~i~0 10)} assume true; {12128#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:40,932 INFO L273 TraceCheckUtils]: 27: Hoare triple {12128#(<= 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; {12129#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:40,932 INFO L273 TraceCheckUtils]: 28: Hoare triple {12129#(<= main_~i~0 11)} assume true; {12129#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:40,933 INFO L273 TraceCheckUtils]: 29: Hoare triple {12129#(<= 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; {12130#(<= main_~i~0 12)} is VALID [2018-11-18 22:55:40,934 INFO L273 TraceCheckUtils]: 30: Hoare triple {12130#(<= main_~i~0 12)} assume true; {12130#(<= main_~i~0 12)} is VALID [2018-11-18 22:55:40,934 INFO L273 TraceCheckUtils]: 31: Hoare triple {12130#(<= 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; {12131#(<= main_~i~0 13)} is VALID [2018-11-18 22:55:40,935 INFO L273 TraceCheckUtils]: 32: Hoare triple {12131#(<= main_~i~0 13)} assume true; {12131#(<= main_~i~0 13)} is VALID [2018-11-18 22:55:40,936 INFO L273 TraceCheckUtils]: 33: Hoare triple {12131#(<= 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; {12132#(<= main_~i~0 14)} is VALID [2018-11-18 22:55:40,936 INFO L273 TraceCheckUtils]: 34: Hoare triple {12132#(<= main_~i~0 14)} assume true; {12132#(<= main_~i~0 14)} is VALID [2018-11-18 22:55:40,937 INFO L273 TraceCheckUtils]: 35: Hoare triple {12132#(<= 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; {12133#(<= main_~i~0 15)} is VALID [2018-11-18 22:55:40,938 INFO L273 TraceCheckUtils]: 36: Hoare triple {12133#(<= main_~i~0 15)} assume true; {12133#(<= main_~i~0 15)} is VALID [2018-11-18 22:55:40,938 INFO L273 TraceCheckUtils]: 37: Hoare triple {12133#(<= main_~i~0 15)} assume !(~i~0 < 100000); {12117#false} is VALID [2018-11-18 22:55:40,939 INFO L273 TraceCheckUtils]: 38: Hoare triple {12117#false} ~i~0 := 0; {12117#false} is VALID [2018-11-18 22:55:40,939 INFO L273 TraceCheckUtils]: 39: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,939 INFO L273 TraceCheckUtils]: 40: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,939 INFO L273 TraceCheckUtils]: 41: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,939 INFO L273 TraceCheckUtils]: 42: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,940 INFO L273 TraceCheckUtils]: 43: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,940 INFO L273 TraceCheckUtils]: 44: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,940 INFO L273 TraceCheckUtils]: 45: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,940 INFO L273 TraceCheckUtils]: 46: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,940 INFO L273 TraceCheckUtils]: 47: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,940 INFO L273 TraceCheckUtils]: 48: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,941 INFO L273 TraceCheckUtils]: 49: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,941 INFO L273 TraceCheckUtils]: 50: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,941 INFO L273 TraceCheckUtils]: 51: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,941 INFO L273 TraceCheckUtils]: 52: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,941 INFO L273 TraceCheckUtils]: 53: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,941 INFO L273 TraceCheckUtils]: 54: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,941 INFO L273 TraceCheckUtils]: 55: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,942 INFO L273 TraceCheckUtils]: 56: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,942 INFO L273 TraceCheckUtils]: 57: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,942 INFO L273 TraceCheckUtils]: 58: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,942 INFO L273 TraceCheckUtils]: 59: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,942 INFO L273 TraceCheckUtils]: 60: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,942 INFO L273 TraceCheckUtils]: 61: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,942 INFO L273 TraceCheckUtils]: 62: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,942 INFO L273 TraceCheckUtils]: 63: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,942 INFO L273 TraceCheckUtils]: 64: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,943 INFO L273 TraceCheckUtils]: 65: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,943 INFO L273 TraceCheckUtils]: 66: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,943 INFO L273 TraceCheckUtils]: 67: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,943 INFO L273 TraceCheckUtils]: 68: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,943 INFO L273 TraceCheckUtils]: 69: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,943 INFO L273 TraceCheckUtils]: 70: Hoare triple {12117#false} assume !(~i~0 < 100000); {12117#false} is VALID [2018-11-18 22:55:40,943 INFO L273 TraceCheckUtils]: 71: Hoare triple {12117#false} ~i~0 := 0; {12117#false} is VALID [2018-11-18 22:55:40,943 INFO L273 TraceCheckUtils]: 72: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,943 INFO L273 TraceCheckUtils]: 73: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,944 INFO L273 TraceCheckUtils]: 74: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,944 INFO L273 TraceCheckUtils]: 75: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,944 INFO L273 TraceCheckUtils]: 76: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,944 INFO L273 TraceCheckUtils]: 77: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,944 INFO L273 TraceCheckUtils]: 78: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,944 INFO L273 TraceCheckUtils]: 79: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,944 INFO L273 TraceCheckUtils]: 80: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,944 INFO L273 TraceCheckUtils]: 81: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,945 INFO L273 TraceCheckUtils]: 82: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,945 INFO L273 TraceCheckUtils]: 83: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,945 INFO L273 TraceCheckUtils]: 84: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,945 INFO L273 TraceCheckUtils]: 85: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,945 INFO L273 TraceCheckUtils]: 86: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,945 INFO L273 TraceCheckUtils]: 87: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,945 INFO L273 TraceCheckUtils]: 88: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,945 INFO L273 TraceCheckUtils]: 89: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,945 INFO L273 TraceCheckUtils]: 90: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,946 INFO L273 TraceCheckUtils]: 91: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,946 INFO L273 TraceCheckUtils]: 92: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,946 INFO L273 TraceCheckUtils]: 93: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,946 INFO L273 TraceCheckUtils]: 94: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,946 INFO L273 TraceCheckUtils]: 95: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,946 INFO L273 TraceCheckUtils]: 96: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,946 INFO L273 TraceCheckUtils]: 97: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,946 INFO L273 TraceCheckUtils]: 98: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,946 INFO L273 TraceCheckUtils]: 99: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,947 INFO L273 TraceCheckUtils]: 100: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,947 INFO L273 TraceCheckUtils]: 101: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,947 INFO L273 TraceCheckUtils]: 102: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,947 INFO L273 TraceCheckUtils]: 103: Hoare triple {12117#false} assume !(~i~0 < 100000); {12117#false} is VALID [2018-11-18 22:55:40,947 INFO L273 TraceCheckUtils]: 104: Hoare triple {12117#false} ~i~0 := 0; {12117#false} is VALID [2018-11-18 22:55:40,947 INFO L273 TraceCheckUtils]: 105: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,947 INFO L273 TraceCheckUtils]: 106: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,947 INFO L273 TraceCheckUtils]: 107: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,947 INFO L273 TraceCheckUtils]: 108: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,948 INFO L273 TraceCheckUtils]: 109: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,948 INFO L273 TraceCheckUtils]: 110: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,948 INFO L273 TraceCheckUtils]: 111: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,948 INFO L273 TraceCheckUtils]: 112: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,948 INFO L273 TraceCheckUtils]: 113: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,948 INFO L273 TraceCheckUtils]: 114: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,948 INFO L273 TraceCheckUtils]: 115: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,948 INFO L273 TraceCheckUtils]: 116: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,949 INFO L273 TraceCheckUtils]: 117: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,949 INFO L273 TraceCheckUtils]: 118: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,949 INFO L273 TraceCheckUtils]: 119: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,949 INFO L273 TraceCheckUtils]: 120: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,949 INFO L273 TraceCheckUtils]: 121: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,949 INFO L273 TraceCheckUtils]: 122: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,949 INFO L273 TraceCheckUtils]: 123: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,949 INFO L273 TraceCheckUtils]: 124: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,949 INFO L273 TraceCheckUtils]: 125: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,950 INFO L273 TraceCheckUtils]: 126: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,950 INFO L273 TraceCheckUtils]: 127: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,950 INFO L273 TraceCheckUtils]: 128: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,950 INFO L273 TraceCheckUtils]: 129: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,950 INFO L273 TraceCheckUtils]: 130: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,950 INFO L273 TraceCheckUtils]: 131: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,950 INFO L273 TraceCheckUtils]: 132: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,950 INFO L273 TraceCheckUtils]: 133: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,950 INFO L273 TraceCheckUtils]: 134: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:40,951 INFO L273 TraceCheckUtils]: 135: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,951 INFO L273 TraceCheckUtils]: 136: Hoare triple {12117#false} assume !(~i~0 < 100000); {12117#false} is VALID [2018-11-18 22:55:40,951 INFO L273 TraceCheckUtils]: 137: Hoare triple {12117#false} havoc ~x~0;~x~0 := 0; {12117#false} is VALID [2018-11-18 22:55:40,951 INFO L273 TraceCheckUtils]: 138: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:40,951 INFO L273 TraceCheckUtils]: 139: Hoare triple {12117#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12117#false} is VALID [2018-11-18 22:55:40,951 INFO L256 TraceCheckUtils]: 140: Hoare triple {12117#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {12117#false} is VALID [2018-11-18 22:55:40,951 INFO L273 TraceCheckUtils]: 141: Hoare triple {12117#false} ~cond := #in~cond; {12117#false} is VALID [2018-11-18 22:55:40,951 INFO L273 TraceCheckUtils]: 142: Hoare triple {12117#false} assume 0 == ~cond; {12117#false} is VALID [2018-11-18 22:55:40,951 INFO L273 TraceCheckUtils]: 143: Hoare triple {12117#false} assume !false; {12117#false} is VALID [2018-11-18 22:55:40,960 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 720 trivial. 0 not checked. [2018-11-18 22:55:40,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:55:40,960 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-18 22:55:40,969 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:55:56,774 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-18 22:55:56,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:55:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:55:56,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:55:57,058 INFO L256 TraceCheckUtils]: 0: Hoare triple {12116#true} call ULTIMATE.init(); {12116#true} is VALID [2018-11-18 22:55:57,058 INFO L273 TraceCheckUtils]: 1: Hoare triple {12116#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12116#true} is VALID [2018-11-18 22:55:57,058 INFO L273 TraceCheckUtils]: 2: Hoare triple {12116#true} assume true; {12116#true} is VALID [2018-11-18 22:55:57,058 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12116#true} {12116#true} #92#return; {12116#true} is VALID [2018-11-18 22:55:57,059 INFO L256 TraceCheckUtils]: 4: Hoare triple {12116#true} call #t~ret2 := main(); {12116#true} is VALID [2018-11-18 22:55:57,059 INFO L273 TraceCheckUtils]: 5: Hoare triple {12116#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12152#(<= main_~i~0 0)} is VALID [2018-11-18 22:55:57,060 INFO L273 TraceCheckUtils]: 6: Hoare triple {12152#(<= main_~i~0 0)} assume true; {12152#(<= main_~i~0 0)} is VALID [2018-11-18 22:55:57,061 INFO L273 TraceCheckUtils]: 7: Hoare triple {12152#(<= 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; {12119#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:57,061 INFO L273 TraceCheckUtils]: 8: Hoare triple {12119#(<= main_~i~0 1)} assume true; {12119#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:57,062 INFO L273 TraceCheckUtils]: 9: Hoare triple {12119#(<= 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; {12120#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:57,062 INFO L273 TraceCheckUtils]: 10: Hoare triple {12120#(<= main_~i~0 2)} assume true; {12120#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:57,062 INFO L273 TraceCheckUtils]: 11: Hoare triple {12120#(<= 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; {12121#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:57,063 INFO L273 TraceCheckUtils]: 12: Hoare triple {12121#(<= main_~i~0 3)} assume true; {12121#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:57,064 INFO L273 TraceCheckUtils]: 13: Hoare triple {12121#(<= 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; {12122#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:57,064 INFO L273 TraceCheckUtils]: 14: Hoare triple {12122#(<= main_~i~0 4)} assume true; {12122#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:57,065 INFO L273 TraceCheckUtils]: 15: Hoare triple {12122#(<= 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; {12123#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:57,066 INFO L273 TraceCheckUtils]: 16: Hoare triple {12123#(<= main_~i~0 5)} assume true; {12123#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:57,067 INFO L273 TraceCheckUtils]: 17: Hoare triple {12123#(<= 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; {12124#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:57,067 INFO L273 TraceCheckUtils]: 18: Hoare triple {12124#(<= main_~i~0 6)} assume true; {12124#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:57,068 INFO L273 TraceCheckUtils]: 19: Hoare triple {12124#(<= 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; {12125#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:57,068 INFO L273 TraceCheckUtils]: 20: Hoare triple {12125#(<= main_~i~0 7)} assume true; {12125#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:57,069 INFO L273 TraceCheckUtils]: 21: Hoare triple {12125#(<= 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; {12126#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:57,070 INFO L273 TraceCheckUtils]: 22: Hoare triple {12126#(<= main_~i~0 8)} assume true; {12126#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:57,071 INFO L273 TraceCheckUtils]: 23: Hoare triple {12126#(<= 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; {12127#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:57,071 INFO L273 TraceCheckUtils]: 24: Hoare triple {12127#(<= main_~i~0 9)} assume true; {12127#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:57,072 INFO L273 TraceCheckUtils]: 25: Hoare triple {12127#(<= 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; {12128#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:57,073 INFO L273 TraceCheckUtils]: 26: Hoare triple {12128#(<= main_~i~0 10)} assume true; {12128#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:57,073 INFO L273 TraceCheckUtils]: 27: Hoare triple {12128#(<= 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; {12129#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:57,074 INFO L273 TraceCheckUtils]: 28: Hoare triple {12129#(<= main_~i~0 11)} assume true; {12129#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:57,075 INFO L273 TraceCheckUtils]: 29: Hoare triple {12129#(<= 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; {12130#(<= main_~i~0 12)} is VALID [2018-11-18 22:55:57,075 INFO L273 TraceCheckUtils]: 30: Hoare triple {12130#(<= main_~i~0 12)} assume true; {12130#(<= main_~i~0 12)} is VALID [2018-11-18 22:55:57,076 INFO L273 TraceCheckUtils]: 31: Hoare triple {12130#(<= 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; {12131#(<= main_~i~0 13)} is VALID [2018-11-18 22:55:57,077 INFO L273 TraceCheckUtils]: 32: Hoare triple {12131#(<= main_~i~0 13)} assume true; {12131#(<= main_~i~0 13)} is VALID [2018-11-18 22:55:57,077 INFO L273 TraceCheckUtils]: 33: Hoare triple {12131#(<= 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; {12132#(<= main_~i~0 14)} is VALID [2018-11-18 22:55:57,078 INFO L273 TraceCheckUtils]: 34: Hoare triple {12132#(<= main_~i~0 14)} assume true; {12132#(<= main_~i~0 14)} is VALID [2018-11-18 22:55:57,079 INFO L273 TraceCheckUtils]: 35: Hoare triple {12132#(<= 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; {12133#(<= main_~i~0 15)} is VALID [2018-11-18 22:55:57,079 INFO L273 TraceCheckUtils]: 36: Hoare triple {12133#(<= main_~i~0 15)} assume true; {12133#(<= main_~i~0 15)} is VALID [2018-11-18 22:55:57,080 INFO L273 TraceCheckUtils]: 37: Hoare triple {12133#(<= main_~i~0 15)} assume !(~i~0 < 100000); {12117#false} is VALID [2018-11-18 22:55:57,080 INFO L273 TraceCheckUtils]: 38: Hoare triple {12117#false} ~i~0 := 0; {12117#false} is VALID [2018-11-18 22:55:57,080 INFO L273 TraceCheckUtils]: 39: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,081 INFO L273 TraceCheckUtils]: 40: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,081 INFO L273 TraceCheckUtils]: 41: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,081 INFO L273 TraceCheckUtils]: 42: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,081 INFO L273 TraceCheckUtils]: 43: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,081 INFO L273 TraceCheckUtils]: 44: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,081 INFO L273 TraceCheckUtils]: 45: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,082 INFO L273 TraceCheckUtils]: 46: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,082 INFO L273 TraceCheckUtils]: 47: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,082 INFO L273 TraceCheckUtils]: 48: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,082 INFO L273 TraceCheckUtils]: 49: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,082 INFO L273 TraceCheckUtils]: 50: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,083 INFO L273 TraceCheckUtils]: 51: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,083 INFO L273 TraceCheckUtils]: 52: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,083 INFO L273 TraceCheckUtils]: 53: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,083 INFO L273 TraceCheckUtils]: 54: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,083 INFO L273 TraceCheckUtils]: 55: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,083 INFO L273 TraceCheckUtils]: 56: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,083 INFO L273 TraceCheckUtils]: 57: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,083 INFO L273 TraceCheckUtils]: 58: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,083 INFO L273 TraceCheckUtils]: 59: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,084 INFO L273 TraceCheckUtils]: 60: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,084 INFO L273 TraceCheckUtils]: 61: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,084 INFO L273 TraceCheckUtils]: 62: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,084 INFO L273 TraceCheckUtils]: 63: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,084 INFO L273 TraceCheckUtils]: 64: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,084 INFO L273 TraceCheckUtils]: 65: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,084 INFO L273 TraceCheckUtils]: 66: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,084 INFO L273 TraceCheckUtils]: 67: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,084 INFO L273 TraceCheckUtils]: 68: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,085 INFO L273 TraceCheckUtils]: 69: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,085 INFO L273 TraceCheckUtils]: 70: Hoare triple {12117#false} assume !(~i~0 < 100000); {12117#false} is VALID [2018-11-18 22:55:57,085 INFO L273 TraceCheckUtils]: 71: Hoare triple {12117#false} ~i~0 := 0; {12117#false} is VALID [2018-11-18 22:55:57,085 INFO L273 TraceCheckUtils]: 72: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,085 INFO L273 TraceCheckUtils]: 73: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,085 INFO L273 TraceCheckUtils]: 74: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,085 INFO L273 TraceCheckUtils]: 75: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,085 INFO L273 TraceCheckUtils]: 76: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,085 INFO L273 TraceCheckUtils]: 77: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,086 INFO L273 TraceCheckUtils]: 78: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,086 INFO L273 TraceCheckUtils]: 79: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,086 INFO L273 TraceCheckUtils]: 80: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,086 INFO L273 TraceCheckUtils]: 81: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,086 INFO L273 TraceCheckUtils]: 82: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,086 INFO L273 TraceCheckUtils]: 83: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,086 INFO L273 TraceCheckUtils]: 84: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,086 INFO L273 TraceCheckUtils]: 85: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,087 INFO L273 TraceCheckUtils]: 86: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,087 INFO L273 TraceCheckUtils]: 87: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,087 INFO L273 TraceCheckUtils]: 88: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,087 INFO L273 TraceCheckUtils]: 89: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,087 INFO L273 TraceCheckUtils]: 90: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,087 INFO L273 TraceCheckUtils]: 91: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,087 INFO L273 TraceCheckUtils]: 92: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,087 INFO L273 TraceCheckUtils]: 93: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,087 INFO L273 TraceCheckUtils]: 94: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,088 INFO L273 TraceCheckUtils]: 95: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,088 INFO L273 TraceCheckUtils]: 96: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,088 INFO L273 TraceCheckUtils]: 97: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,088 INFO L273 TraceCheckUtils]: 98: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,088 INFO L273 TraceCheckUtils]: 99: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,088 INFO L273 TraceCheckUtils]: 100: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,088 INFO L273 TraceCheckUtils]: 101: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,088 INFO L273 TraceCheckUtils]: 102: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,088 INFO L273 TraceCheckUtils]: 103: Hoare triple {12117#false} assume !(~i~0 < 100000); {12117#false} is VALID [2018-11-18 22:55:57,089 INFO L273 TraceCheckUtils]: 104: Hoare triple {12117#false} ~i~0 := 0; {12117#false} is VALID [2018-11-18 22:55:57,089 INFO L273 TraceCheckUtils]: 105: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,089 INFO L273 TraceCheckUtils]: 106: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,089 INFO L273 TraceCheckUtils]: 107: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,089 INFO L273 TraceCheckUtils]: 108: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,089 INFO L273 TraceCheckUtils]: 109: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,089 INFO L273 TraceCheckUtils]: 110: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,090 INFO L273 TraceCheckUtils]: 111: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,090 INFO L273 TraceCheckUtils]: 112: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,090 INFO L273 TraceCheckUtils]: 113: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,090 INFO L273 TraceCheckUtils]: 114: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,090 INFO L273 TraceCheckUtils]: 115: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,090 INFO L273 TraceCheckUtils]: 116: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,091 INFO L273 TraceCheckUtils]: 117: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,091 INFO L273 TraceCheckUtils]: 118: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,091 INFO L273 TraceCheckUtils]: 119: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,091 INFO L273 TraceCheckUtils]: 120: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,091 INFO L273 TraceCheckUtils]: 121: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,091 INFO L273 TraceCheckUtils]: 122: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,092 INFO L273 TraceCheckUtils]: 123: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,092 INFO L273 TraceCheckUtils]: 124: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,092 INFO L273 TraceCheckUtils]: 125: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,092 INFO L273 TraceCheckUtils]: 126: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,092 INFO L273 TraceCheckUtils]: 127: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,092 INFO L273 TraceCheckUtils]: 128: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,092 INFO L273 TraceCheckUtils]: 129: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,093 INFO L273 TraceCheckUtils]: 130: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,093 INFO L273 TraceCheckUtils]: 131: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,093 INFO L273 TraceCheckUtils]: 132: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,093 INFO L273 TraceCheckUtils]: 133: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,093 INFO L273 TraceCheckUtils]: 134: Hoare triple {12117#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12117#false} is VALID [2018-11-18 22:55:57,093 INFO L273 TraceCheckUtils]: 135: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,094 INFO L273 TraceCheckUtils]: 136: Hoare triple {12117#false} assume !(~i~0 < 100000); {12117#false} is VALID [2018-11-18 22:55:57,094 INFO L273 TraceCheckUtils]: 137: Hoare triple {12117#false} havoc ~x~0;~x~0 := 0; {12117#false} is VALID [2018-11-18 22:55:57,094 INFO L273 TraceCheckUtils]: 138: Hoare triple {12117#false} assume true; {12117#false} is VALID [2018-11-18 22:55:57,094 INFO L273 TraceCheckUtils]: 139: Hoare triple {12117#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12117#false} is VALID [2018-11-18 22:55:57,094 INFO L256 TraceCheckUtils]: 140: Hoare triple {12117#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {12117#false} is VALID [2018-11-18 22:55:57,094 INFO L273 TraceCheckUtils]: 141: Hoare triple {12117#false} ~cond := #in~cond; {12117#false} is VALID [2018-11-18 22:55:57,094 INFO L273 TraceCheckUtils]: 142: Hoare triple {12117#false} assume 0 == ~cond; {12117#false} is VALID [2018-11-18 22:55:57,095 INFO L273 TraceCheckUtils]: 143: Hoare triple {12117#false} assume !false; {12117#false} is VALID [2018-11-18 22:55:57,103 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 720 trivial. 0 not checked. [2018-11-18 22:55:57,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:55:57,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-18 22:55:57,128 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 144 [2018-11-18 22:55:57,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:55:57,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-18 22:55:57,183 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:55:57,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 22:55:57,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 22:55:57,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-18 22:55:57,184 INFO L87 Difference]: Start difference. First operand 149 states and 153 transitions. Second operand 19 states. [2018-11-18 22:55:58,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:55:58,293 INFO L93 Difference]: Finished difference Result 268 states and 279 transitions. [2018-11-18 22:55:58,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 22:55:58,294 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 144 [2018-11-18 22:55:58,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:55:58,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 22:55:58,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 189 transitions. [2018-11-18 22:55:58,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 22:55:58,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 189 transitions. [2018-11-18 22:55:58,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 189 transitions. [2018-11-18 22:55:58,460 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:55:58,464 INFO L225 Difference]: With dead ends: 268 [2018-11-18 22:55:58,464 INFO L226 Difference]: Without dead ends: 157 [2018-11-18 22:55:58,464 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-18 22:55:58,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-18 22:55:58,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-11-18 22:55:58,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:55:58,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand 157 states. [2018-11-18 22:55:58,559 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 157 states. [2018-11-18 22:55:58,559 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 157 states. [2018-11-18 22:55:58,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:55:58,561 INFO L93 Difference]: Finished difference Result 157 states and 161 transitions. [2018-11-18 22:55:58,561 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 161 transitions. [2018-11-18 22:55:58,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:55:58,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:55:58,562 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 157 states. [2018-11-18 22:55:58,562 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 157 states. [2018-11-18 22:55:58,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:55:58,564 INFO L93 Difference]: Finished difference Result 157 states and 161 transitions. [2018-11-18 22:55:58,565 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 161 transitions. [2018-11-18 22:55:58,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:55:58,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:55:58,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:55:58,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:55:58,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-18 22:55:58,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 161 transitions. [2018-11-18 22:55:58,568 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 161 transitions. Word has length 144 [2018-11-18 22:55:58,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:55:58,569 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 161 transitions. [2018-11-18 22:55:58,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 22:55:58,569 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 161 transitions. [2018-11-18 22:55:58,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-18 22:55:58,570 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:55:58,570 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:55:58,570 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:55:58,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:55:58,571 INFO L82 PathProgramCache]: Analyzing trace with hash 974492413, now seen corresponding path program 16 times [2018-11-18 22:55:58,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:55:58,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:55:58,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:55:58,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:55:58,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:55:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:55:58,970 INFO L256 TraceCheckUtils]: 0: Hoare triple {13506#true} call ULTIMATE.init(); {13506#true} is VALID [2018-11-18 22:55:58,970 INFO L273 TraceCheckUtils]: 1: Hoare triple {13506#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13506#true} is VALID [2018-11-18 22:55:58,971 INFO L273 TraceCheckUtils]: 2: Hoare triple {13506#true} assume true; {13506#true} is VALID [2018-11-18 22:55:58,971 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13506#true} {13506#true} #92#return; {13506#true} is VALID [2018-11-18 22:55:58,971 INFO L256 TraceCheckUtils]: 4: Hoare triple {13506#true} call #t~ret2 := main(); {13506#true} is VALID [2018-11-18 22:55:58,971 INFO L273 TraceCheckUtils]: 5: Hoare triple {13506#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {13508#(= main_~i~0 0)} is VALID [2018-11-18 22:55:58,972 INFO L273 TraceCheckUtils]: 6: Hoare triple {13508#(= main_~i~0 0)} assume true; {13508#(= main_~i~0 0)} is VALID [2018-11-18 22:55:58,973 INFO L273 TraceCheckUtils]: 7: Hoare triple {13508#(= 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; {13509#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:58,973 INFO L273 TraceCheckUtils]: 8: Hoare triple {13509#(<= main_~i~0 1)} assume true; {13509#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:58,974 INFO L273 TraceCheckUtils]: 9: Hoare triple {13509#(<= 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; {13510#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:58,974 INFO L273 TraceCheckUtils]: 10: Hoare triple {13510#(<= main_~i~0 2)} assume true; {13510#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:58,975 INFO L273 TraceCheckUtils]: 11: Hoare triple {13510#(<= 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; {13511#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:58,975 INFO L273 TraceCheckUtils]: 12: Hoare triple {13511#(<= main_~i~0 3)} assume true; {13511#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:58,976 INFO L273 TraceCheckUtils]: 13: Hoare triple {13511#(<= 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; {13512#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:58,976 INFO L273 TraceCheckUtils]: 14: Hoare triple {13512#(<= main_~i~0 4)} assume true; {13512#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:58,977 INFO L273 TraceCheckUtils]: 15: Hoare triple {13512#(<= 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; {13513#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:58,978 INFO L273 TraceCheckUtils]: 16: Hoare triple {13513#(<= main_~i~0 5)} assume true; {13513#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:58,978 INFO L273 TraceCheckUtils]: 17: Hoare triple {13513#(<= 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; {13514#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:58,979 INFO L273 TraceCheckUtils]: 18: Hoare triple {13514#(<= main_~i~0 6)} assume true; {13514#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:58,980 INFO L273 TraceCheckUtils]: 19: Hoare triple {13514#(<= 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; {13515#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:58,980 INFO L273 TraceCheckUtils]: 20: Hoare triple {13515#(<= main_~i~0 7)} assume true; {13515#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:58,981 INFO L273 TraceCheckUtils]: 21: Hoare triple {13515#(<= 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; {13516#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:58,982 INFO L273 TraceCheckUtils]: 22: Hoare triple {13516#(<= main_~i~0 8)} assume true; {13516#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:58,982 INFO L273 TraceCheckUtils]: 23: Hoare triple {13516#(<= 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; {13517#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:58,983 INFO L273 TraceCheckUtils]: 24: Hoare triple {13517#(<= main_~i~0 9)} assume true; {13517#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:58,984 INFO L273 TraceCheckUtils]: 25: Hoare triple {13517#(<= 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; {13518#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:58,984 INFO L273 TraceCheckUtils]: 26: Hoare triple {13518#(<= main_~i~0 10)} assume true; {13518#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:58,985 INFO L273 TraceCheckUtils]: 27: Hoare triple {13518#(<= 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; {13519#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:58,986 INFO L273 TraceCheckUtils]: 28: Hoare triple {13519#(<= main_~i~0 11)} assume true; {13519#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:58,986 INFO L273 TraceCheckUtils]: 29: Hoare triple {13519#(<= 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; {13520#(<= main_~i~0 12)} is VALID [2018-11-18 22:55:58,987 INFO L273 TraceCheckUtils]: 30: Hoare triple {13520#(<= main_~i~0 12)} assume true; {13520#(<= main_~i~0 12)} is VALID [2018-11-18 22:55:58,988 INFO L273 TraceCheckUtils]: 31: Hoare triple {13520#(<= 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; {13521#(<= main_~i~0 13)} is VALID [2018-11-18 22:55:58,988 INFO L273 TraceCheckUtils]: 32: Hoare triple {13521#(<= main_~i~0 13)} assume true; {13521#(<= main_~i~0 13)} is VALID [2018-11-18 22:55:58,989 INFO L273 TraceCheckUtils]: 33: Hoare triple {13521#(<= 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; {13522#(<= main_~i~0 14)} is VALID [2018-11-18 22:55:58,990 INFO L273 TraceCheckUtils]: 34: Hoare triple {13522#(<= main_~i~0 14)} assume true; {13522#(<= main_~i~0 14)} is VALID [2018-11-18 22:55:59,009 INFO L273 TraceCheckUtils]: 35: Hoare triple {13522#(<= 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; {13523#(<= main_~i~0 15)} is VALID [2018-11-18 22:55:59,009 INFO L273 TraceCheckUtils]: 36: Hoare triple {13523#(<= main_~i~0 15)} assume true; {13523#(<= main_~i~0 15)} is VALID [2018-11-18 22:55:59,010 INFO L273 TraceCheckUtils]: 37: Hoare triple {13523#(<= 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; {13524#(<= main_~i~0 16)} is VALID [2018-11-18 22:55:59,010 INFO L273 TraceCheckUtils]: 38: Hoare triple {13524#(<= main_~i~0 16)} assume true; {13524#(<= main_~i~0 16)} is VALID [2018-11-18 22:55:59,010 INFO L273 TraceCheckUtils]: 39: Hoare triple {13524#(<= main_~i~0 16)} assume !(~i~0 < 100000); {13507#false} is VALID [2018-11-18 22:55:59,011 INFO L273 TraceCheckUtils]: 40: Hoare triple {13507#false} ~i~0 := 0; {13507#false} is VALID [2018-11-18 22:55:59,011 INFO L273 TraceCheckUtils]: 41: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,011 INFO L273 TraceCheckUtils]: 42: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,011 INFO L273 TraceCheckUtils]: 43: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,011 INFO L273 TraceCheckUtils]: 44: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,011 INFO L273 TraceCheckUtils]: 45: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,011 INFO L273 TraceCheckUtils]: 46: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,011 INFO L273 TraceCheckUtils]: 47: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,012 INFO L273 TraceCheckUtils]: 48: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,012 INFO L273 TraceCheckUtils]: 49: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,012 INFO L273 TraceCheckUtils]: 50: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,012 INFO L273 TraceCheckUtils]: 51: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,012 INFO L273 TraceCheckUtils]: 52: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,012 INFO L273 TraceCheckUtils]: 53: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,012 INFO L273 TraceCheckUtils]: 54: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,013 INFO L273 TraceCheckUtils]: 55: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,013 INFO L273 TraceCheckUtils]: 56: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,013 INFO L273 TraceCheckUtils]: 57: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,013 INFO L273 TraceCheckUtils]: 58: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,013 INFO L273 TraceCheckUtils]: 59: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,013 INFO L273 TraceCheckUtils]: 60: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,014 INFO L273 TraceCheckUtils]: 61: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,014 INFO L273 TraceCheckUtils]: 62: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,014 INFO L273 TraceCheckUtils]: 63: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,014 INFO L273 TraceCheckUtils]: 64: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,014 INFO L273 TraceCheckUtils]: 65: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,014 INFO L273 TraceCheckUtils]: 66: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,015 INFO L273 TraceCheckUtils]: 67: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,015 INFO L273 TraceCheckUtils]: 68: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,015 INFO L273 TraceCheckUtils]: 69: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,015 INFO L273 TraceCheckUtils]: 70: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,015 INFO L273 TraceCheckUtils]: 71: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,015 INFO L273 TraceCheckUtils]: 72: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,016 INFO L273 TraceCheckUtils]: 73: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,016 INFO L273 TraceCheckUtils]: 74: Hoare triple {13507#false} assume !(~i~0 < 100000); {13507#false} is VALID [2018-11-18 22:55:59,016 INFO L273 TraceCheckUtils]: 75: Hoare triple {13507#false} ~i~0 := 0; {13507#false} is VALID [2018-11-18 22:55:59,016 INFO L273 TraceCheckUtils]: 76: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,016 INFO L273 TraceCheckUtils]: 77: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,016 INFO L273 TraceCheckUtils]: 78: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,017 INFO L273 TraceCheckUtils]: 79: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,017 INFO L273 TraceCheckUtils]: 80: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,017 INFO L273 TraceCheckUtils]: 81: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,017 INFO L273 TraceCheckUtils]: 82: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,017 INFO L273 TraceCheckUtils]: 83: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,017 INFO L273 TraceCheckUtils]: 84: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,018 INFO L273 TraceCheckUtils]: 85: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,018 INFO L273 TraceCheckUtils]: 86: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,018 INFO L273 TraceCheckUtils]: 87: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,018 INFO L273 TraceCheckUtils]: 88: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,018 INFO L273 TraceCheckUtils]: 89: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,018 INFO L273 TraceCheckUtils]: 90: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,019 INFO L273 TraceCheckUtils]: 91: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,019 INFO L273 TraceCheckUtils]: 92: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,019 INFO L273 TraceCheckUtils]: 93: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,019 INFO L273 TraceCheckUtils]: 94: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,019 INFO L273 TraceCheckUtils]: 95: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,019 INFO L273 TraceCheckUtils]: 96: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,020 INFO L273 TraceCheckUtils]: 97: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,020 INFO L273 TraceCheckUtils]: 98: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,020 INFO L273 TraceCheckUtils]: 99: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,020 INFO L273 TraceCheckUtils]: 100: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,020 INFO L273 TraceCheckUtils]: 101: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,020 INFO L273 TraceCheckUtils]: 102: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,021 INFO L273 TraceCheckUtils]: 103: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,021 INFO L273 TraceCheckUtils]: 104: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,021 INFO L273 TraceCheckUtils]: 105: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,021 INFO L273 TraceCheckUtils]: 106: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,021 INFO L273 TraceCheckUtils]: 107: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,021 INFO L273 TraceCheckUtils]: 108: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,021 INFO L273 TraceCheckUtils]: 109: Hoare triple {13507#false} assume !(~i~0 < 100000); {13507#false} is VALID [2018-11-18 22:55:59,022 INFO L273 TraceCheckUtils]: 110: Hoare triple {13507#false} ~i~0 := 0; {13507#false} is VALID [2018-11-18 22:55:59,022 INFO L273 TraceCheckUtils]: 111: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,022 INFO L273 TraceCheckUtils]: 112: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,022 INFO L273 TraceCheckUtils]: 113: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,022 INFO L273 TraceCheckUtils]: 114: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,022 INFO L273 TraceCheckUtils]: 115: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,023 INFO L273 TraceCheckUtils]: 116: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,023 INFO L273 TraceCheckUtils]: 117: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,023 INFO L273 TraceCheckUtils]: 118: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,023 INFO L273 TraceCheckUtils]: 119: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,023 INFO L273 TraceCheckUtils]: 120: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,023 INFO L273 TraceCheckUtils]: 121: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,024 INFO L273 TraceCheckUtils]: 122: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,024 INFO L273 TraceCheckUtils]: 123: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,024 INFO L273 TraceCheckUtils]: 124: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,024 INFO L273 TraceCheckUtils]: 125: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,024 INFO L273 TraceCheckUtils]: 126: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,024 INFO L273 TraceCheckUtils]: 127: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,025 INFO L273 TraceCheckUtils]: 128: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,025 INFO L273 TraceCheckUtils]: 129: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,025 INFO L273 TraceCheckUtils]: 130: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,025 INFO L273 TraceCheckUtils]: 131: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,025 INFO L273 TraceCheckUtils]: 132: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,025 INFO L273 TraceCheckUtils]: 133: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,025 INFO L273 TraceCheckUtils]: 134: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,026 INFO L273 TraceCheckUtils]: 135: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,026 INFO L273 TraceCheckUtils]: 136: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,026 INFO L273 TraceCheckUtils]: 137: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,026 INFO L273 TraceCheckUtils]: 138: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,026 INFO L273 TraceCheckUtils]: 139: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,026 INFO L273 TraceCheckUtils]: 140: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,027 INFO L273 TraceCheckUtils]: 141: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,027 INFO L273 TraceCheckUtils]: 142: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,027 INFO L273 TraceCheckUtils]: 143: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,027 INFO L273 TraceCheckUtils]: 144: Hoare triple {13507#false} assume !(~i~0 < 100000); {13507#false} is VALID [2018-11-18 22:55:59,027 INFO L273 TraceCheckUtils]: 145: Hoare triple {13507#false} havoc ~x~0;~x~0 := 0; {13507#false} is VALID [2018-11-18 22:55:59,027 INFO L273 TraceCheckUtils]: 146: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,028 INFO L273 TraceCheckUtils]: 147: Hoare triple {13507#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {13507#false} is VALID [2018-11-18 22:55:59,028 INFO L256 TraceCheckUtils]: 148: Hoare triple {13507#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {13507#false} is VALID [2018-11-18 22:55:59,028 INFO L273 TraceCheckUtils]: 149: Hoare triple {13507#false} ~cond := #in~cond; {13507#false} is VALID [2018-11-18 22:55:59,028 INFO L273 TraceCheckUtils]: 150: Hoare triple {13507#false} assume 0 == ~cond; {13507#false} is VALID [2018-11-18 22:55:59,028 INFO L273 TraceCheckUtils]: 151: Hoare triple {13507#false} assume !false; {13507#false} is VALID [2018-11-18 22:55:59,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 816 trivial. 0 not checked. [2018-11-18 22:55:59,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:55:59,041 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-18 22:55:59,050 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:55:59,104 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:55:59,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:55:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:55:59,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:55:59,462 INFO L256 TraceCheckUtils]: 0: Hoare triple {13506#true} call ULTIMATE.init(); {13506#true} is VALID [2018-11-18 22:55:59,462 INFO L273 TraceCheckUtils]: 1: Hoare triple {13506#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13506#true} is VALID [2018-11-18 22:55:59,463 INFO L273 TraceCheckUtils]: 2: Hoare triple {13506#true} assume true; {13506#true} is VALID [2018-11-18 22:55:59,463 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13506#true} {13506#true} #92#return; {13506#true} is VALID [2018-11-18 22:55:59,463 INFO L256 TraceCheckUtils]: 4: Hoare triple {13506#true} call #t~ret2 := main(); {13506#true} is VALID [2018-11-18 22:55:59,463 INFO L273 TraceCheckUtils]: 5: Hoare triple {13506#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {13543#(<= main_~i~0 0)} is VALID [2018-11-18 22:55:59,464 INFO L273 TraceCheckUtils]: 6: Hoare triple {13543#(<= main_~i~0 0)} assume true; {13543#(<= main_~i~0 0)} is VALID [2018-11-18 22:55:59,464 INFO L273 TraceCheckUtils]: 7: Hoare triple {13543#(<= 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; {13509#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:59,465 INFO L273 TraceCheckUtils]: 8: Hoare triple {13509#(<= main_~i~0 1)} assume true; {13509#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:59,465 INFO L273 TraceCheckUtils]: 9: Hoare triple {13509#(<= 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; {13510#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:59,466 INFO L273 TraceCheckUtils]: 10: Hoare triple {13510#(<= main_~i~0 2)} assume true; {13510#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:59,467 INFO L273 TraceCheckUtils]: 11: Hoare triple {13510#(<= 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; {13511#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:59,467 INFO L273 TraceCheckUtils]: 12: Hoare triple {13511#(<= main_~i~0 3)} assume true; {13511#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:59,468 INFO L273 TraceCheckUtils]: 13: Hoare triple {13511#(<= 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; {13512#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:59,468 INFO L273 TraceCheckUtils]: 14: Hoare triple {13512#(<= main_~i~0 4)} assume true; {13512#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:59,469 INFO L273 TraceCheckUtils]: 15: Hoare triple {13512#(<= 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; {13513#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:59,470 INFO L273 TraceCheckUtils]: 16: Hoare triple {13513#(<= main_~i~0 5)} assume true; {13513#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:59,471 INFO L273 TraceCheckUtils]: 17: Hoare triple {13513#(<= 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; {13514#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:59,471 INFO L273 TraceCheckUtils]: 18: Hoare triple {13514#(<= main_~i~0 6)} assume true; {13514#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:59,472 INFO L273 TraceCheckUtils]: 19: Hoare triple {13514#(<= 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; {13515#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:59,472 INFO L273 TraceCheckUtils]: 20: Hoare triple {13515#(<= main_~i~0 7)} assume true; {13515#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:59,473 INFO L273 TraceCheckUtils]: 21: Hoare triple {13515#(<= 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; {13516#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:59,474 INFO L273 TraceCheckUtils]: 22: Hoare triple {13516#(<= main_~i~0 8)} assume true; {13516#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:59,475 INFO L273 TraceCheckUtils]: 23: Hoare triple {13516#(<= 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; {13517#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:59,475 INFO L273 TraceCheckUtils]: 24: Hoare triple {13517#(<= main_~i~0 9)} assume true; {13517#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:59,476 INFO L273 TraceCheckUtils]: 25: Hoare triple {13517#(<= 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; {13518#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:59,476 INFO L273 TraceCheckUtils]: 26: Hoare triple {13518#(<= main_~i~0 10)} assume true; {13518#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:59,477 INFO L273 TraceCheckUtils]: 27: Hoare triple {13518#(<= 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; {13519#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:59,478 INFO L273 TraceCheckUtils]: 28: Hoare triple {13519#(<= main_~i~0 11)} assume true; {13519#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:59,479 INFO L273 TraceCheckUtils]: 29: Hoare triple {13519#(<= 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; {13520#(<= main_~i~0 12)} is VALID [2018-11-18 22:55:59,479 INFO L273 TraceCheckUtils]: 30: Hoare triple {13520#(<= main_~i~0 12)} assume true; {13520#(<= main_~i~0 12)} is VALID [2018-11-18 22:55:59,480 INFO L273 TraceCheckUtils]: 31: Hoare triple {13520#(<= 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; {13521#(<= main_~i~0 13)} is VALID [2018-11-18 22:55:59,480 INFO L273 TraceCheckUtils]: 32: Hoare triple {13521#(<= main_~i~0 13)} assume true; {13521#(<= main_~i~0 13)} is VALID [2018-11-18 22:55:59,481 INFO L273 TraceCheckUtils]: 33: Hoare triple {13521#(<= 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; {13522#(<= main_~i~0 14)} is VALID [2018-11-18 22:55:59,482 INFO L273 TraceCheckUtils]: 34: Hoare triple {13522#(<= main_~i~0 14)} assume true; {13522#(<= main_~i~0 14)} is VALID [2018-11-18 22:55:59,483 INFO L273 TraceCheckUtils]: 35: Hoare triple {13522#(<= 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; {13523#(<= main_~i~0 15)} is VALID [2018-11-18 22:55:59,483 INFO L273 TraceCheckUtils]: 36: Hoare triple {13523#(<= main_~i~0 15)} assume true; {13523#(<= main_~i~0 15)} is VALID [2018-11-18 22:55:59,484 INFO L273 TraceCheckUtils]: 37: Hoare triple {13523#(<= 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; {13524#(<= main_~i~0 16)} is VALID [2018-11-18 22:55:59,484 INFO L273 TraceCheckUtils]: 38: Hoare triple {13524#(<= main_~i~0 16)} assume true; {13524#(<= main_~i~0 16)} is VALID [2018-11-18 22:55:59,485 INFO L273 TraceCheckUtils]: 39: Hoare triple {13524#(<= main_~i~0 16)} assume !(~i~0 < 100000); {13507#false} is VALID [2018-11-18 22:55:59,485 INFO L273 TraceCheckUtils]: 40: Hoare triple {13507#false} ~i~0 := 0; {13507#false} is VALID [2018-11-18 22:55:59,485 INFO L273 TraceCheckUtils]: 41: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,486 INFO L273 TraceCheckUtils]: 42: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,486 INFO L273 TraceCheckUtils]: 43: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,486 INFO L273 TraceCheckUtils]: 44: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,486 INFO L273 TraceCheckUtils]: 45: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,486 INFO L273 TraceCheckUtils]: 46: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,487 INFO L273 TraceCheckUtils]: 47: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,487 INFO L273 TraceCheckUtils]: 48: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,487 INFO L273 TraceCheckUtils]: 49: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,487 INFO L273 TraceCheckUtils]: 50: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,487 INFO L273 TraceCheckUtils]: 51: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,487 INFO L273 TraceCheckUtils]: 52: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,488 INFO L273 TraceCheckUtils]: 53: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,488 INFO L273 TraceCheckUtils]: 54: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,488 INFO L273 TraceCheckUtils]: 55: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,488 INFO L273 TraceCheckUtils]: 56: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,488 INFO L273 TraceCheckUtils]: 57: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,488 INFO L273 TraceCheckUtils]: 58: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,488 INFO L273 TraceCheckUtils]: 59: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,489 INFO L273 TraceCheckUtils]: 60: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,489 INFO L273 TraceCheckUtils]: 61: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,489 INFO L273 TraceCheckUtils]: 62: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,489 INFO L273 TraceCheckUtils]: 63: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,489 INFO L273 TraceCheckUtils]: 64: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,489 INFO L273 TraceCheckUtils]: 65: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,489 INFO L273 TraceCheckUtils]: 66: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,489 INFO L273 TraceCheckUtils]: 67: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,489 INFO L273 TraceCheckUtils]: 68: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,490 INFO L273 TraceCheckUtils]: 69: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,490 INFO L273 TraceCheckUtils]: 70: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,490 INFO L273 TraceCheckUtils]: 71: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,490 INFO L273 TraceCheckUtils]: 72: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,490 INFO L273 TraceCheckUtils]: 73: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,490 INFO L273 TraceCheckUtils]: 74: Hoare triple {13507#false} assume !(~i~0 < 100000); {13507#false} is VALID [2018-11-18 22:55:59,490 INFO L273 TraceCheckUtils]: 75: Hoare triple {13507#false} ~i~0 := 0; {13507#false} is VALID [2018-11-18 22:55:59,490 INFO L273 TraceCheckUtils]: 76: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,490 INFO L273 TraceCheckUtils]: 77: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,491 INFO L273 TraceCheckUtils]: 78: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,491 INFO L273 TraceCheckUtils]: 79: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,491 INFO L273 TraceCheckUtils]: 80: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,491 INFO L273 TraceCheckUtils]: 81: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,491 INFO L273 TraceCheckUtils]: 82: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,491 INFO L273 TraceCheckUtils]: 83: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,491 INFO L273 TraceCheckUtils]: 84: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,491 INFO L273 TraceCheckUtils]: 85: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,491 INFO L273 TraceCheckUtils]: 86: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,492 INFO L273 TraceCheckUtils]: 87: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,492 INFO L273 TraceCheckUtils]: 88: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,492 INFO L273 TraceCheckUtils]: 89: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,492 INFO L273 TraceCheckUtils]: 90: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,492 INFO L273 TraceCheckUtils]: 91: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,492 INFO L273 TraceCheckUtils]: 92: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,492 INFO L273 TraceCheckUtils]: 93: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,492 INFO L273 TraceCheckUtils]: 94: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,492 INFO L273 TraceCheckUtils]: 95: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,493 INFO L273 TraceCheckUtils]: 96: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,493 INFO L273 TraceCheckUtils]: 97: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,493 INFO L273 TraceCheckUtils]: 98: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,493 INFO L273 TraceCheckUtils]: 99: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,493 INFO L273 TraceCheckUtils]: 100: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,493 INFO L273 TraceCheckUtils]: 101: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,493 INFO L273 TraceCheckUtils]: 102: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,493 INFO L273 TraceCheckUtils]: 103: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,493 INFO L273 TraceCheckUtils]: 104: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,494 INFO L273 TraceCheckUtils]: 105: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,494 INFO L273 TraceCheckUtils]: 106: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,494 INFO L273 TraceCheckUtils]: 107: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,494 INFO L273 TraceCheckUtils]: 108: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,494 INFO L273 TraceCheckUtils]: 109: Hoare triple {13507#false} assume !(~i~0 < 100000); {13507#false} is VALID [2018-11-18 22:55:59,494 INFO L273 TraceCheckUtils]: 110: Hoare triple {13507#false} ~i~0 := 0; {13507#false} is VALID [2018-11-18 22:55:59,494 INFO L273 TraceCheckUtils]: 111: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,494 INFO L273 TraceCheckUtils]: 112: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,495 INFO L273 TraceCheckUtils]: 113: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,495 INFO L273 TraceCheckUtils]: 114: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,495 INFO L273 TraceCheckUtils]: 115: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,495 INFO L273 TraceCheckUtils]: 116: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,495 INFO L273 TraceCheckUtils]: 117: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,495 INFO L273 TraceCheckUtils]: 118: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,495 INFO L273 TraceCheckUtils]: 119: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,495 INFO L273 TraceCheckUtils]: 120: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,495 INFO L273 TraceCheckUtils]: 121: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,496 INFO L273 TraceCheckUtils]: 122: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,496 INFO L273 TraceCheckUtils]: 123: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,496 INFO L273 TraceCheckUtils]: 124: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,496 INFO L273 TraceCheckUtils]: 125: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,496 INFO L273 TraceCheckUtils]: 126: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,496 INFO L273 TraceCheckUtils]: 127: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,496 INFO L273 TraceCheckUtils]: 128: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,496 INFO L273 TraceCheckUtils]: 129: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,496 INFO L273 TraceCheckUtils]: 130: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,497 INFO L273 TraceCheckUtils]: 131: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,497 INFO L273 TraceCheckUtils]: 132: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,497 INFO L273 TraceCheckUtils]: 133: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,497 INFO L273 TraceCheckUtils]: 134: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,497 INFO L273 TraceCheckUtils]: 135: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,497 INFO L273 TraceCheckUtils]: 136: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,497 INFO L273 TraceCheckUtils]: 137: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,497 INFO L273 TraceCheckUtils]: 138: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,497 INFO L273 TraceCheckUtils]: 139: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,498 INFO L273 TraceCheckUtils]: 140: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,498 INFO L273 TraceCheckUtils]: 141: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,498 INFO L273 TraceCheckUtils]: 142: Hoare triple {13507#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13507#false} is VALID [2018-11-18 22:55:59,498 INFO L273 TraceCheckUtils]: 143: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,498 INFO L273 TraceCheckUtils]: 144: Hoare triple {13507#false} assume !(~i~0 < 100000); {13507#false} is VALID [2018-11-18 22:55:59,498 INFO L273 TraceCheckUtils]: 145: Hoare triple {13507#false} havoc ~x~0;~x~0 := 0; {13507#false} is VALID [2018-11-18 22:55:59,498 INFO L273 TraceCheckUtils]: 146: Hoare triple {13507#false} assume true; {13507#false} is VALID [2018-11-18 22:55:59,498 INFO L273 TraceCheckUtils]: 147: Hoare triple {13507#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {13507#false} is VALID [2018-11-18 22:55:59,498 INFO L256 TraceCheckUtils]: 148: Hoare triple {13507#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {13507#false} is VALID [2018-11-18 22:55:59,499 INFO L273 TraceCheckUtils]: 149: Hoare triple {13507#false} ~cond := #in~cond; {13507#false} is VALID [2018-11-18 22:55:59,499 INFO L273 TraceCheckUtils]: 150: Hoare triple {13507#false} assume 0 == ~cond; {13507#false} is VALID [2018-11-18 22:55:59,499 INFO L273 TraceCheckUtils]: 151: Hoare triple {13507#false} assume !false; {13507#false} is VALID [2018-11-18 22:55:59,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 816 trivial. 0 not checked. [2018-11-18 22:55:59,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:55:59,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-18 22:55:59,528 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 152 [2018-11-18 22:55:59,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:55:59,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-18 22:55:59,595 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:55:59,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 22:55:59,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 22:55:59,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-18 22:55:59,596 INFO L87 Difference]: Start difference. First operand 157 states and 161 transitions. Second operand 20 states. [2018-11-18 22:56:00,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:00,341 INFO L93 Difference]: Finished difference Result 282 states and 293 transitions. [2018-11-18 22:56:00,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 22:56:00,341 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 152 [2018-11-18 22:56:00,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:00,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 22:56:00,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2018-11-18 22:56:00,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 22:56:00,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2018-11-18 22:56:00,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 197 transitions. [2018-11-18 22:56:00,517 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:00,520 INFO L225 Difference]: With dead ends: 282 [2018-11-18 22:56:00,520 INFO L226 Difference]: Without dead ends: 165 [2018-11-18 22:56:00,521 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-18 22:56:00,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-18 22:56:00,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-11-18 22:56:00,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:00,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand 165 states. [2018-11-18 22:56:00,579 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 165 states. [2018-11-18 22:56:00,580 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 165 states. [2018-11-18 22:56:00,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:00,583 INFO L93 Difference]: Finished difference Result 165 states and 169 transitions. [2018-11-18 22:56:00,583 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2018-11-18 22:56:00,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:00,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:00,583 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 165 states. [2018-11-18 22:56:00,583 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 165 states. [2018-11-18 22:56:00,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:00,586 INFO L93 Difference]: Finished difference Result 165 states and 169 transitions. [2018-11-18 22:56:00,586 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2018-11-18 22:56:00,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:00,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:00,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:00,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:00,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-18 22:56:00,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 169 transitions. [2018-11-18 22:56:00,589 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 169 transitions. Word has length 152 [2018-11-18 22:56:00,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:00,589 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 169 transitions. [2018-11-18 22:56:00,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 22:56:00,590 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2018-11-18 22:56:00,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-18 22:56:00,591 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:00,591 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:00,591 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:00,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:00,591 INFO L82 PathProgramCache]: Analyzing trace with hash 2023089789, now seen corresponding path program 17 times [2018-11-18 22:56:00,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:00,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:00,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:00,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:56:00,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:01,740 INFO L256 TraceCheckUtils]: 0: Hoare triple {14970#true} call ULTIMATE.init(); {14970#true} is VALID [2018-11-18 22:56:01,741 INFO L273 TraceCheckUtils]: 1: Hoare triple {14970#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14970#true} is VALID [2018-11-18 22:56:01,741 INFO L273 TraceCheckUtils]: 2: Hoare triple {14970#true} assume true; {14970#true} is VALID [2018-11-18 22:56:01,741 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14970#true} {14970#true} #92#return; {14970#true} is VALID [2018-11-18 22:56:01,741 INFO L256 TraceCheckUtils]: 4: Hoare triple {14970#true} call #t~ret2 := main(); {14970#true} is VALID [2018-11-18 22:56:01,742 INFO L273 TraceCheckUtils]: 5: Hoare triple {14970#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {14972#(= main_~i~0 0)} is VALID [2018-11-18 22:56:01,742 INFO L273 TraceCheckUtils]: 6: Hoare triple {14972#(= main_~i~0 0)} assume true; {14972#(= main_~i~0 0)} is VALID [2018-11-18 22:56:01,743 INFO L273 TraceCheckUtils]: 7: Hoare triple {14972#(= 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; {14973#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:01,744 INFO L273 TraceCheckUtils]: 8: Hoare triple {14973#(<= main_~i~0 1)} assume true; {14973#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:01,744 INFO L273 TraceCheckUtils]: 9: Hoare triple {14973#(<= 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; {14974#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:01,745 INFO L273 TraceCheckUtils]: 10: Hoare triple {14974#(<= main_~i~0 2)} assume true; {14974#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:01,746 INFO L273 TraceCheckUtils]: 11: Hoare triple {14974#(<= 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; {14975#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:01,747 INFO L273 TraceCheckUtils]: 12: Hoare triple {14975#(<= main_~i~0 3)} assume true; {14975#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:01,748 INFO L273 TraceCheckUtils]: 13: Hoare triple {14975#(<= 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; {14976#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:01,748 INFO L273 TraceCheckUtils]: 14: Hoare triple {14976#(<= main_~i~0 4)} assume true; {14976#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:01,749 INFO L273 TraceCheckUtils]: 15: Hoare triple {14976#(<= 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; {14977#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:01,750 INFO L273 TraceCheckUtils]: 16: Hoare triple {14977#(<= main_~i~0 5)} assume true; {14977#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:01,751 INFO L273 TraceCheckUtils]: 17: Hoare triple {14977#(<= 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; {14978#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:01,751 INFO L273 TraceCheckUtils]: 18: Hoare triple {14978#(<= main_~i~0 6)} assume true; {14978#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:01,752 INFO L273 TraceCheckUtils]: 19: Hoare triple {14978#(<= 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; {14979#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:01,752 INFO L273 TraceCheckUtils]: 20: Hoare triple {14979#(<= main_~i~0 7)} assume true; {14979#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:01,753 INFO L273 TraceCheckUtils]: 21: Hoare triple {14979#(<= 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; {14980#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:01,754 INFO L273 TraceCheckUtils]: 22: Hoare triple {14980#(<= main_~i~0 8)} assume true; {14980#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:01,755 INFO L273 TraceCheckUtils]: 23: Hoare triple {14980#(<= 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; {14981#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:01,755 INFO L273 TraceCheckUtils]: 24: Hoare triple {14981#(<= main_~i~0 9)} assume true; {14981#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:01,756 INFO L273 TraceCheckUtils]: 25: Hoare triple {14981#(<= 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; {14982#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:01,756 INFO L273 TraceCheckUtils]: 26: Hoare triple {14982#(<= main_~i~0 10)} assume true; {14982#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:01,757 INFO L273 TraceCheckUtils]: 27: Hoare triple {14982#(<= 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; {14983#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:01,758 INFO L273 TraceCheckUtils]: 28: Hoare triple {14983#(<= main_~i~0 11)} assume true; {14983#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:01,759 INFO L273 TraceCheckUtils]: 29: Hoare triple {14983#(<= 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; {14984#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:01,759 INFO L273 TraceCheckUtils]: 30: Hoare triple {14984#(<= main_~i~0 12)} assume true; {14984#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:01,760 INFO L273 TraceCheckUtils]: 31: Hoare triple {14984#(<= 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; {14985#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:01,760 INFO L273 TraceCheckUtils]: 32: Hoare triple {14985#(<= main_~i~0 13)} assume true; {14985#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:01,761 INFO L273 TraceCheckUtils]: 33: Hoare triple {14985#(<= 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; {14986#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:01,762 INFO L273 TraceCheckUtils]: 34: Hoare triple {14986#(<= main_~i~0 14)} assume true; {14986#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:01,763 INFO L273 TraceCheckUtils]: 35: Hoare triple {14986#(<= 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; {14987#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:01,763 INFO L273 TraceCheckUtils]: 36: Hoare triple {14987#(<= main_~i~0 15)} assume true; {14987#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:01,764 INFO L273 TraceCheckUtils]: 37: Hoare triple {14987#(<= 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; {14988#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:01,764 INFO L273 TraceCheckUtils]: 38: Hoare triple {14988#(<= main_~i~0 16)} assume true; {14988#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:01,765 INFO L273 TraceCheckUtils]: 39: Hoare triple {14988#(<= 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; {14989#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:01,766 INFO L273 TraceCheckUtils]: 40: Hoare triple {14989#(<= main_~i~0 17)} assume true; {14989#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:01,766 INFO L273 TraceCheckUtils]: 41: Hoare triple {14989#(<= main_~i~0 17)} assume !(~i~0 < 100000); {14971#false} is VALID [2018-11-18 22:56:01,767 INFO L273 TraceCheckUtils]: 42: Hoare triple {14971#false} ~i~0 := 0; {14971#false} is VALID [2018-11-18 22:56:01,767 INFO L273 TraceCheckUtils]: 43: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,767 INFO L273 TraceCheckUtils]: 44: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,767 INFO L273 TraceCheckUtils]: 45: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,767 INFO L273 TraceCheckUtils]: 46: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,767 INFO L273 TraceCheckUtils]: 47: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,768 INFO L273 TraceCheckUtils]: 48: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,768 INFO L273 TraceCheckUtils]: 49: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,768 INFO L273 TraceCheckUtils]: 50: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,768 INFO L273 TraceCheckUtils]: 51: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,768 INFO L273 TraceCheckUtils]: 52: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,769 INFO L273 TraceCheckUtils]: 53: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,769 INFO L273 TraceCheckUtils]: 54: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,769 INFO L273 TraceCheckUtils]: 55: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,769 INFO L273 TraceCheckUtils]: 56: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,769 INFO L273 TraceCheckUtils]: 57: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,769 INFO L273 TraceCheckUtils]: 58: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,770 INFO L273 TraceCheckUtils]: 59: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,770 INFO L273 TraceCheckUtils]: 60: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,770 INFO L273 TraceCheckUtils]: 61: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,770 INFO L273 TraceCheckUtils]: 62: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,770 INFO L273 TraceCheckUtils]: 63: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,770 INFO L273 TraceCheckUtils]: 64: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,771 INFO L273 TraceCheckUtils]: 65: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,771 INFO L273 TraceCheckUtils]: 66: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,771 INFO L273 TraceCheckUtils]: 67: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,771 INFO L273 TraceCheckUtils]: 68: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,771 INFO L273 TraceCheckUtils]: 69: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,771 INFO L273 TraceCheckUtils]: 70: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,771 INFO L273 TraceCheckUtils]: 71: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,771 INFO L273 TraceCheckUtils]: 72: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,771 INFO L273 TraceCheckUtils]: 73: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,772 INFO L273 TraceCheckUtils]: 74: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,772 INFO L273 TraceCheckUtils]: 75: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,772 INFO L273 TraceCheckUtils]: 76: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,772 INFO L273 TraceCheckUtils]: 77: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,772 INFO L273 TraceCheckUtils]: 78: Hoare triple {14971#false} assume !(~i~0 < 100000); {14971#false} is VALID [2018-11-18 22:56:01,772 INFO L273 TraceCheckUtils]: 79: Hoare triple {14971#false} ~i~0 := 0; {14971#false} is VALID [2018-11-18 22:56:01,772 INFO L273 TraceCheckUtils]: 80: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,772 INFO L273 TraceCheckUtils]: 81: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,772 INFO L273 TraceCheckUtils]: 82: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,773 INFO L273 TraceCheckUtils]: 83: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,773 INFO L273 TraceCheckUtils]: 84: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,773 INFO L273 TraceCheckUtils]: 85: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,773 INFO L273 TraceCheckUtils]: 86: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,773 INFO L273 TraceCheckUtils]: 87: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,773 INFO L273 TraceCheckUtils]: 88: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,773 INFO L273 TraceCheckUtils]: 89: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,773 INFO L273 TraceCheckUtils]: 90: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,774 INFO L273 TraceCheckUtils]: 91: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,774 INFO L273 TraceCheckUtils]: 92: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,774 INFO L273 TraceCheckUtils]: 93: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,774 INFO L273 TraceCheckUtils]: 94: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,774 INFO L273 TraceCheckUtils]: 95: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,774 INFO L273 TraceCheckUtils]: 96: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,774 INFO L273 TraceCheckUtils]: 97: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,774 INFO L273 TraceCheckUtils]: 98: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,774 INFO L273 TraceCheckUtils]: 99: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,775 INFO L273 TraceCheckUtils]: 100: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,775 INFO L273 TraceCheckUtils]: 101: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,775 INFO L273 TraceCheckUtils]: 102: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,775 INFO L273 TraceCheckUtils]: 103: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,775 INFO L273 TraceCheckUtils]: 104: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,775 INFO L273 TraceCheckUtils]: 105: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,775 INFO L273 TraceCheckUtils]: 106: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,775 INFO L273 TraceCheckUtils]: 107: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,775 INFO L273 TraceCheckUtils]: 108: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,776 INFO L273 TraceCheckUtils]: 109: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,776 INFO L273 TraceCheckUtils]: 110: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,776 INFO L273 TraceCheckUtils]: 111: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,776 INFO L273 TraceCheckUtils]: 112: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,776 INFO L273 TraceCheckUtils]: 113: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,776 INFO L273 TraceCheckUtils]: 114: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,776 INFO L273 TraceCheckUtils]: 115: Hoare triple {14971#false} assume !(~i~0 < 100000); {14971#false} is VALID [2018-11-18 22:56:01,776 INFO L273 TraceCheckUtils]: 116: Hoare triple {14971#false} ~i~0 := 0; {14971#false} is VALID [2018-11-18 22:56:01,776 INFO L273 TraceCheckUtils]: 117: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,777 INFO L273 TraceCheckUtils]: 118: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,777 INFO L273 TraceCheckUtils]: 119: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,777 INFO L273 TraceCheckUtils]: 120: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,777 INFO L273 TraceCheckUtils]: 121: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,777 INFO L273 TraceCheckUtils]: 122: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,777 INFO L273 TraceCheckUtils]: 123: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,777 INFO L273 TraceCheckUtils]: 124: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,777 INFO L273 TraceCheckUtils]: 125: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,777 INFO L273 TraceCheckUtils]: 126: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,778 INFO L273 TraceCheckUtils]: 127: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,778 INFO L273 TraceCheckUtils]: 128: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,778 INFO L273 TraceCheckUtils]: 129: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,778 INFO L273 TraceCheckUtils]: 130: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,778 INFO L273 TraceCheckUtils]: 131: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,778 INFO L273 TraceCheckUtils]: 132: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,778 INFO L273 TraceCheckUtils]: 133: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,778 INFO L273 TraceCheckUtils]: 134: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,778 INFO L273 TraceCheckUtils]: 135: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,779 INFO L273 TraceCheckUtils]: 136: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,779 INFO L273 TraceCheckUtils]: 137: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,779 INFO L273 TraceCheckUtils]: 138: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,779 INFO L273 TraceCheckUtils]: 139: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,779 INFO L273 TraceCheckUtils]: 140: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,779 INFO L273 TraceCheckUtils]: 141: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,779 INFO L273 TraceCheckUtils]: 142: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,779 INFO L273 TraceCheckUtils]: 143: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,779 INFO L273 TraceCheckUtils]: 144: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,780 INFO L273 TraceCheckUtils]: 145: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,780 INFO L273 TraceCheckUtils]: 146: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,780 INFO L273 TraceCheckUtils]: 147: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,780 INFO L273 TraceCheckUtils]: 148: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,780 INFO L273 TraceCheckUtils]: 149: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,780 INFO L273 TraceCheckUtils]: 150: Hoare triple {14971#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14971#false} is VALID [2018-11-18 22:56:01,780 INFO L273 TraceCheckUtils]: 151: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,780 INFO L273 TraceCheckUtils]: 152: Hoare triple {14971#false} assume !(~i~0 < 100000); {14971#false} is VALID [2018-11-18 22:56:01,780 INFO L273 TraceCheckUtils]: 153: Hoare triple {14971#false} havoc ~x~0;~x~0 := 0; {14971#false} is VALID [2018-11-18 22:56:01,781 INFO L273 TraceCheckUtils]: 154: Hoare triple {14971#false} assume true; {14971#false} is VALID [2018-11-18 22:56:01,781 INFO L273 TraceCheckUtils]: 155: Hoare triple {14971#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {14971#false} is VALID [2018-11-18 22:56:01,781 INFO L256 TraceCheckUtils]: 156: Hoare triple {14971#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {14971#false} is VALID [2018-11-18 22:56:01,781 INFO L273 TraceCheckUtils]: 157: Hoare triple {14971#false} ~cond := #in~cond; {14971#false} is VALID [2018-11-18 22:56:01,781 INFO L273 TraceCheckUtils]: 158: Hoare triple {14971#false} assume 0 == ~cond; {14971#false} is VALID [2018-11-18 22:56:01,781 INFO L273 TraceCheckUtils]: 159: Hoare triple {14971#false} assume !false; {14971#false} is VALID [2018-11-18 22:56:01,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1224 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 918 trivial. 0 not checked. [2018-11-18 22:56:01,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:01,792 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-18 22:56:01,801 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1