java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_init5_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:54:57,758 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:54:57,761 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:54:57,783 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:54:57,783 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:54:57,785 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:54:57,787 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:54:57,790 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:54:57,793 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:54:57,801 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:54:57,802 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:54:57,803 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:54:57,807 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:54:57,808 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:54:57,809 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:54:57,810 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:54:57,810 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:54:57,812 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:54:57,814 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:54:57,815 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:54:57,816 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:54:57,817 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:54:57,819 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:54:57,820 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:54:57,820 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:54:57,821 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:54:57,822 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:54:57,823 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:54:57,823 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:54:57,824 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:54:57,825 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:54:57,825 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:54:57,826 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:54:57,826 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:54:57,827 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:54:57,828 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:54:57,828 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 11:54:57,853 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:54:57,853 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:54:57,855 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:54:57,855 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:54:57,858 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:54:57,859 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:54:57,859 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:54:57,859 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:54:57,859 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:54:57,860 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:54:57,860 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:54:57,860 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:54:57,860 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:54:57,860 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:54:57,861 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:54:57,862 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:54:57,862 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:54:57,862 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:54:57,862 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:54:57,864 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:54:57,864 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:54:57,864 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:54:57,864 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:54:57,864 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:54:57,865 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:54:57,865 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:54:57,865 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:54:57,865 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:54:57,865 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:54:57,866 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:54:57,866 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:54:57,911 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:54:57,925 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:54:57,930 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:54:57,932 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:54:57,932 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:54:57,933 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init5_false-unreach-call_ground.i [2018-11-23 11:54:57,999 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0451b8ab3/f9f7d7c4163b4892a446b69f790746dc/FLAGc56f91fd3 [2018-11-23 11:54:58,504 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:54:58,505 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init5_false-unreach-call_ground.i [2018-11-23 11:54:58,512 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0451b8ab3/f9f7d7c4163b4892a446b69f790746dc/FLAGc56f91fd3 [2018-11-23 11:54:58,855 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0451b8ab3/f9f7d7c4163b4892a446b69f790746dc [2018-11-23 11:54:58,867 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:54:58,869 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:54:58,870 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:54:58,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:54:58,874 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:54:58,876 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:54:58" (1/1) ... [2018-11-23 11:54:58,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d94b8da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:58, skipping insertion in model container [2018-11-23 11:54:58,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:54:58" (1/1) ... [2018-11-23 11:54:58,890 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:54:58,916 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:54:59,160 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:54:59,165 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:54:59,195 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:54:59,220 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:54:59,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:59 WrapperNode [2018-11-23 11:54:59,220 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:54:59,222 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:54:59,222 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:54:59,222 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:54:59,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:59" (1/1) ... [2018-11-23 11:54:59,243 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:59" (1/1) ... [2018-11-23 11:54:59,252 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:54:59,252 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:54:59,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:54:59,252 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:54:59,264 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:59" (1/1) ... [2018-11-23 11:54:59,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:59" (1/1) ... [2018-11-23 11:54:59,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:59" (1/1) ... [2018-11-23 11:54:59,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:59" (1/1) ... [2018-11-23 11:54:59,277 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:59" (1/1) ... [2018-11-23 11:54:59,287 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:59" (1/1) ... [2018-11-23 11:54:59,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:59" (1/1) ... [2018-11-23 11:54:59,295 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:54:59,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:54:59,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:54:59,296 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:54:59,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:54:59,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:54:59,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:54:59,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:54:59,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:54:59,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:54:59,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:54:59,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:54:59,459 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:54:59,459 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:54:59,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:54:59,459 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:54:59,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:55:00,098 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:55:00,099 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 11:55:00,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:55:00 BoogieIcfgContainer [2018-11-23 11:55:00,099 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:55:00,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:55:00,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:55:00,105 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:55:00,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:54:58" (1/3) ... [2018-11-23 11:55:00,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe26220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:55:00, skipping insertion in model container [2018-11-23 11:55:00,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:59" (2/3) ... [2018-11-23 11:55:00,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe26220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:55:00, skipping insertion in model container [2018-11-23 11:55:00,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:55:00" (3/3) ... [2018-11-23 11:55:00,109 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_init5_false-unreach-call_ground.i [2018-11-23 11:55:00,120 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:55:00,129 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:55:00,147 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:55:00,181 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:55:00,182 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:55:00,182 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:55:00,182 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:55:00,182 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:55:00,183 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:55:00,183 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:55:00,183 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:55:00,183 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:55:00,201 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 11:55:00,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:55:00,208 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:00,209 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:00,211 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:00,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:00,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1721973062, now seen corresponding path program 1 times [2018-11-23 11:55:00,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:00,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:00,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:00,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:00,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:00,362 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 11:55:00,366 INFO L273 TraceCheckUtils]: 1: Hoare triple {34#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {34#true} is VALID [2018-11-23 11:55:00,367 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 11:55:00,368 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #100#return; {34#true} is VALID [2018-11-23 11:55:00,368 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret2 := main(); {34#true} is VALID [2018-11-23 11:55:00,369 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {34#true} is VALID [2018-11-23 11:55:00,370 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2018-11-23 11:55:00,371 INFO L273 TraceCheckUtils]: 7: Hoare triple {35#false} ~i~0 := 0; {35#false} is VALID [2018-11-23 11:55:00,371 INFO L273 TraceCheckUtils]: 8: Hoare triple {35#false} assume !(~i~0 < 100000); {35#false} is VALID [2018-11-23 11:55:00,371 INFO L273 TraceCheckUtils]: 9: Hoare triple {35#false} ~i~0 := 0; {35#false} is VALID [2018-11-23 11:55:00,372 INFO L273 TraceCheckUtils]: 10: Hoare triple {35#false} assume !(~i~0 < 100000); {35#false} is VALID [2018-11-23 11:55:00,372 INFO L273 TraceCheckUtils]: 11: Hoare triple {35#false} ~i~0 := 0; {35#false} is VALID [2018-11-23 11:55:00,372 INFO L273 TraceCheckUtils]: 12: Hoare triple {35#false} assume !(~i~0 < 100000); {35#false} is VALID [2018-11-23 11:55:00,373 INFO L273 TraceCheckUtils]: 13: Hoare triple {35#false} ~i~0 := 0; {35#false} is VALID [2018-11-23 11:55:00,373 INFO L273 TraceCheckUtils]: 14: Hoare triple {35#false} assume !(~i~0 < 100000); {35#false} is VALID [2018-11-23 11:55:00,375 INFO L273 TraceCheckUtils]: 15: Hoare triple {35#false} havoc ~x~0;~x~0 := 0; {35#false} is VALID [2018-11-23 11:55:00,376 INFO L273 TraceCheckUtils]: 16: Hoare triple {35#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {35#false} is VALID [2018-11-23 11:55:00,376 INFO L256 TraceCheckUtils]: 17: Hoare triple {35#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {35#false} is VALID [2018-11-23 11:55:00,376 INFO L273 TraceCheckUtils]: 18: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2018-11-23 11:55:00,377 INFO L273 TraceCheckUtils]: 19: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2018-11-23 11:55:00,377 INFO L273 TraceCheckUtils]: 20: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 11:55:00,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:00,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:55:00,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:55:00,397 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-23 11:55:00,402 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:00,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:55:00,603 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:00,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:55:00,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:55:00,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:55:00,614 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-23 11:55:00,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:00,922 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2018-11-23 11:55:00,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:55:00,923 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-23 11:55:00,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:00,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:55:00,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 78 transitions. [2018-11-23 11:55:00,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:55:00,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 78 transitions. [2018-11-23 11:55:00,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 78 transitions. [2018-11-23 11:55:01,206 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-23 11:55:01,219 INFO L225 Difference]: With dead ends: 55 [2018-11-23 11:55:01,219 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 11:55:01,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:55:01,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 11:55:01,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 11:55:01,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:01,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 11:55:01,271 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 11:55:01,271 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 11:55:01,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:01,275 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2018-11-23 11:55:01,275 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2018-11-23 11:55:01,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:01,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:01,276 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 11:55:01,277 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 11:55:01,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:01,281 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2018-11-23 11:55:01,281 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2018-11-23 11:55:01,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:01,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:01,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:01,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:01,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:55:01,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-11-23 11:55:01,287 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 21 [2018-11-23 11:55:01,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:01,287 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-23 11:55:01,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:55:01,288 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2018-11-23 11:55:01,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:55:01,289 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:01,289 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:01,289 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:01,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:01,290 INFO L82 PathProgramCache]: Analyzing trace with hash -13266878, now seen corresponding path program 1 times [2018-11-23 11:55:01,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:01,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:01,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:01,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:01,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:01,381 INFO L256 TraceCheckUtils]: 0: Hoare triple {202#true} call ULTIMATE.init(); {202#true} is VALID [2018-11-23 11:55:01,381 INFO L273 TraceCheckUtils]: 1: Hoare triple {202#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {202#true} is VALID [2018-11-23 11:55:01,382 INFO L273 TraceCheckUtils]: 2: Hoare triple {202#true} assume true; {202#true} is VALID [2018-11-23 11:55:01,382 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {202#true} {202#true} #100#return; {202#true} is VALID [2018-11-23 11:55:01,383 INFO L256 TraceCheckUtils]: 4: Hoare triple {202#true} call #t~ret2 := main(); {202#true} is VALID [2018-11-23 11:55:01,385 INFO L273 TraceCheckUtils]: 5: Hoare triple {202#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {204#(= main_~i~0 0)} is VALID [2018-11-23 11:55:01,393 INFO L273 TraceCheckUtils]: 6: Hoare triple {204#(= main_~i~0 0)} assume !(~i~0 < 100000); {203#false} is VALID [2018-11-23 11:55:01,394 INFO L273 TraceCheckUtils]: 7: Hoare triple {203#false} ~i~0 := 0; {203#false} is VALID [2018-11-23 11:55:01,394 INFO L273 TraceCheckUtils]: 8: Hoare triple {203#false} assume !(~i~0 < 100000); {203#false} is VALID [2018-11-23 11:55:01,395 INFO L273 TraceCheckUtils]: 9: Hoare triple {203#false} ~i~0 := 0; {203#false} is VALID [2018-11-23 11:55:01,395 INFO L273 TraceCheckUtils]: 10: Hoare triple {203#false} assume !(~i~0 < 100000); {203#false} is VALID [2018-11-23 11:55:01,395 INFO L273 TraceCheckUtils]: 11: Hoare triple {203#false} ~i~0 := 0; {203#false} is VALID [2018-11-23 11:55:01,395 INFO L273 TraceCheckUtils]: 12: Hoare triple {203#false} assume !(~i~0 < 100000); {203#false} is VALID [2018-11-23 11:55:01,396 INFO L273 TraceCheckUtils]: 13: Hoare triple {203#false} ~i~0 := 0; {203#false} is VALID [2018-11-23 11:55:01,396 INFO L273 TraceCheckUtils]: 14: Hoare triple {203#false} assume !(~i~0 < 100000); {203#false} is VALID [2018-11-23 11:55:01,396 INFO L273 TraceCheckUtils]: 15: Hoare triple {203#false} havoc ~x~0;~x~0 := 0; {203#false} is VALID [2018-11-23 11:55:01,396 INFO L273 TraceCheckUtils]: 16: Hoare triple {203#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {203#false} is VALID [2018-11-23 11:55:01,397 INFO L256 TraceCheckUtils]: 17: Hoare triple {203#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {203#false} is VALID [2018-11-23 11:55:01,397 INFO L273 TraceCheckUtils]: 18: Hoare triple {203#false} ~cond := #in~cond; {203#false} is VALID [2018-11-23 11:55:01,397 INFO L273 TraceCheckUtils]: 19: Hoare triple {203#false} assume 0 == ~cond; {203#false} is VALID [2018-11-23 11:55:01,397 INFO L273 TraceCheckUtils]: 20: Hoare triple {203#false} assume !false; {203#false} is VALID [2018-11-23 11:55:01,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:01,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:55:01,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:55:01,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 11:55:01,402 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:01,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:55:01,444 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:01,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:55:01,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:55:01,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:55:01,445 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 3 states. [2018-11-23 11:55:01,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:01,975 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2018-11-23 11:55:01,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:55:01,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 11:55:01,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:01,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:55:01,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2018-11-23 11:55:01,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:55:01,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2018-11-23 11:55:01,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 64 transitions. [2018-11-23 11:55:02,116 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:02,118 INFO L225 Difference]: With dead ends: 50 [2018-11-23 11:55:02,119 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 11:55:02,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:55:02,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 11:55:02,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-23 11:55:02,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:02,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-23 11:55:02,193 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 11:55:02,193 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 11:55:02,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:02,198 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 11:55:02,199 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 11:55:02,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:02,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:02,200 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 11:55:02,200 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 11:55:02,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:02,203 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 11:55:02,203 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 11:55:02,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:02,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:02,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:02,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:02,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:55:02,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-11-23 11:55:02,207 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 21 [2018-11-23 11:55:02,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:02,207 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-23 11:55:02,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:55:02,208 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 11:55:02,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:55:02,209 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:02,209 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:02,209 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:02,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:02,210 INFO L82 PathProgramCache]: Analyzing trace with hash -927642988, now seen corresponding path program 1 times [2018-11-23 11:55:02,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:02,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:02,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:02,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:02,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:02,352 INFO L256 TraceCheckUtils]: 0: Hoare triple {391#true} call ULTIMATE.init(); {391#true} is VALID [2018-11-23 11:55:02,354 INFO L273 TraceCheckUtils]: 1: Hoare triple {391#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {391#true} is VALID [2018-11-23 11:55:02,354 INFO L273 TraceCheckUtils]: 2: Hoare triple {391#true} assume true; {391#true} is VALID [2018-11-23 11:55:02,354 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {391#true} {391#true} #100#return; {391#true} is VALID [2018-11-23 11:55:02,354 INFO L256 TraceCheckUtils]: 4: Hoare triple {391#true} call #t~ret2 := main(); {391#true} is VALID [2018-11-23 11:55:02,356 INFO L273 TraceCheckUtils]: 5: Hoare triple {391#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {393#(= main_~i~0 0)} is VALID [2018-11-23 11:55:02,358 INFO L273 TraceCheckUtils]: 6: Hoare triple {393#(= 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; {394#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:02,360 INFO L273 TraceCheckUtils]: 7: Hoare triple {394#(<= main_~i~0 1)} assume !(~i~0 < 100000); {392#false} is VALID [2018-11-23 11:55:02,360 INFO L273 TraceCheckUtils]: 8: Hoare triple {392#false} ~i~0 := 0; {392#false} is VALID [2018-11-23 11:55:02,360 INFO L273 TraceCheckUtils]: 9: Hoare triple {392#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {392#false} is VALID [2018-11-23 11:55:02,361 INFO L273 TraceCheckUtils]: 10: Hoare triple {392#false} assume !(~i~0 < 100000); {392#false} is VALID [2018-11-23 11:55:02,361 INFO L273 TraceCheckUtils]: 11: Hoare triple {392#false} ~i~0 := 0; {392#false} is VALID [2018-11-23 11:55:02,361 INFO L273 TraceCheckUtils]: 12: Hoare triple {392#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {392#false} is VALID [2018-11-23 11:55:02,361 INFO L273 TraceCheckUtils]: 13: Hoare triple {392#false} assume !(~i~0 < 100000); {392#false} is VALID [2018-11-23 11:55:02,361 INFO L273 TraceCheckUtils]: 14: Hoare triple {392#false} ~i~0 := 0; {392#false} is VALID [2018-11-23 11:55:02,362 INFO L273 TraceCheckUtils]: 15: Hoare triple {392#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {392#false} is VALID [2018-11-23 11:55:02,362 INFO L273 TraceCheckUtils]: 16: Hoare triple {392#false} assume !(~i~0 < 100000); {392#false} is VALID [2018-11-23 11:55:02,362 INFO L273 TraceCheckUtils]: 17: Hoare triple {392#false} ~i~0 := 0; {392#false} is VALID [2018-11-23 11:55:02,363 INFO L273 TraceCheckUtils]: 18: Hoare triple {392#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {392#false} is VALID [2018-11-23 11:55:02,363 INFO L273 TraceCheckUtils]: 19: Hoare triple {392#false} assume !(~i~0 < 100000); {392#false} is VALID [2018-11-23 11:55:02,363 INFO L273 TraceCheckUtils]: 20: Hoare triple {392#false} havoc ~x~0;~x~0 := 0; {392#false} is VALID [2018-11-23 11:55:02,364 INFO L273 TraceCheckUtils]: 21: Hoare triple {392#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {392#false} is VALID [2018-11-23 11:55:02,364 INFO L256 TraceCheckUtils]: 22: Hoare triple {392#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {392#false} is VALID [2018-11-23 11:55:02,364 INFO L273 TraceCheckUtils]: 23: Hoare triple {392#false} ~cond := #in~cond; {392#false} is VALID [2018-11-23 11:55:02,365 INFO L273 TraceCheckUtils]: 24: Hoare triple {392#false} assume 0 == ~cond; {392#false} is VALID [2018-11-23 11:55:02,365 INFO L273 TraceCheckUtils]: 25: Hoare triple {392#false} assume !false; {392#false} is VALID [2018-11-23 11:55:02,368 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:55:02,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:02,369 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:02,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:02,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:02,857 INFO L256 TraceCheckUtils]: 0: Hoare triple {391#true} call ULTIMATE.init(); {391#true} is VALID [2018-11-23 11:55:02,858 INFO L273 TraceCheckUtils]: 1: Hoare triple {391#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {391#true} is VALID [2018-11-23 11:55:02,858 INFO L273 TraceCheckUtils]: 2: Hoare triple {391#true} assume true; {391#true} is VALID [2018-11-23 11:55:02,858 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {391#true} {391#true} #100#return; {391#true} is VALID [2018-11-23 11:55:02,858 INFO L256 TraceCheckUtils]: 4: Hoare triple {391#true} call #t~ret2 := main(); {391#true} is VALID [2018-11-23 11:55:02,859 INFO L273 TraceCheckUtils]: 5: Hoare triple {391#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {413#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:02,862 INFO L273 TraceCheckUtils]: 6: Hoare triple {413#(<= 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; {394#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:02,873 INFO L273 TraceCheckUtils]: 7: Hoare triple {394#(<= main_~i~0 1)} assume !(~i~0 < 100000); {392#false} is VALID [2018-11-23 11:55:02,873 INFO L273 TraceCheckUtils]: 8: Hoare triple {392#false} ~i~0 := 0; {392#false} is VALID [2018-11-23 11:55:02,874 INFO L273 TraceCheckUtils]: 9: Hoare triple {392#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {392#false} is VALID [2018-11-23 11:55:02,874 INFO L273 TraceCheckUtils]: 10: Hoare triple {392#false} assume !(~i~0 < 100000); {392#false} is VALID [2018-11-23 11:55:02,874 INFO L273 TraceCheckUtils]: 11: Hoare triple {392#false} ~i~0 := 0; {392#false} is VALID [2018-11-23 11:55:02,875 INFO L273 TraceCheckUtils]: 12: Hoare triple {392#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {392#false} is VALID [2018-11-23 11:55:02,875 INFO L273 TraceCheckUtils]: 13: Hoare triple {392#false} assume !(~i~0 < 100000); {392#false} is VALID [2018-11-23 11:55:02,875 INFO L273 TraceCheckUtils]: 14: Hoare triple {392#false} ~i~0 := 0; {392#false} is VALID [2018-11-23 11:55:02,875 INFO L273 TraceCheckUtils]: 15: Hoare triple {392#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {392#false} is VALID [2018-11-23 11:55:02,876 INFO L273 TraceCheckUtils]: 16: Hoare triple {392#false} assume !(~i~0 < 100000); {392#false} is VALID [2018-11-23 11:55:02,876 INFO L273 TraceCheckUtils]: 17: Hoare triple {392#false} ~i~0 := 0; {392#false} is VALID [2018-11-23 11:55:02,876 INFO L273 TraceCheckUtils]: 18: Hoare triple {392#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {392#false} is VALID [2018-11-23 11:55:02,877 INFO L273 TraceCheckUtils]: 19: Hoare triple {392#false} assume !(~i~0 < 100000); {392#false} is VALID [2018-11-23 11:55:02,877 INFO L273 TraceCheckUtils]: 20: Hoare triple {392#false} havoc ~x~0;~x~0 := 0; {392#false} is VALID [2018-11-23 11:55:02,877 INFO L273 TraceCheckUtils]: 21: Hoare triple {392#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {392#false} is VALID [2018-11-23 11:55:02,878 INFO L256 TraceCheckUtils]: 22: Hoare triple {392#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {392#false} is VALID [2018-11-23 11:55:02,878 INFO L273 TraceCheckUtils]: 23: Hoare triple {392#false} ~cond := #in~cond; {392#false} is VALID [2018-11-23 11:55:02,878 INFO L273 TraceCheckUtils]: 24: Hoare triple {392#false} assume 0 == ~cond; {392#false} is VALID [2018-11-23 11:55:02,879 INFO L273 TraceCheckUtils]: 25: Hoare triple {392#false} assume !false; {392#false} is VALID [2018-11-23 11:55:02,880 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:55:02,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:02,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 11:55:02,903 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-23 11:55:02,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:02,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:55:02,945 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:02,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:55:02,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:55:02,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:55:02,947 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 5 states. [2018-11-23 11:55:03,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:03,457 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2018-11-23 11:55:03,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:55:03,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-23 11:55:03,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:03,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:55:03,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2018-11-23 11:55:03,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:55:03,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2018-11-23 11:55:03,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 69 transitions. [2018-11-23 11:55:03,595 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:03,599 INFO L225 Difference]: With dead ends: 59 [2018-11-23 11:55:03,600 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 11:55:03,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:55:03,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 11:55:03,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 11:55:03,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:03,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2018-11-23 11:55:03,633 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-23 11:55:03,633 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-23 11:55:03,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:03,643 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2018-11-23 11:55:03,643 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-11-23 11:55:03,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:03,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:03,644 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-23 11:55:03,644 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-23 11:55:03,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:03,648 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2018-11-23 11:55:03,648 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-11-23 11:55:03,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:03,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:03,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:03,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:03,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:55:03,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-11-23 11:55:03,652 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 26 [2018-11-23 11:55:03,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:03,652 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-23 11:55:03,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:55:03,652 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-11-23 11:55:03,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 11:55:03,654 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:03,654 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:03,654 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:03,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:03,655 INFO L82 PathProgramCache]: Analyzing trace with hash -681366654, now seen corresponding path program 2 times [2018-11-23 11:55:03,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:03,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:03,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:03,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:03,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:03,818 INFO L256 TraceCheckUtils]: 0: Hoare triple {695#true} call ULTIMATE.init(); {695#true} is VALID [2018-11-23 11:55:03,819 INFO L273 TraceCheckUtils]: 1: Hoare triple {695#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {695#true} is VALID [2018-11-23 11:55:03,819 INFO L273 TraceCheckUtils]: 2: Hoare triple {695#true} assume true; {695#true} is VALID [2018-11-23 11:55:03,819 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {695#true} {695#true} #100#return; {695#true} is VALID [2018-11-23 11:55:03,819 INFO L256 TraceCheckUtils]: 4: Hoare triple {695#true} call #t~ret2 := main(); {695#true} is VALID [2018-11-23 11:55:03,820 INFO L273 TraceCheckUtils]: 5: Hoare triple {695#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {697#(= main_~i~0 0)} is VALID [2018-11-23 11:55:03,826 INFO L273 TraceCheckUtils]: 6: Hoare triple {697#(= 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; {698#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:03,827 INFO L273 TraceCheckUtils]: 7: Hoare triple {698#(<= 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; {699#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:03,828 INFO L273 TraceCheckUtils]: 8: Hoare triple {699#(<= main_~i~0 2)} assume !(~i~0 < 100000); {696#false} is VALID [2018-11-23 11:55:03,828 INFO L273 TraceCheckUtils]: 9: Hoare triple {696#false} ~i~0 := 0; {696#false} is VALID [2018-11-23 11:55:03,828 INFO L273 TraceCheckUtils]: 10: Hoare triple {696#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {696#false} is VALID [2018-11-23 11:55:03,829 INFO L273 TraceCheckUtils]: 11: Hoare triple {696#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {696#false} is VALID [2018-11-23 11:55:03,829 INFO L273 TraceCheckUtils]: 12: Hoare triple {696#false} assume !(~i~0 < 100000); {696#false} is VALID [2018-11-23 11:55:03,829 INFO L273 TraceCheckUtils]: 13: Hoare triple {696#false} ~i~0 := 0; {696#false} is VALID [2018-11-23 11:55:03,830 INFO L273 TraceCheckUtils]: 14: Hoare triple {696#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {696#false} is VALID [2018-11-23 11:55:03,830 INFO L273 TraceCheckUtils]: 15: Hoare triple {696#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {696#false} is VALID [2018-11-23 11:55:03,830 INFO L273 TraceCheckUtils]: 16: Hoare triple {696#false} assume !(~i~0 < 100000); {696#false} is VALID [2018-11-23 11:55:03,830 INFO L273 TraceCheckUtils]: 17: Hoare triple {696#false} ~i~0 := 0; {696#false} is VALID [2018-11-23 11:55:03,831 INFO L273 TraceCheckUtils]: 18: Hoare triple {696#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {696#false} is VALID [2018-11-23 11:55:03,831 INFO L273 TraceCheckUtils]: 19: Hoare triple {696#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {696#false} is VALID [2018-11-23 11:55:03,831 INFO L273 TraceCheckUtils]: 20: Hoare triple {696#false} assume !(~i~0 < 100000); {696#false} is VALID [2018-11-23 11:55:03,832 INFO L273 TraceCheckUtils]: 21: Hoare triple {696#false} ~i~0 := 0; {696#false} is VALID [2018-11-23 11:55:03,832 INFO L273 TraceCheckUtils]: 22: Hoare triple {696#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {696#false} is VALID [2018-11-23 11:55:03,832 INFO L273 TraceCheckUtils]: 23: Hoare triple {696#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {696#false} is VALID [2018-11-23 11:55:03,833 INFO L273 TraceCheckUtils]: 24: Hoare triple {696#false} assume !(~i~0 < 100000); {696#false} is VALID [2018-11-23 11:55:03,833 INFO L273 TraceCheckUtils]: 25: Hoare triple {696#false} havoc ~x~0;~x~0 := 0; {696#false} is VALID [2018-11-23 11:55:03,833 INFO L273 TraceCheckUtils]: 26: Hoare triple {696#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {696#false} is VALID [2018-11-23 11:55:03,833 INFO L256 TraceCheckUtils]: 27: Hoare triple {696#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {696#false} is VALID [2018-11-23 11:55:03,834 INFO L273 TraceCheckUtils]: 28: Hoare triple {696#false} ~cond := #in~cond; {696#false} is VALID [2018-11-23 11:55:03,834 INFO L273 TraceCheckUtils]: 29: Hoare triple {696#false} assume 0 == ~cond; {696#false} is VALID [2018-11-23 11:55:03,834 INFO L273 TraceCheckUtils]: 30: Hoare triple {696#false} assume !false; {696#false} is VALID [2018-11-23 11:55:03,836 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 11:55:03,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:03,837 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:03,854 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:55:03,880 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:55:03,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:03,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:03,987 INFO L256 TraceCheckUtils]: 0: Hoare triple {695#true} call ULTIMATE.init(); {695#true} is VALID [2018-11-23 11:55:03,988 INFO L273 TraceCheckUtils]: 1: Hoare triple {695#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {695#true} is VALID [2018-11-23 11:55:03,988 INFO L273 TraceCheckUtils]: 2: Hoare triple {695#true} assume true; {695#true} is VALID [2018-11-23 11:55:03,989 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {695#true} {695#true} #100#return; {695#true} is VALID [2018-11-23 11:55:03,990 INFO L256 TraceCheckUtils]: 4: Hoare triple {695#true} call #t~ret2 := main(); {695#true} is VALID [2018-11-23 11:55:03,990 INFO L273 TraceCheckUtils]: 5: Hoare triple {695#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {695#true} is VALID [2018-11-23 11:55:03,990 INFO L273 TraceCheckUtils]: 6: Hoare triple {695#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {695#true} is VALID [2018-11-23 11:55:03,990 INFO L273 TraceCheckUtils]: 7: Hoare triple {695#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {695#true} is VALID [2018-11-23 11:55:03,991 INFO L273 TraceCheckUtils]: 8: Hoare triple {695#true} assume !(~i~0 < 100000); {695#true} is VALID [2018-11-23 11:55:03,991 INFO L273 TraceCheckUtils]: 9: Hoare triple {695#true} ~i~0 := 0; {695#true} is VALID [2018-11-23 11:55:03,991 INFO L273 TraceCheckUtils]: 10: Hoare triple {695#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {695#true} is VALID [2018-11-23 11:55:03,992 INFO L273 TraceCheckUtils]: 11: Hoare triple {695#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {695#true} is VALID [2018-11-23 11:55:03,992 INFO L273 TraceCheckUtils]: 12: Hoare triple {695#true} assume !(~i~0 < 100000); {695#true} is VALID [2018-11-23 11:55:03,992 INFO L273 TraceCheckUtils]: 13: Hoare triple {695#true} ~i~0 := 0; {695#true} is VALID [2018-11-23 11:55:03,992 INFO L273 TraceCheckUtils]: 14: Hoare triple {695#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {695#true} is VALID [2018-11-23 11:55:03,993 INFO L273 TraceCheckUtils]: 15: Hoare triple {695#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {695#true} is VALID [2018-11-23 11:55:03,993 INFO L273 TraceCheckUtils]: 16: Hoare triple {695#true} assume !(~i~0 < 100000); {695#true} is VALID [2018-11-23 11:55:03,996 INFO L273 TraceCheckUtils]: 17: Hoare triple {695#true} ~i~0 := 0; {754#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:03,997 INFO L273 TraceCheckUtils]: 18: Hoare triple {754#(<= 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; {698#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:03,998 INFO L273 TraceCheckUtils]: 19: Hoare triple {698#(<= 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; {699#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:03,998 INFO L273 TraceCheckUtils]: 20: Hoare triple {699#(<= main_~i~0 2)} assume !(~i~0 < 100000); {696#false} is VALID [2018-11-23 11:55:03,999 INFO L273 TraceCheckUtils]: 21: Hoare triple {696#false} ~i~0 := 0; {696#false} is VALID [2018-11-23 11:55:03,999 INFO L273 TraceCheckUtils]: 22: Hoare triple {696#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {696#false} is VALID [2018-11-23 11:55:03,999 INFO L273 TraceCheckUtils]: 23: Hoare triple {696#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {696#false} is VALID [2018-11-23 11:55:03,999 INFO L273 TraceCheckUtils]: 24: Hoare triple {696#false} assume !(~i~0 < 100000); {696#false} is VALID [2018-11-23 11:55:04,000 INFO L273 TraceCheckUtils]: 25: Hoare triple {696#false} havoc ~x~0;~x~0 := 0; {696#false} is VALID [2018-11-23 11:55:04,000 INFO L273 TraceCheckUtils]: 26: Hoare triple {696#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {696#false} is VALID [2018-11-23 11:55:04,000 INFO L256 TraceCheckUtils]: 27: Hoare triple {696#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {696#false} is VALID [2018-11-23 11:55:04,000 INFO L273 TraceCheckUtils]: 28: Hoare triple {696#false} ~cond := #in~cond; {696#false} is VALID [2018-11-23 11:55:04,001 INFO L273 TraceCheckUtils]: 29: Hoare triple {696#false} assume 0 == ~cond; {696#false} is VALID [2018-11-23 11:55:04,001 INFO L273 TraceCheckUtils]: 30: Hoare triple {696#false} assume !false; {696#false} is VALID [2018-11-23 11:55:04,003 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 11:55:04,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:04,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 11:55:04,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-23 11:55:04,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:04,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:55:04,116 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:04,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:55:04,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:55:04,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:55:04,117 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 6 states. [2018-11-23 11:55:04,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:04,414 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2018-11-23 11:55:04,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:55:04,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-23 11:55:04,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:04,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:55:04,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2018-11-23 11:55:04,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:55:04,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2018-11-23 11:55:04,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 74 transitions. [2018-11-23 11:55:04,517 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:04,519 INFO L225 Difference]: With dead ends: 68 [2018-11-23 11:55:04,519 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 11:55:04,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:55:04,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 11:55:04,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-23 11:55:04,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:04,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2018-11-23 11:55:04,613 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-23 11:55:04,614 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-23 11:55:04,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:04,617 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-23 11:55:04,617 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-23 11:55:04,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:04,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:04,618 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-23 11:55:04,618 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-23 11:55:04,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:04,620 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-23 11:55:04,621 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-23 11:55:04,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:04,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:04,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:04,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:04,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 11:55:04,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-11-23 11:55:04,624 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 31 [2018-11-23 11:55:04,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:04,624 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-11-23 11:55:04,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:55:04,625 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-23 11:55:04,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 11:55:04,626 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:04,626 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:04,626 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:04,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:04,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1000479276, now seen corresponding path program 3 times [2018-11-23 11:55:04,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:04,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:04,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:04,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:04,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:04,812 INFO L256 TraceCheckUtils]: 0: Hoare triple {1053#true} call ULTIMATE.init(); {1053#true} is VALID [2018-11-23 11:55:04,813 INFO L273 TraceCheckUtils]: 1: Hoare triple {1053#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1053#true} is VALID [2018-11-23 11:55:04,813 INFO L273 TraceCheckUtils]: 2: Hoare triple {1053#true} assume true; {1053#true} is VALID [2018-11-23 11:55:04,814 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1053#true} {1053#true} #100#return; {1053#true} is VALID [2018-11-23 11:55:04,814 INFO L256 TraceCheckUtils]: 4: Hoare triple {1053#true} call #t~ret2 := main(); {1053#true} is VALID [2018-11-23 11:55:04,817 INFO L273 TraceCheckUtils]: 5: Hoare triple {1053#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1055#(= main_~i~0 0)} is VALID [2018-11-23 11:55:04,838 INFO L273 TraceCheckUtils]: 6: Hoare triple {1055#(= 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; {1056#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:04,839 INFO L273 TraceCheckUtils]: 7: Hoare triple {1056#(<= 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; {1057#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:04,843 INFO L273 TraceCheckUtils]: 8: Hoare triple {1057#(<= 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; {1058#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:04,846 INFO L273 TraceCheckUtils]: 9: Hoare triple {1058#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1054#false} is VALID [2018-11-23 11:55:04,846 INFO L273 TraceCheckUtils]: 10: Hoare triple {1054#false} ~i~0 := 0; {1054#false} is VALID [2018-11-23 11:55:04,846 INFO L273 TraceCheckUtils]: 11: Hoare triple {1054#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1054#false} is VALID [2018-11-23 11:55:04,846 INFO L273 TraceCheckUtils]: 12: Hoare triple {1054#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1054#false} is VALID [2018-11-23 11:55:04,847 INFO L273 TraceCheckUtils]: 13: Hoare triple {1054#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1054#false} is VALID [2018-11-23 11:55:04,847 INFO L273 TraceCheckUtils]: 14: Hoare triple {1054#false} assume !(~i~0 < 100000); {1054#false} is VALID [2018-11-23 11:55:04,847 INFO L273 TraceCheckUtils]: 15: Hoare triple {1054#false} ~i~0 := 0; {1054#false} is VALID [2018-11-23 11:55:04,847 INFO L273 TraceCheckUtils]: 16: Hoare triple {1054#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1054#false} is VALID [2018-11-23 11:55:04,847 INFO L273 TraceCheckUtils]: 17: Hoare triple {1054#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1054#false} is VALID [2018-11-23 11:55:04,848 INFO L273 TraceCheckUtils]: 18: Hoare triple {1054#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1054#false} is VALID [2018-11-23 11:55:04,848 INFO L273 TraceCheckUtils]: 19: Hoare triple {1054#false} assume !(~i~0 < 100000); {1054#false} is VALID [2018-11-23 11:55:04,848 INFO L273 TraceCheckUtils]: 20: Hoare triple {1054#false} ~i~0 := 0; {1054#false} is VALID [2018-11-23 11:55:04,848 INFO L273 TraceCheckUtils]: 21: Hoare triple {1054#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1054#false} is VALID [2018-11-23 11:55:04,849 INFO L273 TraceCheckUtils]: 22: Hoare triple {1054#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1054#false} is VALID [2018-11-23 11:55:04,849 INFO L273 TraceCheckUtils]: 23: Hoare triple {1054#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1054#false} is VALID [2018-11-23 11:55:04,849 INFO L273 TraceCheckUtils]: 24: Hoare triple {1054#false} assume !(~i~0 < 100000); {1054#false} is VALID [2018-11-23 11:55:04,849 INFO L273 TraceCheckUtils]: 25: Hoare triple {1054#false} ~i~0 := 0; {1054#false} is VALID [2018-11-23 11:55:04,850 INFO L273 TraceCheckUtils]: 26: Hoare triple {1054#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1054#false} is VALID [2018-11-23 11:55:04,850 INFO L273 TraceCheckUtils]: 27: Hoare triple {1054#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1054#false} is VALID [2018-11-23 11:55:04,850 INFO L273 TraceCheckUtils]: 28: Hoare triple {1054#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1054#false} is VALID [2018-11-23 11:55:04,850 INFO L273 TraceCheckUtils]: 29: Hoare triple {1054#false} assume !(~i~0 < 100000); {1054#false} is VALID [2018-11-23 11:55:04,850 INFO L273 TraceCheckUtils]: 30: Hoare triple {1054#false} havoc ~x~0;~x~0 := 0; {1054#false} is VALID [2018-11-23 11:55:04,851 INFO L273 TraceCheckUtils]: 31: Hoare triple {1054#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1054#false} is VALID [2018-11-23 11:55:04,851 INFO L256 TraceCheckUtils]: 32: Hoare triple {1054#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {1054#false} is VALID [2018-11-23 11:55:04,851 INFO L273 TraceCheckUtils]: 33: Hoare triple {1054#false} ~cond := #in~cond; {1054#false} is VALID [2018-11-23 11:55:04,851 INFO L273 TraceCheckUtils]: 34: Hoare triple {1054#false} assume 0 == ~cond; {1054#false} is VALID [2018-11-23 11:55:04,852 INFO L273 TraceCheckUtils]: 35: Hoare triple {1054#false} assume !false; {1054#false} is VALID [2018-11-23 11:55:04,854 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 11:55:04,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:04,854 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:04,874 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:55:04,931 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:55:04,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:04,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:05,066 INFO L256 TraceCheckUtils]: 0: Hoare triple {1053#true} call ULTIMATE.init(); {1053#true} is VALID [2018-11-23 11:55:05,067 INFO L273 TraceCheckUtils]: 1: Hoare triple {1053#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1053#true} is VALID [2018-11-23 11:55:05,067 INFO L273 TraceCheckUtils]: 2: Hoare triple {1053#true} assume true; {1053#true} is VALID [2018-11-23 11:55:05,068 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1053#true} {1053#true} #100#return; {1053#true} is VALID [2018-11-23 11:55:05,069 INFO L256 TraceCheckUtils]: 4: Hoare triple {1053#true} call #t~ret2 := main(); {1053#true} is VALID [2018-11-23 11:55:05,069 INFO L273 TraceCheckUtils]: 5: Hoare triple {1053#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1053#true} is VALID [2018-11-23 11:55:05,070 INFO L273 TraceCheckUtils]: 6: Hoare triple {1053#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1053#true} is VALID [2018-11-23 11:55:05,070 INFO L273 TraceCheckUtils]: 7: Hoare triple {1053#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1053#true} is VALID [2018-11-23 11:55:05,071 INFO L273 TraceCheckUtils]: 8: Hoare triple {1053#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1053#true} is VALID [2018-11-23 11:55:05,071 INFO L273 TraceCheckUtils]: 9: Hoare triple {1053#true} assume !(~i~0 < 100000); {1053#true} is VALID [2018-11-23 11:55:05,072 INFO L273 TraceCheckUtils]: 10: Hoare triple {1053#true} ~i~0 := 0; {1053#true} is VALID [2018-11-23 11:55:05,072 INFO L273 TraceCheckUtils]: 11: Hoare triple {1053#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1053#true} is VALID [2018-11-23 11:55:05,072 INFO L273 TraceCheckUtils]: 12: Hoare triple {1053#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1053#true} is VALID [2018-11-23 11:55:05,073 INFO L273 TraceCheckUtils]: 13: Hoare triple {1053#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1053#true} is VALID [2018-11-23 11:55:05,073 INFO L273 TraceCheckUtils]: 14: Hoare triple {1053#true} assume !(~i~0 < 100000); {1053#true} is VALID [2018-11-23 11:55:05,078 INFO L273 TraceCheckUtils]: 15: Hoare triple {1053#true} ~i~0 := 0; {1107#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:05,080 INFO L273 TraceCheckUtils]: 16: Hoare triple {1107#(<= 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; {1056#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:05,084 INFO L273 TraceCheckUtils]: 17: Hoare triple {1056#(<= 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; {1057#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:05,086 INFO L273 TraceCheckUtils]: 18: Hoare triple {1057#(<= 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; {1058#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:05,087 INFO L273 TraceCheckUtils]: 19: Hoare triple {1058#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1054#false} is VALID [2018-11-23 11:55:05,087 INFO L273 TraceCheckUtils]: 20: Hoare triple {1054#false} ~i~0 := 0; {1054#false} is VALID [2018-11-23 11:55:05,087 INFO L273 TraceCheckUtils]: 21: Hoare triple {1054#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1054#false} is VALID [2018-11-23 11:55:05,087 INFO L273 TraceCheckUtils]: 22: Hoare triple {1054#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1054#false} is VALID [2018-11-23 11:55:05,087 INFO L273 TraceCheckUtils]: 23: Hoare triple {1054#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1054#false} is VALID [2018-11-23 11:55:05,088 INFO L273 TraceCheckUtils]: 24: Hoare triple {1054#false} assume !(~i~0 < 100000); {1054#false} is VALID [2018-11-23 11:55:05,088 INFO L273 TraceCheckUtils]: 25: Hoare triple {1054#false} ~i~0 := 0; {1054#false} is VALID [2018-11-23 11:55:05,088 INFO L273 TraceCheckUtils]: 26: Hoare triple {1054#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1054#false} is VALID [2018-11-23 11:55:05,088 INFO L273 TraceCheckUtils]: 27: Hoare triple {1054#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1054#false} is VALID [2018-11-23 11:55:05,088 INFO L273 TraceCheckUtils]: 28: Hoare triple {1054#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1054#false} is VALID [2018-11-23 11:55:05,089 INFO L273 TraceCheckUtils]: 29: Hoare triple {1054#false} assume !(~i~0 < 100000); {1054#false} is VALID [2018-11-23 11:55:05,089 INFO L273 TraceCheckUtils]: 30: Hoare triple {1054#false} havoc ~x~0;~x~0 := 0; {1054#false} is VALID [2018-11-23 11:55:05,089 INFO L273 TraceCheckUtils]: 31: Hoare triple {1054#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1054#false} is VALID [2018-11-23 11:55:05,089 INFO L256 TraceCheckUtils]: 32: Hoare triple {1054#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {1054#false} is VALID [2018-11-23 11:55:05,090 INFO L273 TraceCheckUtils]: 33: Hoare triple {1054#false} ~cond := #in~cond; {1054#false} is VALID [2018-11-23 11:55:05,090 INFO L273 TraceCheckUtils]: 34: Hoare triple {1054#false} assume 0 == ~cond; {1054#false} is VALID [2018-11-23 11:55:05,090 INFO L273 TraceCheckUtils]: 35: Hoare triple {1054#false} assume !false; {1054#false} is VALID [2018-11-23 11:55:05,092 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 11:55:05,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:05,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 11:55:05,112 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-11-23 11:55:05,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:05,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:55:05,176 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:05,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:55:05,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:55:05,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:55:05,177 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 7 states. [2018-11-23 11:55:05,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:05,451 INFO L93 Difference]: Finished difference Result 77 states and 91 transitions. [2018-11-23 11:55:05,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:55:05,451 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-11-23 11:55:05,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:05,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:55:05,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2018-11-23 11:55:05,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:55:05,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2018-11-23 11:55:05,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 79 transitions. [2018-11-23 11:55:05,573 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:05,576 INFO L225 Difference]: With dead ends: 77 [2018-11-23 11:55:05,576 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 11:55:05,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:55:05,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 11:55:05,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-23 11:55:05,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:05,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2018-11-23 11:55:05,714 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 11:55:05,715 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 11:55:05,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:05,717 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-23 11:55:05,717 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-11-23 11:55:05,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:05,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:05,718 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 11:55:05,719 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 11:55:05,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:05,721 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-23 11:55:05,721 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-11-23 11:55:05,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:05,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:05,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:05,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:05,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 11:55:05,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-11-23 11:55:05,725 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 36 [2018-11-23 11:55:05,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:05,725 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-11-23 11:55:05,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:55:05,726 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-11-23 11:55:05,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 11:55:05,727 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:05,727 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:05,728 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:05,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:05,729 INFO L82 PathProgramCache]: Analyzing trace with hash 631314114, now seen corresponding path program 4 times [2018-11-23 11:55:05,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:05,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:05,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:05,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:05,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:05,877 INFO L256 TraceCheckUtils]: 0: Hoare triple {1465#true} call ULTIMATE.init(); {1465#true} is VALID [2018-11-23 11:55:05,877 INFO L273 TraceCheckUtils]: 1: Hoare triple {1465#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1465#true} is VALID [2018-11-23 11:55:05,878 INFO L273 TraceCheckUtils]: 2: Hoare triple {1465#true} assume true; {1465#true} is VALID [2018-11-23 11:55:05,878 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1465#true} {1465#true} #100#return; {1465#true} is VALID [2018-11-23 11:55:05,879 INFO L256 TraceCheckUtils]: 4: Hoare triple {1465#true} call #t~ret2 := main(); {1465#true} is VALID [2018-11-23 11:55:05,880 INFO L273 TraceCheckUtils]: 5: Hoare triple {1465#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1467#(= main_~i~0 0)} is VALID [2018-11-23 11:55:05,880 INFO L273 TraceCheckUtils]: 6: Hoare triple {1467#(= 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; {1468#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:05,881 INFO L273 TraceCheckUtils]: 7: Hoare triple {1468#(<= 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; {1469#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:05,882 INFO L273 TraceCheckUtils]: 8: Hoare triple {1469#(<= 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; {1470#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:05,883 INFO L273 TraceCheckUtils]: 9: Hoare triple {1470#(<= 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; {1471#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:05,884 INFO L273 TraceCheckUtils]: 10: Hoare triple {1471#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1466#false} is VALID [2018-11-23 11:55:05,884 INFO L273 TraceCheckUtils]: 11: Hoare triple {1466#false} ~i~0 := 0; {1466#false} is VALID [2018-11-23 11:55:05,884 INFO L273 TraceCheckUtils]: 12: Hoare triple {1466#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1466#false} is VALID [2018-11-23 11:55:05,885 INFO L273 TraceCheckUtils]: 13: Hoare triple {1466#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1466#false} is VALID [2018-11-23 11:55:05,885 INFO L273 TraceCheckUtils]: 14: Hoare triple {1466#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1466#false} is VALID [2018-11-23 11:55:05,885 INFO L273 TraceCheckUtils]: 15: Hoare triple {1466#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1466#false} is VALID [2018-11-23 11:55:05,886 INFO L273 TraceCheckUtils]: 16: Hoare triple {1466#false} assume !(~i~0 < 100000); {1466#false} is VALID [2018-11-23 11:55:05,886 INFO L273 TraceCheckUtils]: 17: Hoare triple {1466#false} ~i~0 := 0; {1466#false} is VALID [2018-11-23 11:55:05,886 INFO L273 TraceCheckUtils]: 18: Hoare triple {1466#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1466#false} is VALID [2018-11-23 11:55:05,887 INFO L273 TraceCheckUtils]: 19: Hoare triple {1466#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1466#false} is VALID [2018-11-23 11:55:05,887 INFO L273 TraceCheckUtils]: 20: Hoare triple {1466#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1466#false} is VALID [2018-11-23 11:55:05,887 INFO L273 TraceCheckUtils]: 21: Hoare triple {1466#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1466#false} is VALID [2018-11-23 11:55:05,887 INFO L273 TraceCheckUtils]: 22: Hoare triple {1466#false} assume !(~i~0 < 100000); {1466#false} is VALID [2018-11-23 11:55:05,887 INFO L273 TraceCheckUtils]: 23: Hoare triple {1466#false} ~i~0 := 0; {1466#false} is VALID [2018-11-23 11:55:05,888 INFO L273 TraceCheckUtils]: 24: Hoare triple {1466#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1466#false} is VALID [2018-11-23 11:55:05,888 INFO L273 TraceCheckUtils]: 25: Hoare triple {1466#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1466#false} is VALID [2018-11-23 11:55:05,888 INFO L273 TraceCheckUtils]: 26: Hoare triple {1466#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1466#false} is VALID [2018-11-23 11:55:05,888 INFO L273 TraceCheckUtils]: 27: Hoare triple {1466#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1466#false} is VALID [2018-11-23 11:55:05,889 INFO L273 TraceCheckUtils]: 28: Hoare triple {1466#false} assume !(~i~0 < 100000); {1466#false} is VALID [2018-11-23 11:55:05,889 INFO L273 TraceCheckUtils]: 29: Hoare triple {1466#false} ~i~0 := 0; {1466#false} is VALID [2018-11-23 11:55:05,889 INFO L273 TraceCheckUtils]: 30: Hoare triple {1466#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1466#false} is VALID [2018-11-23 11:55:05,889 INFO L273 TraceCheckUtils]: 31: Hoare triple {1466#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1466#false} is VALID [2018-11-23 11:55:05,890 INFO L273 TraceCheckUtils]: 32: Hoare triple {1466#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1466#false} is VALID [2018-11-23 11:55:05,890 INFO L273 TraceCheckUtils]: 33: Hoare triple {1466#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1466#false} is VALID [2018-11-23 11:55:05,890 INFO L273 TraceCheckUtils]: 34: Hoare triple {1466#false} assume !(~i~0 < 100000); {1466#false} is VALID [2018-11-23 11:55:05,891 INFO L273 TraceCheckUtils]: 35: Hoare triple {1466#false} havoc ~x~0;~x~0 := 0; {1466#false} is VALID [2018-11-23 11:55:05,891 INFO L273 TraceCheckUtils]: 36: Hoare triple {1466#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1466#false} is VALID [2018-11-23 11:55:05,891 INFO L256 TraceCheckUtils]: 37: Hoare triple {1466#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {1466#false} is VALID [2018-11-23 11:55:05,891 INFO L273 TraceCheckUtils]: 38: Hoare triple {1466#false} ~cond := #in~cond; {1466#false} is VALID [2018-11-23 11:55:05,892 INFO L273 TraceCheckUtils]: 39: Hoare triple {1466#false} assume 0 == ~cond; {1466#false} is VALID [2018-11-23 11:55:05,892 INFO L273 TraceCheckUtils]: 40: Hoare triple {1466#false} assume !false; {1466#false} is VALID [2018-11-23 11:55:05,894 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 11:55:05,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:05,895 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:05,915 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:55:05,957 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:55:05,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:05,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:06,181 INFO L256 TraceCheckUtils]: 0: Hoare triple {1465#true} call ULTIMATE.init(); {1465#true} is VALID [2018-11-23 11:55:06,182 INFO L273 TraceCheckUtils]: 1: Hoare triple {1465#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1465#true} is VALID [2018-11-23 11:55:06,182 INFO L273 TraceCheckUtils]: 2: Hoare triple {1465#true} assume true; {1465#true} is VALID [2018-11-23 11:55:06,183 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1465#true} {1465#true} #100#return; {1465#true} is VALID [2018-11-23 11:55:06,183 INFO L256 TraceCheckUtils]: 4: Hoare triple {1465#true} call #t~ret2 := main(); {1465#true} is VALID [2018-11-23 11:55:06,184 INFO L273 TraceCheckUtils]: 5: Hoare triple {1465#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1490#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:06,185 INFO L273 TraceCheckUtils]: 6: Hoare triple {1490#(<= 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; {1468#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:06,185 INFO L273 TraceCheckUtils]: 7: Hoare triple {1468#(<= 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; {1469#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:06,186 INFO L273 TraceCheckUtils]: 8: Hoare triple {1469#(<= 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; {1470#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:06,187 INFO L273 TraceCheckUtils]: 9: Hoare triple {1470#(<= 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; {1471#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:06,188 INFO L273 TraceCheckUtils]: 10: Hoare triple {1471#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1466#false} is VALID [2018-11-23 11:55:06,188 INFO L273 TraceCheckUtils]: 11: Hoare triple {1466#false} ~i~0 := 0; {1466#false} is VALID [2018-11-23 11:55:06,188 INFO L273 TraceCheckUtils]: 12: Hoare triple {1466#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1466#false} is VALID [2018-11-23 11:55:06,189 INFO L273 TraceCheckUtils]: 13: Hoare triple {1466#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1466#false} is VALID [2018-11-23 11:55:06,189 INFO L273 TraceCheckUtils]: 14: Hoare triple {1466#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1466#false} is VALID [2018-11-23 11:55:06,189 INFO L273 TraceCheckUtils]: 15: Hoare triple {1466#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1466#false} is VALID [2018-11-23 11:55:06,189 INFO L273 TraceCheckUtils]: 16: Hoare triple {1466#false} assume !(~i~0 < 100000); {1466#false} is VALID [2018-11-23 11:55:06,190 INFO L273 TraceCheckUtils]: 17: Hoare triple {1466#false} ~i~0 := 0; {1466#false} is VALID [2018-11-23 11:55:06,190 INFO L273 TraceCheckUtils]: 18: Hoare triple {1466#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1466#false} is VALID [2018-11-23 11:55:06,190 INFO L273 TraceCheckUtils]: 19: Hoare triple {1466#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1466#false} is VALID [2018-11-23 11:55:06,191 INFO L273 TraceCheckUtils]: 20: Hoare triple {1466#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1466#false} is VALID [2018-11-23 11:55:06,191 INFO L273 TraceCheckUtils]: 21: Hoare triple {1466#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1466#false} is VALID [2018-11-23 11:55:06,191 INFO L273 TraceCheckUtils]: 22: Hoare triple {1466#false} assume !(~i~0 < 100000); {1466#false} is VALID [2018-11-23 11:55:06,192 INFO L273 TraceCheckUtils]: 23: Hoare triple {1466#false} ~i~0 := 0; {1466#false} is VALID [2018-11-23 11:55:06,192 INFO L273 TraceCheckUtils]: 24: Hoare triple {1466#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1466#false} is VALID [2018-11-23 11:55:06,192 INFO L273 TraceCheckUtils]: 25: Hoare triple {1466#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1466#false} is VALID [2018-11-23 11:55:06,192 INFO L273 TraceCheckUtils]: 26: Hoare triple {1466#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1466#false} is VALID [2018-11-23 11:55:06,193 INFO L273 TraceCheckUtils]: 27: Hoare triple {1466#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1466#false} is VALID [2018-11-23 11:55:06,193 INFO L273 TraceCheckUtils]: 28: Hoare triple {1466#false} assume !(~i~0 < 100000); {1466#false} is VALID [2018-11-23 11:55:06,193 INFO L273 TraceCheckUtils]: 29: Hoare triple {1466#false} ~i~0 := 0; {1466#false} is VALID [2018-11-23 11:55:06,193 INFO L273 TraceCheckUtils]: 30: Hoare triple {1466#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1466#false} is VALID [2018-11-23 11:55:06,194 INFO L273 TraceCheckUtils]: 31: Hoare triple {1466#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1466#false} is VALID [2018-11-23 11:55:06,194 INFO L273 TraceCheckUtils]: 32: Hoare triple {1466#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1466#false} is VALID [2018-11-23 11:55:06,194 INFO L273 TraceCheckUtils]: 33: Hoare triple {1466#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1466#false} is VALID [2018-11-23 11:55:06,194 INFO L273 TraceCheckUtils]: 34: Hoare triple {1466#false} assume !(~i~0 < 100000); {1466#false} is VALID [2018-11-23 11:55:06,195 INFO L273 TraceCheckUtils]: 35: Hoare triple {1466#false} havoc ~x~0;~x~0 := 0; {1466#false} is VALID [2018-11-23 11:55:06,195 INFO L273 TraceCheckUtils]: 36: Hoare triple {1466#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1466#false} is VALID [2018-11-23 11:55:06,195 INFO L256 TraceCheckUtils]: 37: Hoare triple {1466#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {1466#false} is VALID [2018-11-23 11:55:06,195 INFO L273 TraceCheckUtils]: 38: Hoare triple {1466#false} ~cond := #in~cond; {1466#false} is VALID [2018-11-23 11:55:06,195 INFO L273 TraceCheckUtils]: 39: Hoare triple {1466#false} assume 0 == ~cond; {1466#false} is VALID [2018-11-23 11:55:06,196 INFO L273 TraceCheckUtils]: 40: Hoare triple {1466#false} assume !false; {1466#false} is VALID [2018-11-23 11:55:06,198 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 11:55:06,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:06,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 11:55:06,217 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-11-23 11:55:06,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:06,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:55:06,249 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:06,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:55:06,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:55:06,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:55:06,251 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 8 states. [2018-11-23 11:55:06,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:06,772 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2018-11-23 11:55:06,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:55:06,773 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-11-23 11:55:06,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:06,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:55:06,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2018-11-23 11:55:06,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:55:06,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2018-11-23 11:55:06,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 84 transitions. [2018-11-23 11:55:06,881 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:06,883 INFO L225 Difference]: With dead ends: 86 [2018-11-23 11:55:06,884 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 11:55:06,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:55:06,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 11:55:06,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-23 11:55:06,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:06,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 51 states. [2018-11-23 11:55:06,932 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-23 11:55:06,933 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-23 11:55:06,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:06,936 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-23 11:55:06,936 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-11-23 11:55:06,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:06,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:06,937 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-23 11:55:06,938 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-23 11:55:06,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:06,940 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-23 11:55:06,940 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-11-23 11:55:06,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:06,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:06,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:06,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:06,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 11:55:06,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-11-23 11:55:06,943 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 41 [2018-11-23 11:55:06,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:06,944 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-11-23 11:55:06,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:55:06,944 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-11-23 11:55:06,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 11:55:06,945 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:06,945 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:06,946 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:06,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:06,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1809092332, now seen corresponding path program 5 times [2018-11-23 11:55:06,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:06,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:06,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:06,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:06,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:07,211 INFO L256 TraceCheckUtils]: 0: Hoare triple {1931#true} call ULTIMATE.init(); {1931#true} is VALID [2018-11-23 11:55:07,212 INFO L273 TraceCheckUtils]: 1: Hoare triple {1931#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1931#true} is VALID [2018-11-23 11:55:07,212 INFO L273 TraceCheckUtils]: 2: Hoare triple {1931#true} assume true; {1931#true} is VALID [2018-11-23 11:55:07,212 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1931#true} {1931#true} #100#return; {1931#true} is VALID [2018-11-23 11:55:07,213 INFO L256 TraceCheckUtils]: 4: Hoare triple {1931#true} call #t~ret2 := main(); {1931#true} is VALID [2018-11-23 11:55:07,214 INFO L273 TraceCheckUtils]: 5: Hoare triple {1931#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1933#(= main_~i~0 0)} is VALID [2018-11-23 11:55:07,215 INFO L273 TraceCheckUtils]: 6: Hoare triple {1933#(= 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; {1934#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:07,216 INFO L273 TraceCheckUtils]: 7: Hoare triple {1934#(<= 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; {1935#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:07,217 INFO L273 TraceCheckUtils]: 8: Hoare triple {1935#(<= 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; {1936#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:07,218 INFO L273 TraceCheckUtils]: 9: Hoare triple {1936#(<= 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; {1937#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:07,220 INFO L273 TraceCheckUtils]: 10: Hoare triple {1937#(<= 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; {1938#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:07,220 INFO L273 TraceCheckUtils]: 11: Hoare triple {1938#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1932#false} is VALID [2018-11-23 11:55:07,221 INFO L273 TraceCheckUtils]: 12: Hoare triple {1932#false} ~i~0 := 0; {1932#false} is VALID [2018-11-23 11:55:07,221 INFO L273 TraceCheckUtils]: 13: Hoare triple {1932#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1932#false} is VALID [2018-11-23 11:55:07,221 INFO L273 TraceCheckUtils]: 14: Hoare triple {1932#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1932#false} is VALID [2018-11-23 11:55:07,222 INFO L273 TraceCheckUtils]: 15: Hoare triple {1932#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1932#false} is VALID [2018-11-23 11:55:07,222 INFO L273 TraceCheckUtils]: 16: Hoare triple {1932#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1932#false} is VALID [2018-11-23 11:55:07,222 INFO L273 TraceCheckUtils]: 17: Hoare triple {1932#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1932#false} is VALID [2018-11-23 11:55:07,223 INFO L273 TraceCheckUtils]: 18: Hoare triple {1932#false} assume !(~i~0 < 100000); {1932#false} is VALID [2018-11-23 11:55:07,223 INFO L273 TraceCheckUtils]: 19: Hoare triple {1932#false} ~i~0 := 0; {1932#false} is VALID [2018-11-23 11:55:07,223 INFO L273 TraceCheckUtils]: 20: Hoare triple {1932#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1932#false} is VALID [2018-11-23 11:55:07,223 INFO L273 TraceCheckUtils]: 21: Hoare triple {1932#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1932#false} is VALID [2018-11-23 11:55:07,224 INFO L273 TraceCheckUtils]: 22: Hoare triple {1932#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1932#false} is VALID [2018-11-23 11:55:07,224 INFO L273 TraceCheckUtils]: 23: Hoare triple {1932#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1932#false} is VALID [2018-11-23 11:55:07,225 INFO L273 TraceCheckUtils]: 24: Hoare triple {1932#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1932#false} is VALID [2018-11-23 11:55:07,225 INFO L273 TraceCheckUtils]: 25: Hoare triple {1932#false} assume !(~i~0 < 100000); {1932#false} is VALID [2018-11-23 11:55:07,225 INFO L273 TraceCheckUtils]: 26: Hoare triple {1932#false} ~i~0 := 0; {1932#false} is VALID [2018-11-23 11:55:07,225 INFO L273 TraceCheckUtils]: 27: Hoare triple {1932#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1932#false} is VALID [2018-11-23 11:55:07,225 INFO L273 TraceCheckUtils]: 28: Hoare triple {1932#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1932#false} is VALID [2018-11-23 11:55:07,226 INFO L273 TraceCheckUtils]: 29: Hoare triple {1932#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1932#false} is VALID [2018-11-23 11:55:07,226 INFO L273 TraceCheckUtils]: 30: Hoare triple {1932#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1932#false} is VALID [2018-11-23 11:55:07,226 INFO L273 TraceCheckUtils]: 31: Hoare triple {1932#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1932#false} is VALID [2018-11-23 11:55:07,226 INFO L273 TraceCheckUtils]: 32: Hoare triple {1932#false} assume !(~i~0 < 100000); {1932#false} is VALID [2018-11-23 11:55:07,227 INFO L273 TraceCheckUtils]: 33: Hoare triple {1932#false} ~i~0 := 0; {1932#false} is VALID [2018-11-23 11:55:07,227 INFO L273 TraceCheckUtils]: 34: Hoare triple {1932#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1932#false} is VALID [2018-11-23 11:55:07,227 INFO L273 TraceCheckUtils]: 35: Hoare triple {1932#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1932#false} is VALID [2018-11-23 11:55:07,227 INFO L273 TraceCheckUtils]: 36: Hoare triple {1932#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1932#false} is VALID [2018-11-23 11:55:07,228 INFO L273 TraceCheckUtils]: 37: Hoare triple {1932#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1932#false} is VALID [2018-11-23 11:55:07,228 INFO L273 TraceCheckUtils]: 38: Hoare triple {1932#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1932#false} is VALID [2018-11-23 11:55:07,228 INFO L273 TraceCheckUtils]: 39: Hoare triple {1932#false} assume !(~i~0 < 100000); {1932#false} is VALID [2018-11-23 11:55:07,228 INFO L273 TraceCheckUtils]: 40: Hoare triple {1932#false} havoc ~x~0;~x~0 := 0; {1932#false} is VALID [2018-11-23 11:55:07,229 INFO L273 TraceCheckUtils]: 41: Hoare triple {1932#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1932#false} is VALID [2018-11-23 11:55:07,229 INFO L256 TraceCheckUtils]: 42: Hoare triple {1932#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {1932#false} is VALID [2018-11-23 11:55:07,229 INFO L273 TraceCheckUtils]: 43: Hoare triple {1932#false} ~cond := #in~cond; {1932#false} is VALID [2018-11-23 11:55:07,229 INFO L273 TraceCheckUtils]: 44: Hoare triple {1932#false} assume 0 == ~cond; {1932#false} is VALID [2018-11-23 11:55:07,230 INFO L273 TraceCheckUtils]: 45: Hoare triple {1932#false} assume !false; {1932#false} is VALID [2018-11-23 11:55:07,232 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-23 11:55:07,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:07,233 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:07,259 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:55:08,736 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 11:55:08,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:08,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:08,931 INFO L256 TraceCheckUtils]: 0: Hoare triple {1931#true} call ULTIMATE.init(); {1931#true} is VALID [2018-11-23 11:55:08,931 INFO L273 TraceCheckUtils]: 1: Hoare triple {1931#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1931#true} is VALID [2018-11-23 11:55:08,932 INFO L273 TraceCheckUtils]: 2: Hoare triple {1931#true} assume true; {1931#true} is VALID [2018-11-23 11:55:08,932 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1931#true} {1931#true} #100#return; {1931#true} is VALID [2018-11-23 11:55:08,932 INFO L256 TraceCheckUtils]: 4: Hoare triple {1931#true} call #t~ret2 := main(); {1931#true} is VALID [2018-11-23 11:55:08,933 INFO L273 TraceCheckUtils]: 5: Hoare triple {1931#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1931#true} is VALID [2018-11-23 11:55:08,933 INFO L273 TraceCheckUtils]: 6: Hoare triple {1931#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1931#true} is VALID [2018-11-23 11:55:08,933 INFO L273 TraceCheckUtils]: 7: Hoare triple {1931#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1931#true} is VALID [2018-11-23 11:55:08,934 INFO L273 TraceCheckUtils]: 8: Hoare triple {1931#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1931#true} is VALID [2018-11-23 11:55:08,934 INFO L273 TraceCheckUtils]: 9: Hoare triple {1931#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1931#true} is VALID [2018-11-23 11:55:08,934 INFO L273 TraceCheckUtils]: 10: Hoare triple {1931#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1931#true} is VALID [2018-11-23 11:55:08,934 INFO L273 TraceCheckUtils]: 11: Hoare triple {1931#true} assume !(~i~0 < 100000); {1931#true} is VALID [2018-11-23 11:55:08,934 INFO L273 TraceCheckUtils]: 12: Hoare triple {1931#true} ~i~0 := 0; {1931#true} is VALID [2018-11-23 11:55:08,935 INFO L273 TraceCheckUtils]: 13: Hoare triple {1931#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1931#true} is VALID [2018-11-23 11:55:08,935 INFO L273 TraceCheckUtils]: 14: Hoare triple {1931#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1931#true} is VALID [2018-11-23 11:55:08,935 INFO L273 TraceCheckUtils]: 15: Hoare triple {1931#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1931#true} is VALID [2018-11-23 11:55:08,935 INFO L273 TraceCheckUtils]: 16: Hoare triple {1931#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1931#true} is VALID [2018-11-23 11:55:08,935 INFO L273 TraceCheckUtils]: 17: Hoare triple {1931#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1931#true} is VALID [2018-11-23 11:55:08,936 INFO L273 TraceCheckUtils]: 18: Hoare triple {1931#true} assume !(~i~0 < 100000); {1931#true} is VALID [2018-11-23 11:55:08,936 INFO L273 TraceCheckUtils]: 19: Hoare triple {1931#true} ~i~0 := 0; {1931#true} is VALID [2018-11-23 11:55:08,936 INFO L273 TraceCheckUtils]: 20: Hoare triple {1931#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1931#true} is VALID [2018-11-23 11:55:08,936 INFO L273 TraceCheckUtils]: 21: Hoare triple {1931#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1931#true} is VALID [2018-11-23 11:55:08,936 INFO L273 TraceCheckUtils]: 22: Hoare triple {1931#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1931#true} is VALID [2018-11-23 11:55:08,936 INFO L273 TraceCheckUtils]: 23: Hoare triple {1931#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1931#true} is VALID [2018-11-23 11:55:08,937 INFO L273 TraceCheckUtils]: 24: Hoare triple {1931#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1931#true} is VALID [2018-11-23 11:55:08,937 INFO L273 TraceCheckUtils]: 25: Hoare triple {1931#true} assume !(~i~0 < 100000); {1931#true} is VALID [2018-11-23 11:55:08,937 INFO L273 TraceCheckUtils]: 26: Hoare triple {1931#true} ~i~0 := 0; {1931#true} is VALID [2018-11-23 11:55:08,937 INFO L273 TraceCheckUtils]: 27: Hoare triple {1931#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1931#true} is VALID [2018-11-23 11:55:08,937 INFO L273 TraceCheckUtils]: 28: Hoare triple {1931#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1931#true} is VALID [2018-11-23 11:55:08,938 INFO L273 TraceCheckUtils]: 29: Hoare triple {1931#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1931#true} is VALID [2018-11-23 11:55:08,938 INFO L273 TraceCheckUtils]: 30: Hoare triple {1931#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1931#true} is VALID [2018-11-23 11:55:08,938 INFO L273 TraceCheckUtils]: 31: Hoare triple {1931#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1931#true} is VALID [2018-11-23 11:55:08,938 INFO L273 TraceCheckUtils]: 32: Hoare triple {1931#true} assume !(~i~0 < 100000); {1931#true} is VALID [2018-11-23 11:55:08,956 INFO L273 TraceCheckUtils]: 33: Hoare triple {1931#true} ~i~0 := 0; {2041#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:08,971 INFO L273 TraceCheckUtils]: 34: Hoare triple {2041#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1934#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:08,977 INFO L273 TraceCheckUtils]: 35: Hoare triple {1934#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1935#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:08,979 INFO L273 TraceCheckUtils]: 36: Hoare triple {1935#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1936#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:08,984 INFO L273 TraceCheckUtils]: 37: Hoare triple {1936#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1937#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:08,985 INFO L273 TraceCheckUtils]: 38: Hoare triple {1937#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1938#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:08,986 INFO L273 TraceCheckUtils]: 39: Hoare triple {1938#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1932#false} is VALID [2018-11-23 11:55:08,986 INFO L273 TraceCheckUtils]: 40: Hoare triple {1932#false} havoc ~x~0;~x~0 := 0; {1932#false} is VALID [2018-11-23 11:55:08,986 INFO L273 TraceCheckUtils]: 41: Hoare triple {1932#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1932#false} is VALID [2018-11-23 11:55:08,986 INFO L256 TraceCheckUtils]: 42: Hoare triple {1932#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {1932#false} is VALID [2018-11-23 11:55:08,986 INFO L273 TraceCheckUtils]: 43: Hoare triple {1932#false} ~cond := #in~cond; {1932#false} is VALID [2018-11-23 11:55:08,987 INFO L273 TraceCheckUtils]: 44: Hoare triple {1932#false} assume 0 == ~cond; {1932#false} is VALID [2018-11-23 11:55:08,987 INFO L273 TraceCheckUtils]: 45: Hoare triple {1932#false} assume !false; {1932#false} is VALID [2018-11-23 11:55:08,989 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-23 11:55:09,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:09,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 11:55:09,010 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2018-11-23 11:55:09,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:09,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:55:09,083 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:09,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:55:09,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:55:09,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:55:09,084 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 9 states. [2018-11-23 11:55:09,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:09,583 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2018-11-23 11:55:09,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:55:09,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2018-11-23 11:55:09,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:09,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:55:09,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2018-11-23 11:55:09,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:55:09,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2018-11-23 11:55:09,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 89 transitions. [2018-11-23 11:55:09,734 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:09,736 INFO L225 Difference]: With dead ends: 95 [2018-11-23 11:55:09,736 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 11:55:09,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:55:09,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 11:55:09,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-23 11:55:09,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:09,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 56 states. [2018-11-23 11:55:09,781 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-23 11:55:09,782 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-23 11:55:09,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:09,784 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2018-11-23 11:55:09,784 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-11-23 11:55:09,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:09,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:09,785 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-23 11:55:09,785 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-23 11:55:09,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:09,787 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2018-11-23 11:55:09,787 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-11-23 11:55:09,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:09,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:09,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:09,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:09,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 11:55:09,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-11-23 11:55:09,789 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 46 [2018-11-23 11:55:09,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:09,790 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-11-23 11:55:09,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:55:09,790 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-11-23 11:55:09,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 11:55:09,791 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:09,791 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:09,791 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:09,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:09,791 INFO L82 PathProgramCache]: Analyzing trace with hash 2091864578, now seen corresponding path program 6 times [2018-11-23 11:55:09,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:09,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:09,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:09,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:09,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:10,352 INFO L256 TraceCheckUtils]: 0: Hoare triple {2451#true} call ULTIMATE.init(); {2451#true} is VALID [2018-11-23 11:55:10,352 INFO L273 TraceCheckUtils]: 1: Hoare triple {2451#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2451#true} is VALID [2018-11-23 11:55:10,352 INFO L273 TraceCheckUtils]: 2: Hoare triple {2451#true} assume true; {2451#true} is VALID [2018-11-23 11:55:10,353 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2451#true} {2451#true} #100#return; {2451#true} is VALID [2018-11-23 11:55:10,353 INFO L256 TraceCheckUtils]: 4: Hoare triple {2451#true} call #t~ret2 := main(); {2451#true} is VALID [2018-11-23 11:55:10,353 INFO L273 TraceCheckUtils]: 5: Hoare triple {2451#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2453#(= main_~i~0 0)} is VALID [2018-11-23 11:55:10,354 INFO L273 TraceCheckUtils]: 6: Hoare triple {2453#(= 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; {2454#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:10,355 INFO L273 TraceCheckUtils]: 7: Hoare triple {2454#(<= 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; {2455#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:10,355 INFO L273 TraceCheckUtils]: 8: Hoare triple {2455#(<= 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; {2456#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:10,356 INFO L273 TraceCheckUtils]: 9: Hoare triple {2456#(<= 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; {2457#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:10,356 INFO L273 TraceCheckUtils]: 10: Hoare triple {2457#(<= 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; {2458#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:10,357 INFO L273 TraceCheckUtils]: 11: Hoare triple {2458#(<= 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; {2459#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:10,357 INFO L273 TraceCheckUtils]: 12: Hoare triple {2459#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2452#false} is VALID [2018-11-23 11:55:10,358 INFO L273 TraceCheckUtils]: 13: Hoare triple {2452#false} ~i~0 := 0; {2452#false} is VALID [2018-11-23 11:55:10,358 INFO L273 TraceCheckUtils]: 14: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,358 INFO L273 TraceCheckUtils]: 15: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,358 INFO L273 TraceCheckUtils]: 16: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,358 INFO L273 TraceCheckUtils]: 17: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,359 INFO L273 TraceCheckUtils]: 18: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,359 INFO L273 TraceCheckUtils]: 19: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,359 INFO L273 TraceCheckUtils]: 20: Hoare triple {2452#false} assume !(~i~0 < 100000); {2452#false} is VALID [2018-11-23 11:55:10,359 INFO L273 TraceCheckUtils]: 21: Hoare triple {2452#false} ~i~0 := 0; {2452#false} is VALID [2018-11-23 11:55:10,360 INFO L273 TraceCheckUtils]: 22: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,360 INFO L273 TraceCheckUtils]: 23: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,360 INFO L273 TraceCheckUtils]: 24: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,360 INFO L273 TraceCheckUtils]: 25: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,361 INFO L273 TraceCheckUtils]: 26: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,361 INFO L273 TraceCheckUtils]: 27: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,361 INFO L273 TraceCheckUtils]: 28: Hoare triple {2452#false} assume !(~i~0 < 100000); {2452#false} is VALID [2018-11-23 11:55:10,361 INFO L273 TraceCheckUtils]: 29: Hoare triple {2452#false} ~i~0 := 0; {2452#false} is VALID [2018-11-23 11:55:10,361 INFO L273 TraceCheckUtils]: 30: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,361 INFO L273 TraceCheckUtils]: 31: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,361 INFO L273 TraceCheckUtils]: 32: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,362 INFO L273 TraceCheckUtils]: 33: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,362 INFO L273 TraceCheckUtils]: 34: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,362 INFO L273 TraceCheckUtils]: 35: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,362 INFO L273 TraceCheckUtils]: 36: Hoare triple {2452#false} assume !(~i~0 < 100000); {2452#false} is VALID [2018-11-23 11:55:10,362 INFO L273 TraceCheckUtils]: 37: Hoare triple {2452#false} ~i~0 := 0; {2452#false} is VALID [2018-11-23 11:55:10,362 INFO L273 TraceCheckUtils]: 38: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,362 INFO L273 TraceCheckUtils]: 39: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,363 INFO L273 TraceCheckUtils]: 40: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,363 INFO L273 TraceCheckUtils]: 41: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,363 INFO L273 TraceCheckUtils]: 42: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,363 INFO L273 TraceCheckUtils]: 43: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,363 INFO L273 TraceCheckUtils]: 44: Hoare triple {2452#false} assume !(~i~0 < 100000); {2452#false} is VALID [2018-11-23 11:55:10,363 INFO L273 TraceCheckUtils]: 45: Hoare triple {2452#false} havoc ~x~0;~x~0 := 0; {2452#false} is VALID [2018-11-23 11:55:10,363 INFO L273 TraceCheckUtils]: 46: Hoare triple {2452#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2452#false} is VALID [2018-11-23 11:55:10,364 INFO L256 TraceCheckUtils]: 47: Hoare triple {2452#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {2452#false} is VALID [2018-11-23 11:55:10,364 INFO L273 TraceCheckUtils]: 48: Hoare triple {2452#false} ~cond := #in~cond; {2452#false} is VALID [2018-11-23 11:55:10,364 INFO L273 TraceCheckUtils]: 49: Hoare triple {2452#false} assume 0 == ~cond; {2452#false} is VALID [2018-11-23 11:55:10,364 INFO L273 TraceCheckUtils]: 50: Hoare triple {2452#false} assume !false; {2452#false} is VALID [2018-11-23 11:55:10,365 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 11:55:10,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:10,366 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:10,376 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:55:10,796 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-23 11:55:10,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:10,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:10,954 INFO L256 TraceCheckUtils]: 0: Hoare triple {2451#true} call ULTIMATE.init(); {2451#true} is VALID [2018-11-23 11:55:10,955 INFO L273 TraceCheckUtils]: 1: Hoare triple {2451#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2451#true} is VALID [2018-11-23 11:55:10,955 INFO L273 TraceCheckUtils]: 2: Hoare triple {2451#true} assume true; {2451#true} is VALID [2018-11-23 11:55:10,955 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2451#true} {2451#true} #100#return; {2451#true} is VALID [2018-11-23 11:55:10,956 INFO L256 TraceCheckUtils]: 4: Hoare triple {2451#true} call #t~ret2 := main(); {2451#true} is VALID [2018-11-23 11:55:10,961 INFO L273 TraceCheckUtils]: 5: Hoare triple {2451#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2478#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:10,962 INFO L273 TraceCheckUtils]: 6: Hoare triple {2478#(<= 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; {2454#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:10,962 INFO L273 TraceCheckUtils]: 7: Hoare triple {2454#(<= 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; {2455#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:10,963 INFO L273 TraceCheckUtils]: 8: Hoare triple {2455#(<= 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; {2456#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:10,963 INFO L273 TraceCheckUtils]: 9: Hoare triple {2456#(<= 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; {2457#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:10,964 INFO L273 TraceCheckUtils]: 10: Hoare triple {2457#(<= 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; {2458#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:10,965 INFO L273 TraceCheckUtils]: 11: Hoare triple {2458#(<= 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; {2459#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:10,965 INFO L273 TraceCheckUtils]: 12: Hoare triple {2459#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2452#false} is VALID [2018-11-23 11:55:10,966 INFO L273 TraceCheckUtils]: 13: Hoare triple {2452#false} ~i~0 := 0; {2452#false} is VALID [2018-11-23 11:55:10,966 INFO L273 TraceCheckUtils]: 14: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,966 INFO L273 TraceCheckUtils]: 15: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,966 INFO L273 TraceCheckUtils]: 16: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,967 INFO L273 TraceCheckUtils]: 17: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,967 INFO L273 TraceCheckUtils]: 18: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,967 INFO L273 TraceCheckUtils]: 19: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,967 INFO L273 TraceCheckUtils]: 20: Hoare triple {2452#false} assume !(~i~0 < 100000); {2452#false} is VALID [2018-11-23 11:55:10,968 INFO L273 TraceCheckUtils]: 21: Hoare triple {2452#false} ~i~0 := 0; {2452#false} is VALID [2018-11-23 11:55:10,968 INFO L273 TraceCheckUtils]: 22: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,968 INFO L273 TraceCheckUtils]: 23: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,968 INFO L273 TraceCheckUtils]: 24: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,969 INFO L273 TraceCheckUtils]: 25: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,969 INFO L273 TraceCheckUtils]: 26: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,969 INFO L273 TraceCheckUtils]: 27: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,969 INFO L273 TraceCheckUtils]: 28: Hoare triple {2452#false} assume !(~i~0 < 100000); {2452#false} is VALID [2018-11-23 11:55:10,969 INFO L273 TraceCheckUtils]: 29: Hoare triple {2452#false} ~i~0 := 0; {2452#false} is VALID [2018-11-23 11:55:10,969 INFO L273 TraceCheckUtils]: 30: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,969 INFO L273 TraceCheckUtils]: 31: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,970 INFO L273 TraceCheckUtils]: 32: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,970 INFO L273 TraceCheckUtils]: 33: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,970 INFO L273 TraceCheckUtils]: 34: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,970 INFO L273 TraceCheckUtils]: 35: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,970 INFO L273 TraceCheckUtils]: 36: Hoare triple {2452#false} assume !(~i~0 < 100000); {2452#false} is VALID [2018-11-23 11:55:10,970 INFO L273 TraceCheckUtils]: 37: Hoare triple {2452#false} ~i~0 := 0; {2452#false} is VALID [2018-11-23 11:55:10,970 INFO L273 TraceCheckUtils]: 38: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,970 INFO L273 TraceCheckUtils]: 39: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,971 INFO L273 TraceCheckUtils]: 40: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,971 INFO L273 TraceCheckUtils]: 41: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,971 INFO L273 TraceCheckUtils]: 42: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,971 INFO L273 TraceCheckUtils]: 43: Hoare triple {2452#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#false} is VALID [2018-11-23 11:55:10,971 INFO L273 TraceCheckUtils]: 44: Hoare triple {2452#false} assume !(~i~0 < 100000); {2452#false} is VALID [2018-11-23 11:55:10,971 INFO L273 TraceCheckUtils]: 45: Hoare triple {2452#false} havoc ~x~0;~x~0 := 0; {2452#false} is VALID [2018-11-23 11:55:10,971 INFO L273 TraceCheckUtils]: 46: Hoare triple {2452#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2452#false} is VALID [2018-11-23 11:55:10,972 INFO L256 TraceCheckUtils]: 47: Hoare triple {2452#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {2452#false} is VALID [2018-11-23 11:55:10,972 INFO L273 TraceCheckUtils]: 48: Hoare triple {2452#false} ~cond := #in~cond; {2452#false} is VALID [2018-11-23 11:55:10,972 INFO L273 TraceCheckUtils]: 49: Hoare triple {2452#false} assume 0 == ~cond; {2452#false} is VALID [2018-11-23 11:55:10,972 INFO L273 TraceCheckUtils]: 50: Hoare triple {2452#false} assume !false; {2452#false} is VALID [2018-11-23 11:55:10,974 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 11:55:10,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:10,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 11:55:10,994 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2018-11-23 11:55:10,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:10,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:55:11,020 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:11,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:55:11,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:55:11,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:55:11,021 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 10 states. [2018-11-23 11:55:11,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:11,625 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2018-11-23 11:55:11,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:55:11,625 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2018-11-23 11:55:11,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:11,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:55:11,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2018-11-23 11:55:11,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:55:11,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2018-11-23 11:55:11,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 94 transitions. [2018-11-23 11:55:11,802 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:11,803 INFO L225 Difference]: With dead ends: 104 [2018-11-23 11:55:11,804 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 11:55:11,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:55:11,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 11:55:11,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-23 11:55:11,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:11,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 61 states. [2018-11-23 11:55:11,845 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2018-11-23 11:55:11,845 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2018-11-23 11:55:11,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:11,847 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2018-11-23 11:55:11,848 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-11-23 11:55:11,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:11,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:11,848 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2018-11-23 11:55:11,848 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2018-11-23 11:55:11,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:11,850 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2018-11-23 11:55:11,851 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-11-23 11:55:11,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:11,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:11,851 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:11,851 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:11,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 11:55:11,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-11-23 11:55:11,853 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 51 [2018-11-23 11:55:11,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:11,854 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-11-23 11:55:11,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:55:11,854 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-11-23 11:55:11,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 11:55:11,855 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:11,855 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:11,855 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:11,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:11,855 INFO L82 PathProgramCache]: Analyzing trace with hash -591532972, now seen corresponding path program 7 times [2018-11-23 11:55:11,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:11,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:11,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:11,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:11,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:12,133 INFO L256 TraceCheckUtils]: 0: Hoare triple {3025#true} call ULTIMATE.init(); {3025#true} is VALID [2018-11-23 11:55:12,133 INFO L273 TraceCheckUtils]: 1: Hoare triple {3025#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3025#true} is VALID [2018-11-23 11:55:12,133 INFO L273 TraceCheckUtils]: 2: Hoare triple {3025#true} assume true; {3025#true} is VALID [2018-11-23 11:55:12,134 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3025#true} {3025#true} #100#return; {3025#true} is VALID [2018-11-23 11:55:12,134 INFO L256 TraceCheckUtils]: 4: Hoare triple {3025#true} call #t~ret2 := main(); {3025#true} is VALID [2018-11-23 11:55:12,134 INFO L273 TraceCheckUtils]: 5: Hoare triple {3025#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3027#(= main_~i~0 0)} is VALID [2018-11-23 11:55:12,136 INFO L273 TraceCheckUtils]: 6: Hoare triple {3027#(= 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; {3028#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:12,136 INFO L273 TraceCheckUtils]: 7: Hoare triple {3028#(<= 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; {3029#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:12,152 INFO L273 TraceCheckUtils]: 8: Hoare triple {3029#(<= 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; {3030#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:12,153 INFO L273 TraceCheckUtils]: 9: Hoare triple {3030#(<= 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; {3031#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:12,154 INFO L273 TraceCheckUtils]: 10: Hoare triple {3031#(<= 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; {3032#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:12,154 INFO L273 TraceCheckUtils]: 11: Hoare triple {3032#(<= 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; {3033#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:12,155 INFO L273 TraceCheckUtils]: 12: Hoare triple {3033#(<= 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; {3034#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:12,157 INFO L273 TraceCheckUtils]: 13: Hoare triple {3034#(<= main_~i~0 7)} assume !(~i~0 < 100000); {3026#false} is VALID [2018-11-23 11:55:12,157 INFO L273 TraceCheckUtils]: 14: Hoare triple {3026#false} ~i~0 := 0; {3026#false} is VALID [2018-11-23 11:55:12,157 INFO L273 TraceCheckUtils]: 15: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,158 INFO L273 TraceCheckUtils]: 16: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,158 INFO L273 TraceCheckUtils]: 17: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,158 INFO L273 TraceCheckUtils]: 18: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,158 INFO L273 TraceCheckUtils]: 19: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,159 INFO L273 TraceCheckUtils]: 20: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,159 INFO L273 TraceCheckUtils]: 21: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,159 INFO L273 TraceCheckUtils]: 22: Hoare triple {3026#false} assume !(~i~0 < 100000); {3026#false} is VALID [2018-11-23 11:55:12,159 INFO L273 TraceCheckUtils]: 23: Hoare triple {3026#false} ~i~0 := 0; {3026#false} is VALID [2018-11-23 11:55:12,159 INFO L273 TraceCheckUtils]: 24: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,160 INFO L273 TraceCheckUtils]: 25: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,160 INFO L273 TraceCheckUtils]: 26: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,160 INFO L273 TraceCheckUtils]: 27: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,161 INFO L273 TraceCheckUtils]: 28: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,161 INFO L273 TraceCheckUtils]: 29: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,161 INFO L273 TraceCheckUtils]: 30: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,161 INFO L273 TraceCheckUtils]: 31: Hoare triple {3026#false} assume !(~i~0 < 100000); {3026#false} is VALID [2018-11-23 11:55:12,161 INFO L273 TraceCheckUtils]: 32: Hoare triple {3026#false} ~i~0 := 0; {3026#false} is VALID [2018-11-23 11:55:12,162 INFO L273 TraceCheckUtils]: 33: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,162 INFO L273 TraceCheckUtils]: 34: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,162 INFO L273 TraceCheckUtils]: 35: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,162 INFO L273 TraceCheckUtils]: 36: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,162 INFO L273 TraceCheckUtils]: 37: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,162 INFO L273 TraceCheckUtils]: 38: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,162 INFO L273 TraceCheckUtils]: 39: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,162 INFO L273 TraceCheckUtils]: 40: Hoare triple {3026#false} assume !(~i~0 < 100000); {3026#false} is VALID [2018-11-23 11:55:12,163 INFO L273 TraceCheckUtils]: 41: Hoare triple {3026#false} ~i~0 := 0; {3026#false} is VALID [2018-11-23 11:55:12,163 INFO L273 TraceCheckUtils]: 42: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,163 INFO L273 TraceCheckUtils]: 43: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,163 INFO L273 TraceCheckUtils]: 44: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,163 INFO L273 TraceCheckUtils]: 45: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,163 INFO L273 TraceCheckUtils]: 46: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,163 INFO L273 TraceCheckUtils]: 47: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,163 INFO L273 TraceCheckUtils]: 48: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,164 INFO L273 TraceCheckUtils]: 49: Hoare triple {3026#false} assume !(~i~0 < 100000); {3026#false} is VALID [2018-11-23 11:55:12,164 INFO L273 TraceCheckUtils]: 50: Hoare triple {3026#false} havoc ~x~0;~x~0 := 0; {3026#false} is VALID [2018-11-23 11:55:12,164 INFO L273 TraceCheckUtils]: 51: Hoare triple {3026#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3026#false} is VALID [2018-11-23 11:55:12,164 INFO L256 TraceCheckUtils]: 52: Hoare triple {3026#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {3026#false} is VALID [2018-11-23 11:55:12,164 INFO L273 TraceCheckUtils]: 53: Hoare triple {3026#false} ~cond := #in~cond; {3026#false} is VALID [2018-11-23 11:55:12,164 INFO L273 TraceCheckUtils]: 54: Hoare triple {3026#false} assume 0 == ~cond; {3026#false} is VALID [2018-11-23 11:55:12,164 INFO L273 TraceCheckUtils]: 55: Hoare triple {3026#false} assume !false; {3026#false} is VALID [2018-11-23 11:55:12,166 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-23 11:55:12,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:12,167 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:12,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:12,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:12,583 INFO L256 TraceCheckUtils]: 0: Hoare triple {3025#true} call ULTIMATE.init(); {3025#true} is VALID [2018-11-23 11:55:12,583 INFO L273 TraceCheckUtils]: 1: Hoare triple {3025#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3025#true} is VALID [2018-11-23 11:55:12,583 INFO L273 TraceCheckUtils]: 2: Hoare triple {3025#true} assume true; {3025#true} is VALID [2018-11-23 11:55:12,584 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3025#true} {3025#true} #100#return; {3025#true} is VALID [2018-11-23 11:55:12,584 INFO L256 TraceCheckUtils]: 4: Hoare triple {3025#true} call #t~ret2 := main(); {3025#true} is VALID [2018-11-23 11:55:12,585 INFO L273 TraceCheckUtils]: 5: Hoare triple {3025#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3053#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:12,586 INFO L273 TraceCheckUtils]: 6: Hoare triple {3053#(<= 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; {3028#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:12,587 INFO L273 TraceCheckUtils]: 7: Hoare triple {3028#(<= 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; {3029#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:12,587 INFO L273 TraceCheckUtils]: 8: Hoare triple {3029#(<= 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; {3030#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:12,588 INFO L273 TraceCheckUtils]: 9: Hoare triple {3030#(<= 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; {3031#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:12,588 INFO L273 TraceCheckUtils]: 10: Hoare triple {3031#(<= 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; {3032#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:12,589 INFO L273 TraceCheckUtils]: 11: Hoare triple {3032#(<= 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; {3033#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:12,590 INFO L273 TraceCheckUtils]: 12: Hoare triple {3033#(<= 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; {3034#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:12,591 INFO L273 TraceCheckUtils]: 13: Hoare triple {3034#(<= main_~i~0 7)} assume !(~i~0 < 100000); {3026#false} is VALID [2018-11-23 11:55:12,591 INFO L273 TraceCheckUtils]: 14: Hoare triple {3026#false} ~i~0 := 0; {3026#false} is VALID [2018-11-23 11:55:12,591 INFO L273 TraceCheckUtils]: 15: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,591 INFO L273 TraceCheckUtils]: 16: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,592 INFO L273 TraceCheckUtils]: 17: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,592 INFO L273 TraceCheckUtils]: 18: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,592 INFO L273 TraceCheckUtils]: 19: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,592 INFO L273 TraceCheckUtils]: 20: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,592 INFO L273 TraceCheckUtils]: 21: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,593 INFO L273 TraceCheckUtils]: 22: Hoare triple {3026#false} assume !(~i~0 < 100000); {3026#false} is VALID [2018-11-23 11:55:12,593 INFO L273 TraceCheckUtils]: 23: Hoare triple {3026#false} ~i~0 := 0; {3026#false} is VALID [2018-11-23 11:55:12,593 INFO L273 TraceCheckUtils]: 24: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,593 INFO L273 TraceCheckUtils]: 25: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,594 INFO L273 TraceCheckUtils]: 26: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,594 INFO L273 TraceCheckUtils]: 27: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,594 INFO L273 TraceCheckUtils]: 28: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,594 INFO L273 TraceCheckUtils]: 29: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,594 INFO L273 TraceCheckUtils]: 30: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,594 INFO L273 TraceCheckUtils]: 31: Hoare triple {3026#false} assume !(~i~0 < 100000); {3026#false} is VALID [2018-11-23 11:55:12,594 INFO L273 TraceCheckUtils]: 32: Hoare triple {3026#false} ~i~0 := 0; {3026#false} is VALID [2018-11-23 11:55:12,595 INFO L273 TraceCheckUtils]: 33: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,595 INFO L273 TraceCheckUtils]: 34: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,595 INFO L273 TraceCheckUtils]: 35: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,595 INFO L273 TraceCheckUtils]: 36: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,595 INFO L273 TraceCheckUtils]: 37: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,595 INFO L273 TraceCheckUtils]: 38: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,595 INFO L273 TraceCheckUtils]: 39: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,595 INFO L273 TraceCheckUtils]: 40: Hoare triple {3026#false} assume !(~i~0 < 100000); {3026#false} is VALID [2018-11-23 11:55:12,596 INFO L273 TraceCheckUtils]: 41: Hoare triple {3026#false} ~i~0 := 0; {3026#false} is VALID [2018-11-23 11:55:12,596 INFO L273 TraceCheckUtils]: 42: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,596 INFO L273 TraceCheckUtils]: 43: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,596 INFO L273 TraceCheckUtils]: 44: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,596 INFO L273 TraceCheckUtils]: 45: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,596 INFO L273 TraceCheckUtils]: 46: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,596 INFO L273 TraceCheckUtils]: 47: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,596 INFO L273 TraceCheckUtils]: 48: Hoare triple {3026#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3026#false} is VALID [2018-11-23 11:55:12,597 INFO L273 TraceCheckUtils]: 49: Hoare triple {3026#false} assume !(~i~0 < 100000); {3026#false} is VALID [2018-11-23 11:55:12,597 INFO L273 TraceCheckUtils]: 50: Hoare triple {3026#false} havoc ~x~0;~x~0 := 0; {3026#false} is VALID [2018-11-23 11:55:12,597 INFO L273 TraceCheckUtils]: 51: Hoare triple {3026#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3026#false} is VALID [2018-11-23 11:55:12,597 INFO L256 TraceCheckUtils]: 52: Hoare triple {3026#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {3026#false} is VALID [2018-11-23 11:55:12,597 INFO L273 TraceCheckUtils]: 53: Hoare triple {3026#false} ~cond := #in~cond; {3026#false} is VALID [2018-11-23 11:55:12,597 INFO L273 TraceCheckUtils]: 54: Hoare triple {3026#false} assume 0 == ~cond; {3026#false} is VALID [2018-11-23 11:55:12,597 INFO L273 TraceCheckUtils]: 55: Hoare triple {3026#false} assume !false; {3026#false} is VALID [2018-11-23 11:55:12,599 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-23 11:55:12,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:12,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 11:55:12,619 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-23 11:55:12,620 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:12,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:55:12,659 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:12,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:55:12,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:55:12,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:55:12,660 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 11 states. [2018-11-23 11:55:13,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:13,133 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2018-11-23 11:55:13,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:55:13,133 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-23 11:55:13,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:13,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:55:13,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 99 transitions. [2018-11-23 11:55:13,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:55:13,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 99 transitions. [2018-11-23 11:55:13,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 99 transitions. [2018-11-23 11:55:13,243 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:13,244 INFO L225 Difference]: With dead ends: 113 [2018-11-23 11:55:13,244 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 11:55:13,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:55:13,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 11:55:13,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-23 11:55:13,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:13,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 66 states. [2018-11-23 11:55:13,335 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2018-11-23 11:55:13,336 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2018-11-23 11:55:13,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:13,338 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-11-23 11:55:13,338 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2018-11-23 11:55:13,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:13,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:13,338 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2018-11-23 11:55:13,339 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2018-11-23 11:55:13,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:13,340 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-11-23 11:55:13,340 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2018-11-23 11:55:13,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:13,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:13,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:13,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:13,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 11:55:13,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2018-11-23 11:55:13,343 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 56 [2018-11-23 11:55:13,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:13,343 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2018-11-23 11:55:13,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:55:13,343 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2018-11-23 11:55:13,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 11:55:13,344 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:13,344 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:13,344 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:13,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:13,345 INFO L82 PathProgramCache]: Analyzing trace with hash 642637122, now seen corresponding path program 8 times [2018-11-23 11:55:13,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:13,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:13,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:13,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:13,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:13,488 INFO L256 TraceCheckUtils]: 0: Hoare triple {3653#true} call ULTIMATE.init(); {3653#true} is VALID [2018-11-23 11:55:13,488 INFO L273 TraceCheckUtils]: 1: Hoare triple {3653#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3653#true} is VALID [2018-11-23 11:55:13,489 INFO L273 TraceCheckUtils]: 2: Hoare triple {3653#true} assume true; {3653#true} is VALID [2018-11-23 11:55:13,489 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3653#true} {3653#true} #100#return; {3653#true} is VALID [2018-11-23 11:55:13,489 INFO L256 TraceCheckUtils]: 4: Hoare triple {3653#true} call #t~ret2 := main(); {3653#true} is VALID [2018-11-23 11:55:13,490 INFO L273 TraceCheckUtils]: 5: Hoare triple {3653#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3655#(= main_~i~0 0)} is VALID [2018-11-23 11:55:13,491 INFO L273 TraceCheckUtils]: 6: Hoare triple {3655#(= 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; {3656#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:13,491 INFO L273 TraceCheckUtils]: 7: Hoare triple {3656#(<= 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; {3657#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:13,492 INFO L273 TraceCheckUtils]: 8: Hoare triple {3657#(<= 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; {3658#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:13,492 INFO L273 TraceCheckUtils]: 9: Hoare triple {3658#(<= 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; {3659#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:13,493 INFO L273 TraceCheckUtils]: 10: Hoare triple {3659#(<= 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; {3660#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:13,493 INFO L273 TraceCheckUtils]: 11: Hoare triple {3660#(<= 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; {3661#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:13,494 INFO L273 TraceCheckUtils]: 12: Hoare triple {3661#(<= 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; {3662#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:13,495 INFO L273 TraceCheckUtils]: 13: Hoare triple {3662#(<= 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; {3663#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:13,496 INFO L273 TraceCheckUtils]: 14: Hoare triple {3663#(<= main_~i~0 8)} assume !(~i~0 < 100000); {3654#false} is VALID [2018-11-23 11:55:13,496 INFO L273 TraceCheckUtils]: 15: Hoare triple {3654#false} ~i~0 := 0; {3654#false} is VALID [2018-11-23 11:55:13,496 INFO L273 TraceCheckUtils]: 16: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,497 INFO L273 TraceCheckUtils]: 17: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,497 INFO L273 TraceCheckUtils]: 18: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,497 INFO L273 TraceCheckUtils]: 19: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,497 INFO L273 TraceCheckUtils]: 20: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,498 INFO L273 TraceCheckUtils]: 21: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,498 INFO L273 TraceCheckUtils]: 22: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,498 INFO L273 TraceCheckUtils]: 23: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,499 INFO L273 TraceCheckUtils]: 24: Hoare triple {3654#false} assume !(~i~0 < 100000); {3654#false} is VALID [2018-11-23 11:55:13,499 INFO L273 TraceCheckUtils]: 25: Hoare triple {3654#false} ~i~0 := 0; {3654#false} is VALID [2018-11-23 11:55:13,499 INFO L273 TraceCheckUtils]: 26: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,499 INFO L273 TraceCheckUtils]: 27: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,500 INFO L273 TraceCheckUtils]: 28: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,500 INFO L273 TraceCheckUtils]: 29: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,500 INFO L273 TraceCheckUtils]: 30: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,500 INFO L273 TraceCheckUtils]: 31: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,500 INFO L273 TraceCheckUtils]: 32: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,501 INFO L273 TraceCheckUtils]: 33: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,501 INFO L273 TraceCheckUtils]: 34: Hoare triple {3654#false} assume !(~i~0 < 100000); {3654#false} is VALID [2018-11-23 11:55:13,501 INFO L273 TraceCheckUtils]: 35: Hoare triple {3654#false} ~i~0 := 0; {3654#false} is VALID [2018-11-23 11:55:13,501 INFO L273 TraceCheckUtils]: 36: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,501 INFO L273 TraceCheckUtils]: 37: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,502 INFO L273 TraceCheckUtils]: 38: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,502 INFO L273 TraceCheckUtils]: 39: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,502 INFO L273 TraceCheckUtils]: 40: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,502 INFO L273 TraceCheckUtils]: 41: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,502 INFO L273 TraceCheckUtils]: 42: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,502 INFO L273 TraceCheckUtils]: 43: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,503 INFO L273 TraceCheckUtils]: 44: Hoare triple {3654#false} assume !(~i~0 < 100000); {3654#false} is VALID [2018-11-23 11:55:13,503 INFO L273 TraceCheckUtils]: 45: Hoare triple {3654#false} ~i~0 := 0; {3654#false} is VALID [2018-11-23 11:55:13,503 INFO L273 TraceCheckUtils]: 46: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,503 INFO L273 TraceCheckUtils]: 47: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,503 INFO L273 TraceCheckUtils]: 48: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,504 INFO L273 TraceCheckUtils]: 49: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,504 INFO L273 TraceCheckUtils]: 50: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,504 INFO L273 TraceCheckUtils]: 51: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,504 INFO L273 TraceCheckUtils]: 52: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,504 INFO L273 TraceCheckUtils]: 53: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,505 INFO L273 TraceCheckUtils]: 54: Hoare triple {3654#false} assume !(~i~0 < 100000); {3654#false} is VALID [2018-11-23 11:55:13,505 INFO L273 TraceCheckUtils]: 55: Hoare triple {3654#false} havoc ~x~0;~x~0 := 0; {3654#false} is VALID [2018-11-23 11:55:13,505 INFO L273 TraceCheckUtils]: 56: Hoare triple {3654#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3654#false} is VALID [2018-11-23 11:55:13,505 INFO L256 TraceCheckUtils]: 57: Hoare triple {3654#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {3654#false} is VALID [2018-11-23 11:55:13,505 INFO L273 TraceCheckUtils]: 58: Hoare triple {3654#false} ~cond := #in~cond; {3654#false} is VALID [2018-11-23 11:55:13,505 INFO L273 TraceCheckUtils]: 59: Hoare triple {3654#false} assume 0 == ~cond; {3654#false} is VALID [2018-11-23 11:55:13,506 INFO L273 TraceCheckUtils]: 60: Hoare triple {3654#false} assume !false; {3654#false} is VALID [2018-11-23 11:55:13,508 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-23 11:55:13,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:13,508 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:13,529 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:55:13,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:55:13,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:13,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:13,785 INFO L256 TraceCheckUtils]: 0: Hoare triple {3653#true} call ULTIMATE.init(); {3653#true} is VALID [2018-11-23 11:55:13,786 INFO L273 TraceCheckUtils]: 1: Hoare triple {3653#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3653#true} is VALID [2018-11-23 11:55:13,786 INFO L273 TraceCheckUtils]: 2: Hoare triple {3653#true} assume true; {3653#true} is VALID [2018-11-23 11:55:13,786 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3653#true} {3653#true} #100#return; {3653#true} is VALID [2018-11-23 11:55:13,787 INFO L256 TraceCheckUtils]: 4: Hoare triple {3653#true} call #t~ret2 := main(); {3653#true} is VALID [2018-11-23 11:55:13,790 INFO L273 TraceCheckUtils]: 5: Hoare triple {3653#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3682#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:13,791 INFO L273 TraceCheckUtils]: 6: Hoare triple {3682#(<= 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; {3656#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:13,792 INFO L273 TraceCheckUtils]: 7: Hoare triple {3656#(<= 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; {3657#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:13,793 INFO L273 TraceCheckUtils]: 8: Hoare triple {3657#(<= 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; {3658#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:13,794 INFO L273 TraceCheckUtils]: 9: Hoare triple {3658#(<= 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; {3659#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:13,794 INFO L273 TraceCheckUtils]: 10: Hoare triple {3659#(<= 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; {3660#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:13,795 INFO L273 TraceCheckUtils]: 11: Hoare triple {3660#(<= 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; {3661#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:13,796 INFO L273 TraceCheckUtils]: 12: Hoare triple {3661#(<= 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; {3662#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:13,797 INFO L273 TraceCheckUtils]: 13: Hoare triple {3662#(<= 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; {3663#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:13,798 INFO L273 TraceCheckUtils]: 14: Hoare triple {3663#(<= main_~i~0 8)} assume !(~i~0 < 100000); {3654#false} is VALID [2018-11-23 11:55:13,798 INFO L273 TraceCheckUtils]: 15: Hoare triple {3654#false} ~i~0 := 0; {3654#false} is VALID [2018-11-23 11:55:13,799 INFO L273 TraceCheckUtils]: 16: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,799 INFO L273 TraceCheckUtils]: 17: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,799 INFO L273 TraceCheckUtils]: 18: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,799 INFO L273 TraceCheckUtils]: 19: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,800 INFO L273 TraceCheckUtils]: 20: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,800 INFO L273 TraceCheckUtils]: 21: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,800 INFO L273 TraceCheckUtils]: 22: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,800 INFO L273 TraceCheckUtils]: 23: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,801 INFO L273 TraceCheckUtils]: 24: Hoare triple {3654#false} assume !(~i~0 < 100000); {3654#false} is VALID [2018-11-23 11:55:13,801 INFO L273 TraceCheckUtils]: 25: Hoare triple {3654#false} ~i~0 := 0; {3654#false} is VALID [2018-11-23 11:55:13,801 INFO L273 TraceCheckUtils]: 26: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,801 INFO L273 TraceCheckUtils]: 27: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,802 INFO L273 TraceCheckUtils]: 28: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,802 INFO L273 TraceCheckUtils]: 29: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,802 INFO L273 TraceCheckUtils]: 30: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,802 INFO L273 TraceCheckUtils]: 31: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,802 INFO L273 TraceCheckUtils]: 32: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,803 INFO L273 TraceCheckUtils]: 33: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,803 INFO L273 TraceCheckUtils]: 34: Hoare triple {3654#false} assume !(~i~0 < 100000); {3654#false} is VALID [2018-11-23 11:55:13,803 INFO L273 TraceCheckUtils]: 35: Hoare triple {3654#false} ~i~0 := 0; {3654#false} is VALID [2018-11-23 11:55:13,803 INFO L273 TraceCheckUtils]: 36: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,803 INFO L273 TraceCheckUtils]: 37: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,803 INFO L273 TraceCheckUtils]: 38: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,804 INFO L273 TraceCheckUtils]: 39: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,804 INFO L273 TraceCheckUtils]: 40: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,804 INFO L273 TraceCheckUtils]: 41: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,804 INFO L273 TraceCheckUtils]: 42: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,804 INFO L273 TraceCheckUtils]: 43: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,804 INFO L273 TraceCheckUtils]: 44: Hoare triple {3654#false} assume !(~i~0 < 100000); {3654#false} is VALID [2018-11-23 11:55:13,804 INFO L273 TraceCheckUtils]: 45: Hoare triple {3654#false} ~i~0 := 0; {3654#false} is VALID [2018-11-23 11:55:13,805 INFO L273 TraceCheckUtils]: 46: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,805 INFO L273 TraceCheckUtils]: 47: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,805 INFO L273 TraceCheckUtils]: 48: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,805 INFO L273 TraceCheckUtils]: 49: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,805 INFO L273 TraceCheckUtils]: 50: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,805 INFO L273 TraceCheckUtils]: 51: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,806 INFO L273 TraceCheckUtils]: 52: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,806 INFO L273 TraceCheckUtils]: 53: Hoare triple {3654#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3654#false} is VALID [2018-11-23 11:55:13,806 INFO L273 TraceCheckUtils]: 54: Hoare triple {3654#false} assume !(~i~0 < 100000); {3654#false} is VALID [2018-11-23 11:55:13,806 INFO L273 TraceCheckUtils]: 55: Hoare triple {3654#false} havoc ~x~0;~x~0 := 0; {3654#false} is VALID [2018-11-23 11:55:13,806 INFO L273 TraceCheckUtils]: 56: Hoare triple {3654#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3654#false} is VALID [2018-11-23 11:55:13,807 INFO L256 TraceCheckUtils]: 57: Hoare triple {3654#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {3654#false} is VALID [2018-11-23 11:55:13,807 INFO L273 TraceCheckUtils]: 58: Hoare triple {3654#false} ~cond := #in~cond; {3654#false} is VALID [2018-11-23 11:55:13,807 INFO L273 TraceCheckUtils]: 59: Hoare triple {3654#false} assume 0 == ~cond; {3654#false} is VALID [2018-11-23 11:55:13,807 INFO L273 TraceCheckUtils]: 60: Hoare triple {3654#false} assume !false; {3654#false} is VALID [2018-11-23 11:55:13,811 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-23 11:55:13,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:13,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 11:55:13,830 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2018-11-23 11:55:13,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:13,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:55:13,865 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:13,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:55:13,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:55:13,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:55:13,866 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 12 states. [2018-11-23 11:55:14,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:14,381 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2018-11-23 11:55:14,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:55:14,382 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2018-11-23 11:55:14,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:14,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:55:14,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 104 transitions. [2018-11-23 11:55:14,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:55:14,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 104 transitions. [2018-11-23 11:55:14,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 104 transitions. [2018-11-23 11:55:14,491 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:14,492 INFO L225 Difference]: With dead ends: 122 [2018-11-23 11:55:14,493 INFO L226 Difference]: Without dead ends: 71 [2018-11-23 11:55:14,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:55:14,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-23 11:55:14,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-11-23 11:55:14,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:14,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 71 states. [2018-11-23 11:55:14,560 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 71 states. [2018-11-23 11:55:14,560 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 71 states. [2018-11-23 11:55:14,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:14,562 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-11-23 11:55:14,563 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2018-11-23 11:55:14,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:14,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:14,563 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 71 states. [2018-11-23 11:55:14,563 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 71 states. [2018-11-23 11:55:14,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:14,565 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-11-23 11:55:14,565 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2018-11-23 11:55:14,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:14,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:14,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:14,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:14,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 11:55:14,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2018-11-23 11:55:14,568 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 61 [2018-11-23 11:55:14,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:14,568 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2018-11-23 11:55:14,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:55:14,568 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2018-11-23 11:55:14,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 11:55:14,569 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:14,569 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:14,569 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:14,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:14,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1682614380, now seen corresponding path program 9 times [2018-11-23 11:55:14,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:14,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:14,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:14,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:14,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:14,873 INFO L256 TraceCheckUtils]: 0: Hoare triple {4335#true} call ULTIMATE.init(); {4335#true} is VALID [2018-11-23 11:55:14,874 INFO L273 TraceCheckUtils]: 1: Hoare triple {4335#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4335#true} is VALID [2018-11-23 11:55:14,874 INFO L273 TraceCheckUtils]: 2: Hoare triple {4335#true} assume true; {4335#true} is VALID [2018-11-23 11:55:14,874 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4335#true} {4335#true} #100#return; {4335#true} is VALID [2018-11-23 11:55:14,875 INFO L256 TraceCheckUtils]: 4: Hoare triple {4335#true} call #t~ret2 := main(); {4335#true} is VALID [2018-11-23 11:55:14,875 INFO L273 TraceCheckUtils]: 5: Hoare triple {4335#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4337#(= main_~i~0 0)} is VALID [2018-11-23 11:55:14,876 INFO L273 TraceCheckUtils]: 6: Hoare triple {4337#(= 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; {4338#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:14,877 INFO L273 TraceCheckUtils]: 7: Hoare triple {4338#(<= 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; {4339#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:14,877 INFO L273 TraceCheckUtils]: 8: Hoare triple {4339#(<= 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; {4340#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:14,878 INFO L273 TraceCheckUtils]: 9: Hoare triple {4340#(<= 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; {4341#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:14,879 INFO L273 TraceCheckUtils]: 10: Hoare triple {4341#(<= 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; {4342#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:14,880 INFO L273 TraceCheckUtils]: 11: Hoare triple {4342#(<= 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; {4343#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:14,881 INFO L273 TraceCheckUtils]: 12: Hoare triple {4343#(<= 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; {4344#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:14,882 INFO L273 TraceCheckUtils]: 13: Hoare triple {4344#(<= 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; {4345#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:14,883 INFO L273 TraceCheckUtils]: 14: Hoare triple {4345#(<= 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; {4346#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:14,884 INFO L273 TraceCheckUtils]: 15: Hoare triple {4346#(<= main_~i~0 9)} assume !(~i~0 < 100000); {4336#false} is VALID [2018-11-23 11:55:14,884 INFO L273 TraceCheckUtils]: 16: Hoare triple {4336#false} ~i~0 := 0; {4336#false} is VALID [2018-11-23 11:55:14,884 INFO L273 TraceCheckUtils]: 17: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:14,884 INFO L273 TraceCheckUtils]: 18: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:14,885 INFO L273 TraceCheckUtils]: 19: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:14,885 INFO L273 TraceCheckUtils]: 20: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:14,885 INFO L273 TraceCheckUtils]: 21: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:14,885 INFO L273 TraceCheckUtils]: 22: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:14,886 INFO L273 TraceCheckUtils]: 23: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:14,886 INFO L273 TraceCheckUtils]: 24: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:14,886 INFO L273 TraceCheckUtils]: 25: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:14,886 INFO L273 TraceCheckUtils]: 26: Hoare triple {4336#false} assume !(~i~0 < 100000); {4336#false} is VALID [2018-11-23 11:55:14,887 INFO L273 TraceCheckUtils]: 27: Hoare triple {4336#false} ~i~0 := 0; {4336#false} is VALID [2018-11-23 11:55:14,887 INFO L273 TraceCheckUtils]: 28: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:14,887 INFO L273 TraceCheckUtils]: 29: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:14,887 INFO L273 TraceCheckUtils]: 30: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:14,887 INFO L273 TraceCheckUtils]: 31: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:14,888 INFO L273 TraceCheckUtils]: 32: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:14,888 INFO L273 TraceCheckUtils]: 33: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:14,888 INFO L273 TraceCheckUtils]: 34: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:14,888 INFO L273 TraceCheckUtils]: 35: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:14,888 INFO L273 TraceCheckUtils]: 36: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:14,888 INFO L273 TraceCheckUtils]: 37: Hoare triple {4336#false} assume !(~i~0 < 100000); {4336#false} is VALID [2018-11-23 11:55:14,889 INFO L273 TraceCheckUtils]: 38: Hoare triple {4336#false} ~i~0 := 0; {4336#false} is VALID [2018-11-23 11:55:14,889 INFO L273 TraceCheckUtils]: 39: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:14,889 INFO L273 TraceCheckUtils]: 40: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:14,889 INFO L273 TraceCheckUtils]: 41: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:14,889 INFO L273 TraceCheckUtils]: 42: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:14,889 INFO L273 TraceCheckUtils]: 43: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:14,890 INFO L273 TraceCheckUtils]: 44: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:14,890 INFO L273 TraceCheckUtils]: 45: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:14,890 INFO L273 TraceCheckUtils]: 46: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:14,890 INFO L273 TraceCheckUtils]: 47: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:14,890 INFO L273 TraceCheckUtils]: 48: Hoare triple {4336#false} assume !(~i~0 < 100000); {4336#false} is VALID [2018-11-23 11:55:14,891 INFO L273 TraceCheckUtils]: 49: Hoare triple {4336#false} ~i~0 := 0; {4336#false} is VALID [2018-11-23 11:55:14,891 INFO L273 TraceCheckUtils]: 50: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:14,891 INFO L273 TraceCheckUtils]: 51: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:14,891 INFO L273 TraceCheckUtils]: 52: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:14,891 INFO L273 TraceCheckUtils]: 53: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:14,891 INFO L273 TraceCheckUtils]: 54: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:14,892 INFO L273 TraceCheckUtils]: 55: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:14,892 INFO L273 TraceCheckUtils]: 56: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:14,892 INFO L273 TraceCheckUtils]: 57: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:14,892 INFO L273 TraceCheckUtils]: 58: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:14,892 INFO L273 TraceCheckUtils]: 59: Hoare triple {4336#false} assume !(~i~0 < 100000); {4336#false} is VALID [2018-11-23 11:55:14,893 INFO L273 TraceCheckUtils]: 60: Hoare triple {4336#false} havoc ~x~0;~x~0 := 0; {4336#false} is VALID [2018-11-23 11:55:14,893 INFO L273 TraceCheckUtils]: 61: Hoare triple {4336#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4336#false} is VALID [2018-11-23 11:55:14,893 INFO L256 TraceCheckUtils]: 62: Hoare triple {4336#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {4336#false} is VALID [2018-11-23 11:55:14,893 INFO L273 TraceCheckUtils]: 63: Hoare triple {4336#false} ~cond := #in~cond; {4336#false} is VALID [2018-11-23 11:55:14,893 INFO L273 TraceCheckUtils]: 64: Hoare triple {4336#false} assume 0 == ~cond; {4336#false} is VALID [2018-11-23 11:55:14,893 INFO L273 TraceCheckUtils]: 65: Hoare triple {4336#false} assume !false; {4336#false} is VALID [2018-11-23 11:55:14,896 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-23 11:55:14,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:14,897 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:14,913 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:55:21,373 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 11:55:21,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:21,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:21,518 INFO L256 TraceCheckUtils]: 0: Hoare triple {4335#true} call ULTIMATE.init(); {4335#true} is VALID [2018-11-23 11:55:21,519 INFO L273 TraceCheckUtils]: 1: Hoare triple {4335#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4335#true} is VALID [2018-11-23 11:55:21,519 INFO L273 TraceCheckUtils]: 2: Hoare triple {4335#true} assume true; {4335#true} is VALID [2018-11-23 11:55:21,520 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4335#true} {4335#true} #100#return; {4335#true} is VALID [2018-11-23 11:55:21,520 INFO L256 TraceCheckUtils]: 4: Hoare triple {4335#true} call #t~ret2 := main(); {4335#true} is VALID [2018-11-23 11:55:21,520 INFO L273 TraceCheckUtils]: 5: Hoare triple {4335#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4335#true} is VALID [2018-11-23 11:55:21,521 INFO L273 TraceCheckUtils]: 6: Hoare triple {4335#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4335#true} is VALID [2018-11-23 11:55:21,521 INFO L273 TraceCheckUtils]: 7: Hoare triple {4335#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4335#true} is VALID [2018-11-23 11:55:21,521 INFO L273 TraceCheckUtils]: 8: Hoare triple {4335#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4335#true} is VALID [2018-11-23 11:55:21,522 INFO L273 TraceCheckUtils]: 9: Hoare triple {4335#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4335#true} is VALID [2018-11-23 11:55:21,522 INFO L273 TraceCheckUtils]: 10: Hoare triple {4335#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4335#true} is VALID [2018-11-23 11:55:21,522 INFO L273 TraceCheckUtils]: 11: Hoare triple {4335#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4335#true} is VALID [2018-11-23 11:55:21,522 INFO L273 TraceCheckUtils]: 12: Hoare triple {4335#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4335#true} is VALID [2018-11-23 11:55:21,523 INFO L273 TraceCheckUtils]: 13: Hoare triple {4335#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4335#true} is VALID [2018-11-23 11:55:21,523 INFO L273 TraceCheckUtils]: 14: Hoare triple {4335#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4335#true} is VALID [2018-11-23 11:55:21,523 INFO L273 TraceCheckUtils]: 15: Hoare triple {4335#true} assume !(~i~0 < 100000); {4335#true} is VALID [2018-11-23 11:55:21,523 INFO L273 TraceCheckUtils]: 16: Hoare triple {4335#true} ~i~0 := 0; {4335#true} is VALID [2018-11-23 11:55:21,523 INFO L273 TraceCheckUtils]: 17: Hoare triple {4335#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4335#true} is VALID [2018-11-23 11:55:21,524 INFO L273 TraceCheckUtils]: 18: Hoare triple {4335#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4335#true} is VALID [2018-11-23 11:55:21,524 INFO L273 TraceCheckUtils]: 19: Hoare triple {4335#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4335#true} is VALID [2018-11-23 11:55:21,524 INFO L273 TraceCheckUtils]: 20: Hoare triple {4335#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4335#true} is VALID [2018-11-23 11:55:21,524 INFO L273 TraceCheckUtils]: 21: Hoare triple {4335#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4335#true} is VALID [2018-11-23 11:55:21,525 INFO L273 TraceCheckUtils]: 22: Hoare triple {4335#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4335#true} is VALID [2018-11-23 11:55:21,525 INFO L273 TraceCheckUtils]: 23: Hoare triple {4335#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4335#true} is VALID [2018-11-23 11:55:21,525 INFO L273 TraceCheckUtils]: 24: Hoare triple {4335#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4335#true} is VALID [2018-11-23 11:55:21,525 INFO L273 TraceCheckUtils]: 25: Hoare triple {4335#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4335#true} is VALID [2018-11-23 11:55:21,525 INFO L273 TraceCheckUtils]: 26: Hoare triple {4335#true} assume !(~i~0 < 100000); {4335#true} is VALID [2018-11-23 11:55:21,540 INFO L273 TraceCheckUtils]: 27: Hoare triple {4335#true} ~i~0 := 0; {4431#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:21,549 INFO L273 TraceCheckUtils]: 28: Hoare triple {4431#(<= 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; {4338#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:21,561 INFO L273 TraceCheckUtils]: 29: Hoare triple {4338#(<= 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; {4339#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:21,562 INFO L273 TraceCheckUtils]: 30: Hoare triple {4339#(<= 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; {4340#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:21,562 INFO L273 TraceCheckUtils]: 31: Hoare triple {4340#(<= 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; {4341#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:21,582 INFO L273 TraceCheckUtils]: 32: Hoare triple {4341#(<= 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; {4342#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:21,597 INFO L273 TraceCheckUtils]: 33: Hoare triple {4342#(<= 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; {4343#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:21,604 INFO L273 TraceCheckUtils]: 34: Hoare triple {4343#(<= 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; {4344#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:21,605 INFO L273 TraceCheckUtils]: 35: Hoare triple {4344#(<= 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; {4345#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:21,606 INFO L273 TraceCheckUtils]: 36: Hoare triple {4345#(<= 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; {4346#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:21,606 INFO L273 TraceCheckUtils]: 37: Hoare triple {4346#(<= main_~i~0 9)} assume !(~i~0 < 100000); {4336#false} is VALID [2018-11-23 11:55:21,606 INFO L273 TraceCheckUtils]: 38: Hoare triple {4336#false} ~i~0 := 0; {4336#false} is VALID [2018-11-23 11:55:21,607 INFO L273 TraceCheckUtils]: 39: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:21,607 INFO L273 TraceCheckUtils]: 40: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:21,607 INFO L273 TraceCheckUtils]: 41: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:21,607 INFO L273 TraceCheckUtils]: 42: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:21,608 INFO L273 TraceCheckUtils]: 43: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:21,608 INFO L273 TraceCheckUtils]: 44: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:21,608 INFO L273 TraceCheckUtils]: 45: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:21,608 INFO L273 TraceCheckUtils]: 46: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:21,609 INFO L273 TraceCheckUtils]: 47: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:21,609 INFO L273 TraceCheckUtils]: 48: Hoare triple {4336#false} assume !(~i~0 < 100000); {4336#false} is VALID [2018-11-23 11:55:21,609 INFO L273 TraceCheckUtils]: 49: Hoare triple {4336#false} ~i~0 := 0; {4336#false} is VALID [2018-11-23 11:55:21,609 INFO L273 TraceCheckUtils]: 50: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:21,610 INFO L273 TraceCheckUtils]: 51: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:21,610 INFO L273 TraceCheckUtils]: 52: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:21,610 INFO L273 TraceCheckUtils]: 53: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:21,610 INFO L273 TraceCheckUtils]: 54: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:21,610 INFO L273 TraceCheckUtils]: 55: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:21,610 INFO L273 TraceCheckUtils]: 56: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:21,611 INFO L273 TraceCheckUtils]: 57: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:21,611 INFO L273 TraceCheckUtils]: 58: Hoare triple {4336#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4336#false} is VALID [2018-11-23 11:55:21,611 INFO L273 TraceCheckUtils]: 59: Hoare triple {4336#false} assume !(~i~0 < 100000); {4336#false} is VALID [2018-11-23 11:55:21,611 INFO L273 TraceCheckUtils]: 60: Hoare triple {4336#false} havoc ~x~0;~x~0 := 0; {4336#false} is VALID [2018-11-23 11:55:21,611 INFO L273 TraceCheckUtils]: 61: Hoare triple {4336#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4336#false} is VALID [2018-11-23 11:55:21,611 INFO L256 TraceCheckUtils]: 62: Hoare triple {4336#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {4336#false} is VALID [2018-11-23 11:55:21,612 INFO L273 TraceCheckUtils]: 63: Hoare triple {4336#false} ~cond := #in~cond; {4336#false} is VALID [2018-11-23 11:55:21,612 INFO L273 TraceCheckUtils]: 64: Hoare triple {4336#false} assume 0 == ~cond; {4336#false} is VALID [2018-11-23 11:55:21,612 INFO L273 TraceCheckUtils]: 65: Hoare triple {4336#false} assume !false; {4336#false} is VALID [2018-11-23 11:55:21,616 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-23 11:55:21,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:21,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 11:55:21,638 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2018-11-23 11:55:21,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:21,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:55:21,694 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:21,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:55:21,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:55:21,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:55:21,696 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 13 states. [2018-11-23 11:55:22,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:22,233 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2018-11-23 11:55:22,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:55:22,234 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2018-11-23 11:55:22,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:22,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:55:22,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 109 transitions. [2018-11-23 11:55:22,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:55:22,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 109 transitions. [2018-11-23 11:55:22,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 109 transitions. [2018-11-23 11:55:22,413 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:22,416 INFO L225 Difference]: With dead ends: 131 [2018-11-23 11:55:22,416 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 11:55:22,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:55:22,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 11:55:22,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-11-23 11:55:22,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:22,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 76 states. [2018-11-23 11:55:22,477 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2018-11-23 11:55:22,478 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2018-11-23 11:55:22,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:22,480 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2018-11-23 11:55:22,480 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-11-23 11:55:22,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:22,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:22,481 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2018-11-23 11:55:22,481 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2018-11-23 11:55:22,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:22,483 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2018-11-23 11:55:22,483 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-11-23 11:55:22,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:22,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:22,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:22,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:22,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 11:55:22,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2018-11-23 11:55:22,486 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 66 [2018-11-23 11:55:22,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:22,486 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2018-11-23 11:55:22,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:55:22,487 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-11-23 11:55:22,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 11:55:22,487 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:22,488 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:22,488 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:22,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:22,488 INFO L82 PathProgramCache]: Analyzing trace with hash 591181954, now seen corresponding path program 10 times [2018-11-23 11:55:22,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:22,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:22,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:22,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:22,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:23,183 INFO L256 TraceCheckUtils]: 0: Hoare triple {5071#true} call ULTIMATE.init(); {5071#true} is VALID [2018-11-23 11:55:23,183 INFO L273 TraceCheckUtils]: 1: Hoare triple {5071#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5071#true} is VALID [2018-11-23 11:55:23,183 INFO L273 TraceCheckUtils]: 2: Hoare triple {5071#true} assume true; {5071#true} is VALID [2018-11-23 11:55:23,184 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5071#true} {5071#true} #100#return; {5071#true} is VALID [2018-11-23 11:55:23,184 INFO L256 TraceCheckUtils]: 4: Hoare triple {5071#true} call #t~ret2 := main(); {5071#true} is VALID [2018-11-23 11:55:23,184 INFO L273 TraceCheckUtils]: 5: Hoare triple {5071#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5073#(= main_~i~0 0)} is VALID [2018-11-23 11:55:23,185 INFO L273 TraceCheckUtils]: 6: Hoare triple {5073#(= 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; {5074#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:23,186 INFO L273 TraceCheckUtils]: 7: Hoare triple {5074#(<= 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; {5075#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:23,187 INFO L273 TraceCheckUtils]: 8: Hoare triple {5075#(<= 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; {5076#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:23,188 INFO L273 TraceCheckUtils]: 9: Hoare triple {5076#(<= 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; {5077#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:23,189 INFO L273 TraceCheckUtils]: 10: Hoare triple {5077#(<= 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; {5078#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:23,190 INFO L273 TraceCheckUtils]: 11: Hoare triple {5078#(<= 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; {5079#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:23,191 INFO L273 TraceCheckUtils]: 12: Hoare triple {5079#(<= 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; {5080#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:23,192 INFO L273 TraceCheckUtils]: 13: Hoare triple {5080#(<= 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; {5081#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:23,193 INFO L273 TraceCheckUtils]: 14: Hoare triple {5081#(<= 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; {5082#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:23,194 INFO L273 TraceCheckUtils]: 15: Hoare triple {5082#(<= 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; {5083#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:23,195 INFO L273 TraceCheckUtils]: 16: Hoare triple {5083#(<= main_~i~0 10)} assume !(~i~0 < 100000); {5072#false} is VALID [2018-11-23 11:55:23,195 INFO L273 TraceCheckUtils]: 17: Hoare triple {5072#false} ~i~0 := 0; {5072#false} is VALID [2018-11-23 11:55:23,195 INFO L273 TraceCheckUtils]: 18: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,195 INFO L273 TraceCheckUtils]: 19: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,195 INFO L273 TraceCheckUtils]: 20: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,196 INFO L273 TraceCheckUtils]: 21: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,196 INFO L273 TraceCheckUtils]: 22: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,196 INFO L273 TraceCheckUtils]: 23: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,196 INFO L273 TraceCheckUtils]: 24: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,196 INFO L273 TraceCheckUtils]: 25: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,197 INFO L273 TraceCheckUtils]: 26: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,197 INFO L273 TraceCheckUtils]: 27: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,197 INFO L273 TraceCheckUtils]: 28: Hoare triple {5072#false} assume !(~i~0 < 100000); {5072#false} is VALID [2018-11-23 11:55:23,197 INFO L273 TraceCheckUtils]: 29: Hoare triple {5072#false} ~i~0 := 0; {5072#false} is VALID [2018-11-23 11:55:23,198 INFO L273 TraceCheckUtils]: 30: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,198 INFO L273 TraceCheckUtils]: 31: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,198 INFO L273 TraceCheckUtils]: 32: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,199 INFO L273 TraceCheckUtils]: 33: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,199 INFO L273 TraceCheckUtils]: 34: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,199 INFO L273 TraceCheckUtils]: 35: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,199 INFO L273 TraceCheckUtils]: 36: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,199 INFO L273 TraceCheckUtils]: 37: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,200 INFO L273 TraceCheckUtils]: 38: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,200 INFO L273 TraceCheckUtils]: 39: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,200 INFO L273 TraceCheckUtils]: 40: Hoare triple {5072#false} assume !(~i~0 < 100000); {5072#false} is VALID [2018-11-23 11:55:23,200 INFO L273 TraceCheckUtils]: 41: Hoare triple {5072#false} ~i~0 := 0; {5072#false} is VALID [2018-11-23 11:55:23,200 INFO L273 TraceCheckUtils]: 42: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,200 INFO L273 TraceCheckUtils]: 43: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,201 INFO L273 TraceCheckUtils]: 44: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,201 INFO L273 TraceCheckUtils]: 45: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,201 INFO L273 TraceCheckUtils]: 46: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,201 INFO L273 TraceCheckUtils]: 47: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,201 INFO L273 TraceCheckUtils]: 48: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,201 INFO L273 TraceCheckUtils]: 49: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,202 INFO L273 TraceCheckUtils]: 50: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,202 INFO L273 TraceCheckUtils]: 51: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,202 INFO L273 TraceCheckUtils]: 52: Hoare triple {5072#false} assume !(~i~0 < 100000); {5072#false} is VALID [2018-11-23 11:55:23,202 INFO L273 TraceCheckUtils]: 53: Hoare triple {5072#false} ~i~0 := 0; {5072#false} is VALID [2018-11-23 11:55:23,202 INFO L273 TraceCheckUtils]: 54: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,202 INFO L273 TraceCheckUtils]: 55: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,203 INFO L273 TraceCheckUtils]: 56: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,203 INFO L273 TraceCheckUtils]: 57: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,203 INFO L273 TraceCheckUtils]: 58: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,203 INFO L273 TraceCheckUtils]: 59: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,203 INFO L273 TraceCheckUtils]: 60: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,203 INFO L273 TraceCheckUtils]: 61: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,204 INFO L273 TraceCheckUtils]: 62: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,204 INFO L273 TraceCheckUtils]: 63: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,204 INFO L273 TraceCheckUtils]: 64: Hoare triple {5072#false} assume !(~i~0 < 100000); {5072#false} is VALID [2018-11-23 11:55:23,204 INFO L273 TraceCheckUtils]: 65: Hoare triple {5072#false} havoc ~x~0;~x~0 := 0; {5072#false} is VALID [2018-11-23 11:55:23,204 INFO L273 TraceCheckUtils]: 66: Hoare triple {5072#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5072#false} is VALID [2018-11-23 11:55:23,204 INFO L256 TraceCheckUtils]: 67: Hoare triple {5072#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {5072#false} is VALID [2018-11-23 11:55:23,205 INFO L273 TraceCheckUtils]: 68: Hoare triple {5072#false} ~cond := #in~cond; {5072#false} is VALID [2018-11-23 11:55:23,205 INFO L273 TraceCheckUtils]: 69: Hoare triple {5072#false} assume 0 == ~cond; {5072#false} is VALID [2018-11-23 11:55:23,205 INFO L273 TraceCheckUtils]: 70: Hoare triple {5072#false} assume !false; {5072#false} is VALID [2018-11-23 11:55:23,208 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-23 11:55:23,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:23,208 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:23,225 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:55:23,267 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:55:23,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:23,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:23,412 INFO L256 TraceCheckUtils]: 0: Hoare triple {5071#true} call ULTIMATE.init(); {5071#true} is VALID [2018-11-23 11:55:23,413 INFO L273 TraceCheckUtils]: 1: Hoare triple {5071#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5071#true} is VALID [2018-11-23 11:55:23,413 INFO L273 TraceCheckUtils]: 2: Hoare triple {5071#true} assume true; {5071#true} is VALID [2018-11-23 11:55:23,413 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5071#true} {5071#true} #100#return; {5071#true} is VALID [2018-11-23 11:55:23,413 INFO L256 TraceCheckUtils]: 4: Hoare triple {5071#true} call #t~ret2 := main(); {5071#true} is VALID [2018-11-23 11:55:23,414 INFO L273 TraceCheckUtils]: 5: Hoare triple {5071#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5102#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:23,415 INFO L273 TraceCheckUtils]: 6: Hoare triple {5102#(<= 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; {5074#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:23,415 INFO L273 TraceCheckUtils]: 7: Hoare triple {5074#(<= 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; {5075#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:23,416 INFO L273 TraceCheckUtils]: 8: Hoare triple {5075#(<= 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; {5076#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:23,416 INFO L273 TraceCheckUtils]: 9: Hoare triple {5076#(<= 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; {5077#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:23,417 INFO L273 TraceCheckUtils]: 10: Hoare triple {5077#(<= 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; {5078#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:23,418 INFO L273 TraceCheckUtils]: 11: Hoare triple {5078#(<= 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; {5079#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:23,418 INFO L273 TraceCheckUtils]: 12: Hoare triple {5079#(<= 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; {5080#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:23,419 INFO L273 TraceCheckUtils]: 13: Hoare triple {5080#(<= 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; {5081#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:23,420 INFO L273 TraceCheckUtils]: 14: Hoare triple {5081#(<= 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; {5082#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:23,421 INFO L273 TraceCheckUtils]: 15: Hoare triple {5082#(<= 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; {5083#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:23,422 INFO L273 TraceCheckUtils]: 16: Hoare triple {5083#(<= main_~i~0 10)} assume !(~i~0 < 100000); {5072#false} is VALID [2018-11-23 11:55:23,422 INFO L273 TraceCheckUtils]: 17: Hoare triple {5072#false} ~i~0 := 0; {5072#false} is VALID [2018-11-23 11:55:23,422 INFO L273 TraceCheckUtils]: 18: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,422 INFO L273 TraceCheckUtils]: 19: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,423 INFO L273 TraceCheckUtils]: 20: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,423 INFO L273 TraceCheckUtils]: 21: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,423 INFO L273 TraceCheckUtils]: 22: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,423 INFO L273 TraceCheckUtils]: 23: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,424 INFO L273 TraceCheckUtils]: 24: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,424 INFO L273 TraceCheckUtils]: 25: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,424 INFO L273 TraceCheckUtils]: 26: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,424 INFO L273 TraceCheckUtils]: 27: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,424 INFO L273 TraceCheckUtils]: 28: Hoare triple {5072#false} assume !(~i~0 < 100000); {5072#false} is VALID [2018-11-23 11:55:23,425 INFO L273 TraceCheckUtils]: 29: Hoare triple {5072#false} ~i~0 := 0; {5072#false} is VALID [2018-11-23 11:55:23,425 INFO L273 TraceCheckUtils]: 30: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,425 INFO L273 TraceCheckUtils]: 31: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,425 INFO L273 TraceCheckUtils]: 32: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,425 INFO L273 TraceCheckUtils]: 33: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,425 INFO L273 TraceCheckUtils]: 34: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,426 INFO L273 TraceCheckUtils]: 35: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,426 INFO L273 TraceCheckUtils]: 36: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,426 INFO L273 TraceCheckUtils]: 37: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,426 INFO L273 TraceCheckUtils]: 38: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,426 INFO L273 TraceCheckUtils]: 39: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,426 INFO L273 TraceCheckUtils]: 40: Hoare triple {5072#false} assume !(~i~0 < 100000); {5072#false} is VALID [2018-11-23 11:55:23,426 INFO L273 TraceCheckUtils]: 41: Hoare triple {5072#false} ~i~0 := 0; {5072#false} is VALID [2018-11-23 11:55:23,426 INFO L273 TraceCheckUtils]: 42: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,427 INFO L273 TraceCheckUtils]: 43: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,427 INFO L273 TraceCheckUtils]: 44: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,427 INFO L273 TraceCheckUtils]: 45: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,427 INFO L273 TraceCheckUtils]: 46: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,427 INFO L273 TraceCheckUtils]: 47: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,427 INFO L273 TraceCheckUtils]: 48: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,427 INFO L273 TraceCheckUtils]: 49: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,427 INFO L273 TraceCheckUtils]: 50: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,427 INFO L273 TraceCheckUtils]: 51: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,428 INFO L273 TraceCheckUtils]: 52: Hoare triple {5072#false} assume !(~i~0 < 100000); {5072#false} is VALID [2018-11-23 11:55:23,428 INFO L273 TraceCheckUtils]: 53: Hoare triple {5072#false} ~i~0 := 0; {5072#false} is VALID [2018-11-23 11:55:23,428 INFO L273 TraceCheckUtils]: 54: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,428 INFO L273 TraceCheckUtils]: 55: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,428 INFO L273 TraceCheckUtils]: 56: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,428 INFO L273 TraceCheckUtils]: 57: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,428 INFO L273 TraceCheckUtils]: 58: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,428 INFO L273 TraceCheckUtils]: 59: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,429 INFO L273 TraceCheckUtils]: 60: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,429 INFO L273 TraceCheckUtils]: 61: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,429 INFO L273 TraceCheckUtils]: 62: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,429 INFO L273 TraceCheckUtils]: 63: Hoare triple {5072#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5072#false} is VALID [2018-11-23 11:55:23,429 INFO L273 TraceCheckUtils]: 64: Hoare triple {5072#false} assume !(~i~0 < 100000); {5072#false} is VALID [2018-11-23 11:55:23,429 INFO L273 TraceCheckUtils]: 65: Hoare triple {5072#false} havoc ~x~0;~x~0 := 0; {5072#false} is VALID [2018-11-23 11:55:23,429 INFO L273 TraceCheckUtils]: 66: Hoare triple {5072#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5072#false} is VALID [2018-11-23 11:55:23,429 INFO L256 TraceCheckUtils]: 67: Hoare triple {5072#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {5072#false} is VALID [2018-11-23 11:55:23,430 INFO L273 TraceCheckUtils]: 68: Hoare triple {5072#false} ~cond := #in~cond; {5072#false} is VALID [2018-11-23 11:55:23,430 INFO L273 TraceCheckUtils]: 69: Hoare triple {5072#false} assume 0 == ~cond; {5072#false} is VALID [2018-11-23 11:55:23,430 INFO L273 TraceCheckUtils]: 70: Hoare triple {5072#false} assume !false; {5072#false} is VALID [2018-11-23 11:55:23,432 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-23 11:55:23,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:23,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 11:55:23,451 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-11-23 11:55:23,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:23,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:55:23,486 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:23,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:55:23,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:55:23,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:55:23,487 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 14 states. [2018-11-23 11:55:24,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:24,190 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2018-11-23 11:55:24,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:55:24,190 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-11-23 11:55:24,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:24,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:55:24,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 114 transitions. [2018-11-23 11:55:24,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:55:24,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 114 transitions. [2018-11-23 11:55:24,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 114 transitions. [2018-11-23 11:55:24,704 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:24,706 INFO L225 Difference]: With dead ends: 140 [2018-11-23 11:55:24,707 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 11:55:24,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 71 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-23 11:55:24,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 11:55:24,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-11-23 11:55:24,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:24,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 81 states. [2018-11-23 11:55:24,766 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2018-11-23 11:55:24,767 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2018-11-23 11:55:24,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:24,769 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-11-23 11:55:24,769 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2018-11-23 11:55:24,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:24,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:24,769 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2018-11-23 11:55:24,769 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2018-11-23 11:55:24,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:24,771 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-11-23 11:55:24,771 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2018-11-23 11:55:24,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:24,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:24,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:24,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:24,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 11:55:24,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2018-11-23 11:55:24,774 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 71 [2018-11-23 11:55:24,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:24,774 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2018-11-23 11:55:24,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:55:24,774 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2018-11-23 11:55:24,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 11:55:24,775 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:24,775 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:24,775 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:24,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:24,776 INFO L82 PathProgramCache]: Analyzing trace with hash 665957076, now seen corresponding path program 11 times [2018-11-23 11:55:24,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:24,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:24,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:24,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:24,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:25,791 INFO L256 TraceCheckUtils]: 0: Hoare triple {5861#true} call ULTIMATE.init(); {5861#true} is VALID [2018-11-23 11:55:25,791 INFO L273 TraceCheckUtils]: 1: Hoare triple {5861#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5861#true} is VALID [2018-11-23 11:55:25,791 INFO L273 TraceCheckUtils]: 2: Hoare triple {5861#true} assume true; {5861#true} is VALID [2018-11-23 11:55:25,792 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5861#true} {5861#true} #100#return; {5861#true} is VALID [2018-11-23 11:55:25,792 INFO L256 TraceCheckUtils]: 4: Hoare triple {5861#true} call #t~ret2 := main(); {5861#true} is VALID [2018-11-23 11:55:25,792 INFO L273 TraceCheckUtils]: 5: Hoare triple {5861#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5863#(= main_~i~0 0)} is VALID [2018-11-23 11:55:25,793 INFO L273 TraceCheckUtils]: 6: Hoare triple {5863#(= 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; {5864#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:25,794 INFO L273 TraceCheckUtils]: 7: Hoare triple {5864#(<= 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; {5865#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:25,795 INFO L273 TraceCheckUtils]: 8: Hoare triple {5865#(<= 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; {5866#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:25,796 INFO L273 TraceCheckUtils]: 9: Hoare triple {5866#(<= 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; {5867#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:25,797 INFO L273 TraceCheckUtils]: 10: Hoare triple {5867#(<= 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; {5868#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:25,798 INFO L273 TraceCheckUtils]: 11: Hoare triple {5868#(<= 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; {5869#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:25,798 INFO L273 TraceCheckUtils]: 12: Hoare triple {5869#(<= 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; {5870#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:25,799 INFO L273 TraceCheckUtils]: 13: Hoare triple {5870#(<= 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; {5871#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:25,800 INFO L273 TraceCheckUtils]: 14: Hoare triple {5871#(<= 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; {5872#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:25,801 INFO L273 TraceCheckUtils]: 15: Hoare triple {5872#(<= 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; {5873#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:25,802 INFO L273 TraceCheckUtils]: 16: Hoare triple {5873#(<= 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; {5874#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:25,803 INFO L273 TraceCheckUtils]: 17: Hoare triple {5874#(<= main_~i~0 11)} assume !(~i~0 < 100000); {5862#false} is VALID [2018-11-23 11:55:25,803 INFO L273 TraceCheckUtils]: 18: Hoare triple {5862#false} ~i~0 := 0; {5862#false} is VALID [2018-11-23 11:55:25,803 INFO L273 TraceCheckUtils]: 19: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,803 INFO L273 TraceCheckUtils]: 20: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,803 INFO L273 TraceCheckUtils]: 21: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,804 INFO L273 TraceCheckUtils]: 22: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,804 INFO L273 TraceCheckUtils]: 23: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,804 INFO L273 TraceCheckUtils]: 24: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,804 INFO L273 TraceCheckUtils]: 25: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,804 INFO L273 TraceCheckUtils]: 26: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,804 INFO L273 TraceCheckUtils]: 27: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,805 INFO L273 TraceCheckUtils]: 28: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,805 INFO L273 TraceCheckUtils]: 29: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,805 INFO L273 TraceCheckUtils]: 30: Hoare triple {5862#false} assume !(~i~0 < 100000); {5862#false} is VALID [2018-11-23 11:55:25,805 INFO L273 TraceCheckUtils]: 31: Hoare triple {5862#false} ~i~0 := 0; {5862#false} is VALID [2018-11-23 11:55:25,805 INFO L273 TraceCheckUtils]: 32: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,806 INFO L273 TraceCheckUtils]: 33: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,806 INFO L273 TraceCheckUtils]: 34: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,806 INFO L273 TraceCheckUtils]: 35: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,806 INFO L273 TraceCheckUtils]: 36: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,806 INFO L273 TraceCheckUtils]: 37: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,806 INFO L273 TraceCheckUtils]: 38: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,806 INFO L273 TraceCheckUtils]: 39: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,807 INFO L273 TraceCheckUtils]: 40: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,807 INFO L273 TraceCheckUtils]: 41: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,807 INFO L273 TraceCheckUtils]: 42: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,807 INFO L273 TraceCheckUtils]: 43: Hoare triple {5862#false} assume !(~i~0 < 100000); {5862#false} is VALID [2018-11-23 11:55:25,807 INFO L273 TraceCheckUtils]: 44: Hoare triple {5862#false} ~i~0 := 0; {5862#false} is VALID [2018-11-23 11:55:25,807 INFO L273 TraceCheckUtils]: 45: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,807 INFO L273 TraceCheckUtils]: 46: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,807 INFO L273 TraceCheckUtils]: 47: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,807 INFO L273 TraceCheckUtils]: 48: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,808 INFO L273 TraceCheckUtils]: 49: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,808 INFO L273 TraceCheckUtils]: 50: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,808 INFO L273 TraceCheckUtils]: 51: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,808 INFO L273 TraceCheckUtils]: 52: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,808 INFO L273 TraceCheckUtils]: 53: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,808 INFO L273 TraceCheckUtils]: 54: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,808 INFO L273 TraceCheckUtils]: 55: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,808 INFO L273 TraceCheckUtils]: 56: Hoare triple {5862#false} assume !(~i~0 < 100000); {5862#false} is VALID [2018-11-23 11:55:25,809 INFO L273 TraceCheckUtils]: 57: Hoare triple {5862#false} ~i~0 := 0; {5862#false} is VALID [2018-11-23 11:55:25,809 INFO L273 TraceCheckUtils]: 58: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,809 INFO L273 TraceCheckUtils]: 59: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,809 INFO L273 TraceCheckUtils]: 60: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,809 INFO L273 TraceCheckUtils]: 61: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,809 INFO L273 TraceCheckUtils]: 62: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,809 INFO L273 TraceCheckUtils]: 63: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,809 INFO L273 TraceCheckUtils]: 64: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,809 INFO L273 TraceCheckUtils]: 65: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,810 INFO L273 TraceCheckUtils]: 66: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,810 INFO L273 TraceCheckUtils]: 67: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,810 INFO L273 TraceCheckUtils]: 68: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:55:25,810 INFO L273 TraceCheckUtils]: 69: Hoare triple {5862#false} assume !(~i~0 < 100000); {5862#false} is VALID [2018-11-23 11:55:25,810 INFO L273 TraceCheckUtils]: 70: Hoare triple {5862#false} havoc ~x~0;~x~0 := 0; {5862#false} is VALID [2018-11-23 11:55:25,810 INFO L273 TraceCheckUtils]: 71: Hoare triple {5862#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5862#false} is VALID [2018-11-23 11:55:25,810 INFO L256 TraceCheckUtils]: 72: Hoare triple {5862#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {5862#false} is VALID [2018-11-23 11:55:25,810 INFO L273 TraceCheckUtils]: 73: Hoare triple {5862#false} ~cond := #in~cond; {5862#false} is VALID [2018-11-23 11:55:25,811 INFO L273 TraceCheckUtils]: 74: Hoare triple {5862#false} assume 0 == ~cond; {5862#false} is VALID [2018-11-23 11:55:25,811 INFO L273 TraceCheckUtils]: 75: Hoare triple {5862#false} assume !false; {5862#false} is VALID [2018-11-23 11:55:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-11-23 11:55:25,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:25,814 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:25,822 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:56:04,881 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 11:56:04,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:04,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:05,060 INFO L256 TraceCheckUtils]: 0: Hoare triple {5861#true} call ULTIMATE.init(); {5861#true} is VALID [2018-11-23 11:56:05,060 INFO L273 TraceCheckUtils]: 1: Hoare triple {5861#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5861#true} is VALID [2018-11-23 11:56:05,061 INFO L273 TraceCheckUtils]: 2: Hoare triple {5861#true} assume true; {5861#true} is VALID [2018-11-23 11:56:05,061 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5861#true} {5861#true} #100#return; {5861#true} is VALID [2018-11-23 11:56:05,061 INFO L256 TraceCheckUtils]: 4: Hoare triple {5861#true} call #t~ret2 := main(); {5861#true} is VALID [2018-11-23 11:56:05,063 INFO L273 TraceCheckUtils]: 5: Hoare triple {5861#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5893#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:05,064 INFO L273 TraceCheckUtils]: 6: Hoare triple {5893#(<= 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; {5864#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:05,064 INFO L273 TraceCheckUtils]: 7: Hoare triple {5864#(<= 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; {5865#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:05,065 INFO L273 TraceCheckUtils]: 8: Hoare triple {5865#(<= 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; {5866#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:05,065 INFO L273 TraceCheckUtils]: 9: Hoare triple {5866#(<= 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; {5867#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:05,066 INFO L273 TraceCheckUtils]: 10: Hoare triple {5867#(<= 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; {5868#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:05,066 INFO L273 TraceCheckUtils]: 11: Hoare triple {5868#(<= 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; {5869#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:05,067 INFO L273 TraceCheckUtils]: 12: Hoare triple {5869#(<= 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; {5870#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:05,068 INFO L273 TraceCheckUtils]: 13: Hoare triple {5870#(<= 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; {5871#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:05,069 INFO L273 TraceCheckUtils]: 14: Hoare triple {5871#(<= 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; {5872#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:05,070 INFO L273 TraceCheckUtils]: 15: Hoare triple {5872#(<= 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; {5873#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:05,071 INFO L273 TraceCheckUtils]: 16: Hoare triple {5873#(<= 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; {5874#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:05,071 INFO L273 TraceCheckUtils]: 17: Hoare triple {5874#(<= main_~i~0 11)} assume !(~i~0 < 100000); {5862#false} is VALID [2018-11-23 11:56:05,072 INFO L273 TraceCheckUtils]: 18: Hoare triple {5862#false} ~i~0 := 0; {5862#false} is VALID [2018-11-23 11:56:05,072 INFO L273 TraceCheckUtils]: 19: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,072 INFO L273 TraceCheckUtils]: 20: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,072 INFO L273 TraceCheckUtils]: 21: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,072 INFO L273 TraceCheckUtils]: 22: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,073 INFO L273 TraceCheckUtils]: 23: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,073 INFO L273 TraceCheckUtils]: 24: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,073 INFO L273 TraceCheckUtils]: 25: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,073 INFO L273 TraceCheckUtils]: 26: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,073 INFO L273 TraceCheckUtils]: 27: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,074 INFO L273 TraceCheckUtils]: 28: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,074 INFO L273 TraceCheckUtils]: 29: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,074 INFO L273 TraceCheckUtils]: 30: Hoare triple {5862#false} assume !(~i~0 < 100000); {5862#false} is VALID [2018-11-23 11:56:05,074 INFO L273 TraceCheckUtils]: 31: Hoare triple {5862#false} ~i~0 := 0; {5862#false} is VALID [2018-11-23 11:56:05,075 INFO L273 TraceCheckUtils]: 32: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,075 INFO L273 TraceCheckUtils]: 33: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,075 INFO L273 TraceCheckUtils]: 34: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,075 INFO L273 TraceCheckUtils]: 35: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,075 INFO L273 TraceCheckUtils]: 36: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,075 INFO L273 TraceCheckUtils]: 37: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,075 INFO L273 TraceCheckUtils]: 38: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,076 INFO L273 TraceCheckUtils]: 39: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,076 INFO L273 TraceCheckUtils]: 40: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,076 INFO L273 TraceCheckUtils]: 41: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,076 INFO L273 TraceCheckUtils]: 42: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,076 INFO L273 TraceCheckUtils]: 43: Hoare triple {5862#false} assume !(~i~0 < 100000); {5862#false} is VALID [2018-11-23 11:56:05,076 INFO L273 TraceCheckUtils]: 44: Hoare triple {5862#false} ~i~0 := 0; {5862#false} is VALID [2018-11-23 11:56:05,076 INFO L273 TraceCheckUtils]: 45: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,076 INFO L273 TraceCheckUtils]: 46: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,076 INFO L273 TraceCheckUtils]: 47: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,077 INFO L273 TraceCheckUtils]: 48: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,077 INFO L273 TraceCheckUtils]: 49: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,077 INFO L273 TraceCheckUtils]: 50: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,077 INFO L273 TraceCheckUtils]: 51: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,077 INFO L273 TraceCheckUtils]: 52: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,077 INFO L273 TraceCheckUtils]: 53: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,077 INFO L273 TraceCheckUtils]: 54: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,077 INFO L273 TraceCheckUtils]: 55: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,078 INFO L273 TraceCheckUtils]: 56: Hoare triple {5862#false} assume !(~i~0 < 100000); {5862#false} is VALID [2018-11-23 11:56:05,078 INFO L273 TraceCheckUtils]: 57: Hoare triple {5862#false} ~i~0 := 0; {5862#false} is VALID [2018-11-23 11:56:05,078 INFO L273 TraceCheckUtils]: 58: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,078 INFO L273 TraceCheckUtils]: 59: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,078 INFO L273 TraceCheckUtils]: 60: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,078 INFO L273 TraceCheckUtils]: 61: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,078 INFO L273 TraceCheckUtils]: 62: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,078 INFO L273 TraceCheckUtils]: 63: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,078 INFO L273 TraceCheckUtils]: 64: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,079 INFO L273 TraceCheckUtils]: 65: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,079 INFO L273 TraceCheckUtils]: 66: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,079 INFO L273 TraceCheckUtils]: 67: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,079 INFO L273 TraceCheckUtils]: 68: Hoare triple {5862#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#false} is VALID [2018-11-23 11:56:05,079 INFO L273 TraceCheckUtils]: 69: Hoare triple {5862#false} assume !(~i~0 < 100000); {5862#false} is VALID [2018-11-23 11:56:05,079 INFO L273 TraceCheckUtils]: 70: Hoare triple {5862#false} havoc ~x~0;~x~0 := 0; {5862#false} is VALID [2018-11-23 11:56:05,079 INFO L273 TraceCheckUtils]: 71: Hoare triple {5862#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5862#false} is VALID [2018-11-23 11:56:05,079 INFO L256 TraceCheckUtils]: 72: Hoare triple {5862#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {5862#false} is VALID [2018-11-23 11:56:05,080 INFO L273 TraceCheckUtils]: 73: Hoare triple {5862#false} ~cond := #in~cond; {5862#false} is VALID [2018-11-23 11:56:05,080 INFO L273 TraceCheckUtils]: 74: Hoare triple {5862#false} assume 0 == ~cond; {5862#false} is VALID [2018-11-23 11:56:05,080 INFO L273 TraceCheckUtils]: 75: Hoare triple {5862#false} assume !false; {5862#false} is VALID [2018-11-23 11:56:05,082 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-11-23 11:56:05,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:05,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 11:56:05,109 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 76 [2018-11-23 11:56:05,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:05,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:56:05,138 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:05,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:56:05,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:56:05,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:56:05,139 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand 15 states. [2018-11-23 11:56:05,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:05,915 INFO L93 Difference]: Finished difference Result 149 states and 163 transitions. [2018-11-23 11:56:05,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:56:05,915 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 76 [2018-11-23 11:56:05,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:05,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:56:05,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 119 transitions. [2018-11-23 11:56:05,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:56:05,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 119 transitions. [2018-11-23 11:56:05,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 119 transitions. [2018-11-23 11:56:06,888 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:06,891 INFO L225 Difference]: With dead ends: 149 [2018-11-23 11:56:06,892 INFO L226 Difference]: Without dead ends: 86 [2018-11-23 11:56:06,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:56:06,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-23 11:56:06,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-23 11:56:06,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:06,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 86 states. [2018-11-23 11:56:06,996 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 86 states. [2018-11-23 11:56:06,996 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 86 states. [2018-11-23 11:56:06,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:06,998 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-11-23 11:56:06,998 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-11-23 11:56:06,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:06,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:06,998 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 86 states. [2018-11-23 11:56:06,999 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 86 states. [2018-11-23 11:56:07,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:07,001 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-11-23 11:56:07,001 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-11-23 11:56:07,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:07,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:07,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:07,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:07,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 11:56:07,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-11-23 11:56:07,003 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 76 [2018-11-23 11:56:07,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:07,004 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-11-23 11:56:07,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:56:07,004 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-11-23 11:56:07,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 11:56:07,005 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:07,005 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:07,005 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:07,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:07,006 INFO L82 PathProgramCache]: Analyzing trace with hash 725345218, now seen corresponding path program 12 times [2018-11-23 11:56:07,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:07,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:07,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:07,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:07,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:07,674 INFO L256 TraceCheckUtils]: 0: Hoare triple {6705#true} call ULTIMATE.init(); {6705#true} is VALID [2018-11-23 11:56:07,674 INFO L273 TraceCheckUtils]: 1: Hoare triple {6705#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6705#true} is VALID [2018-11-23 11:56:07,674 INFO L273 TraceCheckUtils]: 2: Hoare triple {6705#true} assume true; {6705#true} is VALID [2018-11-23 11:56:07,674 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6705#true} {6705#true} #100#return; {6705#true} is VALID [2018-11-23 11:56:07,675 INFO L256 TraceCheckUtils]: 4: Hoare triple {6705#true} call #t~ret2 := main(); {6705#true} is VALID [2018-11-23 11:56:07,675 INFO L273 TraceCheckUtils]: 5: Hoare triple {6705#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6707#(= main_~i~0 0)} is VALID [2018-11-23 11:56:07,676 INFO L273 TraceCheckUtils]: 6: Hoare triple {6707#(= 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; {6708#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:07,677 INFO L273 TraceCheckUtils]: 7: Hoare triple {6708#(<= 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; {6709#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:07,677 INFO L273 TraceCheckUtils]: 8: Hoare triple {6709#(<= 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; {6710#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:07,678 INFO L273 TraceCheckUtils]: 9: Hoare triple {6710#(<= 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; {6711#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:07,679 INFO L273 TraceCheckUtils]: 10: Hoare triple {6711#(<= 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; {6712#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:07,680 INFO L273 TraceCheckUtils]: 11: Hoare triple {6712#(<= 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; {6713#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:07,681 INFO L273 TraceCheckUtils]: 12: Hoare triple {6713#(<= 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; {6714#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:07,682 INFO L273 TraceCheckUtils]: 13: Hoare triple {6714#(<= 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; {6715#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:07,682 INFO L273 TraceCheckUtils]: 14: Hoare triple {6715#(<= 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; {6716#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:07,683 INFO L273 TraceCheckUtils]: 15: Hoare triple {6716#(<= 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; {6717#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:07,684 INFO L273 TraceCheckUtils]: 16: Hoare triple {6717#(<= 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; {6718#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:07,685 INFO L273 TraceCheckUtils]: 17: Hoare triple {6718#(<= 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; {6719#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:07,686 INFO L273 TraceCheckUtils]: 18: Hoare triple {6719#(<= main_~i~0 12)} assume !(~i~0 < 100000); {6706#false} is VALID [2018-11-23 11:56:07,686 INFO L273 TraceCheckUtils]: 19: Hoare triple {6706#false} ~i~0 := 0; {6706#false} is VALID [2018-11-23 11:56:07,686 INFO L273 TraceCheckUtils]: 20: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,687 INFO L273 TraceCheckUtils]: 21: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,687 INFO L273 TraceCheckUtils]: 22: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,687 INFO L273 TraceCheckUtils]: 23: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,687 INFO L273 TraceCheckUtils]: 24: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,688 INFO L273 TraceCheckUtils]: 25: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,688 INFO L273 TraceCheckUtils]: 26: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,688 INFO L273 TraceCheckUtils]: 27: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,688 INFO L273 TraceCheckUtils]: 28: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,688 INFO L273 TraceCheckUtils]: 29: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,689 INFO L273 TraceCheckUtils]: 30: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,689 INFO L273 TraceCheckUtils]: 31: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,689 INFO L273 TraceCheckUtils]: 32: Hoare triple {6706#false} assume !(~i~0 < 100000); {6706#false} is VALID [2018-11-23 11:56:07,689 INFO L273 TraceCheckUtils]: 33: Hoare triple {6706#false} ~i~0 := 0; {6706#false} is VALID [2018-11-23 11:56:07,689 INFO L273 TraceCheckUtils]: 34: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,690 INFO L273 TraceCheckUtils]: 35: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,690 INFO L273 TraceCheckUtils]: 36: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,690 INFO L273 TraceCheckUtils]: 37: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,690 INFO L273 TraceCheckUtils]: 38: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,690 INFO L273 TraceCheckUtils]: 39: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,690 INFO L273 TraceCheckUtils]: 40: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,690 INFO L273 TraceCheckUtils]: 41: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,691 INFO L273 TraceCheckUtils]: 42: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,691 INFO L273 TraceCheckUtils]: 43: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,691 INFO L273 TraceCheckUtils]: 44: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,691 INFO L273 TraceCheckUtils]: 45: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,691 INFO L273 TraceCheckUtils]: 46: Hoare triple {6706#false} assume !(~i~0 < 100000); {6706#false} is VALID [2018-11-23 11:56:07,691 INFO L273 TraceCheckUtils]: 47: Hoare triple {6706#false} ~i~0 := 0; {6706#false} is VALID [2018-11-23 11:56:07,691 INFO L273 TraceCheckUtils]: 48: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,691 INFO L273 TraceCheckUtils]: 49: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,692 INFO L273 TraceCheckUtils]: 50: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,692 INFO L273 TraceCheckUtils]: 51: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,692 INFO L273 TraceCheckUtils]: 52: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,692 INFO L273 TraceCheckUtils]: 53: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,692 INFO L273 TraceCheckUtils]: 54: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,692 INFO L273 TraceCheckUtils]: 55: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,692 INFO L273 TraceCheckUtils]: 56: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,692 INFO L273 TraceCheckUtils]: 57: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,692 INFO L273 TraceCheckUtils]: 58: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,693 INFO L273 TraceCheckUtils]: 59: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,693 INFO L273 TraceCheckUtils]: 60: Hoare triple {6706#false} assume !(~i~0 < 100000); {6706#false} is VALID [2018-11-23 11:56:07,693 INFO L273 TraceCheckUtils]: 61: Hoare triple {6706#false} ~i~0 := 0; {6706#false} is VALID [2018-11-23 11:56:07,693 INFO L273 TraceCheckUtils]: 62: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,693 INFO L273 TraceCheckUtils]: 63: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,693 INFO L273 TraceCheckUtils]: 64: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,693 INFO L273 TraceCheckUtils]: 65: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,693 INFO L273 TraceCheckUtils]: 66: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,694 INFO L273 TraceCheckUtils]: 67: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,694 INFO L273 TraceCheckUtils]: 68: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,694 INFO L273 TraceCheckUtils]: 69: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,694 INFO L273 TraceCheckUtils]: 70: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,694 INFO L273 TraceCheckUtils]: 71: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,694 INFO L273 TraceCheckUtils]: 72: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,694 INFO L273 TraceCheckUtils]: 73: Hoare triple {6706#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6706#false} is VALID [2018-11-23 11:56:07,694 INFO L273 TraceCheckUtils]: 74: Hoare triple {6706#false} assume !(~i~0 < 100000); {6706#false} is VALID [2018-11-23 11:56:07,695 INFO L273 TraceCheckUtils]: 75: Hoare triple {6706#false} havoc ~x~0;~x~0 := 0; {6706#false} is VALID [2018-11-23 11:56:07,695 INFO L273 TraceCheckUtils]: 76: Hoare triple {6706#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6706#false} is VALID [2018-11-23 11:56:07,695 INFO L256 TraceCheckUtils]: 77: Hoare triple {6706#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {6706#false} is VALID [2018-11-23 11:56:07,695 INFO L273 TraceCheckUtils]: 78: Hoare triple {6706#false} ~cond := #in~cond; {6706#false} is VALID [2018-11-23 11:56:07,695 INFO L273 TraceCheckUtils]: 79: Hoare triple {6706#false} assume 0 == ~cond; {6706#false} is VALID [2018-11-23 11:56:07,695 INFO L273 TraceCheckUtils]: 80: Hoare triple {6706#false} assume !false; {6706#false} is VALID [2018-11-23 11:56:07,698 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-23 11:56:07,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:07,698 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:07,707 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:56:38,339 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 11:56:38,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:38,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:38,654 INFO L256 TraceCheckUtils]: 0: Hoare triple {6705#true} call ULTIMATE.init(); {6705#true} is VALID [2018-11-23 11:56:38,655 INFO L273 TraceCheckUtils]: 1: Hoare triple {6705#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6705#true} is VALID [2018-11-23 11:56:38,655 INFO L273 TraceCheckUtils]: 2: Hoare triple {6705#true} assume true; {6705#true} is VALID [2018-11-23 11:56:38,655 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6705#true} {6705#true} #100#return; {6705#true} is VALID [2018-11-23 11:56:38,655 INFO L256 TraceCheckUtils]: 4: Hoare triple {6705#true} call #t~ret2 := main(); {6705#true} is VALID [2018-11-23 11:56:38,656 INFO L273 TraceCheckUtils]: 5: Hoare triple {6705#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6705#true} is VALID [2018-11-23 11:56:38,656 INFO L273 TraceCheckUtils]: 6: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,656 INFO L273 TraceCheckUtils]: 7: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,656 INFO L273 TraceCheckUtils]: 8: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,656 INFO L273 TraceCheckUtils]: 9: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,657 INFO L273 TraceCheckUtils]: 10: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,657 INFO L273 TraceCheckUtils]: 11: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,657 INFO L273 TraceCheckUtils]: 12: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,657 INFO L273 TraceCheckUtils]: 13: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,657 INFO L273 TraceCheckUtils]: 14: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,658 INFO L273 TraceCheckUtils]: 15: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,658 INFO L273 TraceCheckUtils]: 16: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,659 INFO L273 TraceCheckUtils]: 17: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6774#(<= main_~i~0 100000)} is VALID [2018-11-23 11:56:38,659 INFO L273 TraceCheckUtils]: 18: Hoare triple {6774#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {6705#true} is VALID [2018-11-23 11:56:38,659 INFO L273 TraceCheckUtils]: 19: Hoare triple {6705#true} ~i~0 := 0; {6705#true} is VALID [2018-11-23 11:56:38,659 INFO L273 TraceCheckUtils]: 20: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,659 INFO L273 TraceCheckUtils]: 21: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,659 INFO L273 TraceCheckUtils]: 22: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,659 INFO L273 TraceCheckUtils]: 23: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,659 INFO L273 TraceCheckUtils]: 24: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,660 INFO L273 TraceCheckUtils]: 25: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,660 INFO L273 TraceCheckUtils]: 26: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,660 INFO L273 TraceCheckUtils]: 27: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,660 INFO L273 TraceCheckUtils]: 28: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,660 INFO L273 TraceCheckUtils]: 29: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,660 INFO L273 TraceCheckUtils]: 30: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,661 INFO L273 TraceCheckUtils]: 31: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6774#(<= main_~i~0 100000)} is VALID [2018-11-23 11:56:38,661 INFO L273 TraceCheckUtils]: 32: Hoare triple {6774#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {6705#true} is VALID [2018-11-23 11:56:38,661 INFO L273 TraceCheckUtils]: 33: Hoare triple {6705#true} ~i~0 := 0; {6705#true} is VALID [2018-11-23 11:56:38,661 INFO L273 TraceCheckUtils]: 34: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,661 INFO L273 TraceCheckUtils]: 35: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,661 INFO L273 TraceCheckUtils]: 36: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,662 INFO L273 TraceCheckUtils]: 37: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,662 INFO L273 TraceCheckUtils]: 38: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,662 INFO L273 TraceCheckUtils]: 39: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,662 INFO L273 TraceCheckUtils]: 40: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,662 INFO L273 TraceCheckUtils]: 41: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,662 INFO L273 TraceCheckUtils]: 42: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,662 INFO L273 TraceCheckUtils]: 43: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,662 INFO L273 TraceCheckUtils]: 44: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,663 INFO L273 TraceCheckUtils]: 45: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,663 INFO L273 TraceCheckUtils]: 46: Hoare triple {6705#true} assume !(~i~0 < 100000); {6705#true} is VALID [2018-11-23 11:56:38,663 INFO L273 TraceCheckUtils]: 47: Hoare triple {6705#true} ~i~0 := 0; {6705#true} is VALID [2018-11-23 11:56:38,663 INFO L273 TraceCheckUtils]: 48: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,663 INFO L273 TraceCheckUtils]: 49: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,663 INFO L273 TraceCheckUtils]: 50: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,664 INFO L273 TraceCheckUtils]: 51: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,664 INFO L273 TraceCheckUtils]: 52: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,664 INFO L273 TraceCheckUtils]: 53: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,664 INFO L273 TraceCheckUtils]: 54: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,664 INFO L273 TraceCheckUtils]: 55: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,665 INFO L273 TraceCheckUtils]: 56: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,665 INFO L273 TraceCheckUtils]: 57: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,665 INFO L273 TraceCheckUtils]: 58: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,665 INFO L273 TraceCheckUtils]: 59: Hoare triple {6705#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6705#true} is VALID [2018-11-23 11:56:38,665 INFO L273 TraceCheckUtils]: 60: Hoare triple {6705#true} assume !(~i~0 < 100000); {6705#true} is VALID [2018-11-23 11:56:38,665 INFO L273 TraceCheckUtils]: 61: Hoare triple {6705#true} ~i~0 := 0; {6907#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:38,666 INFO L273 TraceCheckUtils]: 62: Hoare triple {6907#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6708#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:38,666 INFO L273 TraceCheckUtils]: 63: Hoare triple {6708#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6709#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:38,667 INFO L273 TraceCheckUtils]: 64: Hoare triple {6709#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6710#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:38,668 INFO L273 TraceCheckUtils]: 65: Hoare triple {6710#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6711#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:38,668 INFO L273 TraceCheckUtils]: 66: Hoare triple {6711#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6712#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:38,669 INFO L273 TraceCheckUtils]: 67: Hoare triple {6712#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6713#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:38,669 INFO L273 TraceCheckUtils]: 68: Hoare triple {6713#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6714#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:38,670 INFO L273 TraceCheckUtils]: 69: Hoare triple {6714#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6715#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:38,671 INFO L273 TraceCheckUtils]: 70: Hoare triple {6715#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6716#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:38,672 INFO L273 TraceCheckUtils]: 71: Hoare triple {6716#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6717#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:38,673 INFO L273 TraceCheckUtils]: 72: Hoare triple {6717#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6718#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:38,673 INFO L273 TraceCheckUtils]: 73: Hoare triple {6718#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6719#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:38,674 INFO L273 TraceCheckUtils]: 74: Hoare triple {6719#(<= main_~i~0 12)} assume !(~i~0 < 100000); {6706#false} is VALID [2018-11-23 11:56:38,674 INFO L273 TraceCheckUtils]: 75: Hoare triple {6706#false} havoc ~x~0;~x~0 := 0; {6706#false} is VALID [2018-11-23 11:56:38,674 INFO L273 TraceCheckUtils]: 76: Hoare triple {6706#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6706#false} is VALID [2018-11-23 11:56:38,675 INFO L256 TraceCheckUtils]: 77: Hoare triple {6706#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {6706#false} is VALID [2018-11-23 11:56:38,675 INFO L273 TraceCheckUtils]: 78: Hoare triple {6706#false} ~cond := #in~cond; {6706#false} is VALID [2018-11-23 11:56:38,675 INFO L273 TraceCheckUtils]: 79: Hoare triple {6706#false} assume 0 == ~cond; {6706#false} is VALID [2018-11-23 11:56:38,675 INFO L273 TraceCheckUtils]: 80: Hoare triple {6706#false} assume !false; {6706#false} is VALID [2018-11-23 11:56:38,679 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 24 proven. 78 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-11-23 11:56:38,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:38,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 17 [2018-11-23 11:56:38,706 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 81 [2018-11-23 11:56:38,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:38,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:56:38,764 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:38,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:56:38,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:56:38,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:56:38,765 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 17 states. [2018-11-23 11:56:39,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:39,522 INFO L93 Difference]: Finished difference Result 158 states and 172 transitions. [2018-11-23 11:56:39,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:56:39,522 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 81 [2018-11-23 11:56:39,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:39,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:56:39,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 124 transitions. [2018-11-23 11:56:39,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:56:39,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 124 transitions. [2018-11-23 11:56:39,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 124 transitions. [2018-11-23 11:56:39,703 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:39,705 INFO L225 Difference]: With dead ends: 158 [2018-11-23 11:56:39,705 INFO L226 Difference]: Without dead ends: 91 [2018-11-23 11:56:39,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:56:39,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-23 11:56:39,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-11-23 11:56:39,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:39,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 91 states. [2018-11-23 11:56:39,778 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 91 states. [2018-11-23 11:56:39,778 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 91 states. [2018-11-23 11:56:39,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:39,780 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-11-23 11:56:39,780 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2018-11-23 11:56:39,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:39,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:39,781 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 91 states. [2018-11-23 11:56:39,781 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 91 states. [2018-11-23 11:56:39,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:39,783 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-11-23 11:56:39,783 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2018-11-23 11:56:39,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:39,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:39,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:39,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:39,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-23 11:56:39,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2018-11-23 11:56:39,786 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 81 [2018-11-23 11:56:39,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:39,786 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2018-11-23 11:56:39,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:56:39,786 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2018-11-23 11:56:39,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 11:56:39,787 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:39,788 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:39,788 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:39,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:39,788 INFO L82 PathProgramCache]: Analyzing trace with hash 810745364, now seen corresponding path program 13 times [2018-11-23 11:56:39,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:39,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:39,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:39,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:39,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:40,120 INFO L256 TraceCheckUtils]: 0: Hoare triple {7604#true} call ULTIMATE.init(); {7604#true} is VALID [2018-11-23 11:56:40,120 INFO L273 TraceCheckUtils]: 1: Hoare triple {7604#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7604#true} is VALID [2018-11-23 11:56:40,121 INFO L273 TraceCheckUtils]: 2: Hoare triple {7604#true} assume true; {7604#true} is VALID [2018-11-23 11:56:40,121 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7604#true} {7604#true} #100#return; {7604#true} is VALID [2018-11-23 11:56:40,122 INFO L256 TraceCheckUtils]: 4: Hoare triple {7604#true} call #t~ret2 := main(); {7604#true} is VALID [2018-11-23 11:56:40,138 INFO L273 TraceCheckUtils]: 5: Hoare triple {7604#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7606#(= main_~i~0 0)} is VALID [2018-11-23 11:56:40,142 INFO L273 TraceCheckUtils]: 6: Hoare triple {7606#(= 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; {7607#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:40,143 INFO L273 TraceCheckUtils]: 7: Hoare triple {7607#(<= 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; {7608#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:40,144 INFO L273 TraceCheckUtils]: 8: Hoare triple {7608#(<= 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; {7609#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:40,144 INFO L273 TraceCheckUtils]: 9: Hoare triple {7609#(<= 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; {7610#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:40,145 INFO L273 TraceCheckUtils]: 10: Hoare triple {7610#(<= 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; {7611#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:40,145 INFO L273 TraceCheckUtils]: 11: Hoare triple {7611#(<= 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; {7612#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:40,146 INFO L273 TraceCheckUtils]: 12: Hoare triple {7612#(<= 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; {7613#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:40,147 INFO L273 TraceCheckUtils]: 13: Hoare triple {7613#(<= 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; {7614#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:40,148 INFO L273 TraceCheckUtils]: 14: Hoare triple {7614#(<= 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; {7615#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:40,149 INFO L273 TraceCheckUtils]: 15: Hoare triple {7615#(<= 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; {7616#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:40,150 INFO L273 TraceCheckUtils]: 16: Hoare triple {7616#(<= 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; {7617#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:40,151 INFO L273 TraceCheckUtils]: 17: Hoare triple {7617#(<= 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; {7618#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:40,152 INFO L273 TraceCheckUtils]: 18: Hoare triple {7618#(<= 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; {7619#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:40,153 INFO L273 TraceCheckUtils]: 19: Hoare triple {7619#(<= main_~i~0 13)} assume !(~i~0 < 100000); {7605#false} is VALID [2018-11-23 11:56:40,153 INFO L273 TraceCheckUtils]: 20: Hoare triple {7605#false} ~i~0 := 0; {7605#false} is VALID [2018-11-23 11:56:40,154 INFO L273 TraceCheckUtils]: 21: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,154 INFO L273 TraceCheckUtils]: 22: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,154 INFO L273 TraceCheckUtils]: 23: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,155 INFO L273 TraceCheckUtils]: 24: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,155 INFO L273 TraceCheckUtils]: 25: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,155 INFO L273 TraceCheckUtils]: 26: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,156 INFO L273 TraceCheckUtils]: 27: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,156 INFO L273 TraceCheckUtils]: 28: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,156 INFO L273 TraceCheckUtils]: 29: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,156 INFO L273 TraceCheckUtils]: 30: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,156 INFO L273 TraceCheckUtils]: 31: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,157 INFO L273 TraceCheckUtils]: 32: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,157 INFO L273 TraceCheckUtils]: 33: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,157 INFO L273 TraceCheckUtils]: 34: Hoare triple {7605#false} assume !(~i~0 < 100000); {7605#false} is VALID [2018-11-23 11:56:40,157 INFO L273 TraceCheckUtils]: 35: Hoare triple {7605#false} ~i~0 := 0; {7605#false} is VALID [2018-11-23 11:56:40,157 INFO L273 TraceCheckUtils]: 36: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,158 INFO L273 TraceCheckUtils]: 37: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,158 INFO L273 TraceCheckUtils]: 38: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,158 INFO L273 TraceCheckUtils]: 39: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,158 INFO L273 TraceCheckUtils]: 40: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,158 INFO L273 TraceCheckUtils]: 41: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,159 INFO L273 TraceCheckUtils]: 42: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,159 INFO L273 TraceCheckUtils]: 43: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,159 INFO L273 TraceCheckUtils]: 44: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,159 INFO L273 TraceCheckUtils]: 45: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,159 INFO L273 TraceCheckUtils]: 46: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,160 INFO L273 TraceCheckUtils]: 47: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,160 INFO L273 TraceCheckUtils]: 48: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,160 INFO L273 TraceCheckUtils]: 49: Hoare triple {7605#false} assume !(~i~0 < 100000); {7605#false} is VALID [2018-11-23 11:56:40,160 INFO L273 TraceCheckUtils]: 50: Hoare triple {7605#false} ~i~0 := 0; {7605#false} is VALID [2018-11-23 11:56:40,160 INFO L273 TraceCheckUtils]: 51: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,161 INFO L273 TraceCheckUtils]: 52: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,161 INFO L273 TraceCheckUtils]: 53: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,161 INFO L273 TraceCheckUtils]: 54: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,161 INFO L273 TraceCheckUtils]: 55: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,161 INFO L273 TraceCheckUtils]: 56: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,162 INFO L273 TraceCheckUtils]: 57: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,162 INFO L273 TraceCheckUtils]: 58: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,162 INFO L273 TraceCheckUtils]: 59: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,162 INFO L273 TraceCheckUtils]: 60: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,162 INFO L273 TraceCheckUtils]: 61: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,163 INFO L273 TraceCheckUtils]: 62: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,163 INFO L273 TraceCheckUtils]: 63: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,163 INFO L273 TraceCheckUtils]: 64: Hoare triple {7605#false} assume !(~i~0 < 100000); {7605#false} is VALID [2018-11-23 11:56:40,163 INFO L273 TraceCheckUtils]: 65: Hoare triple {7605#false} ~i~0 := 0; {7605#false} is VALID [2018-11-23 11:56:40,163 INFO L273 TraceCheckUtils]: 66: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,164 INFO L273 TraceCheckUtils]: 67: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,164 INFO L273 TraceCheckUtils]: 68: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,164 INFO L273 TraceCheckUtils]: 69: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,164 INFO L273 TraceCheckUtils]: 70: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,165 INFO L273 TraceCheckUtils]: 71: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,165 INFO L273 TraceCheckUtils]: 72: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,165 INFO L273 TraceCheckUtils]: 73: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,165 INFO L273 TraceCheckUtils]: 74: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,165 INFO L273 TraceCheckUtils]: 75: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,165 INFO L273 TraceCheckUtils]: 76: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,166 INFO L273 TraceCheckUtils]: 77: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,166 INFO L273 TraceCheckUtils]: 78: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,166 INFO L273 TraceCheckUtils]: 79: Hoare triple {7605#false} assume !(~i~0 < 100000); {7605#false} is VALID [2018-11-23 11:56:40,166 INFO L273 TraceCheckUtils]: 80: Hoare triple {7605#false} havoc ~x~0;~x~0 := 0; {7605#false} is VALID [2018-11-23 11:56:40,166 INFO L273 TraceCheckUtils]: 81: Hoare triple {7605#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7605#false} is VALID [2018-11-23 11:56:40,167 INFO L256 TraceCheckUtils]: 82: Hoare triple {7605#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {7605#false} is VALID [2018-11-23 11:56:40,167 INFO L273 TraceCheckUtils]: 83: Hoare triple {7605#false} ~cond := #in~cond; {7605#false} is VALID [2018-11-23 11:56:40,167 INFO L273 TraceCheckUtils]: 84: Hoare triple {7605#false} assume 0 == ~cond; {7605#false} is VALID [2018-11-23 11:56:40,167 INFO L273 TraceCheckUtils]: 85: Hoare triple {7605#false} assume !false; {7605#false} is VALID [2018-11-23 11:56:40,175 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-11-23 11:56:40,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:40,176 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:40,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:56:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:40,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:40,432 INFO L256 TraceCheckUtils]: 0: Hoare triple {7604#true} call ULTIMATE.init(); {7604#true} is VALID [2018-11-23 11:56:40,432 INFO L273 TraceCheckUtils]: 1: Hoare triple {7604#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7604#true} is VALID [2018-11-23 11:56:40,433 INFO L273 TraceCheckUtils]: 2: Hoare triple {7604#true} assume true; {7604#true} is VALID [2018-11-23 11:56:40,433 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7604#true} {7604#true} #100#return; {7604#true} is VALID [2018-11-23 11:56:40,433 INFO L256 TraceCheckUtils]: 4: Hoare triple {7604#true} call #t~ret2 := main(); {7604#true} is VALID [2018-11-23 11:56:40,434 INFO L273 TraceCheckUtils]: 5: Hoare triple {7604#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7638#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:40,435 INFO L273 TraceCheckUtils]: 6: Hoare triple {7638#(<= 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; {7607#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:40,435 INFO L273 TraceCheckUtils]: 7: Hoare triple {7607#(<= 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; {7608#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:40,436 INFO L273 TraceCheckUtils]: 8: Hoare triple {7608#(<= 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; {7609#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:40,437 INFO L273 TraceCheckUtils]: 9: Hoare triple {7609#(<= 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; {7610#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:40,438 INFO L273 TraceCheckUtils]: 10: Hoare triple {7610#(<= 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; {7611#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:40,439 INFO L273 TraceCheckUtils]: 11: Hoare triple {7611#(<= 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; {7612#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:40,440 INFO L273 TraceCheckUtils]: 12: Hoare triple {7612#(<= 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; {7613#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:40,441 INFO L273 TraceCheckUtils]: 13: Hoare triple {7613#(<= 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; {7614#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:40,442 INFO L273 TraceCheckUtils]: 14: Hoare triple {7614#(<= 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; {7615#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:40,443 INFO L273 TraceCheckUtils]: 15: Hoare triple {7615#(<= 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; {7616#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:40,444 INFO L273 TraceCheckUtils]: 16: Hoare triple {7616#(<= 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; {7617#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:40,446 INFO L273 TraceCheckUtils]: 17: Hoare triple {7617#(<= 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; {7618#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:40,447 INFO L273 TraceCheckUtils]: 18: Hoare triple {7618#(<= 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; {7619#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:40,447 INFO L273 TraceCheckUtils]: 19: Hoare triple {7619#(<= main_~i~0 13)} assume !(~i~0 < 100000); {7605#false} is VALID [2018-11-23 11:56:40,448 INFO L273 TraceCheckUtils]: 20: Hoare triple {7605#false} ~i~0 := 0; {7605#false} is VALID [2018-11-23 11:56:40,448 INFO L273 TraceCheckUtils]: 21: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,448 INFO L273 TraceCheckUtils]: 22: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,448 INFO L273 TraceCheckUtils]: 23: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,449 INFO L273 TraceCheckUtils]: 24: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,449 INFO L273 TraceCheckUtils]: 25: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,449 INFO L273 TraceCheckUtils]: 26: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,449 INFO L273 TraceCheckUtils]: 27: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,450 INFO L273 TraceCheckUtils]: 28: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,450 INFO L273 TraceCheckUtils]: 29: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,450 INFO L273 TraceCheckUtils]: 30: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,450 INFO L273 TraceCheckUtils]: 31: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,451 INFO L273 TraceCheckUtils]: 32: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,451 INFO L273 TraceCheckUtils]: 33: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,451 INFO L273 TraceCheckUtils]: 34: Hoare triple {7605#false} assume !(~i~0 < 100000); {7605#false} is VALID [2018-11-23 11:56:40,451 INFO L273 TraceCheckUtils]: 35: Hoare triple {7605#false} ~i~0 := 0; {7605#false} is VALID [2018-11-23 11:56:40,452 INFO L273 TraceCheckUtils]: 36: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,452 INFO L273 TraceCheckUtils]: 37: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,452 INFO L273 TraceCheckUtils]: 38: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,453 INFO L273 TraceCheckUtils]: 39: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,453 INFO L273 TraceCheckUtils]: 40: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,453 INFO L273 TraceCheckUtils]: 41: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,453 INFO L273 TraceCheckUtils]: 42: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,453 INFO L273 TraceCheckUtils]: 43: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,453 INFO L273 TraceCheckUtils]: 44: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,454 INFO L273 TraceCheckUtils]: 45: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,454 INFO L273 TraceCheckUtils]: 46: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,454 INFO L273 TraceCheckUtils]: 47: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,454 INFO L273 TraceCheckUtils]: 48: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,454 INFO L273 TraceCheckUtils]: 49: Hoare triple {7605#false} assume !(~i~0 < 100000); {7605#false} is VALID [2018-11-23 11:56:40,454 INFO L273 TraceCheckUtils]: 50: Hoare triple {7605#false} ~i~0 := 0; {7605#false} is VALID [2018-11-23 11:56:40,454 INFO L273 TraceCheckUtils]: 51: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,455 INFO L273 TraceCheckUtils]: 52: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,455 INFO L273 TraceCheckUtils]: 53: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,455 INFO L273 TraceCheckUtils]: 54: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,455 INFO L273 TraceCheckUtils]: 55: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,455 INFO L273 TraceCheckUtils]: 56: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,455 INFO L273 TraceCheckUtils]: 57: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,455 INFO L273 TraceCheckUtils]: 58: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,456 INFO L273 TraceCheckUtils]: 59: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,456 INFO L273 TraceCheckUtils]: 60: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,456 INFO L273 TraceCheckUtils]: 61: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,456 INFO L273 TraceCheckUtils]: 62: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,456 INFO L273 TraceCheckUtils]: 63: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,456 INFO L273 TraceCheckUtils]: 64: Hoare triple {7605#false} assume !(~i~0 < 100000); {7605#false} is VALID [2018-11-23 11:56:40,456 INFO L273 TraceCheckUtils]: 65: Hoare triple {7605#false} ~i~0 := 0; {7605#false} is VALID [2018-11-23 11:56:40,457 INFO L273 TraceCheckUtils]: 66: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,457 INFO L273 TraceCheckUtils]: 67: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,457 INFO L273 TraceCheckUtils]: 68: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,457 INFO L273 TraceCheckUtils]: 69: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,457 INFO L273 TraceCheckUtils]: 70: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,457 INFO L273 TraceCheckUtils]: 71: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,458 INFO L273 TraceCheckUtils]: 72: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,458 INFO L273 TraceCheckUtils]: 73: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,458 INFO L273 TraceCheckUtils]: 74: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,458 INFO L273 TraceCheckUtils]: 75: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,458 INFO L273 TraceCheckUtils]: 76: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,458 INFO L273 TraceCheckUtils]: 77: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,458 INFO L273 TraceCheckUtils]: 78: Hoare triple {7605#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7605#false} is VALID [2018-11-23 11:56:40,459 INFO L273 TraceCheckUtils]: 79: Hoare triple {7605#false} assume !(~i~0 < 100000); {7605#false} is VALID [2018-11-23 11:56:40,459 INFO L273 TraceCheckUtils]: 80: Hoare triple {7605#false} havoc ~x~0;~x~0 := 0; {7605#false} is VALID [2018-11-23 11:56:40,459 INFO L273 TraceCheckUtils]: 81: Hoare triple {7605#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7605#false} is VALID [2018-11-23 11:56:40,459 INFO L256 TraceCheckUtils]: 82: Hoare triple {7605#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {7605#false} is VALID [2018-11-23 11:56:40,459 INFO L273 TraceCheckUtils]: 83: Hoare triple {7605#false} ~cond := #in~cond; {7605#false} is VALID [2018-11-23 11:56:40,459 INFO L273 TraceCheckUtils]: 84: Hoare triple {7605#false} assume 0 == ~cond; {7605#false} is VALID [2018-11-23 11:56:40,459 INFO L273 TraceCheckUtils]: 85: Hoare triple {7605#false} assume !false; {7605#false} is VALID [2018-11-23 11:56:40,466 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-11-23 11:56:40,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:40,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 11:56:40,487 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 86 [2018-11-23 11:56:40,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:40,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:56:40,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:40,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:56:40,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:56:40,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:56:40,528 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand 17 states. [2018-11-23 11:56:41,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:41,165 INFO L93 Difference]: Finished difference Result 167 states and 181 transitions. [2018-11-23 11:56:41,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:56:41,165 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 86 [2018-11-23 11:56:41,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:41,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:56:41,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 129 transitions. [2018-11-23 11:56:41,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:56:41,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 129 transitions. [2018-11-23 11:56:41,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 129 transitions. [2018-11-23 11:56:41,331 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:41,333 INFO L225 Difference]: With dead ends: 167 [2018-11-23 11:56:41,333 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 11:56:41,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:56:41,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 11:56:41,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-11-23 11:56:41,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:41,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 96 states. [2018-11-23 11:56:41,407 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 96 states. [2018-11-23 11:56:41,408 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 96 states. [2018-11-23 11:56:41,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:41,410 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2018-11-23 11:56:41,410 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-11-23 11:56:41,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:41,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:41,410 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 96 states. [2018-11-23 11:56:41,410 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 96 states. [2018-11-23 11:56:41,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:41,412 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2018-11-23 11:56:41,412 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-11-23 11:56:41,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:41,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:41,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:41,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:41,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 11:56:41,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2018-11-23 11:56:41,415 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 86 [2018-11-23 11:56:41,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:41,415 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2018-11-23 11:56:41,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:56:41,416 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-11-23 11:56:41,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 11:56:41,417 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:41,417 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:41,417 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:41,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:41,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1391763710, now seen corresponding path program 14 times [2018-11-23 11:56:41,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:41,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:41,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:41,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:56:41,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:42,657 INFO L256 TraceCheckUtils]: 0: Hoare triple {8556#true} call ULTIMATE.init(); {8556#true} is VALID [2018-11-23 11:56:42,657 INFO L273 TraceCheckUtils]: 1: Hoare triple {8556#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8556#true} is VALID [2018-11-23 11:56:42,658 INFO L273 TraceCheckUtils]: 2: Hoare triple {8556#true} assume true; {8556#true} is VALID [2018-11-23 11:56:42,658 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8556#true} {8556#true} #100#return; {8556#true} is VALID [2018-11-23 11:56:42,658 INFO L256 TraceCheckUtils]: 4: Hoare triple {8556#true} call #t~ret2 := main(); {8556#true} is VALID [2018-11-23 11:56:42,659 INFO L273 TraceCheckUtils]: 5: Hoare triple {8556#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8558#(= main_~i~0 0)} is VALID [2018-11-23 11:56:42,659 INFO L273 TraceCheckUtils]: 6: Hoare triple {8558#(= 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; {8559#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:42,677 INFO L273 TraceCheckUtils]: 7: Hoare triple {8559#(<= 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; {8560#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:42,693 INFO L273 TraceCheckUtils]: 8: Hoare triple {8560#(<= 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; {8561#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:42,707 INFO L273 TraceCheckUtils]: 9: Hoare triple {8561#(<= 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; {8562#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:42,710 INFO L273 TraceCheckUtils]: 10: Hoare triple {8562#(<= 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; {8563#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:42,710 INFO L273 TraceCheckUtils]: 11: Hoare triple {8563#(<= 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; {8564#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:42,711 INFO L273 TraceCheckUtils]: 12: Hoare triple {8564#(<= 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; {8565#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:42,712 INFO L273 TraceCheckUtils]: 13: Hoare triple {8565#(<= 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; {8566#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:42,712 INFO L273 TraceCheckUtils]: 14: Hoare triple {8566#(<= 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; {8567#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:42,713 INFO L273 TraceCheckUtils]: 15: Hoare triple {8567#(<= 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; {8568#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:42,714 INFO L273 TraceCheckUtils]: 16: Hoare triple {8568#(<= 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; {8569#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:42,715 INFO L273 TraceCheckUtils]: 17: Hoare triple {8569#(<= 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; {8570#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:42,716 INFO L273 TraceCheckUtils]: 18: Hoare triple {8570#(<= 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; {8571#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:42,717 INFO L273 TraceCheckUtils]: 19: Hoare triple {8571#(<= 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; {8572#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:42,718 INFO L273 TraceCheckUtils]: 20: Hoare triple {8572#(<= main_~i~0 14)} assume !(~i~0 < 100000); {8557#false} is VALID [2018-11-23 11:56:42,718 INFO L273 TraceCheckUtils]: 21: Hoare triple {8557#false} ~i~0 := 0; {8557#false} is VALID [2018-11-23 11:56:42,718 INFO L273 TraceCheckUtils]: 22: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,718 INFO L273 TraceCheckUtils]: 23: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,718 INFO L273 TraceCheckUtils]: 24: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,719 INFO L273 TraceCheckUtils]: 25: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,719 INFO L273 TraceCheckUtils]: 26: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,719 INFO L273 TraceCheckUtils]: 27: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,719 INFO L273 TraceCheckUtils]: 28: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,719 INFO L273 TraceCheckUtils]: 29: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,720 INFO L273 TraceCheckUtils]: 30: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,720 INFO L273 TraceCheckUtils]: 31: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,720 INFO L273 TraceCheckUtils]: 32: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,720 INFO L273 TraceCheckUtils]: 33: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,720 INFO L273 TraceCheckUtils]: 34: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,720 INFO L273 TraceCheckUtils]: 35: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,721 INFO L273 TraceCheckUtils]: 36: Hoare triple {8557#false} assume !(~i~0 < 100000); {8557#false} is VALID [2018-11-23 11:56:42,721 INFO L273 TraceCheckUtils]: 37: Hoare triple {8557#false} ~i~0 := 0; {8557#false} is VALID [2018-11-23 11:56:42,721 INFO L273 TraceCheckUtils]: 38: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,721 INFO L273 TraceCheckUtils]: 39: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,721 INFO L273 TraceCheckUtils]: 40: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,721 INFO L273 TraceCheckUtils]: 41: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,722 INFO L273 TraceCheckUtils]: 42: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,722 INFO L273 TraceCheckUtils]: 43: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,722 INFO L273 TraceCheckUtils]: 44: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,722 INFO L273 TraceCheckUtils]: 45: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,722 INFO L273 TraceCheckUtils]: 46: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,722 INFO L273 TraceCheckUtils]: 47: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,722 INFO L273 TraceCheckUtils]: 48: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,722 INFO L273 TraceCheckUtils]: 49: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,723 INFO L273 TraceCheckUtils]: 50: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,723 INFO L273 TraceCheckUtils]: 51: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,723 INFO L273 TraceCheckUtils]: 52: Hoare triple {8557#false} assume !(~i~0 < 100000); {8557#false} is VALID [2018-11-23 11:56:42,723 INFO L273 TraceCheckUtils]: 53: Hoare triple {8557#false} ~i~0 := 0; {8557#false} is VALID [2018-11-23 11:56:42,723 INFO L273 TraceCheckUtils]: 54: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,723 INFO L273 TraceCheckUtils]: 55: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,723 INFO L273 TraceCheckUtils]: 56: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,723 INFO L273 TraceCheckUtils]: 57: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,723 INFO L273 TraceCheckUtils]: 58: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,724 INFO L273 TraceCheckUtils]: 59: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,724 INFO L273 TraceCheckUtils]: 60: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,724 INFO L273 TraceCheckUtils]: 61: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,724 INFO L273 TraceCheckUtils]: 62: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,724 INFO L273 TraceCheckUtils]: 63: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,724 INFO L273 TraceCheckUtils]: 64: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,724 INFO L273 TraceCheckUtils]: 65: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,724 INFO L273 TraceCheckUtils]: 66: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,724 INFO L273 TraceCheckUtils]: 67: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,725 INFO L273 TraceCheckUtils]: 68: Hoare triple {8557#false} assume !(~i~0 < 100000); {8557#false} is VALID [2018-11-23 11:56:42,725 INFO L273 TraceCheckUtils]: 69: Hoare triple {8557#false} ~i~0 := 0; {8557#false} is VALID [2018-11-23 11:56:42,725 INFO L273 TraceCheckUtils]: 70: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,725 INFO L273 TraceCheckUtils]: 71: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,725 INFO L273 TraceCheckUtils]: 72: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,725 INFO L273 TraceCheckUtils]: 73: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,725 INFO L273 TraceCheckUtils]: 74: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,725 INFO L273 TraceCheckUtils]: 75: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,726 INFO L273 TraceCheckUtils]: 76: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,726 INFO L273 TraceCheckUtils]: 77: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,726 INFO L273 TraceCheckUtils]: 78: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,726 INFO L273 TraceCheckUtils]: 79: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,726 INFO L273 TraceCheckUtils]: 80: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,726 INFO L273 TraceCheckUtils]: 81: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,726 INFO L273 TraceCheckUtils]: 82: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,726 INFO L273 TraceCheckUtils]: 83: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:42,726 INFO L273 TraceCheckUtils]: 84: Hoare triple {8557#false} assume !(~i~0 < 100000); {8557#false} is VALID [2018-11-23 11:56:42,727 INFO L273 TraceCheckUtils]: 85: Hoare triple {8557#false} havoc ~x~0;~x~0 := 0; {8557#false} is VALID [2018-11-23 11:56:42,727 INFO L273 TraceCheckUtils]: 86: Hoare triple {8557#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8557#false} is VALID [2018-11-23 11:56:42,727 INFO L256 TraceCheckUtils]: 87: Hoare triple {8557#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {8557#false} is VALID [2018-11-23 11:56:42,727 INFO L273 TraceCheckUtils]: 88: Hoare triple {8557#false} ~cond := #in~cond; {8557#false} is VALID [2018-11-23 11:56:42,727 INFO L273 TraceCheckUtils]: 89: Hoare triple {8557#false} assume 0 == ~cond; {8557#false} is VALID [2018-11-23 11:56:42,727 INFO L273 TraceCheckUtils]: 90: Hoare triple {8557#false} assume !false; {8557#false} is VALID [2018-11-23 11:56:42,730 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-23 11:56:42,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:42,731 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:42,741 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:56:42,806 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:56:42,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:42,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:43,066 INFO L256 TraceCheckUtils]: 0: Hoare triple {8556#true} call ULTIMATE.init(); {8556#true} is VALID [2018-11-23 11:56:43,066 INFO L273 TraceCheckUtils]: 1: Hoare triple {8556#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8556#true} is VALID [2018-11-23 11:56:43,067 INFO L273 TraceCheckUtils]: 2: Hoare triple {8556#true} assume true; {8556#true} is VALID [2018-11-23 11:56:43,067 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8556#true} {8556#true} #100#return; {8556#true} is VALID [2018-11-23 11:56:43,067 INFO L256 TraceCheckUtils]: 4: Hoare triple {8556#true} call #t~ret2 := main(); {8556#true} is VALID [2018-11-23 11:56:43,068 INFO L273 TraceCheckUtils]: 5: Hoare triple {8556#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8591#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:43,068 INFO L273 TraceCheckUtils]: 6: Hoare triple {8591#(<= 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; {8559#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:43,069 INFO L273 TraceCheckUtils]: 7: Hoare triple {8559#(<= 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; {8560#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:43,070 INFO L273 TraceCheckUtils]: 8: Hoare triple {8560#(<= 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; {8561#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:43,070 INFO L273 TraceCheckUtils]: 9: Hoare triple {8561#(<= 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; {8562#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:43,071 INFO L273 TraceCheckUtils]: 10: Hoare triple {8562#(<= 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; {8563#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:43,072 INFO L273 TraceCheckUtils]: 11: Hoare triple {8563#(<= 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; {8564#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:43,073 INFO L273 TraceCheckUtils]: 12: Hoare triple {8564#(<= 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; {8565#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:43,074 INFO L273 TraceCheckUtils]: 13: Hoare triple {8565#(<= 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; {8566#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:43,075 INFO L273 TraceCheckUtils]: 14: Hoare triple {8566#(<= 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; {8567#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:43,076 INFO L273 TraceCheckUtils]: 15: Hoare triple {8567#(<= 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; {8568#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:43,077 INFO L273 TraceCheckUtils]: 16: Hoare triple {8568#(<= 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; {8569#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:43,078 INFO L273 TraceCheckUtils]: 17: Hoare triple {8569#(<= 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; {8570#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:43,079 INFO L273 TraceCheckUtils]: 18: Hoare triple {8570#(<= 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; {8571#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:43,080 INFO L273 TraceCheckUtils]: 19: Hoare triple {8571#(<= 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; {8572#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:43,080 INFO L273 TraceCheckUtils]: 20: Hoare triple {8572#(<= main_~i~0 14)} assume !(~i~0 < 100000); {8557#false} is VALID [2018-11-23 11:56:43,081 INFO L273 TraceCheckUtils]: 21: Hoare triple {8557#false} ~i~0 := 0; {8557#false} is VALID [2018-11-23 11:56:43,081 INFO L273 TraceCheckUtils]: 22: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,081 INFO L273 TraceCheckUtils]: 23: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,081 INFO L273 TraceCheckUtils]: 24: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,081 INFO L273 TraceCheckUtils]: 25: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,082 INFO L273 TraceCheckUtils]: 26: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,082 INFO L273 TraceCheckUtils]: 27: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,082 INFO L273 TraceCheckUtils]: 28: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,082 INFO L273 TraceCheckUtils]: 29: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,082 INFO L273 TraceCheckUtils]: 30: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,083 INFO L273 TraceCheckUtils]: 31: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,083 INFO L273 TraceCheckUtils]: 32: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,083 INFO L273 TraceCheckUtils]: 33: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,083 INFO L273 TraceCheckUtils]: 34: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,083 INFO L273 TraceCheckUtils]: 35: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,084 INFO L273 TraceCheckUtils]: 36: Hoare triple {8557#false} assume !(~i~0 < 100000); {8557#false} is VALID [2018-11-23 11:56:43,084 INFO L273 TraceCheckUtils]: 37: Hoare triple {8557#false} ~i~0 := 0; {8557#false} is VALID [2018-11-23 11:56:43,084 INFO L273 TraceCheckUtils]: 38: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,084 INFO L273 TraceCheckUtils]: 39: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,084 INFO L273 TraceCheckUtils]: 40: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,085 INFO L273 TraceCheckUtils]: 41: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,085 INFO L273 TraceCheckUtils]: 42: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,085 INFO L273 TraceCheckUtils]: 43: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,085 INFO L273 TraceCheckUtils]: 44: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,085 INFO L273 TraceCheckUtils]: 45: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,086 INFO L273 TraceCheckUtils]: 46: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,086 INFO L273 TraceCheckUtils]: 47: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,086 INFO L273 TraceCheckUtils]: 48: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,086 INFO L273 TraceCheckUtils]: 49: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,086 INFO L273 TraceCheckUtils]: 50: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,086 INFO L273 TraceCheckUtils]: 51: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,086 INFO L273 TraceCheckUtils]: 52: Hoare triple {8557#false} assume !(~i~0 < 100000); {8557#false} is VALID [2018-11-23 11:56:43,086 INFO L273 TraceCheckUtils]: 53: Hoare triple {8557#false} ~i~0 := 0; {8557#false} is VALID [2018-11-23 11:56:43,087 INFO L273 TraceCheckUtils]: 54: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,087 INFO L273 TraceCheckUtils]: 55: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,087 INFO L273 TraceCheckUtils]: 56: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,087 INFO L273 TraceCheckUtils]: 57: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,087 INFO L273 TraceCheckUtils]: 58: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,087 INFO L273 TraceCheckUtils]: 59: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,087 INFO L273 TraceCheckUtils]: 60: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,087 INFO L273 TraceCheckUtils]: 61: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,088 INFO L273 TraceCheckUtils]: 62: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,088 INFO L273 TraceCheckUtils]: 63: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,088 INFO L273 TraceCheckUtils]: 64: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,088 INFO L273 TraceCheckUtils]: 65: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,088 INFO L273 TraceCheckUtils]: 66: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,088 INFO L273 TraceCheckUtils]: 67: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,088 INFO L273 TraceCheckUtils]: 68: Hoare triple {8557#false} assume !(~i~0 < 100000); {8557#false} is VALID [2018-11-23 11:56:43,088 INFO L273 TraceCheckUtils]: 69: Hoare triple {8557#false} ~i~0 := 0; {8557#false} is VALID [2018-11-23 11:56:43,088 INFO L273 TraceCheckUtils]: 70: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,089 INFO L273 TraceCheckUtils]: 71: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,089 INFO L273 TraceCheckUtils]: 72: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,089 INFO L273 TraceCheckUtils]: 73: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,089 INFO L273 TraceCheckUtils]: 74: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,089 INFO L273 TraceCheckUtils]: 75: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,089 INFO L273 TraceCheckUtils]: 76: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,089 INFO L273 TraceCheckUtils]: 77: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,089 INFO L273 TraceCheckUtils]: 78: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,089 INFO L273 TraceCheckUtils]: 79: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,090 INFO L273 TraceCheckUtils]: 80: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,090 INFO L273 TraceCheckUtils]: 81: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,090 INFO L273 TraceCheckUtils]: 82: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,090 INFO L273 TraceCheckUtils]: 83: Hoare triple {8557#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8557#false} is VALID [2018-11-23 11:56:43,090 INFO L273 TraceCheckUtils]: 84: Hoare triple {8557#false} assume !(~i~0 < 100000); {8557#false} is VALID [2018-11-23 11:56:43,090 INFO L273 TraceCheckUtils]: 85: Hoare triple {8557#false} havoc ~x~0;~x~0 := 0; {8557#false} is VALID [2018-11-23 11:56:43,090 INFO L273 TraceCheckUtils]: 86: Hoare triple {8557#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8557#false} is VALID [2018-11-23 11:56:43,090 INFO L256 TraceCheckUtils]: 87: Hoare triple {8557#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {8557#false} is VALID [2018-11-23 11:56:43,091 INFO L273 TraceCheckUtils]: 88: Hoare triple {8557#false} ~cond := #in~cond; {8557#false} is VALID [2018-11-23 11:56:43,091 INFO L273 TraceCheckUtils]: 89: Hoare triple {8557#false} assume 0 == ~cond; {8557#false} is VALID [2018-11-23 11:56:43,091 INFO L273 TraceCheckUtils]: 90: Hoare triple {8557#false} assume !false; {8557#false} is VALID [2018-11-23 11:56:43,095 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-23 11:56:43,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:43,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 11:56:43,116 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2018-11-23 11:56:43,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:43,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:56:43,152 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:43,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:56:43,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:56:43,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:56:43,153 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 18 states. [2018-11-23 11:56:43,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:43,899 INFO L93 Difference]: Finished difference Result 176 states and 190 transitions. [2018-11-23 11:56:43,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:56:43,899 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2018-11-23 11:56:43,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:43,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:56:43,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 134 transitions. [2018-11-23 11:56:43,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:56:43,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 134 transitions. [2018-11-23 11:56:43,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 134 transitions. [2018-11-23 11:56:44,040 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:44,043 INFO L225 Difference]: With dead ends: 176 [2018-11-23 11:56:44,043 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 11:56:44,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:56:44,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 11:56:44,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-11-23 11:56:44,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:44,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 101 states. [2018-11-23 11:56:44,216 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 101 states. [2018-11-23 11:56:44,216 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 101 states. [2018-11-23 11:56:44,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:44,218 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-11-23 11:56:44,218 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-11-23 11:56:44,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:44,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:44,219 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 101 states. [2018-11-23 11:56:44,219 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 101 states. [2018-11-23 11:56:44,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:44,221 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-11-23 11:56:44,221 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-11-23 11:56:44,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:44,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:44,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:44,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:44,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-23 11:56:44,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-11-23 11:56:44,224 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 91 [2018-11-23 11:56:44,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:44,224 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-11-23 11:56:44,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:56:44,224 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-11-23 11:56:44,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 11:56:44,225 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:44,226 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:44,226 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:44,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:44,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1103546028, now seen corresponding path program 15 times [2018-11-23 11:56:44,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:44,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:44,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:44,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:44,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:44,554 INFO L256 TraceCheckUtils]: 0: Hoare triple {9562#true} call ULTIMATE.init(); {9562#true} is VALID [2018-11-23 11:56:44,555 INFO L273 TraceCheckUtils]: 1: Hoare triple {9562#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9562#true} is VALID [2018-11-23 11:56:44,555 INFO L273 TraceCheckUtils]: 2: Hoare triple {9562#true} assume true; {9562#true} is VALID [2018-11-23 11:56:44,555 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9562#true} {9562#true} #100#return; {9562#true} is VALID [2018-11-23 11:56:44,555 INFO L256 TraceCheckUtils]: 4: Hoare triple {9562#true} call #t~ret2 := main(); {9562#true} is VALID [2018-11-23 11:56:44,556 INFO L273 TraceCheckUtils]: 5: Hoare triple {9562#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9564#(= main_~i~0 0)} is VALID [2018-11-23 11:56:44,558 INFO L273 TraceCheckUtils]: 6: Hoare triple {9564#(= 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; {9565#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:44,559 INFO L273 TraceCheckUtils]: 7: Hoare triple {9565#(<= 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; {9566#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:44,560 INFO L273 TraceCheckUtils]: 8: Hoare triple {9566#(<= 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; {9567#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:44,560 INFO L273 TraceCheckUtils]: 9: Hoare triple {9567#(<= 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; {9568#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:44,561 INFO L273 TraceCheckUtils]: 10: Hoare triple {9568#(<= 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; {9569#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:44,571 INFO L273 TraceCheckUtils]: 11: Hoare triple {9569#(<= 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; {9570#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:44,574 INFO L273 TraceCheckUtils]: 12: Hoare triple {9570#(<= 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; {9571#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:44,576 INFO L273 TraceCheckUtils]: 13: Hoare triple {9571#(<= 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; {9572#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:44,578 INFO L273 TraceCheckUtils]: 14: Hoare triple {9572#(<= 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; {9573#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:44,578 INFO L273 TraceCheckUtils]: 15: Hoare triple {9573#(<= 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; {9574#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:44,580 INFO L273 TraceCheckUtils]: 16: Hoare triple {9574#(<= 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; {9575#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:44,580 INFO L273 TraceCheckUtils]: 17: Hoare triple {9575#(<= 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; {9576#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:44,582 INFO L273 TraceCheckUtils]: 18: Hoare triple {9576#(<= 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; {9577#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:44,582 INFO L273 TraceCheckUtils]: 19: Hoare triple {9577#(<= 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; {9578#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:44,584 INFO L273 TraceCheckUtils]: 20: Hoare triple {9578#(<= 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; {9579#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:44,584 INFO L273 TraceCheckUtils]: 21: Hoare triple {9579#(<= main_~i~0 15)} assume !(~i~0 < 100000); {9563#false} is VALID [2018-11-23 11:56:44,584 INFO L273 TraceCheckUtils]: 22: Hoare triple {9563#false} ~i~0 := 0; {9563#false} is VALID [2018-11-23 11:56:44,584 INFO L273 TraceCheckUtils]: 23: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,584 INFO L273 TraceCheckUtils]: 24: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,585 INFO L273 TraceCheckUtils]: 25: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,585 INFO L273 TraceCheckUtils]: 26: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,585 INFO L273 TraceCheckUtils]: 27: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,585 INFO L273 TraceCheckUtils]: 28: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,585 INFO L273 TraceCheckUtils]: 29: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,586 INFO L273 TraceCheckUtils]: 30: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,586 INFO L273 TraceCheckUtils]: 31: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,586 INFO L273 TraceCheckUtils]: 32: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,586 INFO L273 TraceCheckUtils]: 33: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,586 INFO L273 TraceCheckUtils]: 34: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,587 INFO L273 TraceCheckUtils]: 35: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,587 INFO L273 TraceCheckUtils]: 36: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,587 INFO L273 TraceCheckUtils]: 37: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,587 INFO L273 TraceCheckUtils]: 38: Hoare triple {9563#false} assume !(~i~0 < 100000); {9563#false} is VALID [2018-11-23 11:56:44,587 INFO L273 TraceCheckUtils]: 39: Hoare triple {9563#false} ~i~0 := 0; {9563#false} is VALID [2018-11-23 11:56:44,588 INFO L273 TraceCheckUtils]: 40: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,588 INFO L273 TraceCheckUtils]: 41: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,588 INFO L273 TraceCheckUtils]: 42: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,588 INFO L273 TraceCheckUtils]: 43: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,588 INFO L273 TraceCheckUtils]: 44: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,588 INFO L273 TraceCheckUtils]: 45: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,588 INFO L273 TraceCheckUtils]: 46: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,588 INFO L273 TraceCheckUtils]: 47: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,588 INFO L273 TraceCheckUtils]: 48: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,589 INFO L273 TraceCheckUtils]: 49: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,589 INFO L273 TraceCheckUtils]: 50: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,589 INFO L273 TraceCheckUtils]: 51: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,589 INFO L273 TraceCheckUtils]: 52: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,589 INFO L273 TraceCheckUtils]: 53: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,589 INFO L273 TraceCheckUtils]: 54: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,589 INFO L273 TraceCheckUtils]: 55: Hoare triple {9563#false} assume !(~i~0 < 100000); {9563#false} is VALID [2018-11-23 11:56:44,589 INFO L273 TraceCheckUtils]: 56: Hoare triple {9563#false} ~i~0 := 0; {9563#false} is VALID [2018-11-23 11:56:44,590 INFO L273 TraceCheckUtils]: 57: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,590 INFO L273 TraceCheckUtils]: 58: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,590 INFO L273 TraceCheckUtils]: 59: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,590 INFO L273 TraceCheckUtils]: 60: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,590 INFO L273 TraceCheckUtils]: 61: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,590 INFO L273 TraceCheckUtils]: 62: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,590 INFO L273 TraceCheckUtils]: 63: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,590 INFO L273 TraceCheckUtils]: 64: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,590 INFO L273 TraceCheckUtils]: 65: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,591 INFO L273 TraceCheckUtils]: 66: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,591 INFO L273 TraceCheckUtils]: 67: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,591 INFO L273 TraceCheckUtils]: 68: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,591 INFO L273 TraceCheckUtils]: 69: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,591 INFO L273 TraceCheckUtils]: 70: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,591 INFO L273 TraceCheckUtils]: 71: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,591 INFO L273 TraceCheckUtils]: 72: Hoare triple {9563#false} assume !(~i~0 < 100000); {9563#false} is VALID [2018-11-23 11:56:44,591 INFO L273 TraceCheckUtils]: 73: Hoare triple {9563#false} ~i~0 := 0; {9563#false} is VALID [2018-11-23 11:56:44,591 INFO L273 TraceCheckUtils]: 74: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,592 INFO L273 TraceCheckUtils]: 75: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,592 INFO L273 TraceCheckUtils]: 76: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,592 INFO L273 TraceCheckUtils]: 77: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,592 INFO L273 TraceCheckUtils]: 78: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,592 INFO L273 TraceCheckUtils]: 79: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,592 INFO L273 TraceCheckUtils]: 80: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,592 INFO L273 TraceCheckUtils]: 81: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,592 INFO L273 TraceCheckUtils]: 82: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,592 INFO L273 TraceCheckUtils]: 83: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,593 INFO L273 TraceCheckUtils]: 84: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,593 INFO L273 TraceCheckUtils]: 85: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,593 INFO L273 TraceCheckUtils]: 86: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,593 INFO L273 TraceCheckUtils]: 87: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,593 INFO L273 TraceCheckUtils]: 88: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:56:44,593 INFO L273 TraceCheckUtils]: 89: Hoare triple {9563#false} assume !(~i~0 < 100000); {9563#false} is VALID [2018-11-23 11:56:44,593 INFO L273 TraceCheckUtils]: 90: Hoare triple {9563#false} havoc ~x~0;~x~0 := 0; {9563#false} is VALID [2018-11-23 11:56:44,593 INFO L273 TraceCheckUtils]: 91: Hoare triple {9563#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9563#false} is VALID [2018-11-23 11:56:44,593 INFO L256 TraceCheckUtils]: 92: Hoare triple {9563#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {9563#false} is VALID [2018-11-23 11:56:44,594 INFO L273 TraceCheckUtils]: 93: Hoare triple {9563#false} ~cond := #in~cond; {9563#false} is VALID [2018-11-23 11:56:44,594 INFO L273 TraceCheckUtils]: 94: Hoare triple {9563#false} assume 0 == ~cond; {9563#false} is VALID [2018-11-23 11:56:44,594 INFO L273 TraceCheckUtils]: 95: Hoare triple {9563#false} assume !false; {9563#false} is VALID [2018-11-23 11:56:44,598 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2018-11-23 11:56:44,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:44,598 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:44,607 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:57:23,423 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 11:57:23,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:57:23,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:23,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:23,796 INFO L256 TraceCheckUtils]: 0: Hoare triple {9562#true} call ULTIMATE.init(); {9562#true} is VALID [2018-11-23 11:57:23,797 INFO L273 TraceCheckUtils]: 1: Hoare triple {9562#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9562#true} is VALID [2018-11-23 11:57:23,797 INFO L273 TraceCheckUtils]: 2: Hoare triple {9562#true} assume true; {9562#true} is VALID [2018-11-23 11:57:23,797 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9562#true} {9562#true} #100#return; {9562#true} is VALID [2018-11-23 11:57:23,797 INFO L256 TraceCheckUtils]: 4: Hoare triple {9562#true} call #t~ret2 := main(); {9562#true} is VALID [2018-11-23 11:57:23,798 INFO L273 TraceCheckUtils]: 5: Hoare triple {9562#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9562#true} is VALID [2018-11-23 11:57:23,798 INFO L273 TraceCheckUtils]: 6: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,798 INFO L273 TraceCheckUtils]: 7: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,798 INFO L273 TraceCheckUtils]: 8: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,799 INFO L273 TraceCheckUtils]: 9: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,799 INFO L273 TraceCheckUtils]: 10: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,799 INFO L273 TraceCheckUtils]: 11: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,799 INFO L273 TraceCheckUtils]: 12: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,799 INFO L273 TraceCheckUtils]: 13: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,799 INFO L273 TraceCheckUtils]: 14: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,799 INFO L273 TraceCheckUtils]: 15: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,799 INFO L273 TraceCheckUtils]: 16: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,800 INFO L273 TraceCheckUtils]: 17: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,800 INFO L273 TraceCheckUtils]: 18: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,800 INFO L273 TraceCheckUtils]: 19: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,801 INFO L273 TraceCheckUtils]: 20: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9643#(<= main_~i~0 100000)} is VALID [2018-11-23 11:57:23,801 INFO L273 TraceCheckUtils]: 21: Hoare triple {9643#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {9562#true} is VALID [2018-11-23 11:57:23,801 INFO L273 TraceCheckUtils]: 22: Hoare triple {9562#true} ~i~0 := 0; {9562#true} is VALID [2018-11-23 11:57:23,801 INFO L273 TraceCheckUtils]: 23: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,801 INFO L273 TraceCheckUtils]: 24: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,801 INFO L273 TraceCheckUtils]: 25: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,801 INFO L273 TraceCheckUtils]: 26: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,801 INFO L273 TraceCheckUtils]: 27: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,801 INFO L273 TraceCheckUtils]: 28: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,802 INFO L273 TraceCheckUtils]: 29: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,802 INFO L273 TraceCheckUtils]: 30: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,802 INFO L273 TraceCheckUtils]: 31: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,802 INFO L273 TraceCheckUtils]: 32: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,802 INFO L273 TraceCheckUtils]: 33: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,802 INFO L273 TraceCheckUtils]: 34: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,802 INFO L273 TraceCheckUtils]: 35: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,802 INFO L273 TraceCheckUtils]: 36: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,803 INFO L273 TraceCheckUtils]: 37: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9643#(<= main_~i~0 100000)} is VALID [2018-11-23 11:57:23,803 INFO L273 TraceCheckUtils]: 38: Hoare triple {9643#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {9562#true} is VALID [2018-11-23 11:57:23,803 INFO L273 TraceCheckUtils]: 39: Hoare triple {9562#true} ~i~0 := 0; {9562#true} is VALID [2018-11-23 11:57:23,803 INFO L273 TraceCheckUtils]: 40: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,803 INFO L273 TraceCheckUtils]: 41: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,804 INFO L273 TraceCheckUtils]: 42: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,804 INFO L273 TraceCheckUtils]: 43: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,804 INFO L273 TraceCheckUtils]: 44: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,804 INFO L273 TraceCheckUtils]: 45: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,804 INFO L273 TraceCheckUtils]: 46: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,804 INFO L273 TraceCheckUtils]: 47: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,804 INFO L273 TraceCheckUtils]: 48: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,804 INFO L273 TraceCheckUtils]: 49: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,804 INFO L273 TraceCheckUtils]: 50: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,805 INFO L273 TraceCheckUtils]: 51: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,805 INFO L273 TraceCheckUtils]: 52: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,805 INFO L273 TraceCheckUtils]: 53: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,805 INFO L273 TraceCheckUtils]: 54: Hoare triple {9562#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9562#true} is VALID [2018-11-23 11:57:23,805 INFO L273 TraceCheckUtils]: 55: Hoare triple {9562#true} assume !(~i~0 < 100000); {9562#true} is VALID [2018-11-23 11:57:23,805 INFO L273 TraceCheckUtils]: 56: Hoare triple {9562#true} ~i~0 := 0; {9752#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:23,806 INFO L273 TraceCheckUtils]: 57: Hoare triple {9752#(<= 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; {9565#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:23,807 INFO L273 TraceCheckUtils]: 58: Hoare triple {9565#(<= 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; {9566#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:23,808 INFO L273 TraceCheckUtils]: 59: Hoare triple {9566#(<= 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; {9567#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:23,809 INFO L273 TraceCheckUtils]: 60: Hoare triple {9567#(<= 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; {9568#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:23,809 INFO L273 TraceCheckUtils]: 61: Hoare triple {9568#(<= 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; {9569#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:23,810 INFO L273 TraceCheckUtils]: 62: Hoare triple {9569#(<= 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; {9570#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:23,810 INFO L273 TraceCheckUtils]: 63: Hoare triple {9570#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9571#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:23,811 INFO L273 TraceCheckUtils]: 64: Hoare triple {9571#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9572#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:23,812 INFO L273 TraceCheckUtils]: 65: Hoare triple {9572#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9573#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:23,813 INFO L273 TraceCheckUtils]: 66: Hoare triple {9573#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9574#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:23,813 INFO L273 TraceCheckUtils]: 67: Hoare triple {9574#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9575#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:23,814 INFO L273 TraceCheckUtils]: 68: Hoare triple {9575#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9576#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:23,815 INFO L273 TraceCheckUtils]: 69: Hoare triple {9576#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9577#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:23,816 INFO L273 TraceCheckUtils]: 70: Hoare triple {9577#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9578#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:23,817 INFO L273 TraceCheckUtils]: 71: Hoare triple {9578#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9579#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:23,818 INFO L273 TraceCheckUtils]: 72: Hoare triple {9579#(<= main_~i~0 15)} assume !(~i~0 < 100000); {9563#false} is VALID [2018-11-23 11:57:23,818 INFO L273 TraceCheckUtils]: 73: Hoare triple {9563#false} ~i~0 := 0; {9563#false} is VALID [2018-11-23 11:57:23,818 INFO L273 TraceCheckUtils]: 74: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:57:23,819 INFO L273 TraceCheckUtils]: 75: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:57:23,819 INFO L273 TraceCheckUtils]: 76: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:57:23,819 INFO L273 TraceCheckUtils]: 77: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:57:23,819 INFO L273 TraceCheckUtils]: 78: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:57:23,819 INFO L273 TraceCheckUtils]: 79: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:57:23,820 INFO L273 TraceCheckUtils]: 80: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:57:23,820 INFO L273 TraceCheckUtils]: 81: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:57:23,820 INFO L273 TraceCheckUtils]: 82: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:57:23,820 INFO L273 TraceCheckUtils]: 83: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:57:23,820 INFO L273 TraceCheckUtils]: 84: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:57:23,821 INFO L273 TraceCheckUtils]: 85: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:57:23,821 INFO L273 TraceCheckUtils]: 86: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:57:23,821 INFO L273 TraceCheckUtils]: 87: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:57:23,821 INFO L273 TraceCheckUtils]: 88: Hoare triple {9563#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9563#false} is VALID [2018-11-23 11:57:23,821 INFO L273 TraceCheckUtils]: 89: Hoare triple {9563#false} assume !(~i~0 < 100000); {9563#false} is VALID [2018-11-23 11:57:23,821 INFO L273 TraceCheckUtils]: 90: Hoare triple {9563#false} havoc ~x~0;~x~0 := 0; {9563#false} is VALID [2018-11-23 11:57:23,822 INFO L273 TraceCheckUtils]: 91: Hoare triple {9563#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9563#false} is VALID [2018-11-23 11:57:23,822 INFO L256 TraceCheckUtils]: 92: Hoare triple {9563#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {9563#false} is VALID [2018-11-23 11:57:23,822 INFO L273 TraceCheckUtils]: 93: Hoare triple {9563#false} ~cond := #in~cond; {9563#false} is VALID [2018-11-23 11:57:23,822 INFO L273 TraceCheckUtils]: 94: Hoare triple {9563#false} assume 0 == ~cond; {9563#false} is VALID [2018-11-23 11:57:23,822 INFO L273 TraceCheckUtils]: 95: Hoare triple {9563#false} assume !false; {9563#false} is VALID [2018-11-23 11:57:23,827 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 30 proven. 120 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-11-23 11:57:23,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:23,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 20 [2018-11-23 11:57:23,855 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 96 [2018-11-23 11:57:23,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:23,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:57:23,924 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:23,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:57:23,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:57:23,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:57:23,925 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 20 states. [2018-11-23 11:57:24,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:24,712 INFO L93 Difference]: Finished difference Result 185 states and 199 transitions. [2018-11-23 11:57:24,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:57:24,712 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 96 [2018-11-23 11:57:24,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:24,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:57:24,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 139 transitions. [2018-11-23 11:57:24,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:57:24,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 139 transitions. [2018-11-23 11:57:24,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 139 transitions. [2018-11-23 11:57:24,866 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:24,868 INFO L225 Difference]: With dead ends: 185 [2018-11-23 11:57:24,869 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 11:57:24,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:57:24,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 11:57:24,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-11-23 11:57:24,947 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:24,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 106 states. [2018-11-23 11:57:24,947 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 106 states. [2018-11-23 11:57:24,948 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 106 states. [2018-11-23 11:57:24,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:24,950 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2018-11-23 11:57:24,950 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-11-23 11:57:24,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:24,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:24,951 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 106 states. [2018-11-23 11:57:24,951 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 106 states. [2018-11-23 11:57:24,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:24,953 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2018-11-23 11:57:24,953 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-11-23 11:57:24,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:24,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:24,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:24,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:24,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-23 11:57:24,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-11-23 11:57:24,956 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 96 [2018-11-23 11:57:24,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:24,957 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-11-23 11:57:24,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:57:24,957 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-11-23 11:57:24,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-23 11:57:24,958 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:24,959 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:24,959 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:24,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:24,959 INFO L82 PathProgramCache]: Analyzing trace with hash -831837630, now seen corresponding path program 16 times [2018-11-23 11:57:24,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:24,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:24,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:24,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:57:24,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:25,522 INFO L256 TraceCheckUtils]: 0: Hoare triple {10623#true} call ULTIMATE.init(); {10623#true} is VALID [2018-11-23 11:57:25,523 INFO L273 TraceCheckUtils]: 1: Hoare triple {10623#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10623#true} is VALID [2018-11-23 11:57:25,523 INFO L273 TraceCheckUtils]: 2: Hoare triple {10623#true} assume true; {10623#true} is VALID [2018-11-23 11:57:25,523 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10623#true} {10623#true} #100#return; {10623#true} is VALID [2018-11-23 11:57:25,523 INFO L256 TraceCheckUtils]: 4: Hoare triple {10623#true} call #t~ret2 := main(); {10623#true} is VALID [2018-11-23 11:57:25,524 INFO L273 TraceCheckUtils]: 5: Hoare triple {10623#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10625#(= main_~i~0 0)} is VALID [2018-11-23 11:57:25,525 INFO L273 TraceCheckUtils]: 6: Hoare triple {10625#(= 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; {10626#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:25,525 INFO L273 TraceCheckUtils]: 7: Hoare triple {10626#(<= 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; {10627#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:25,526 INFO L273 TraceCheckUtils]: 8: Hoare triple {10627#(<= 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; {10628#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:25,526 INFO L273 TraceCheckUtils]: 9: Hoare triple {10628#(<= 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; {10629#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:25,527 INFO L273 TraceCheckUtils]: 10: Hoare triple {10629#(<= 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; {10630#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:25,528 INFO L273 TraceCheckUtils]: 11: Hoare triple {10630#(<= 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; {10631#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:25,529 INFO L273 TraceCheckUtils]: 12: Hoare triple {10631#(<= 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; {10632#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:25,533 INFO L273 TraceCheckUtils]: 13: Hoare triple {10632#(<= 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; {10633#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:25,534 INFO L273 TraceCheckUtils]: 14: Hoare triple {10633#(<= 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; {10634#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:25,535 INFO L273 TraceCheckUtils]: 15: Hoare triple {10634#(<= 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; {10635#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:25,535 INFO L273 TraceCheckUtils]: 16: Hoare triple {10635#(<= 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; {10636#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:25,537 INFO L273 TraceCheckUtils]: 17: Hoare triple {10636#(<= 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; {10637#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:25,538 INFO L273 TraceCheckUtils]: 18: Hoare triple {10637#(<= 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; {10638#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:25,539 INFO L273 TraceCheckUtils]: 19: Hoare triple {10638#(<= 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; {10639#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:25,540 INFO L273 TraceCheckUtils]: 20: Hoare triple {10639#(<= 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; {10640#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:25,541 INFO L273 TraceCheckUtils]: 21: Hoare triple {10640#(<= 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; {10641#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:25,541 INFO L273 TraceCheckUtils]: 22: Hoare triple {10641#(<= main_~i~0 16)} assume !(~i~0 < 100000); {10624#false} is VALID [2018-11-23 11:57:25,542 INFO L273 TraceCheckUtils]: 23: Hoare triple {10624#false} ~i~0 := 0; {10624#false} is VALID [2018-11-23 11:57:25,542 INFO L273 TraceCheckUtils]: 24: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,542 INFO L273 TraceCheckUtils]: 25: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,542 INFO L273 TraceCheckUtils]: 26: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,542 INFO L273 TraceCheckUtils]: 27: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,543 INFO L273 TraceCheckUtils]: 28: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,543 INFO L273 TraceCheckUtils]: 29: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,543 INFO L273 TraceCheckUtils]: 30: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,543 INFO L273 TraceCheckUtils]: 31: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,543 INFO L273 TraceCheckUtils]: 32: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,544 INFO L273 TraceCheckUtils]: 33: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,544 INFO L273 TraceCheckUtils]: 34: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,544 INFO L273 TraceCheckUtils]: 35: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,544 INFO L273 TraceCheckUtils]: 36: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,544 INFO L273 TraceCheckUtils]: 37: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,545 INFO L273 TraceCheckUtils]: 38: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,545 INFO L273 TraceCheckUtils]: 39: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,545 INFO L273 TraceCheckUtils]: 40: Hoare triple {10624#false} assume !(~i~0 < 100000); {10624#false} is VALID [2018-11-23 11:57:25,545 INFO L273 TraceCheckUtils]: 41: Hoare triple {10624#false} ~i~0 := 0; {10624#false} is VALID [2018-11-23 11:57:25,545 INFO L273 TraceCheckUtils]: 42: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,546 INFO L273 TraceCheckUtils]: 43: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,546 INFO L273 TraceCheckUtils]: 44: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,546 INFO L273 TraceCheckUtils]: 45: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,546 INFO L273 TraceCheckUtils]: 46: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,546 INFO L273 TraceCheckUtils]: 47: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,546 INFO L273 TraceCheckUtils]: 48: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,547 INFO L273 TraceCheckUtils]: 49: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,547 INFO L273 TraceCheckUtils]: 50: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,547 INFO L273 TraceCheckUtils]: 51: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,547 INFO L273 TraceCheckUtils]: 52: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,547 INFO L273 TraceCheckUtils]: 53: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,547 INFO L273 TraceCheckUtils]: 54: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,547 INFO L273 TraceCheckUtils]: 55: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,547 INFO L273 TraceCheckUtils]: 56: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,547 INFO L273 TraceCheckUtils]: 57: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,548 INFO L273 TraceCheckUtils]: 58: Hoare triple {10624#false} assume !(~i~0 < 100000); {10624#false} is VALID [2018-11-23 11:57:25,548 INFO L273 TraceCheckUtils]: 59: Hoare triple {10624#false} ~i~0 := 0; {10624#false} is VALID [2018-11-23 11:57:25,548 INFO L273 TraceCheckUtils]: 60: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,548 INFO L273 TraceCheckUtils]: 61: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,548 INFO L273 TraceCheckUtils]: 62: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,548 INFO L273 TraceCheckUtils]: 63: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,548 INFO L273 TraceCheckUtils]: 64: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,548 INFO L273 TraceCheckUtils]: 65: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,548 INFO L273 TraceCheckUtils]: 66: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,549 INFO L273 TraceCheckUtils]: 67: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,549 INFO L273 TraceCheckUtils]: 68: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,549 INFO L273 TraceCheckUtils]: 69: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,549 INFO L273 TraceCheckUtils]: 70: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,549 INFO L273 TraceCheckUtils]: 71: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,549 INFO L273 TraceCheckUtils]: 72: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,549 INFO L273 TraceCheckUtils]: 73: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,549 INFO L273 TraceCheckUtils]: 74: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,549 INFO L273 TraceCheckUtils]: 75: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,550 INFO L273 TraceCheckUtils]: 76: Hoare triple {10624#false} assume !(~i~0 < 100000); {10624#false} is VALID [2018-11-23 11:57:25,550 INFO L273 TraceCheckUtils]: 77: Hoare triple {10624#false} ~i~0 := 0; {10624#false} is VALID [2018-11-23 11:57:25,550 INFO L273 TraceCheckUtils]: 78: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,550 INFO L273 TraceCheckUtils]: 79: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,550 INFO L273 TraceCheckUtils]: 80: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,550 INFO L273 TraceCheckUtils]: 81: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,550 INFO L273 TraceCheckUtils]: 82: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,550 INFO L273 TraceCheckUtils]: 83: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,551 INFO L273 TraceCheckUtils]: 84: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,551 INFO L273 TraceCheckUtils]: 85: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,551 INFO L273 TraceCheckUtils]: 86: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,551 INFO L273 TraceCheckUtils]: 87: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,551 INFO L273 TraceCheckUtils]: 88: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,551 INFO L273 TraceCheckUtils]: 89: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,551 INFO L273 TraceCheckUtils]: 90: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,551 INFO L273 TraceCheckUtils]: 91: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,551 INFO L273 TraceCheckUtils]: 92: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,552 INFO L273 TraceCheckUtils]: 93: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:25,552 INFO L273 TraceCheckUtils]: 94: Hoare triple {10624#false} assume !(~i~0 < 100000); {10624#false} is VALID [2018-11-23 11:57:25,552 INFO L273 TraceCheckUtils]: 95: Hoare triple {10624#false} havoc ~x~0;~x~0 := 0; {10624#false} is VALID [2018-11-23 11:57:25,552 INFO L273 TraceCheckUtils]: 96: Hoare triple {10624#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10624#false} is VALID [2018-11-23 11:57:25,552 INFO L256 TraceCheckUtils]: 97: Hoare triple {10624#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {10624#false} is VALID [2018-11-23 11:57:25,552 INFO L273 TraceCheckUtils]: 98: Hoare triple {10624#false} ~cond := #in~cond; {10624#false} is VALID [2018-11-23 11:57:25,552 INFO L273 TraceCheckUtils]: 99: Hoare triple {10624#false} assume 0 == ~cond; {10624#false} is VALID [2018-11-23 11:57:25,552 INFO L273 TraceCheckUtils]: 100: Hoare triple {10624#false} assume !false; {10624#false} is VALID [2018-11-23 11:57:25,557 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-23 11:57:25,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:25,557 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:25,566 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:57:25,638 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:57:25,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:57:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:25,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:26,013 INFO L256 TraceCheckUtils]: 0: Hoare triple {10623#true} call ULTIMATE.init(); {10623#true} is VALID [2018-11-23 11:57:26,014 INFO L273 TraceCheckUtils]: 1: Hoare triple {10623#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10623#true} is VALID [2018-11-23 11:57:26,014 INFO L273 TraceCheckUtils]: 2: Hoare triple {10623#true} assume true; {10623#true} is VALID [2018-11-23 11:57:26,014 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10623#true} {10623#true} #100#return; {10623#true} is VALID [2018-11-23 11:57:26,014 INFO L256 TraceCheckUtils]: 4: Hoare triple {10623#true} call #t~ret2 := main(); {10623#true} is VALID [2018-11-23 11:57:26,015 INFO L273 TraceCheckUtils]: 5: Hoare triple {10623#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10660#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:26,015 INFO L273 TraceCheckUtils]: 6: Hoare triple {10660#(<= 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; {10626#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:26,016 INFO L273 TraceCheckUtils]: 7: Hoare triple {10626#(<= 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; {10627#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:26,016 INFO L273 TraceCheckUtils]: 8: Hoare triple {10627#(<= 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; {10628#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:26,017 INFO L273 TraceCheckUtils]: 9: Hoare triple {10628#(<= 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; {10629#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:26,018 INFO L273 TraceCheckUtils]: 10: Hoare triple {10629#(<= 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; {10630#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:26,019 INFO L273 TraceCheckUtils]: 11: Hoare triple {10630#(<= 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; {10631#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:26,020 INFO L273 TraceCheckUtils]: 12: Hoare triple {10631#(<= 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; {10632#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:26,021 INFO L273 TraceCheckUtils]: 13: Hoare triple {10632#(<= 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; {10633#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:26,022 INFO L273 TraceCheckUtils]: 14: Hoare triple {10633#(<= 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; {10634#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:26,022 INFO L273 TraceCheckUtils]: 15: Hoare triple {10634#(<= 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; {10635#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:26,023 INFO L273 TraceCheckUtils]: 16: Hoare triple {10635#(<= 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; {10636#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:26,024 INFO L273 TraceCheckUtils]: 17: Hoare triple {10636#(<= 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; {10637#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:26,025 INFO L273 TraceCheckUtils]: 18: Hoare triple {10637#(<= 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; {10638#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:26,026 INFO L273 TraceCheckUtils]: 19: Hoare triple {10638#(<= 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; {10639#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:26,027 INFO L273 TraceCheckUtils]: 20: Hoare triple {10639#(<= 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; {10640#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:26,028 INFO L273 TraceCheckUtils]: 21: Hoare triple {10640#(<= 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; {10641#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:26,029 INFO L273 TraceCheckUtils]: 22: Hoare triple {10641#(<= main_~i~0 16)} assume !(~i~0 < 100000); {10624#false} is VALID [2018-11-23 11:57:26,029 INFO L273 TraceCheckUtils]: 23: Hoare triple {10624#false} ~i~0 := 0; {10624#false} is VALID [2018-11-23 11:57:26,029 INFO L273 TraceCheckUtils]: 24: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,029 INFO L273 TraceCheckUtils]: 25: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,030 INFO L273 TraceCheckUtils]: 26: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,030 INFO L273 TraceCheckUtils]: 27: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,030 INFO L273 TraceCheckUtils]: 28: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,030 INFO L273 TraceCheckUtils]: 29: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,030 INFO L273 TraceCheckUtils]: 30: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,031 INFO L273 TraceCheckUtils]: 31: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,031 INFO L273 TraceCheckUtils]: 32: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,031 INFO L273 TraceCheckUtils]: 33: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,031 INFO L273 TraceCheckUtils]: 34: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,031 INFO L273 TraceCheckUtils]: 35: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,031 INFO L273 TraceCheckUtils]: 36: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,031 INFO L273 TraceCheckUtils]: 37: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,032 INFO L273 TraceCheckUtils]: 38: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,032 INFO L273 TraceCheckUtils]: 39: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,032 INFO L273 TraceCheckUtils]: 40: Hoare triple {10624#false} assume !(~i~0 < 100000); {10624#false} is VALID [2018-11-23 11:57:26,032 INFO L273 TraceCheckUtils]: 41: Hoare triple {10624#false} ~i~0 := 0; {10624#false} is VALID [2018-11-23 11:57:26,032 INFO L273 TraceCheckUtils]: 42: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,032 INFO L273 TraceCheckUtils]: 43: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,032 INFO L273 TraceCheckUtils]: 44: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,032 INFO L273 TraceCheckUtils]: 45: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,032 INFO L273 TraceCheckUtils]: 46: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,033 INFO L273 TraceCheckUtils]: 47: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,033 INFO L273 TraceCheckUtils]: 48: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,033 INFO L273 TraceCheckUtils]: 49: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,033 INFO L273 TraceCheckUtils]: 50: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,033 INFO L273 TraceCheckUtils]: 51: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,033 INFO L273 TraceCheckUtils]: 52: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,033 INFO L273 TraceCheckUtils]: 53: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,033 INFO L273 TraceCheckUtils]: 54: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,034 INFO L273 TraceCheckUtils]: 55: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,034 INFO L273 TraceCheckUtils]: 56: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,034 INFO L273 TraceCheckUtils]: 57: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,034 INFO L273 TraceCheckUtils]: 58: Hoare triple {10624#false} assume !(~i~0 < 100000); {10624#false} is VALID [2018-11-23 11:57:26,034 INFO L273 TraceCheckUtils]: 59: Hoare triple {10624#false} ~i~0 := 0; {10624#false} is VALID [2018-11-23 11:57:26,034 INFO L273 TraceCheckUtils]: 60: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,034 INFO L273 TraceCheckUtils]: 61: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,034 INFO L273 TraceCheckUtils]: 62: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,034 INFO L273 TraceCheckUtils]: 63: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,035 INFO L273 TraceCheckUtils]: 64: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,035 INFO L273 TraceCheckUtils]: 65: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,035 INFO L273 TraceCheckUtils]: 66: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,035 INFO L273 TraceCheckUtils]: 67: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,035 INFO L273 TraceCheckUtils]: 68: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,035 INFO L273 TraceCheckUtils]: 69: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,035 INFO L273 TraceCheckUtils]: 70: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,035 INFO L273 TraceCheckUtils]: 71: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,035 INFO L273 TraceCheckUtils]: 72: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,036 INFO L273 TraceCheckUtils]: 73: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,036 INFO L273 TraceCheckUtils]: 74: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,036 INFO L273 TraceCheckUtils]: 75: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,036 INFO L273 TraceCheckUtils]: 76: Hoare triple {10624#false} assume !(~i~0 < 100000); {10624#false} is VALID [2018-11-23 11:57:26,036 INFO L273 TraceCheckUtils]: 77: Hoare triple {10624#false} ~i~0 := 0; {10624#false} is VALID [2018-11-23 11:57:26,036 INFO L273 TraceCheckUtils]: 78: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,036 INFO L273 TraceCheckUtils]: 79: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,037 INFO L273 TraceCheckUtils]: 80: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,037 INFO L273 TraceCheckUtils]: 81: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,037 INFO L273 TraceCheckUtils]: 82: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,037 INFO L273 TraceCheckUtils]: 83: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,037 INFO L273 TraceCheckUtils]: 84: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,037 INFO L273 TraceCheckUtils]: 85: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,038 INFO L273 TraceCheckUtils]: 86: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,038 INFO L273 TraceCheckUtils]: 87: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,038 INFO L273 TraceCheckUtils]: 88: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,038 INFO L273 TraceCheckUtils]: 89: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,038 INFO L273 TraceCheckUtils]: 90: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,038 INFO L273 TraceCheckUtils]: 91: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,038 INFO L273 TraceCheckUtils]: 92: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,038 INFO L273 TraceCheckUtils]: 93: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10624#false} is VALID [2018-11-23 11:57:26,038 INFO L273 TraceCheckUtils]: 94: Hoare triple {10624#false} assume !(~i~0 < 100000); {10624#false} is VALID [2018-11-23 11:57:26,039 INFO L273 TraceCheckUtils]: 95: Hoare triple {10624#false} havoc ~x~0;~x~0 := 0; {10624#false} is VALID [2018-11-23 11:57:26,039 INFO L273 TraceCheckUtils]: 96: Hoare triple {10624#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10624#false} is VALID [2018-11-23 11:57:26,039 INFO L256 TraceCheckUtils]: 97: Hoare triple {10624#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {10624#false} is VALID [2018-11-23 11:57:26,039 INFO L273 TraceCheckUtils]: 98: Hoare triple {10624#false} ~cond := #in~cond; {10624#false} is VALID [2018-11-23 11:57:26,039 INFO L273 TraceCheckUtils]: 99: Hoare triple {10624#false} assume 0 == ~cond; {10624#false} is VALID [2018-11-23 11:57:26,039 INFO L273 TraceCheckUtils]: 100: Hoare triple {10624#false} assume !false; {10624#false} is VALID [2018-11-23 11:57:26,044 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-23 11:57:26,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:26,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 11:57:26,063 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 101 [2018-11-23 11:57:26,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:26,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:57:26,096 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:26,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:57:26,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:57:26,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:57:26,098 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 20 states. [2018-11-23 11:57:27,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:27,374 INFO L93 Difference]: Finished difference Result 194 states and 208 transitions. [2018-11-23 11:57:27,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:57:27,374 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 101 [2018-11-23 11:57:27,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:27,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:57:27,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 144 transitions. [2018-11-23 11:57:27,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:57:27,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 144 transitions. [2018-11-23 11:57:27,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 144 transitions. [2018-11-23 11:57:27,529 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:27,531 INFO L225 Difference]: With dead ends: 194 [2018-11-23 11:57:27,531 INFO L226 Difference]: Without dead ends: 111 [2018-11-23 11:57:27,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:57:27,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-23 11:57:27,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-11-23 11:57:27,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:27,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 111 states. [2018-11-23 11:57:27,633 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 111 states. [2018-11-23 11:57:27,633 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 111 states. [2018-11-23 11:57:27,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:27,635 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2018-11-23 11:57:27,635 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2018-11-23 11:57:27,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:27,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:27,636 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 111 states. [2018-11-23 11:57:27,636 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 111 states. [2018-11-23 11:57:27,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:27,638 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2018-11-23 11:57:27,638 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2018-11-23 11:57:27,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:27,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:27,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:27,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:27,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-23 11:57:27,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 116 transitions. [2018-11-23 11:57:27,641 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 116 transitions. Word has length 101 [2018-11-23 11:57:27,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:27,641 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 116 transitions. [2018-11-23 11:57:27,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:57:27,641 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2018-11-23 11:57:27,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-23 11:57:27,642 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:27,642 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:27,643 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:27,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:27,643 INFO L82 PathProgramCache]: Analyzing trace with hash 855925908, now seen corresponding path program 17 times [2018-11-23 11:57:27,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:27,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:27,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:27,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:57:27,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:28,544 INFO L256 TraceCheckUtils]: 0: Hoare triple {11737#true} call ULTIMATE.init(); {11737#true} is VALID [2018-11-23 11:57:28,545 INFO L273 TraceCheckUtils]: 1: Hoare triple {11737#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11737#true} is VALID [2018-11-23 11:57:28,545 INFO L273 TraceCheckUtils]: 2: Hoare triple {11737#true} assume true; {11737#true} is VALID [2018-11-23 11:57:28,545 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11737#true} {11737#true} #100#return; {11737#true} is VALID [2018-11-23 11:57:28,546 INFO L256 TraceCheckUtils]: 4: Hoare triple {11737#true} call #t~ret2 := main(); {11737#true} is VALID [2018-11-23 11:57:28,546 INFO L273 TraceCheckUtils]: 5: Hoare triple {11737#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11739#(= main_~i~0 0)} is VALID [2018-11-23 11:57:28,547 INFO L273 TraceCheckUtils]: 6: Hoare triple {11739#(= 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; {11740#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:28,548 INFO L273 TraceCheckUtils]: 7: Hoare triple {11740#(<= 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; {11741#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:28,548 INFO L273 TraceCheckUtils]: 8: Hoare triple {11741#(<= 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; {11742#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:28,549 INFO L273 TraceCheckUtils]: 9: Hoare triple {11742#(<= 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; {11743#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:28,549 INFO L273 TraceCheckUtils]: 10: Hoare triple {11743#(<= 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; {11744#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:28,550 INFO L273 TraceCheckUtils]: 11: Hoare triple {11744#(<= 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; {11745#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:28,551 INFO L273 TraceCheckUtils]: 12: Hoare triple {11745#(<= 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; {11746#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:28,552 INFO L273 TraceCheckUtils]: 13: Hoare triple {11746#(<= 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; {11747#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:28,553 INFO L273 TraceCheckUtils]: 14: Hoare triple {11747#(<= 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; {11748#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:28,554 INFO L273 TraceCheckUtils]: 15: Hoare triple {11748#(<= 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; {11749#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:28,555 INFO L273 TraceCheckUtils]: 16: Hoare triple {11749#(<= 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; {11750#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:28,556 INFO L273 TraceCheckUtils]: 17: Hoare triple {11750#(<= 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; {11751#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:28,557 INFO L273 TraceCheckUtils]: 18: Hoare triple {11751#(<= 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; {11752#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:28,558 INFO L273 TraceCheckUtils]: 19: Hoare triple {11752#(<= 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; {11753#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:28,559 INFO L273 TraceCheckUtils]: 20: Hoare triple {11753#(<= 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; {11754#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:28,560 INFO L273 TraceCheckUtils]: 21: Hoare triple {11754#(<= 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; {11755#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:28,561 INFO L273 TraceCheckUtils]: 22: Hoare triple {11755#(<= 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; {11756#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:28,561 INFO L273 TraceCheckUtils]: 23: Hoare triple {11756#(<= main_~i~0 17)} assume !(~i~0 < 100000); {11738#false} is VALID [2018-11-23 11:57:28,562 INFO L273 TraceCheckUtils]: 24: Hoare triple {11738#false} ~i~0 := 0; {11738#false} is VALID [2018-11-23 11:57:28,562 INFO L273 TraceCheckUtils]: 25: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,562 INFO L273 TraceCheckUtils]: 26: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,562 INFO L273 TraceCheckUtils]: 27: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,562 INFO L273 TraceCheckUtils]: 28: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,563 INFO L273 TraceCheckUtils]: 29: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,563 INFO L273 TraceCheckUtils]: 30: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,563 INFO L273 TraceCheckUtils]: 31: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,563 INFO L273 TraceCheckUtils]: 32: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,563 INFO L273 TraceCheckUtils]: 33: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,564 INFO L273 TraceCheckUtils]: 34: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,564 INFO L273 TraceCheckUtils]: 35: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,564 INFO L273 TraceCheckUtils]: 36: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,564 INFO L273 TraceCheckUtils]: 37: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,564 INFO L273 TraceCheckUtils]: 38: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,565 INFO L273 TraceCheckUtils]: 39: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,565 INFO L273 TraceCheckUtils]: 40: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,565 INFO L273 TraceCheckUtils]: 41: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,565 INFO L273 TraceCheckUtils]: 42: Hoare triple {11738#false} assume !(~i~0 < 100000); {11738#false} is VALID [2018-11-23 11:57:28,565 INFO L273 TraceCheckUtils]: 43: Hoare triple {11738#false} ~i~0 := 0; {11738#false} is VALID [2018-11-23 11:57:28,565 INFO L273 TraceCheckUtils]: 44: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,565 INFO L273 TraceCheckUtils]: 45: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,565 INFO L273 TraceCheckUtils]: 46: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,566 INFO L273 TraceCheckUtils]: 47: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,566 INFO L273 TraceCheckUtils]: 48: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,566 INFO L273 TraceCheckUtils]: 49: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,566 INFO L273 TraceCheckUtils]: 50: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,566 INFO L273 TraceCheckUtils]: 51: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,566 INFO L273 TraceCheckUtils]: 52: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,566 INFO L273 TraceCheckUtils]: 53: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,566 INFO L273 TraceCheckUtils]: 54: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,567 INFO L273 TraceCheckUtils]: 55: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,567 INFO L273 TraceCheckUtils]: 56: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,567 INFO L273 TraceCheckUtils]: 57: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,567 INFO L273 TraceCheckUtils]: 58: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,567 INFO L273 TraceCheckUtils]: 59: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,567 INFO L273 TraceCheckUtils]: 60: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,567 INFO L273 TraceCheckUtils]: 61: Hoare triple {11738#false} assume !(~i~0 < 100000); {11738#false} is VALID [2018-11-23 11:57:28,567 INFO L273 TraceCheckUtils]: 62: Hoare triple {11738#false} ~i~0 := 0; {11738#false} is VALID [2018-11-23 11:57:28,567 INFO L273 TraceCheckUtils]: 63: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,568 INFO L273 TraceCheckUtils]: 64: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,568 INFO L273 TraceCheckUtils]: 65: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,568 INFO L273 TraceCheckUtils]: 66: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,568 INFO L273 TraceCheckUtils]: 67: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,568 INFO L273 TraceCheckUtils]: 68: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,568 INFO L273 TraceCheckUtils]: 69: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,568 INFO L273 TraceCheckUtils]: 70: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,568 INFO L273 TraceCheckUtils]: 71: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,568 INFO L273 TraceCheckUtils]: 72: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,569 INFO L273 TraceCheckUtils]: 73: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,569 INFO L273 TraceCheckUtils]: 74: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,569 INFO L273 TraceCheckUtils]: 75: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,569 INFO L273 TraceCheckUtils]: 76: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,569 INFO L273 TraceCheckUtils]: 77: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,569 INFO L273 TraceCheckUtils]: 78: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,569 INFO L273 TraceCheckUtils]: 79: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,569 INFO L273 TraceCheckUtils]: 80: Hoare triple {11738#false} assume !(~i~0 < 100000); {11738#false} is VALID [2018-11-23 11:57:28,570 INFO L273 TraceCheckUtils]: 81: Hoare triple {11738#false} ~i~0 := 0; {11738#false} is VALID [2018-11-23 11:57:28,570 INFO L273 TraceCheckUtils]: 82: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,570 INFO L273 TraceCheckUtils]: 83: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,570 INFO L273 TraceCheckUtils]: 84: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,570 INFO L273 TraceCheckUtils]: 85: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,570 INFO L273 TraceCheckUtils]: 86: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,570 INFO L273 TraceCheckUtils]: 87: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,570 INFO L273 TraceCheckUtils]: 88: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,570 INFO L273 TraceCheckUtils]: 89: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,571 INFO L273 TraceCheckUtils]: 90: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,571 INFO L273 TraceCheckUtils]: 91: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,571 INFO L273 TraceCheckUtils]: 92: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,571 INFO L273 TraceCheckUtils]: 93: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,571 INFO L273 TraceCheckUtils]: 94: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,571 INFO L273 TraceCheckUtils]: 95: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,571 INFO L273 TraceCheckUtils]: 96: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,571 INFO L273 TraceCheckUtils]: 97: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,571 INFO L273 TraceCheckUtils]: 98: Hoare triple {11738#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:57:28,572 INFO L273 TraceCheckUtils]: 99: Hoare triple {11738#false} assume !(~i~0 < 100000); {11738#false} is VALID [2018-11-23 11:57:28,572 INFO L273 TraceCheckUtils]: 100: Hoare triple {11738#false} havoc ~x~0;~x~0 := 0; {11738#false} is VALID [2018-11-23 11:57:28,572 INFO L273 TraceCheckUtils]: 101: Hoare triple {11738#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11738#false} is VALID [2018-11-23 11:57:28,572 INFO L256 TraceCheckUtils]: 102: Hoare triple {11738#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {11738#false} is VALID [2018-11-23 11:57:28,572 INFO L273 TraceCheckUtils]: 103: Hoare triple {11738#false} ~cond := #in~cond; {11738#false} is VALID [2018-11-23 11:57:28,572 INFO L273 TraceCheckUtils]: 104: Hoare triple {11738#false} assume 0 == ~cond; {11738#false} is VALID [2018-11-23 11:57:28,572 INFO L273 TraceCheckUtils]: 105: Hoare triple {11738#false} assume !false; {11738#false} is VALID [2018-11-23 11:57:28,577 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2018-11-23 11:57:28,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:28,577 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:28,586 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1