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_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:02:33,347 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:02:33,350 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:02:33,362 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:02:33,362 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:02:33,363 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:02:33,365 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:02:33,367 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:02:33,369 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:02:33,369 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:02:33,370 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:02:33,371 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:02:33,372 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:02:33,373 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:02:33,374 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:02:33,375 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:02:33,376 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:02:33,378 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:02:33,380 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:02:33,382 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:02:33,383 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:02:33,385 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:02:33,388 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:02:33,388 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:02:33,388 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:02:33,389 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:02:33,391 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:02:33,392 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:02:33,393 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:02:33,394 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:02:33,394 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:02:33,395 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:02:33,395 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:02:33,395 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:02:33,397 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:02:33,397 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:02:33,398 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:02:33,414 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:02:33,414 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:02:33,415 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:02:33,415 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:02:33,416 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:02:33,416 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:02:33,416 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:02:33,417 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:02:33,417 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:02:33,417 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:02:33,417 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:02:33,417 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:02:33,418 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:02:33,418 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:02:33,418 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:02:33,418 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:02:33,418 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:02:33,419 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:02:33,419 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:02:33,419 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:02:33,419 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:02:33,419 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:02:33,420 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:02:33,420 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:02:33,420 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:02:33,420 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:02:33,421 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:02:33,421 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:02:33,421 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:02:33,421 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:02:33,421 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:02:33,466 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:02:33,479 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:02:33,483 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:02:33,485 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:02:33,485 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:02:33,486 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init5_true-unreach-call_ground.i [2018-11-23 12:02:33,547 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27dcff990/447a85f7b09b47938088227168b5450e/FLAG112a357de [2018-11-23 12:02:34,044 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:02:34,045 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init5_true-unreach-call_ground.i [2018-11-23 12:02:34,050 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27dcff990/447a85f7b09b47938088227168b5450e/FLAG112a357de [2018-11-23 12:02:34,388 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27dcff990/447a85f7b09b47938088227168b5450e [2018-11-23 12:02:34,398 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:02:34,400 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:02:34,401 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:02:34,401 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:02:34,408 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:02:34,409 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:02:34" (1/1) ... [2018-11-23 12:02:34,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d94b8da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:34, skipping insertion in model container [2018-11-23 12:02:34,413 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:02:34" (1/1) ... [2018-11-23 12:02:34,423 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:02:34,445 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:02:34,665 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:02:34,670 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:02:34,699 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:02:34,723 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:02:34,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:34 WrapperNode [2018-11-23 12:02:34,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:02:34,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:02:34,725 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:02:34,725 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:02:34,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:34" (1/1) ... [2018-11-23 12:02:34,746 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:34" (1/1) ... [2018-11-23 12:02:34,755 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:02:34,755 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:02:34,755 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:02:34,756 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:02:34,767 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:34" (1/1) ... [2018-11-23 12:02:34,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:34" (1/1) ... [2018-11-23 12:02:34,769 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:34" (1/1) ... [2018-11-23 12:02:34,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:34" (1/1) ... [2018-11-23 12:02:34,781 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:34" (1/1) ... [2018-11-23 12:02:34,793 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:34" (1/1) ... [2018-11-23 12:02:34,796 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:34" (1/1) ... [2018-11-23 12:02:34,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:02:34,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:02:34,805 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:02:34,811 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:02:34,812 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:02:34,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:02:34,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:02:34,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:02:34,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:02:34,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:02:34,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:02:34,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:02:34,975 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:02:34,975 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:02:34,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:02:34,975 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:02:34,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:02:35,618 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:02:35,621 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 12:02:35,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:02:35 BoogieIcfgContainer [2018-11-23 12:02:35,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:02:35,624 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:02:35,624 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:02:35,628 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:02:35,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:02:34" (1/3) ... [2018-11-23 12:02:35,629 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 12:02:35, skipping insertion in model container [2018-11-23 12:02:35,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:34" (2/3) ... [2018-11-23 12:02:35,630 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 12:02:35, skipping insertion in model container [2018-11-23 12:02:35,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:02:35" (3/3) ... [2018-11-23 12:02:35,633 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_init5_true-unreach-call_ground.i [2018-11-23 12:02:35,644 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:02:35,654 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:02:35,669 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:02:35,699 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:02:35,700 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:02:35,700 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:02:35,701 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:02:35,701 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:02:35,701 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:02:35,701 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:02:35,701 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:02:35,702 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:02:35,720 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 12:02:35,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:02:35,726 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:35,727 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 12:02:35,729 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:35,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:35,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1721973062, now seen corresponding path program 1 times [2018-11-23 12:02:35,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:35,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:35,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:35,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:35,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:35,897 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 12:02:35,901 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 12:02:35,902 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:02:35,902 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #100#return; {34#true} is VALID [2018-11-23 12:02:35,903 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret2 := main(); {34#true} is VALID [2018-11-23 12:02:35,903 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 12:02:35,904 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2018-11-23 12:02:35,905 INFO L273 TraceCheckUtils]: 7: Hoare triple {35#false} ~i~0 := 0; {35#false} is VALID [2018-11-23 12:02:35,905 INFO L273 TraceCheckUtils]: 8: Hoare triple {35#false} assume !(~i~0 < 100000); {35#false} is VALID [2018-11-23 12:02:35,905 INFO L273 TraceCheckUtils]: 9: Hoare triple {35#false} ~i~0 := 0; {35#false} is VALID [2018-11-23 12:02:35,906 INFO L273 TraceCheckUtils]: 10: Hoare triple {35#false} assume !(~i~0 < 100000); {35#false} is VALID [2018-11-23 12:02:35,906 INFO L273 TraceCheckUtils]: 11: Hoare triple {35#false} ~i~0 := 0; {35#false} is VALID [2018-11-23 12:02:35,907 INFO L273 TraceCheckUtils]: 12: Hoare triple {35#false} assume !(~i~0 < 100000); {35#false} is VALID [2018-11-23 12:02:35,907 INFO L273 TraceCheckUtils]: 13: Hoare triple {35#false} ~i~0 := 0; {35#false} is VALID [2018-11-23 12:02:35,907 INFO L273 TraceCheckUtils]: 14: Hoare triple {35#false} assume !(~i~0 < 100000); {35#false} is VALID [2018-11-23 12:02:35,908 INFO L273 TraceCheckUtils]: 15: Hoare triple {35#false} havoc ~x~0;~x~0 := 0; {35#false} is VALID [2018-11-23 12:02:35,908 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 12:02:35,908 INFO L256 TraceCheckUtils]: 17: Hoare triple {35#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {35#false} is VALID [2018-11-23 12:02:35,909 INFO L273 TraceCheckUtils]: 18: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2018-11-23 12:02:35,909 INFO L273 TraceCheckUtils]: 19: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2018-11-23 12:02:35,909 INFO L273 TraceCheckUtils]: 20: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 12:02:35,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:35,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:02:35,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:02:35,921 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-23 12:02:35,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:35,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:02:36,074 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:36,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:02:36,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:02:36,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:02:36,088 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-23 12:02:36,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:36,435 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2018-11-23 12:02:36,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:02:36,436 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-23 12:02:36,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:36,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:02:36,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 78 transitions. [2018-11-23 12:02:36,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:02:36,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 78 transitions. [2018-11-23 12:02:36,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 78 transitions. [2018-11-23 12:02:36,752 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 12:02:36,762 INFO L225 Difference]: With dead ends: 55 [2018-11-23 12:02:36,762 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 12:02:36,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:02:36,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 12:02:36,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 12:02:36,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:36,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 12:02:36,808 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:02:36,809 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:02:36,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:36,813 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2018-11-23 12:02:36,814 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2018-11-23 12:02:36,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:36,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:36,815 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:02:36,815 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:02:36,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:36,820 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2018-11-23 12:02:36,820 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2018-11-23 12:02:36,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:36,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:36,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:36,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:36,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:02:36,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-11-23 12:02:36,826 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 21 [2018-11-23 12:02:36,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:36,827 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-23 12:02:36,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:02:36,827 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2018-11-23 12:02:36,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:02:36,828 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:36,829 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 12:02:36,829 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:36,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:36,829 INFO L82 PathProgramCache]: Analyzing trace with hash -13266878, now seen corresponding path program 1 times [2018-11-23 12:02:36,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:36,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:36,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:36,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:36,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:36,945 INFO L256 TraceCheckUtils]: 0: Hoare triple {202#true} call ULTIMATE.init(); {202#true} is VALID [2018-11-23 12:02:36,946 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 12:02:36,946 INFO L273 TraceCheckUtils]: 2: Hoare triple {202#true} assume true; {202#true} is VALID [2018-11-23 12:02:36,946 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {202#true} {202#true} #100#return; {202#true} is VALID [2018-11-23 12:02:36,947 INFO L256 TraceCheckUtils]: 4: Hoare triple {202#true} call #t~ret2 := main(); {202#true} is VALID [2018-11-23 12:02:36,950 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 12:02:36,953 INFO L273 TraceCheckUtils]: 6: Hoare triple {204#(= main_~i~0 0)} assume !(~i~0 < 100000); {203#false} is VALID [2018-11-23 12:02:36,953 INFO L273 TraceCheckUtils]: 7: Hoare triple {203#false} ~i~0 := 0; {203#false} is VALID [2018-11-23 12:02:36,953 INFO L273 TraceCheckUtils]: 8: Hoare triple {203#false} assume !(~i~0 < 100000); {203#false} is VALID [2018-11-23 12:02:36,954 INFO L273 TraceCheckUtils]: 9: Hoare triple {203#false} ~i~0 := 0; {203#false} is VALID [2018-11-23 12:02:36,954 INFO L273 TraceCheckUtils]: 10: Hoare triple {203#false} assume !(~i~0 < 100000); {203#false} is VALID [2018-11-23 12:02:36,955 INFO L273 TraceCheckUtils]: 11: Hoare triple {203#false} ~i~0 := 0; {203#false} is VALID [2018-11-23 12:02:36,955 INFO L273 TraceCheckUtils]: 12: Hoare triple {203#false} assume !(~i~0 < 100000); {203#false} is VALID [2018-11-23 12:02:36,955 INFO L273 TraceCheckUtils]: 13: Hoare triple {203#false} ~i~0 := 0; {203#false} is VALID [2018-11-23 12:02:36,956 INFO L273 TraceCheckUtils]: 14: Hoare triple {203#false} assume !(~i~0 < 100000); {203#false} is VALID [2018-11-23 12:02:36,956 INFO L273 TraceCheckUtils]: 15: Hoare triple {203#false} havoc ~x~0;~x~0 := 0; {203#false} is VALID [2018-11-23 12:02:36,956 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 12:02:36,956 INFO L256 TraceCheckUtils]: 17: Hoare triple {203#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {203#false} is VALID [2018-11-23 12:02:36,957 INFO L273 TraceCheckUtils]: 18: Hoare triple {203#false} ~cond := #in~cond; {203#false} is VALID [2018-11-23 12:02:36,957 INFO L273 TraceCheckUtils]: 19: Hoare triple {203#false} assume 0 == ~cond; {203#false} is VALID [2018-11-23 12:02:36,957 INFO L273 TraceCheckUtils]: 20: Hoare triple {203#false} assume !false; {203#false} is VALID [2018-11-23 12:02:36,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:36,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:02:36,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:02:36,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:02:36,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:36,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:02:36,996 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:36,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:02:36,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:02:36,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:02:36,997 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 3 states. [2018-11-23 12:02:37,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:37,499 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2018-11-23 12:02:37,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:02:37,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:02:37,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:37,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:02:37,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2018-11-23 12:02:37,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:02:37,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2018-11-23 12:02:37,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 64 transitions. [2018-11-23 12:02:37,652 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:37,654 INFO L225 Difference]: With dead ends: 50 [2018-11-23 12:02:37,654 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 12:02:37,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:02:37,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 12:02:37,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-23 12:02:37,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:37,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-23 12:02:37,705 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 12:02:37,705 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 12:02:37,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:37,707 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 12:02:37,707 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 12:02:37,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:37,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:37,709 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 12:02:37,709 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 12:02:37,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:37,712 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 12:02:37,712 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 12:02:37,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:37,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:37,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:37,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:37,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:02:37,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-11-23 12:02:37,716 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 21 [2018-11-23 12:02:37,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:37,718 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-23 12:02:37,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:02:37,718 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 12:02:37,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:02:37,719 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:37,720 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 12:02:37,720 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:37,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:37,720 INFO L82 PathProgramCache]: Analyzing trace with hash -927642988, now seen corresponding path program 1 times [2018-11-23 12:02:37,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:37,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:37,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:37,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:37,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:37,836 INFO L256 TraceCheckUtils]: 0: Hoare triple {391#true} call ULTIMATE.init(); {391#true} is VALID [2018-11-23 12:02:37,838 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 12:02:37,838 INFO L273 TraceCheckUtils]: 2: Hoare triple {391#true} assume true; {391#true} is VALID [2018-11-23 12:02:37,838 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {391#true} {391#true} #100#return; {391#true} is VALID [2018-11-23 12:02:37,838 INFO L256 TraceCheckUtils]: 4: Hoare triple {391#true} call #t~ret2 := main(); {391#true} is VALID [2018-11-23 12:02:37,846 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 12:02:37,848 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 12:02:37,850 INFO L273 TraceCheckUtils]: 7: Hoare triple {394#(<= main_~i~0 1)} assume !(~i~0 < 100000); {392#false} is VALID [2018-11-23 12:02:37,850 INFO L273 TraceCheckUtils]: 8: Hoare triple {392#false} ~i~0 := 0; {392#false} is VALID [2018-11-23 12:02:37,851 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 12:02:37,851 INFO L273 TraceCheckUtils]: 10: Hoare triple {392#false} assume !(~i~0 < 100000); {392#false} is VALID [2018-11-23 12:02:37,852 INFO L273 TraceCheckUtils]: 11: Hoare triple {392#false} ~i~0 := 0; {392#false} is VALID [2018-11-23 12:02:37,852 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 12:02:37,853 INFO L273 TraceCheckUtils]: 13: Hoare triple {392#false} assume !(~i~0 < 100000); {392#false} is VALID [2018-11-23 12:02:37,853 INFO L273 TraceCheckUtils]: 14: Hoare triple {392#false} ~i~0 := 0; {392#false} is VALID [2018-11-23 12:02:37,854 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 12:02:37,854 INFO L273 TraceCheckUtils]: 16: Hoare triple {392#false} assume !(~i~0 < 100000); {392#false} is VALID [2018-11-23 12:02:37,854 INFO L273 TraceCheckUtils]: 17: Hoare triple {392#false} ~i~0 := 0; {392#false} is VALID [2018-11-23 12:02:37,855 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 12:02:37,855 INFO L273 TraceCheckUtils]: 19: Hoare triple {392#false} assume !(~i~0 < 100000); {392#false} is VALID [2018-11-23 12:02:37,855 INFO L273 TraceCheckUtils]: 20: Hoare triple {392#false} havoc ~x~0;~x~0 := 0; {392#false} is VALID [2018-11-23 12:02:37,856 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 12:02:37,856 INFO L256 TraceCheckUtils]: 22: Hoare triple {392#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {392#false} is VALID [2018-11-23 12:02:37,856 INFO L273 TraceCheckUtils]: 23: Hoare triple {392#false} ~cond := #in~cond; {392#false} is VALID [2018-11-23 12:02:37,857 INFO L273 TraceCheckUtils]: 24: Hoare triple {392#false} assume 0 == ~cond; {392#false} is VALID [2018-11-23 12:02:37,857 INFO L273 TraceCheckUtils]: 25: Hoare triple {392#false} assume !false; {392#false} is VALID [2018-11-23 12:02:37,859 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 12:02:37,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:37,859 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:37,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:37,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:38,247 INFO L256 TraceCheckUtils]: 0: Hoare triple {391#true} call ULTIMATE.init(); {391#true} is VALID [2018-11-23 12:02:38,248 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 12:02:38,248 INFO L273 TraceCheckUtils]: 2: Hoare triple {391#true} assume true; {391#true} is VALID [2018-11-23 12:02:38,249 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {391#true} {391#true} #100#return; {391#true} is VALID [2018-11-23 12:02:38,249 INFO L256 TraceCheckUtils]: 4: Hoare triple {391#true} call #t~ret2 := main(); {391#true} is VALID [2018-11-23 12:02:38,250 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 12:02:38,252 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 12:02:38,254 INFO L273 TraceCheckUtils]: 7: Hoare triple {394#(<= main_~i~0 1)} assume !(~i~0 < 100000); {392#false} is VALID [2018-11-23 12:02:38,254 INFO L273 TraceCheckUtils]: 8: Hoare triple {392#false} ~i~0 := 0; {392#false} is VALID [2018-11-23 12:02:38,255 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 12:02:38,255 INFO L273 TraceCheckUtils]: 10: Hoare triple {392#false} assume !(~i~0 < 100000); {392#false} is VALID [2018-11-23 12:02:38,256 INFO L273 TraceCheckUtils]: 11: Hoare triple {392#false} ~i~0 := 0; {392#false} is VALID [2018-11-23 12:02:38,256 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 12:02:38,256 INFO L273 TraceCheckUtils]: 13: Hoare triple {392#false} assume !(~i~0 < 100000); {392#false} is VALID [2018-11-23 12:02:38,257 INFO L273 TraceCheckUtils]: 14: Hoare triple {392#false} ~i~0 := 0; {392#false} is VALID [2018-11-23 12:02:38,257 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 12:02:38,257 INFO L273 TraceCheckUtils]: 16: Hoare triple {392#false} assume !(~i~0 < 100000); {392#false} is VALID [2018-11-23 12:02:38,258 INFO L273 TraceCheckUtils]: 17: Hoare triple {392#false} ~i~0 := 0; {392#false} is VALID [2018-11-23 12:02:38,258 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 12:02:38,258 INFO L273 TraceCheckUtils]: 19: Hoare triple {392#false} assume !(~i~0 < 100000); {392#false} is VALID [2018-11-23 12:02:38,259 INFO L273 TraceCheckUtils]: 20: Hoare triple {392#false} havoc ~x~0;~x~0 := 0; {392#false} is VALID [2018-11-23 12:02:38,259 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 12:02:38,259 INFO L256 TraceCheckUtils]: 22: Hoare triple {392#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {392#false} is VALID [2018-11-23 12:02:38,260 INFO L273 TraceCheckUtils]: 23: Hoare triple {392#false} ~cond := #in~cond; {392#false} is VALID [2018-11-23 12:02:38,260 INFO L273 TraceCheckUtils]: 24: Hoare triple {392#false} assume 0 == ~cond; {392#false} is VALID [2018-11-23 12:02:38,260 INFO L273 TraceCheckUtils]: 25: Hoare triple {392#false} assume !false; {392#false} is VALID [2018-11-23 12:02:38,262 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 12:02:38,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:38,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:02:38,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-23 12:02:38,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:38,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:02:38,331 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:38,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:02:38,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:02:38,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:02:38,332 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 5 states. [2018-11-23 12:02:38,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:38,848 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2018-11-23 12:02:38,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:02:38,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-23 12:02:38,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:38,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:02:38,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2018-11-23 12:02:38,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:02:38,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2018-11-23 12:02:38,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 69 transitions. [2018-11-23 12:02:38,982 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:38,985 INFO L225 Difference]: With dead ends: 59 [2018-11-23 12:02:38,985 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 12:02:38,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:02:38,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 12:02:39,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 12:02:39,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:39,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2018-11-23 12:02:39,016 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-23 12:02:39,017 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-23 12:02:39,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:39,021 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2018-11-23 12:02:39,021 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-11-23 12:02:39,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:39,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:39,022 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-23 12:02:39,022 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-23 12:02:39,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:39,025 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2018-11-23 12:02:39,025 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-11-23 12:02:39,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:39,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:39,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:39,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:39,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:02:39,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-11-23 12:02:39,029 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 26 [2018-11-23 12:02:39,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:39,029 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-23 12:02:39,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:02:39,030 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-11-23 12:02:39,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:02:39,031 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:39,031 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 12:02:39,031 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:39,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:39,032 INFO L82 PathProgramCache]: Analyzing trace with hash -681366654, now seen corresponding path program 2 times [2018-11-23 12:02:39,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:39,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:39,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:39,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:39,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:39,185 INFO L256 TraceCheckUtils]: 0: Hoare triple {695#true} call ULTIMATE.init(); {695#true} is VALID [2018-11-23 12:02:39,185 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 12:02:39,186 INFO L273 TraceCheckUtils]: 2: Hoare triple {695#true} assume true; {695#true} is VALID [2018-11-23 12:02:39,186 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {695#true} {695#true} #100#return; {695#true} is VALID [2018-11-23 12:02:39,186 INFO L256 TraceCheckUtils]: 4: Hoare triple {695#true} call #t~ret2 := main(); {695#true} is VALID [2018-11-23 12:02:39,187 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 12:02:39,189 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 12:02:39,189 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 12:02:39,208 INFO L273 TraceCheckUtils]: 8: Hoare triple {699#(<= main_~i~0 2)} assume !(~i~0 < 100000); {696#false} is VALID [2018-11-23 12:02:39,208 INFO L273 TraceCheckUtils]: 9: Hoare triple {696#false} ~i~0 := 0; {696#false} is VALID [2018-11-23 12:02:39,209 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 12:02:39,209 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 12:02:39,209 INFO L273 TraceCheckUtils]: 12: Hoare triple {696#false} assume !(~i~0 < 100000); {696#false} is VALID [2018-11-23 12:02:39,211 INFO L273 TraceCheckUtils]: 13: Hoare triple {696#false} ~i~0 := 0; {696#false} is VALID [2018-11-23 12:02:39,211 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 12:02:39,211 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 12:02:39,212 INFO L273 TraceCheckUtils]: 16: Hoare triple {696#false} assume !(~i~0 < 100000); {696#false} is VALID [2018-11-23 12:02:39,212 INFO L273 TraceCheckUtils]: 17: Hoare triple {696#false} ~i~0 := 0; {696#false} is VALID [2018-11-23 12:02:39,212 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 12:02:39,213 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 12:02:39,214 INFO L273 TraceCheckUtils]: 20: Hoare triple {696#false} assume !(~i~0 < 100000); {696#false} is VALID [2018-11-23 12:02:39,214 INFO L273 TraceCheckUtils]: 21: Hoare triple {696#false} ~i~0 := 0; {696#false} is VALID [2018-11-23 12:02:39,214 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 12:02:39,215 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 12:02:39,216 INFO L273 TraceCheckUtils]: 24: Hoare triple {696#false} assume !(~i~0 < 100000); {696#false} is VALID [2018-11-23 12:02:39,216 INFO L273 TraceCheckUtils]: 25: Hoare triple {696#false} havoc ~x~0;~x~0 := 0; {696#false} is VALID [2018-11-23 12:02:39,216 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 12:02:39,217 INFO L256 TraceCheckUtils]: 27: Hoare triple {696#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {696#false} is VALID [2018-11-23 12:02:39,217 INFO L273 TraceCheckUtils]: 28: Hoare triple {696#false} ~cond := #in~cond; {696#false} is VALID [2018-11-23 12:02:39,217 INFO L273 TraceCheckUtils]: 29: Hoare triple {696#false} assume 0 == ~cond; {696#false} is VALID [2018-11-23 12:02:39,218 INFO L273 TraceCheckUtils]: 30: Hoare triple {696#false} assume !false; {696#false} is VALID [2018-11-23 12:02:39,226 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 12:02:39,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:39,226 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:39,245 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:02:39,272 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:02:39,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:39,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:39,385 INFO L256 TraceCheckUtils]: 0: Hoare triple {695#true} call ULTIMATE.init(); {695#true} is VALID [2018-11-23 12:02:39,386 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 12:02:39,386 INFO L273 TraceCheckUtils]: 2: Hoare triple {695#true} assume true; {695#true} is VALID [2018-11-23 12:02:39,387 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {695#true} {695#true} #100#return; {695#true} is VALID [2018-11-23 12:02:39,388 INFO L256 TraceCheckUtils]: 4: Hoare triple {695#true} call #t~ret2 := main(); {695#true} is VALID [2018-11-23 12:02:39,388 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 12:02:39,388 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 12:02:39,389 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 12:02:39,389 INFO L273 TraceCheckUtils]: 8: Hoare triple {695#true} assume !(~i~0 < 100000); {695#true} is VALID [2018-11-23 12:02:39,389 INFO L273 TraceCheckUtils]: 9: Hoare triple {695#true} ~i~0 := 0; {695#true} is VALID [2018-11-23 12:02:39,390 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 12:02:39,390 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 12:02:39,390 INFO L273 TraceCheckUtils]: 12: Hoare triple {695#true} assume !(~i~0 < 100000); {695#true} is VALID [2018-11-23 12:02:39,390 INFO L273 TraceCheckUtils]: 13: Hoare triple {695#true} ~i~0 := 0; {695#true} is VALID [2018-11-23 12:02:39,391 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 12:02:39,391 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 12:02:39,391 INFO L273 TraceCheckUtils]: 16: Hoare triple {695#true} assume !(~i~0 < 100000); {695#true} is VALID [2018-11-23 12:02:39,395 INFO L273 TraceCheckUtils]: 17: Hoare triple {695#true} ~i~0 := 0; {754#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:39,396 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 12:02:39,397 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 12:02:39,397 INFO L273 TraceCheckUtils]: 20: Hoare triple {699#(<= main_~i~0 2)} assume !(~i~0 < 100000); {696#false} is VALID [2018-11-23 12:02:39,397 INFO L273 TraceCheckUtils]: 21: Hoare triple {696#false} ~i~0 := 0; {696#false} is VALID [2018-11-23 12:02:39,398 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 12:02:39,398 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 12:02:39,398 INFO L273 TraceCheckUtils]: 24: Hoare triple {696#false} assume !(~i~0 < 100000); {696#false} is VALID [2018-11-23 12:02:39,398 INFO L273 TraceCheckUtils]: 25: Hoare triple {696#false} havoc ~x~0;~x~0 := 0; {696#false} is VALID [2018-11-23 12:02:39,399 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 12:02:39,399 INFO L256 TraceCheckUtils]: 27: Hoare triple {696#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {696#false} is VALID [2018-11-23 12:02:39,399 INFO L273 TraceCheckUtils]: 28: Hoare triple {696#false} ~cond := #in~cond; {696#false} is VALID [2018-11-23 12:02:39,399 INFO L273 TraceCheckUtils]: 29: Hoare triple {696#false} assume 0 == ~cond; {696#false} is VALID [2018-11-23 12:02:39,400 INFO L273 TraceCheckUtils]: 30: Hoare triple {696#false} assume !false; {696#false} is VALID [2018-11-23 12:02:39,401 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 12:02:39,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:39,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:02:39,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-23 12:02:39,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:39,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:02:39,486 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:39,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:02:39,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:02:39,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:02:39,487 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 6 states. [2018-11-23 12:02:39,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:39,743 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2018-11-23 12:02:39,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:02:39,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-23 12:02:39,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:39,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:02:39,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2018-11-23 12:02:39,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:02:39,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2018-11-23 12:02:39,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 74 transitions. [2018-11-23 12:02:39,845 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:39,847 INFO L225 Difference]: With dead ends: 68 [2018-11-23 12:02:39,847 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 12:02:39,848 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 12:02:39,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 12:02:39,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-23 12:02:39,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:39,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2018-11-23 12:02:39,956 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-23 12:02:39,956 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-23 12:02:39,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:39,958 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-23 12:02:39,959 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-23 12:02:39,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:39,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:39,960 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-23 12:02:39,960 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-23 12:02:39,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:39,963 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-23 12:02:39,963 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-23 12:02:39,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:39,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:39,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:39,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:39,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:02:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-11-23 12:02:39,967 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 31 [2018-11-23 12:02:39,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:39,967 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-11-23 12:02:39,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:02:39,967 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-23 12:02:39,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 12:02:39,968 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:39,969 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 12:02:39,969 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:39,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:39,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1000479276, now seen corresponding path program 3 times [2018-11-23 12:02:39,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:39,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:39,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:39,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:39,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:40,112 INFO L256 TraceCheckUtils]: 0: Hoare triple {1053#true} call ULTIMATE.init(); {1053#true} is VALID [2018-11-23 12:02:40,112 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 12:02:40,113 INFO L273 TraceCheckUtils]: 2: Hoare triple {1053#true} assume true; {1053#true} is VALID [2018-11-23 12:02:40,113 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1053#true} {1053#true} #100#return; {1053#true} is VALID [2018-11-23 12:02:40,113 INFO L256 TraceCheckUtils]: 4: Hoare triple {1053#true} call #t~ret2 := main(); {1053#true} is VALID [2018-11-23 12:02:40,113 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 12:02:40,115 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 12:02:40,115 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 12:02:40,118 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 12:02:40,118 INFO L273 TraceCheckUtils]: 9: Hoare triple {1058#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1054#false} is VALID [2018-11-23 12:02:40,118 INFO L273 TraceCheckUtils]: 10: Hoare triple {1054#false} ~i~0 := 0; {1054#false} is VALID [2018-11-23 12:02:40,119 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 12:02:40,119 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 12:02:40,119 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 12:02:40,119 INFO L273 TraceCheckUtils]: 14: Hoare triple {1054#false} assume !(~i~0 < 100000); {1054#false} is VALID [2018-11-23 12:02:40,119 INFO L273 TraceCheckUtils]: 15: Hoare triple {1054#false} ~i~0 := 0; {1054#false} is VALID [2018-11-23 12:02:40,120 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 12:02:40,120 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 12:02:40,120 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 12:02:40,120 INFO L273 TraceCheckUtils]: 19: Hoare triple {1054#false} assume !(~i~0 < 100000); {1054#false} is VALID [2018-11-23 12:02:40,121 INFO L273 TraceCheckUtils]: 20: Hoare triple {1054#false} ~i~0 := 0; {1054#false} is VALID [2018-11-23 12:02:40,121 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 12:02:40,121 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 12:02:40,121 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 12:02:40,121 INFO L273 TraceCheckUtils]: 24: Hoare triple {1054#false} assume !(~i~0 < 100000); {1054#false} is VALID [2018-11-23 12:02:40,122 INFO L273 TraceCheckUtils]: 25: Hoare triple {1054#false} ~i~0 := 0; {1054#false} is VALID [2018-11-23 12:02:40,122 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 12:02:40,122 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 12:02:40,122 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 12:02:40,122 INFO L273 TraceCheckUtils]: 29: Hoare triple {1054#false} assume !(~i~0 < 100000); {1054#false} is VALID [2018-11-23 12:02:40,123 INFO L273 TraceCheckUtils]: 30: Hoare triple {1054#false} havoc ~x~0;~x~0 := 0; {1054#false} is VALID [2018-11-23 12:02:40,123 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 12:02:40,123 INFO L256 TraceCheckUtils]: 32: Hoare triple {1054#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {1054#false} is VALID [2018-11-23 12:02:40,123 INFO L273 TraceCheckUtils]: 33: Hoare triple {1054#false} ~cond := #in~cond; {1054#false} is VALID [2018-11-23 12:02:40,124 INFO L273 TraceCheckUtils]: 34: Hoare triple {1054#false} assume 0 == ~cond; {1054#false} is VALID [2018-11-23 12:02:40,124 INFO L273 TraceCheckUtils]: 35: Hoare triple {1054#false} assume !false; {1054#false} is VALID [2018-11-23 12:02:40,126 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 12:02:40,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:40,127 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:40,146 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:02:40,190 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 12:02:40,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:40,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:40,306 INFO L256 TraceCheckUtils]: 0: Hoare triple {1053#true} call ULTIMATE.init(); {1053#true} is VALID [2018-11-23 12:02:40,307 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 12:02:40,307 INFO L273 TraceCheckUtils]: 2: Hoare triple {1053#true} assume true; {1053#true} is VALID [2018-11-23 12:02:40,308 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1053#true} {1053#true} #100#return; {1053#true} is VALID [2018-11-23 12:02:40,308 INFO L256 TraceCheckUtils]: 4: Hoare triple {1053#true} call #t~ret2 := main(); {1053#true} is VALID [2018-11-23 12:02:40,309 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 12:02:40,309 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 12:02:40,309 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 12:02:40,310 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 12:02:40,310 INFO L273 TraceCheckUtils]: 9: Hoare triple {1053#true} assume !(~i~0 < 100000); {1053#true} is VALID [2018-11-23 12:02:40,310 INFO L273 TraceCheckUtils]: 10: Hoare triple {1053#true} ~i~0 := 0; {1053#true} is VALID [2018-11-23 12:02:40,311 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 12:02:40,311 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 12:02:40,311 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 12:02:40,312 INFO L273 TraceCheckUtils]: 14: Hoare triple {1053#true} assume !(~i~0 < 100000); {1053#true} is VALID [2018-11-23 12:02:40,312 INFO L273 TraceCheckUtils]: 15: Hoare triple {1053#true} ~i~0 := 0; {1107#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:40,316 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 12:02:40,317 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 12:02:40,318 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 12:02:40,318 INFO L273 TraceCheckUtils]: 19: Hoare triple {1058#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1054#false} is VALID [2018-11-23 12:02:40,318 INFO L273 TraceCheckUtils]: 20: Hoare triple {1054#false} ~i~0 := 0; {1054#false} is VALID [2018-11-23 12:02:40,319 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 12:02:40,319 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 12:02:40,319 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 12:02:40,320 INFO L273 TraceCheckUtils]: 24: Hoare triple {1054#false} assume !(~i~0 < 100000); {1054#false} is VALID [2018-11-23 12:02:40,320 INFO L273 TraceCheckUtils]: 25: Hoare triple {1054#false} ~i~0 := 0; {1054#false} is VALID [2018-11-23 12:02:40,320 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 12:02:40,321 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 12:02:40,321 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 12:02:40,321 INFO L273 TraceCheckUtils]: 29: Hoare triple {1054#false} assume !(~i~0 < 100000); {1054#false} is VALID [2018-11-23 12:02:40,322 INFO L273 TraceCheckUtils]: 30: Hoare triple {1054#false} havoc ~x~0;~x~0 := 0; {1054#false} is VALID [2018-11-23 12:02:40,322 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 12:02:40,322 INFO L256 TraceCheckUtils]: 32: Hoare triple {1054#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {1054#false} is VALID [2018-11-23 12:02:40,322 INFO L273 TraceCheckUtils]: 33: Hoare triple {1054#false} ~cond := #in~cond; {1054#false} is VALID [2018-11-23 12:02:40,323 INFO L273 TraceCheckUtils]: 34: Hoare triple {1054#false} assume 0 == ~cond; {1054#false} is VALID [2018-11-23 12:02:40,323 INFO L273 TraceCheckUtils]: 35: Hoare triple {1054#false} assume !false; {1054#false} is VALID [2018-11-23 12:02:40,325 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 12:02:40,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:40,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 12:02:40,356 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-11-23 12:02:40,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:40,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:02:40,417 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:40,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:02:40,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:02:40,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:02:40,419 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 7 states. [2018-11-23 12:02:40,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:40,684 INFO L93 Difference]: Finished difference Result 77 states and 91 transitions. [2018-11-23 12:02:40,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:02:40,684 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-11-23 12:02:40,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:40,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:02:40,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2018-11-23 12:02:40,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:02:40,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2018-11-23 12:02:40,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 79 transitions. [2018-11-23 12:02:40,816 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:40,818 INFO L225 Difference]: With dead ends: 77 [2018-11-23 12:02:40,818 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 12:02:40,819 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 12:02:40,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 12:02:40,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-23 12:02:40,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:40,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2018-11-23 12:02:40,931 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 12:02:40,932 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 12:02:40,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:40,934 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-23 12:02:40,935 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-11-23 12:02:40,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:40,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:40,936 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 12:02:40,936 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 12:02:40,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:40,938 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-23 12:02:40,939 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-11-23 12:02:40,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:40,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:40,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:40,940 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:40,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:02:40,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-11-23 12:02:40,942 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 36 [2018-11-23 12:02:40,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:40,942 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-11-23 12:02:40,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:02:40,943 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-11-23 12:02:40,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 12:02:40,944 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:40,944 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 12:02:40,944 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:40,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:40,945 INFO L82 PathProgramCache]: Analyzing trace with hash 631314114, now seen corresponding path program 4 times [2018-11-23 12:02:40,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:40,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:40,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:40,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:40,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:41,093 INFO L256 TraceCheckUtils]: 0: Hoare triple {1465#true} call ULTIMATE.init(); {1465#true} is VALID [2018-11-23 12:02:41,093 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 12:02:41,093 INFO L273 TraceCheckUtils]: 2: Hoare triple {1465#true} assume true; {1465#true} is VALID [2018-11-23 12:02:41,093 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1465#true} {1465#true} #100#return; {1465#true} is VALID [2018-11-23 12:02:41,094 INFO L256 TraceCheckUtils]: 4: Hoare triple {1465#true} call #t~ret2 := main(); {1465#true} is VALID [2018-11-23 12:02:41,095 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 12:02:41,095 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 12:02:41,096 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 12:02:41,097 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 12:02:41,098 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 12:02:41,099 INFO L273 TraceCheckUtils]: 10: Hoare triple {1471#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1466#false} is VALID [2018-11-23 12:02:41,099 INFO L273 TraceCheckUtils]: 11: Hoare triple {1466#false} ~i~0 := 0; {1466#false} is VALID [2018-11-23 12:02:41,100 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 12:02:41,100 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 12:02:41,100 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 12:02:41,101 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 12:02:41,101 INFO L273 TraceCheckUtils]: 16: Hoare triple {1466#false} assume !(~i~0 < 100000); {1466#false} is VALID [2018-11-23 12:02:41,102 INFO L273 TraceCheckUtils]: 17: Hoare triple {1466#false} ~i~0 := 0; {1466#false} is VALID [2018-11-23 12:02:41,102 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 12:02:41,103 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 12:02:41,103 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 12:02:41,103 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 12:02:41,103 INFO L273 TraceCheckUtils]: 22: Hoare triple {1466#false} assume !(~i~0 < 100000); {1466#false} is VALID [2018-11-23 12:02:41,104 INFO L273 TraceCheckUtils]: 23: Hoare triple {1466#false} ~i~0 := 0; {1466#false} is VALID [2018-11-23 12:02:41,104 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 12:02:41,104 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 12:02:41,104 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 12:02:41,105 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 12:02:41,105 INFO L273 TraceCheckUtils]: 28: Hoare triple {1466#false} assume !(~i~0 < 100000); {1466#false} is VALID [2018-11-23 12:02:41,105 INFO L273 TraceCheckUtils]: 29: Hoare triple {1466#false} ~i~0 := 0; {1466#false} is VALID [2018-11-23 12:02:41,106 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 12:02:41,106 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 12:02:41,106 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 12:02:41,106 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 12:02:41,107 INFO L273 TraceCheckUtils]: 34: Hoare triple {1466#false} assume !(~i~0 < 100000); {1466#false} is VALID [2018-11-23 12:02:41,107 INFO L273 TraceCheckUtils]: 35: Hoare triple {1466#false} havoc ~x~0;~x~0 := 0; {1466#false} is VALID [2018-11-23 12:02:41,107 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 12:02:41,108 INFO L256 TraceCheckUtils]: 37: Hoare triple {1466#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {1466#false} is VALID [2018-11-23 12:02:41,108 INFO L273 TraceCheckUtils]: 38: Hoare triple {1466#false} ~cond := #in~cond; {1466#false} is VALID [2018-11-23 12:02:41,108 INFO L273 TraceCheckUtils]: 39: Hoare triple {1466#false} assume 0 == ~cond; {1466#false} is VALID [2018-11-23 12:02:41,108 INFO L273 TraceCheckUtils]: 40: Hoare triple {1466#false} assume !false; {1466#false} is VALID [2018-11-23 12:02:41,111 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 12:02:41,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:41,111 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:41,121 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:02:41,176 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:02:41,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:41,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:41,310 INFO L256 TraceCheckUtils]: 0: Hoare triple {1465#true} call ULTIMATE.init(); {1465#true} is VALID [2018-11-23 12:02:41,310 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 12:02:41,311 INFO L273 TraceCheckUtils]: 2: Hoare triple {1465#true} assume true; {1465#true} is VALID [2018-11-23 12:02:41,311 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1465#true} {1465#true} #100#return; {1465#true} is VALID [2018-11-23 12:02:41,311 INFO L256 TraceCheckUtils]: 4: Hoare triple {1465#true} call #t~ret2 := main(); {1465#true} is VALID [2018-11-23 12:02:41,312 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 12:02:41,313 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 12:02:41,314 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 12:02:41,315 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 12:02:41,316 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 12:02:41,317 INFO L273 TraceCheckUtils]: 10: Hoare triple {1471#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1466#false} is VALID [2018-11-23 12:02:41,317 INFO L273 TraceCheckUtils]: 11: Hoare triple {1466#false} ~i~0 := 0; {1466#false} is VALID [2018-11-23 12:02:41,317 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 12:02:41,318 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 12:02:41,318 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 12:02:41,318 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 12:02:41,319 INFO L273 TraceCheckUtils]: 16: Hoare triple {1466#false} assume !(~i~0 < 100000); {1466#false} is VALID [2018-11-23 12:02:41,319 INFO L273 TraceCheckUtils]: 17: Hoare triple {1466#false} ~i~0 := 0; {1466#false} is VALID [2018-11-23 12:02:41,319 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 12:02:41,320 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 12:02:41,320 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 12:02:41,320 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 12:02:41,321 INFO L273 TraceCheckUtils]: 22: Hoare triple {1466#false} assume !(~i~0 < 100000); {1466#false} is VALID [2018-11-23 12:02:41,321 INFO L273 TraceCheckUtils]: 23: Hoare triple {1466#false} ~i~0 := 0; {1466#false} is VALID [2018-11-23 12:02:41,321 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 12:02:41,322 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 12:02:41,322 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 12:02:41,322 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 12:02:41,323 INFO L273 TraceCheckUtils]: 28: Hoare triple {1466#false} assume !(~i~0 < 100000); {1466#false} is VALID [2018-11-23 12:02:41,323 INFO L273 TraceCheckUtils]: 29: Hoare triple {1466#false} ~i~0 := 0; {1466#false} is VALID [2018-11-23 12:02:41,323 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 12:02:41,323 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 12:02:41,324 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 12:02:41,324 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 12:02:41,324 INFO L273 TraceCheckUtils]: 34: Hoare triple {1466#false} assume !(~i~0 < 100000); {1466#false} is VALID [2018-11-23 12:02:41,324 INFO L273 TraceCheckUtils]: 35: Hoare triple {1466#false} havoc ~x~0;~x~0 := 0; {1466#false} is VALID [2018-11-23 12:02:41,325 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 12:02:41,325 INFO L256 TraceCheckUtils]: 37: Hoare triple {1466#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {1466#false} is VALID [2018-11-23 12:02:41,325 INFO L273 TraceCheckUtils]: 38: Hoare triple {1466#false} ~cond := #in~cond; {1466#false} is VALID [2018-11-23 12:02:41,325 INFO L273 TraceCheckUtils]: 39: Hoare triple {1466#false} assume 0 == ~cond; {1466#false} is VALID [2018-11-23 12:02:41,325 INFO L273 TraceCheckUtils]: 40: Hoare triple {1466#false} assume !false; {1466#false} is VALID [2018-11-23 12:02:41,328 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 12:02:41,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:41,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:02:41,348 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-11-23 12:02:41,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:41,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:02:41,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:41,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:02:41,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:02:41,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:02:41,389 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 8 states. [2018-11-23 12:02:42,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:42,026 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2018-11-23 12:02:42,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:02:42,026 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-11-23 12:02:42,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:42,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:02:42,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2018-11-23 12:02:42,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:02:42,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2018-11-23 12:02:42,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 84 transitions. [2018-11-23 12:02:42,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:42,160 INFO L225 Difference]: With dead ends: 86 [2018-11-23 12:02:42,161 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 12:02:42,162 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 12:02:42,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 12:02:42,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-23 12:02:42,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:42,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 51 states. [2018-11-23 12:02:42,206 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-23 12:02:42,206 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-23 12:02:42,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:42,209 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-23 12:02:42,210 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-11-23 12:02:42,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:42,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:42,211 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-23 12:02:42,211 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-23 12:02:42,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:42,213 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-23 12:02:42,213 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-11-23 12:02:42,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:42,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:42,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:42,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:42,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:02:42,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-11-23 12:02:42,216 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 41 [2018-11-23 12:02:42,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:42,217 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-11-23 12:02:42,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:02:42,217 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-11-23 12:02:42,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:02:42,218 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:42,218 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 12:02:42,219 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:42,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:42,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1809092332, now seen corresponding path program 5 times [2018-11-23 12:02:42,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:42,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:42,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:42,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:42,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:42,388 INFO L256 TraceCheckUtils]: 0: Hoare triple {1931#true} call ULTIMATE.init(); {1931#true} is VALID [2018-11-23 12:02:42,388 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 12:02:42,389 INFO L273 TraceCheckUtils]: 2: Hoare triple {1931#true} assume true; {1931#true} is VALID [2018-11-23 12:02:42,389 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1931#true} {1931#true} #100#return; {1931#true} is VALID [2018-11-23 12:02:42,390 INFO L256 TraceCheckUtils]: 4: Hoare triple {1931#true} call #t~ret2 := main(); {1931#true} is VALID [2018-11-23 12:02:42,390 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 12:02:42,391 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 12:02:42,392 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 12:02:42,393 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 12:02:42,393 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 12:02:42,394 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 12:02:42,395 INFO L273 TraceCheckUtils]: 11: Hoare triple {1938#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1932#false} is VALID [2018-11-23 12:02:42,395 INFO L273 TraceCheckUtils]: 12: Hoare triple {1932#false} ~i~0 := 0; {1932#false} is VALID [2018-11-23 12:02:42,395 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 12:02:42,396 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 12:02:42,396 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 12:02:42,397 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 12:02:42,397 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 12:02:42,398 INFO L273 TraceCheckUtils]: 18: Hoare triple {1932#false} assume !(~i~0 < 100000); {1932#false} is VALID [2018-11-23 12:02:42,398 INFO L273 TraceCheckUtils]: 19: Hoare triple {1932#false} ~i~0 := 0; {1932#false} is VALID [2018-11-23 12:02:42,398 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 12:02:42,398 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 12:02:42,399 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 12:02:42,399 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 12:02:42,399 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 12:02:42,399 INFO L273 TraceCheckUtils]: 25: Hoare triple {1932#false} assume !(~i~0 < 100000); {1932#false} is VALID [2018-11-23 12:02:42,400 INFO L273 TraceCheckUtils]: 26: Hoare triple {1932#false} ~i~0 := 0; {1932#false} is VALID [2018-11-23 12:02:42,400 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 12:02:42,400 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 12:02:42,400 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 12:02:42,400 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 12:02:42,401 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 12:02:42,401 INFO L273 TraceCheckUtils]: 32: Hoare triple {1932#false} assume !(~i~0 < 100000); {1932#false} is VALID [2018-11-23 12:02:42,401 INFO L273 TraceCheckUtils]: 33: Hoare triple {1932#false} ~i~0 := 0; {1932#false} is VALID [2018-11-23 12:02:42,401 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 12:02:42,402 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 12:02:42,402 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 12:02:42,402 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 12:02:42,403 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 12:02:42,403 INFO L273 TraceCheckUtils]: 39: Hoare triple {1932#false} assume !(~i~0 < 100000); {1932#false} is VALID [2018-11-23 12:02:42,403 INFO L273 TraceCheckUtils]: 40: Hoare triple {1932#false} havoc ~x~0;~x~0 := 0; {1932#false} is VALID [2018-11-23 12:02:42,403 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 12:02:42,404 INFO L256 TraceCheckUtils]: 42: Hoare triple {1932#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {1932#false} is VALID [2018-11-23 12:02:42,404 INFO L273 TraceCheckUtils]: 43: Hoare triple {1932#false} ~cond := #in~cond; {1932#false} is VALID [2018-11-23 12:02:42,404 INFO L273 TraceCheckUtils]: 44: Hoare triple {1932#false} assume 0 == ~cond; {1932#false} is VALID [2018-11-23 12:02:42,404 INFO L273 TraceCheckUtils]: 45: Hoare triple {1932#false} assume !false; {1932#false} is VALID [2018-11-23 12:02:42,407 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 12:02:42,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:42,408 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:42,430 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:02:43,844 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 12:02:43,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:43,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:44,085 INFO L256 TraceCheckUtils]: 0: Hoare triple {1931#true} call ULTIMATE.init(); {1931#true} is VALID [2018-11-23 12:02:44,085 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 12:02:44,086 INFO L273 TraceCheckUtils]: 2: Hoare triple {1931#true} assume true; {1931#true} is VALID [2018-11-23 12:02:44,086 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1931#true} {1931#true} #100#return; {1931#true} is VALID [2018-11-23 12:02:44,086 INFO L256 TraceCheckUtils]: 4: Hoare triple {1931#true} call #t~ret2 := main(); {1931#true} is VALID [2018-11-23 12:02:44,087 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 12:02:44,087 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 12:02:44,087 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 12:02:44,088 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 12:02:44,088 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 12:02:44,088 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 12:02:44,088 INFO L273 TraceCheckUtils]: 11: Hoare triple {1931#true} assume !(~i~0 < 100000); {1931#true} is VALID [2018-11-23 12:02:44,089 INFO L273 TraceCheckUtils]: 12: Hoare triple {1931#true} ~i~0 := 0; {1931#true} is VALID [2018-11-23 12:02:44,089 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 12:02:44,089 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 12:02:44,089 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 12:02:44,090 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 12:02:44,090 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 12:02:44,090 INFO L273 TraceCheckUtils]: 18: Hoare triple {1931#true} assume !(~i~0 < 100000); {1931#true} is VALID [2018-11-23 12:02:44,090 INFO L273 TraceCheckUtils]: 19: Hoare triple {1931#true} ~i~0 := 0; {1931#true} is VALID [2018-11-23 12:02:44,090 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 12:02:44,091 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 12:02:44,091 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 12:02:44,091 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 12:02:44,091 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 12:02:44,091 INFO L273 TraceCheckUtils]: 25: Hoare triple {1931#true} assume !(~i~0 < 100000); {1931#true} is VALID [2018-11-23 12:02:44,092 INFO L273 TraceCheckUtils]: 26: Hoare triple {1931#true} ~i~0 := 0; {1931#true} is VALID [2018-11-23 12:02:44,092 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 12:02:44,092 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 12:02:44,092 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 12:02:44,093 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 12:02:44,093 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 12:02:44,093 INFO L273 TraceCheckUtils]: 32: Hoare triple {1931#true} assume !(~i~0 < 100000); {1931#true} is VALID [2018-11-23 12:02:44,113 INFO L273 TraceCheckUtils]: 33: Hoare triple {1931#true} ~i~0 := 0; {2041#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:44,127 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 12:02:44,135 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 12:02:44,136 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 12:02:44,138 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 12:02:44,139 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 12:02:44,140 INFO L273 TraceCheckUtils]: 39: Hoare triple {1938#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1932#false} is VALID [2018-11-23 12:02:44,140 INFO L273 TraceCheckUtils]: 40: Hoare triple {1932#false} havoc ~x~0;~x~0 := 0; {1932#false} is VALID [2018-11-23 12:02:44,140 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 12:02:44,141 INFO L256 TraceCheckUtils]: 42: Hoare triple {1932#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {1932#false} is VALID [2018-11-23 12:02:44,141 INFO L273 TraceCheckUtils]: 43: Hoare triple {1932#false} ~cond := #in~cond; {1932#false} is VALID [2018-11-23 12:02:44,141 INFO L273 TraceCheckUtils]: 44: Hoare triple {1932#false} assume 0 == ~cond; {1932#false} is VALID [2018-11-23 12:02:44,142 INFO L273 TraceCheckUtils]: 45: Hoare triple {1932#false} assume !false; {1932#false} is VALID [2018-11-23 12:02:44,144 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 12:02:44,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:44,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 12:02:44,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2018-11-23 12:02:44,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:44,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:02:44,230 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:44,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:02:44,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:02:44,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:02:44,231 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 9 states. [2018-11-23 12:02:44,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:44,854 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2018-11-23 12:02:44,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:02:44,855 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2018-11-23 12:02:44,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:44,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:02:44,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2018-11-23 12:02:44,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:02:44,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2018-11-23 12:02:44,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 89 transitions. [2018-11-23 12:02:45,169 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:45,171 INFO L225 Difference]: With dead ends: 95 [2018-11-23 12:02:45,171 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 12:02:45,172 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 12:02:45,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 12:02:45,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-23 12:02:45,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:45,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 56 states. [2018-11-23 12:02:45,218 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-23 12:02:45,218 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-23 12:02:45,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:45,220 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2018-11-23 12:02:45,221 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-11-23 12:02:45,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:45,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:45,221 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-23 12:02:45,221 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-23 12:02:45,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:45,223 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2018-11-23 12:02:45,223 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-11-23 12:02:45,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:45,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:45,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:45,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:45,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 12:02:45,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-11-23 12:02:45,226 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 46 [2018-11-23 12:02:45,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:45,226 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-11-23 12:02:45,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:02:45,226 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-11-23 12:02:45,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 12:02:45,227 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:45,227 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 12:02:45,228 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:45,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:45,228 INFO L82 PathProgramCache]: Analyzing trace with hash 2091864578, now seen corresponding path program 6 times [2018-11-23 12:02:45,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:45,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:45,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:45,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:45,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:45,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:45,475 INFO L256 TraceCheckUtils]: 0: Hoare triple {2451#true} call ULTIMATE.init(); {2451#true} is VALID [2018-11-23 12:02:45,475 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 12:02:45,475 INFO L273 TraceCheckUtils]: 2: Hoare triple {2451#true} assume true; {2451#true} is VALID [2018-11-23 12:02:45,475 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2451#true} {2451#true} #100#return; {2451#true} is VALID [2018-11-23 12:02:45,476 INFO L256 TraceCheckUtils]: 4: Hoare triple {2451#true} call #t~ret2 := main(); {2451#true} is VALID [2018-11-23 12:02:45,477 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 12:02:45,477 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 12:02:45,478 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 12:02:45,478 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 12:02:45,479 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 12:02:45,480 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 12:02:45,481 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 12:02:45,481 INFO L273 TraceCheckUtils]: 12: Hoare triple {2459#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2452#false} is VALID [2018-11-23 12:02:45,482 INFO L273 TraceCheckUtils]: 13: Hoare triple {2452#false} ~i~0 := 0; {2452#false} is VALID [2018-11-23 12:02:45,482 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 12:02:45,482 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 12:02:45,482 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 12:02:45,483 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 12:02:45,483 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 12:02:45,483 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 12:02:45,483 INFO L273 TraceCheckUtils]: 20: Hoare triple {2452#false} assume !(~i~0 < 100000); {2452#false} is VALID [2018-11-23 12:02:45,484 INFO L273 TraceCheckUtils]: 21: Hoare triple {2452#false} ~i~0 := 0; {2452#false} is VALID [2018-11-23 12:02:45,484 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 12:02:45,484 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 12:02:45,484 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 12:02:45,485 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 12:02:45,485 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 12:02:45,485 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 12:02:45,485 INFO L273 TraceCheckUtils]: 28: Hoare triple {2452#false} assume !(~i~0 < 100000); {2452#false} is VALID [2018-11-23 12:02:45,486 INFO L273 TraceCheckUtils]: 29: Hoare triple {2452#false} ~i~0 := 0; {2452#false} is VALID [2018-11-23 12:02:45,486 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 12:02:45,486 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 12:02:45,486 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 12:02:45,487 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 12:02:45,487 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 12:02:45,487 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 12:02:45,487 INFO L273 TraceCheckUtils]: 36: Hoare triple {2452#false} assume !(~i~0 < 100000); {2452#false} is VALID [2018-11-23 12:02:45,487 INFO L273 TraceCheckUtils]: 37: Hoare triple {2452#false} ~i~0 := 0; {2452#false} is VALID [2018-11-23 12:02:45,488 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 12:02:45,488 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 12:02:45,488 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 12:02:45,488 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 12:02:45,488 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 12:02:45,489 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 12:02:45,489 INFO L273 TraceCheckUtils]: 44: Hoare triple {2452#false} assume !(~i~0 < 100000); {2452#false} is VALID [2018-11-23 12:02:45,489 INFO L273 TraceCheckUtils]: 45: Hoare triple {2452#false} havoc ~x~0;~x~0 := 0; {2452#false} is VALID [2018-11-23 12:02:45,489 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 12:02:45,489 INFO L256 TraceCheckUtils]: 47: Hoare triple {2452#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {2452#false} is VALID [2018-11-23 12:02:45,490 INFO L273 TraceCheckUtils]: 48: Hoare triple {2452#false} ~cond := #in~cond; {2452#false} is VALID [2018-11-23 12:02:45,490 INFO L273 TraceCheckUtils]: 49: Hoare triple {2452#false} assume 0 == ~cond; {2452#false} is VALID [2018-11-23 12:02:45,490 INFO L273 TraceCheckUtils]: 50: Hoare triple {2452#false} assume !false; {2452#false} is VALID [2018-11-23 12:02:45,491 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 12:02:45,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:45,492 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:45,503 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:02:46,117 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-23 12:02:46,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:46,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:46,322 INFO L256 TraceCheckUtils]: 0: Hoare triple {2451#true} call ULTIMATE.init(); {2451#true} is VALID [2018-11-23 12:02:46,322 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 12:02:46,323 INFO L273 TraceCheckUtils]: 2: Hoare triple {2451#true} assume true; {2451#true} is VALID [2018-11-23 12:02:46,323 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2451#true} {2451#true} #100#return; {2451#true} is VALID [2018-11-23 12:02:46,323 INFO L256 TraceCheckUtils]: 4: Hoare triple {2451#true} call #t~ret2 := main(); {2451#true} is VALID [2018-11-23 12:02:46,337 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 12:02:46,338 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 12:02:46,339 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 12:02:46,339 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 12:02:46,345 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 12:02:46,346 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 12:02:46,347 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 12:02:46,347 INFO L273 TraceCheckUtils]: 12: Hoare triple {2459#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2452#false} is VALID [2018-11-23 12:02:46,347 INFO L273 TraceCheckUtils]: 13: Hoare triple {2452#false} ~i~0 := 0; {2452#false} is VALID [2018-11-23 12:02:46,347 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 12:02:46,348 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 12:02:46,348 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 12:02:46,348 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 12:02:46,348 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 12:02:46,348 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 12:02:46,348 INFO L273 TraceCheckUtils]: 20: Hoare triple {2452#false} assume !(~i~0 < 100000); {2452#false} is VALID [2018-11-23 12:02:46,348 INFO L273 TraceCheckUtils]: 21: Hoare triple {2452#false} ~i~0 := 0; {2452#false} is VALID [2018-11-23 12:02:46,349 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 12:02:46,349 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 12:02:46,349 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 12:02:46,349 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 12:02:46,350 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 12:02:46,350 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 12:02:46,350 INFO L273 TraceCheckUtils]: 28: Hoare triple {2452#false} assume !(~i~0 < 100000); {2452#false} is VALID [2018-11-23 12:02:46,350 INFO L273 TraceCheckUtils]: 29: Hoare triple {2452#false} ~i~0 := 0; {2452#false} is VALID [2018-11-23 12:02:46,350 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 12:02:46,351 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 12:02:46,351 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 12:02:46,351 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 12:02:46,351 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 12:02:46,351 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 12:02:46,351 INFO L273 TraceCheckUtils]: 36: Hoare triple {2452#false} assume !(~i~0 < 100000); {2452#false} is VALID [2018-11-23 12:02:46,351 INFO L273 TraceCheckUtils]: 37: Hoare triple {2452#false} ~i~0 := 0; {2452#false} is VALID [2018-11-23 12:02:46,352 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 12:02:46,352 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 12:02:46,352 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 12:02:46,352 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 12:02:46,352 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 12:02:46,352 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 12:02:46,352 INFO L273 TraceCheckUtils]: 44: Hoare triple {2452#false} assume !(~i~0 < 100000); {2452#false} is VALID [2018-11-23 12:02:46,353 INFO L273 TraceCheckUtils]: 45: Hoare triple {2452#false} havoc ~x~0;~x~0 := 0; {2452#false} is VALID [2018-11-23 12:02:46,353 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 12:02:46,353 INFO L256 TraceCheckUtils]: 47: Hoare triple {2452#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {2452#false} is VALID [2018-11-23 12:02:46,353 INFO L273 TraceCheckUtils]: 48: Hoare triple {2452#false} ~cond := #in~cond; {2452#false} is VALID [2018-11-23 12:02:46,353 INFO L273 TraceCheckUtils]: 49: Hoare triple {2452#false} assume 0 == ~cond; {2452#false} is VALID [2018-11-23 12:02:46,353 INFO L273 TraceCheckUtils]: 50: Hoare triple {2452#false} assume !false; {2452#false} is VALID [2018-11-23 12:02:46,354 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 12:02:46,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:46,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 12:02:46,376 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2018-11-23 12:02:46,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:46,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:02:46,402 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:46,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:02:46,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:02:46,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:02:46,403 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 10 states. [2018-11-23 12:02:46,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:46,985 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2018-11-23 12:02:46,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:02:46,985 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2018-11-23 12:02:46,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:46,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:02:46,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2018-11-23 12:02:46,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:02:46,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2018-11-23 12:02:46,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 94 transitions. [2018-11-23 12:02:47,124 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:47,126 INFO L225 Difference]: With dead ends: 104 [2018-11-23 12:02:47,126 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 12:02:47,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:02:47,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 12:02:47,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-23 12:02:47,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:47,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 61 states. [2018-11-23 12:02:47,165 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2018-11-23 12:02:47,165 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2018-11-23 12:02:47,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:47,171 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2018-11-23 12:02:47,171 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-11-23 12:02:47,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:47,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:47,172 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2018-11-23 12:02:47,172 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2018-11-23 12:02:47,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:47,174 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2018-11-23 12:02:47,174 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-11-23 12:02:47,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:47,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:47,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:47,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:47,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 12:02:47,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-11-23 12:02:47,177 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 51 [2018-11-23 12:02:47,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:47,177 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-11-23 12:02:47,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:02:47,177 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-11-23 12:02:47,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 12:02:47,178 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:47,178 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 12:02:47,178 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:47,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:47,179 INFO L82 PathProgramCache]: Analyzing trace with hash -591532972, now seen corresponding path program 7 times [2018-11-23 12:02:47,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:47,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:47,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:47,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:47,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:47,396 INFO L256 TraceCheckUtils]: 0: Hoare triple {3025#true} call ULTIMATE.init(); {3025#true} is VALID [2018-11-23 12:02:47,396 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 12:02:47,397 INFO L273 TraceCheckUtils]: 2: Hoare triple {3025#true} assume true; {3025#true} is VALID [2018-11-23 12:02:47,397 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3025#true} {3025#true} #100#return; {3025#true} is VALID [2018-11-23 12:02:47,397 INFO L256 TraceCheckUtils]: 4: Hoare triple {3025#true} call #t~ret2 := main(); {3025#true} is VALID [2018-11-23 12:02:47,399 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 12:02:47,402 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 12:02:47,405 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 12:02:47,420 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 12:02:47,421 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 12:02:47,422 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 12:02:47,422 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 12:02:47,423 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 12:02:47,425 INFO L273 TraceCheckUtils]: 13: Hoare triple {3034#(<= main_~i~0 7)} assume !(~i~0 < 100000); {3026#false} is VALID [2018-11-23 12:02:47,425 INFO L273 TraceCheckUtils]: 14: Hoare triple {3026#false} ~i~0 := 0; {3026#false} is VALID [2018-11-23 12:02:47,425 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 12:02:47,425 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 12:02:47,426 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 12:02:47,426 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 12:02:47,426 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 12:02:47,426 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 12:02:47,426 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 12:02:47,426 INFO L273 TraceCheckUtils]: 22: Hoare triple {3026#false} assume !(~i~0 < 100000); {3026#false} is VALID [2018-11-23 12:02:47,426 INFO L273 TraceCheckUtils]: 23: Hoare triple {3026#false} ~i~0 := 0; {3026#false} is VALID [2018-11-23 12:02:47,426 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 12:02:47,427 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 12:02:47,427 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 12:02:47,427 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 12:02:47,427 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 12:02:47,427 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 12:02:47,427 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 12:02:47,427 INFO L273 TraceCheckUtils]: 31: Hoare triple {3026#false} assume !(~i~0 < 100000); {3026#false} is VALID [2018-11-23 12:02:47,427 INFO L273 TraceCheckUtils]: 32: Hoare triple {3026#false} ~i~0 := 0; {3026#false} is VALID [2018-11-23 12:02:47,428 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 12:02:47,428 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 12:02:47,428 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 12:02:47,428 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 12:02:47,428 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 12:02:47,428 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 12:02:47,428 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 12:02:47,428 INFO L273 TraceCheckUtils]: 40: Hoare triple {3026#false} assume !(~i~0 < 100000); {3026#false} is VALID [2018-11-23 12:02:47,428 INFO L273 TraceCheckUtils]: 41: Hoare triple {3026#false} ~i~0 := 0; {3026#false} is VALID [2018-11-23 12:02:47,429 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 12:02:47,429 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 12:02:47,429 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 12:02:47,429 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 12:02:47,429 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 12:02:47,429 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 12:02:47,429 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 12:02:47,429 INFO L273 TraceCheckUtils]: 49: Hoare triple {3026#false} assume !(~i~0 < 100000); {3026#false} is VALID [2018-11-23 12:02:47,430 INFO L273 TraceCheckUtils]: 50: Hoare triple {3026#false} havoc ~x~0;~x~0 := 0; {3026#false} is VALID [2018-11-23 12:02:47,430 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 12:02:47,430 INFO L256 TraceCheckUtils]: 52: Hoare triple {3026#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {3026#false} is VALID [2018-11-23 12:02:47,430 INFO L273 TraceCheckUtils]: 53: Hoare triple {3026#false} ~cond := #in~cond; {3026#false} is VALID [2018-11-23 12:02:47,430 INFO L273 TraceCheckUtils]: 54: Hoare triple {3026#false} assume 0 == ~cond; {3026#false} is VALID [2018-11-23 12:02:47,430 INFO L273 TraceCheckUtils]: 55: Hoare triple {3026#false} assume !false; {3026#false} is VALID [2018-11-23 12:02:47,432 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 12:02:47,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:47,432 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:47,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:47,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:47,828 INFO L256 TraceCheckUtils]: 0: Hoare triple {3025#true} call ULTIMATE.init(); {3025#true} is VALID [2018-11-23 12:02:47,829 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 12:02:47,829 INFO L273 TraceCheckUtils]: 2: Hoare triple {3025#true} assume true; {3025#true} is VALID [2018-11-23 12:02:47,829 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3025#true} {3025#true} #100#return; {3025#true} is VALID [2018-11-23 12:02:47,830 INFO L256 TraceCheckUtils]: 4: Hoare triple {3025#true} call #t~ret2 := main(); {3025#true} is VALID [2018-11-23 12:02:47,830 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 12:02:47,831 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 12:02:47,832 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 12:02:47,832 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 12:02:47,833 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 12:02:47,834 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 12:02:47,835 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 12:02:47,836 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 12:02:47,836 INFO L273 TraceCheckUtils]: 13: Hoare triple {3034#(<= main_~i~0 7)} assume !(~i~0 < 100000); {3026#false} is VALID [2018-11-23 12:02:47,837 INFO L273 TraceCheckUtils]: 14: Hoare triple {3026#false} ~i~0 := 0; {3026#false} is VALID [2018-11-23 12:02:47,837 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 12:02:47,837 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 12:02:47,837 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 12:02:47,838 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 12:02:47,838 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 12:02:47,838 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 12:02:47,838 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 12:02:47,838 INFO L273 TraceCheckUtils]: 22: Hoare triple {3026#false} assume !(~i~0 < 100000); {3026#false} is VALID [2018-11-23 12:02:47,839 INFO L273 TraceCheckUtils]: 23: Hoare triple {3026#false} ~i~0 := 0; {3026#false} is VALID [2018-11-23 12:02:47,839 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 12:02:47,839 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 12:02:47,839 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 12:02:47,839 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 12:02:47,839 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 12:02:47,840 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 12:02:47,840 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 12:02:47,840 INFO L273 TraceCheckUtils]: 31: Hoare triple {3026#false} assume !(~i~0 < 100000); {3026#false} is VALID [2018-11-23 12:02:47,840 INFO L273 TraceCheckUtils]: 32: Hoare triple {3026#false} ~i~0 := 0; {3026#false} is VALID [2018-11-23 12:02:47,840 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 12:02:47,840 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 12:02:47,840 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 12:02:47,840 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 12:02:47,841 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 12:02:47,841 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 12:02:47,841 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 12:02:47,841 INFO L273 TraceCheckUtils]: 40: Hoare triple {3026#false} assume !(~i~0 < 100000); {3026#false} is VALID [2018-11-23 12:02:47,841 INFO L273 TraceCheckUtils]: 41: Hoare triple {3026#false} ~i~0 := 0; {3026#false} is VALID [2018-11-23 12:02:47,841 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 12:02:47,841 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 12:02:47,841 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 12:02:47,842 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 12:02:47,842 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 12:02:47,842 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 12:02:47,842 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 12:02:47,842 INFO L273 TraceCheckUtils]: 49: Hoare triple {3026#false} assume !(~i~0 < 100000); {3026#false} is VALID [2018-11-23 12:02:47,842 INFO L273 TraceCheckUtils]: 50: Hoare triple {3026#false} havoc ~x~0;~x~0 := 0; {3026#false} is VALID [2018-11-23 12:02:47,842 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 12:02:47,842 INFO L256 TraceCheckUtils]: 52: Hoare triple {3026#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {3026#false} is VALID [2018-11-23 12:02:47,843 INFO L273 TraceCheckUtils]: 53: Hoare triple {3026#false} ~cond := #in~cond; {3026#false} is VALID [2018-11-23 12:02:47,843 INFO L273 TraceCheckUtils]: 54: Hoare triple {3026#false} assume 0 == ~cond; {3026#false} is VALID [2018-11-23 12:02:47,843 INFO L273 TraceCheckUtils]: 55: Hoare triple {3026#false} assume !false; {3026#false} is VALID [2018-11-23 12:02:47,844 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 12:02:47,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:47,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:02:47,864 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-23 12:02:47,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:47,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:02:47,892 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:47,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:02:47,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:02:47,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:02:47,893 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 11 states. [2018-11-23 12:02:48,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:48,484 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2018-11-23 12:02:48,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:02:48,485 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-23 12:02:48,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:48,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:02:48,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 99 transitions. [2018-11-23 12:02:48,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:02:48,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 99 transitions. [2018-11-23 12:02:48,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 99 transitions. [2018-11-23 12:02:48,586 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:48,588 INFO L225 Difference]: With dead ends: 113 [2018-11-23 12:02:48,588 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 12:02:48,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:02:48,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 12:02:48,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-23 12:02:48,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:48,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 66 states. [2018-11-23 12:02:48,637 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2018-11-23 12:02:48,637 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2018-11-23 12:02:48,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:48,640 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-11-23 12:02:48,640 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2018-11-23 12:02:48,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:48,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:48,641 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2018-11-23 12:02:48,641 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2018-11-23 12:02:48,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:48,642 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-11-23 12:02:48,642 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2018-11-23 12:02:48,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:48,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:48,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:48,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:48,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 12:02:48,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2018-11-23 12:02:48,645 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 56 [2018-11-23 12:02:48,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:48,645 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2018-11-23 12:02:48,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:02:48,645 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2018-11-23 12:02:48,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 12:02:48,646 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:48,646 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 12:02:48,646 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:48,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:48,647 INFO L82 PathProgramCache]: Analyzing trace with hash 642637122, now seen corresponding path program 8 times [2018-11-23 12:02:48,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:48,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:48,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:48,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:48,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:48,874 INFO L256 TraceCheckUtils]: 0: Hoare triple {3653#true} call ULTIMATE.init(); {3653#true} is VALID [2018-11-23 12:02:48,875 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 12:02:48,875 INFO L273 TraceCheckUtils]: 2: Hoare triple {3653#true} assume true; {3653#true} is VALID [2018-11-23 12:02:48,875 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3653#true} {3653#true} #100#return; {3653#true} is VALID [2018-11-23 12:02:48,875 INFO L256 TraceCheckUtils]: 4: Hoare triple {3653#true} call #t~ret2 := main(); {3653#true} is VALID [2018-11-23 12:02:48,876 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 12:02:48,877 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 12:02:48,878 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 12:02:48,879 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 12:02:48,880 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 12:02:48,881 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 12:02:48,882 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 12:02:48,883 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 12:02:48,884 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 12:02:48,884 INFO L273 TraceCheckUtils]: 14: Hoare triple {3663#(<= main_~i~0 8)} assume !(~i~0 < 100000); {3654#false} is VALID [2018-11-23 12:02:48,885 INFO L273 TraceCheckUtils]: 15: Hoare triple {3654#false} ~i~0 := 0; {3654#false} is VALID [2018-11-23 12:02:48,885 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 12:02:48,885 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 12:02:48,885 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 12:02:48,886 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 12:02:48,886 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 12:02:48,886 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 12:02:48,886 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 12:02:48,887 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 12:02:48,887 INFO L273 TraceCheckUtils]: 24: Hoare triple {3654#false} assume !(~i~0 < 100000); {3654#false} is VALID [2018-11-23 12:02:48,887 INFO L273 TraceCheckUtils]: 25: Hoare triple {3654#false} ~i~0 := 0; {3654#false} is VALID [2018-11-23 12:02:48,887 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 12:02:48,888 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 12:02:48,888 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 12:02:48,888 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 12:02:48,888 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 12:02:48,888 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 12:02:48,889 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 12:02:48,889 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 12:02:48,889 INFO L273 TraceCheckUtils]: 34: Hoare triple {3654#false} assume !(~i~0 < 100000); {3654#false} is VALID [2018-11-23 12:02:48,889 INFO L273 TraceCheckUtils]: 35: Hoare triple {3654#false} ~i~0 := 0; {3654#false} is VALID [2018-11-23 12:02:48,889 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 12:02:48,890 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 12:02:48,890 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 12:02:48,890 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 12:02:48,890 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 12:02:48,890 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 12:02:48,890 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 12:02:48,891 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 12:02:48,891 INFO L273 TraceCheckUtils]: 44: Hoare triple {3654#false} assume !(~i~0 < 100000); {3654#false} is VALID [2018-11-23 12:02:48,891 INFO L273 TraceCheckUtils]: 45: Hoare triple {3654#false} ~i~0 := 0; {3654#false} is VALID [2018-11-23 12:02:48,891 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 12:02:48,891 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 12:02:48,892 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 12:02:48,892 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 12:02:48,892 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 12:02:48,892 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 12:02:48,892 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 12:02:48,892 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 12:02:48,893 INFO L273 TraceCheckUtils]: 54: Hoare triple {3654#false} assume !(~i~0 < 100000); {3654#false} is VALID [2018-11-23 12:02:48,893 INFO L273 TraceCheckUtils]: 55: Hoare triple {3654#false} havoc ~x~0;~x~0 := 0; {3654#false} is VALID [2018-11-23 12:02:48,893 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 12:02:48,893 INFO L256 TraceCheckUtils]: 57: Hoare triple {3654#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {3654#false} is VALID [2018-11-23 12:02:48,893 INFO L273 TraceCheckUtils]: 58: Hoare triple {3654#false} ~cond := #in~cond; {3654#false} is VALID [2018-11-23 12:02:48,893 INFO L273 TraceCheckUtils]: 59: Hoare triple {3654#false} assume 0 == ~cond; {3654#false} is VALID [2018-11-23 12:02:48,894 INFO L273 TraceCheckUtils]: 60: Hoare triple {3654#false} assume !false; {3654#false} is VALID [2018-11-23 12:02:48,896 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 12:02:48,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:48,896 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:48,919 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:02:48,968 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:02:48,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:49,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:49,116 INFO L256 TraceCheckUtils]: 0: Hoare triple {3653#true} call ULTIMATE.init(); {3653#true} is VALID [2018-11-23 12:02:49,117 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 12:02:49,117 INFO L273 TraceCheckUtils]: 2: Hoare triple {3653#true} assume true; {3653#true} is VALID [2018-11-23 12:02:49,117 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3653#true} {3653#true} #100#return; {3653#true} is VALID [2018-11-23 12:02:49,117 INFO L256 TraceCheckUtils]: 4: Hoare triple {3653#true} call #t~ret2 := main(); {3653#true} is VALID [2018-11-23 12:02:49,123 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 12:02:49,123 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 12:02:49,124 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 12:02:49,125 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 12:02:49,126 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 12:02:49,127 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 12:02:49,128 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 12:02:49,129 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 12:02:49,130 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 12:02:49,131 INFO L273 TraceCheckUtils]: 14: Hoare triple {3663#(<= main_~i~0 8)} assume !(~i~0 < 100000); {3654#false} is VALID [2018-11-23 12:02:49,131 INFO L273 TraceCheckUtils]: 15: Hoare triple {3654#false} ~i~0 := 0; {3654#false} is VALID [2018-11-23 12:02:49,131 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 12:02:49,131 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 12:02:49,131 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 12:02:49,132 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 12:02:49,132 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 12:02:49,132 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 12:02:49,132 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 12:02:49,132 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 12:02:49,133 INFO L273 TraceCheckUtils]: 24: Hoare triple {3654#false} assume !(~i~0 < 100000); {3654#false} is VALID [2018-11-23 12:02:49,133 INFO L273 TraceCheckUtils]: 25: Hoare triple {3654#false} ~i~0 := 0; {3654#false} is VALID [2018-11-23 12:02:49,133 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 12:02:49,133 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 12:02:49,133 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 12:02:49,134 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 12:02:49,134 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 12:02:49,134 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 12:02:49,134 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 12:02:49,134 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 12:02:49,135 INFO L273 TraceCheckUtils]: 34: Hoare triple {3654#false} assume !(~i~0 < 100000); {3654#false} is VALID [2018-11-23 12:02:49,135 INFO L273 TraceCheckUtils]: 35: Hoare triple {3654#false} ~i~0 := 0; {3654#false} is VALID [2018-11-23 12:02:49,135 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 12:02:49,135 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 12:02:49,135 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 12:02:49,136 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 12:02:49,136 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 12:02:49,136 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 12:02:49,136 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 12:02:49,136 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 12:02:49,136 INFO L273 TraceCheckUtils]: 44: Hoare triple {3654#false} assume !(~i~0 < 100000); {3654#false} is VALID [2018-11-23 12:02:49,136 INFO L273 TraceCheckUtils]: 45: Hoare triple {3654#false} ~i~0 := 0; {3654#false} is VALID [2018-11-23 12:02:49,136 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 12:02:49,137 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 12:02:49,137 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 12:02:49,137 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 12:02:49,137 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 12:02:49,137 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 12:02:49,137 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 12:02:49,137 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 12:02:49,137 INFO L273 TraceCheckUtils]: 54: Hoare triple {3654#false} assume !(~i~0 < 100000); {3654#false} is VALID [2018-11-23 12:02:49,138 INFO L273 TraceCheckUtils]: 55: Hoare triple {3654#false} havoc ~x~0;~x~0 := 0; {3654#false} is VALID [2018-11-23 12:02:49,138 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 12:02:49,138 INFO L256 TraceCheckUtils]: 57: Hoare triple {3654#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {3654#false} is VALID [2018-11-23 12:02:49,138 INFO L273 TraceCheckUtils]: 58: Hoare triple {3654#false} ~cond := #in~cond; {3654#false} is VALID [2018-11-23 12:02:49,138 INFO L273 TraceCheckUtils]: 59: Hoare triple {3654#false} assume 0 == ~cond; {3654#false} is VALID [2018-11-23 12:02:49,138 INFO L273 TraceCheckUtils]: 60: Hoare triple {3654#false} assume !false; {3654#false} is VALID [2018-11-23 12:02:49,140 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 12:02:49,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:49,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:02:49,160 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2018-11-23 12:02:49,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:49,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:02:49,192 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 12:02:49,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:02:49,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:02:49,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:02:49,194 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 12 states. [2018-11-23 12:02:49,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:49,696 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2018-11-23 12:02:49,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:02:49,696 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2018-11-23 12:02:49,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:49,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:02:49,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 104 transitions. [2018-11-23 12:02:49,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:02:49,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 104 transitions. [2018-11-23 12:02:49,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 104 transitions. [2018-11-23 12:02:49,807 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:49,809 INFO L225 Difference]: With dead ends: 122 [2018-11-23 12:02:49,809 INFO L226 Difference]: Without dead ends: 71 [2018-11-23 12:02:49,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:02:49,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-23 12:02:49,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-11-23 12:02:49,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:49,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 71 states. [2018-11-23 12:02:49,890 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 71 states. [2018-11-23 12:02:49,890 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 71 states. [2018-11-23 12:02:49,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:49,891 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-11-23 12:02:49,892 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2018-11-23 12:02:49,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:49,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:49,892 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 71 states. [2018-11-23 12:02:49,892 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 71 states. [2018-11-23 12:02:49,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:49,894 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-11-23 12:02:49,894 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2018-11-23 12:02:49,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:49,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:49,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:49,895 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:49,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 12:02:49,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2018-11-23 12:02:49,897 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 61 [2018-11-23 12:02:49,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:49,897 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2018-11-23 12:02:49,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:02:49,897 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2018-11-23 12:02:49,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 12:02:49,898 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:49,898 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 12:02:49,898 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:49,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:49,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1682614380, now seen corresponding path program 9 times [2018-11-23 12:02:49,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:49,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:49,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:49,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:49,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:50,499 INFO L256 TraceCheckUtils]: 0: Hoare triple {4335#true} call ULTIMATE.init(); {4335#true} is VALID [2018-11-23 12:02:50,500 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 12:02:50,500 INFO L273 TraceCheckUtils]: 2: Hoare triple {4335#true} assume true; {4335#true} is VALID [2018-11-23 12:02:50,500 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4335#true} {4335#true} #100#return; {4335#true} is VALID [2018-11-23 12:02:50,501 INFO L256 TraceCheckUtils]: 4: Hoare triple {4335#true} call #t~ret2 := main(); {4335#true} is VALID [2018-11-23 12:02:50,501 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 12:02:50,502 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 12:02:50,502 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 12:02:50,503 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 12:02:50,503 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 12:02:50,504 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 12:02:50,505 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 12:02:50,506 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 12:02:50,506 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 12:02:50,507 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 12:02:50,508 INFO L273 TraceCheckUtils]: 15: Hoare triple {4346#(<= main_~i~0 9)} assume !(~i~0 < 100000); {4336#false} is VALID [2018-11-23 12:02:50,508 INFO L273 TraceCheckUtils]: 16: Hoare triple {4336#false} ~i~0 := 0; {4336#false} is VALID [2018-11-23 12:02:50,508 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 12:02:50,509 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 12:02:50,509 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 12:02:50,509 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 12:02:50,509 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 12:02:50,509 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 12:02:50,510 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 12:02:50,510 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 12:02:50,510 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 12:02:50,510 INFO L273 TraceCheckUtils]: 26: Hoare triple {4336#false} assume !(~i~0 < 100000); {4336#false} is VALID [2018-11-23 12:02:50,510 INFO L273 TraceCheckUtils]: 27: Hoare triple {4336#false} ~i~0 := 0; {4336#false} is VALID [2018-11-23 12:02:50,510 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 12:02:50,511 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 12:02:50,511 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 12:02:50,511 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 12:02:50,511 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 12:02:50,511 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 12:02:50,511 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 12:02:50,512 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 12:02:50,512 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 12:02:50,512 INFO L273 TraceCheckUtils]: 37: Hoare triple {4336#false} assume !(~i~0 < 100000); {4336#false} is VALID [2018-11-23 12:02:50,512 INFO L273 TraceCheckUtils]: 38: Hoare triple {4336#false} ~i~0 := 0; {4336#false} is VALID [2018-11-23 12:02:50,512 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 12:02:50,512 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 12:02:50,513 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 12:02:50,513 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 12:02:50,513 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 12:02:50,513 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 12:02:50,513 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 12:02:50,513 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 12:02:50,514 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 12:02:50,514 INFO L273 TraceCheckUtils]: 48: Hoare triple {4336#false} assume !(~i~0 < 100000); {4336#false} is VALID [2018-11-23 12:02:50,514 INFO L273 TraceCheckUtils]: 49: Hoare triple {4336#false} ~i~0 := 0; {4336#false} is VALID [2018-11-23 12:02:50,514 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 12:02:50,514 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 12:02:50,514 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 12:02:50,515 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 12:02:50,515 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 12:02:50,515 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 12:02:50,515 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 12:02:50,515 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 12:02:50,515 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 12:02:50,516 INFO L273 TraceCheckUtils]: 59: Hoare triple {4336#false} assume !(~i~0 < 100000); {4336#false} is VALID [2018-11-23 12:02:50,516 INFO L273 TraceCheckUtils]: 60: Hoare triple {4336#false} havoc ~x~0;~x~0 := 0; {4336#false} is VALID [2018-11-23 12:02:50,516 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 12:02:50,516 INFO L256 TraceCheckUtils]: 62: Hoare triple {4336#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {4336#false} is VALID [2018-11-23 12:02:50,516 INFO L273 TraceCheckUtils]: 63: Hoare triple {4336#false} ~cond := #in~cond; {4336#false} is VALID [2018-11-23 12:02:50,517 INFO L273 TraceCheckUtils]: 64: Hoare triple {4336#false} assume 0 == ~cond; {4336#false} is VALID [2018-11-23 12:02:50,517 INFO L273 TraceCheckUtils]: 65: Hoare triple {4336#false} assume !false; {4336#false} is VALID [2018-11-23 12:02:50,519 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 12:02:50,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:50,520 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:50,538 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:02:57,166 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:02:57,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:57,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:57,310 INFO L256 TraceCheckUtils]: 0: Hoare triple {4335#true} call ULTIMATE.init(); {4335#true} is VALID [2018-11-23 12:02:57,310 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 12:02:57,310 INFO L273 TraceCheckUtils]: 2: Hoare triple {4335#true} assume true; {4335#true} is VALID [2018-11-23 12:02:57,311 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4335#true} {4335#true} #100#return; {4335#true} is VALID [2018-11-23 12:02:57,311 INFO L256 TraceCheckUtils]: 4: Hoare triple {4335#true} call #t~ret2 := main(); {4335#true} is VALID [2018-11-23 12:02:57,311 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 12:02:57,312 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 12:02:57,312 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 12:02:57,312 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 12:02:57,312 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 12:02:57,312 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 12:02:57,313 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 12:02:57,313 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 12:02:57,313 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 12:02:57,313 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 12:02:57,313 INFO L273 TraceCheckUtils]: 15: Hoare triple {4335#true} assume !(~i~0 < 100000); {4335#true} is VALID [2018-11-23 12:02:57,314 INFO L273 TraceCheckUtils]: 16: Hoare triple {4335#true} ~i~0 := 0; {4335#true} is VALID [2018-11-23 12:02:57,314 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 12:02:57,314 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 12:02:57,314 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 12:02:57,315 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 12:02:57,315 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 12:02:57,315 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 12:02:57,315 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 12:02:57,316 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 12:02:57,316 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 12:02:57,316 INFO L273 TraceCheckUtils]: 26: Hoare triple {4335#true} assume !(~i~0 < 100000); {4335#true} is VALID [2018-11-23 12:02:57,333 INFO L273 TraceCheckUtils]: 27: Hoare triple {4335#true} ~i~0 := 0; {4431#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:57,346 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 12:02:57,347 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 12:02:57,348 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 12:02:57,348 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 12:02:57,365 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 12:02:57,380 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 12:02:57,389 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 12:02:57,390 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 12:02:57,391 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 12:02:57,392 INFO L273 TraceCheckUtils]: 37: Hoare triple {4346#(<= main_~i~0 9)} assume !(~i~0 < 100000); {4336#false} is VALID [2018-11-23 12:02:57,392 INFO L273 TraceCheckUtils]: 38: Hoare triple {4336#false} ~i~0 := 0; {4336#false} is VALID [2018-11-23 12:02:57,392 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 12:02:57,392 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 12:02:57,392 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 12:02:57,392 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 12:02:57,392 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 12:02:57,393 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 12:02:57,393 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 12:02:57,393 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 12:02:57,393 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 12:02:57,393 INFO L273 TraceCheckUtils]: 48: Hoare triple {4336#false} assume !(~i~0 < 100000); {4336#false} is VALID [2018-11-23 12:02:57,393 INFO L273 TraceCheckUtils]: 49: Hoare triple {4336#false} ~i~0 := 0; {4336#false} is VALID [2018-11-23 12:02:57,394 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 12:02:57,394 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 12:02:57,394 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 12:02:57,394 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 12:02:57,394 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 12:02:57,394 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 12:02:57,394 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 12:02:57,395 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 12:02:57,395 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 12:02:57,395 INFO L273 TraceCheckUtils]: 59: Hoare triple {4336#false} assume !(~i~0 < 100000); {4336#false} is VALID [2018-11-23 12:02:57,395 INFO L273 TraceCheckUtils]: 60: Hoare triple {4336#false} havoc ~x~0;~x~0 := 0; {4336#false} is VALID [2018-11-23 12:02:57,395 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 12:02:57,395 INFO L256 TraceCheckUtils]: 62: Hoare triple {4336#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {4336#false} is VALID [2018-11-23 12:02:57,396 INFO L273 TraceCheckUtils]: 63: Hoare triple {4336#false} ~cond := #in~cond; {4336#false} is VALID [2018-11-23 12:02:57,396 INFO L273 TraceCheckUtils]: 64: Hoare triple {4336#false} assume 0 == ~cond; {4336#false} is VALID [2018-11-23 12:02:57,396 INFO L273 TraceCheckUtils]: 65: Hoare triple {4336#false} assume !false; {4336#false} is VALID [2018-11-23 12:02:57,400 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 12:02:57,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:57,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 12:02:57,423 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2018-11-23 12:02:57,424 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:57,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:02:57,478 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 12:02:57,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:02:57,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:02:57,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:02:57,479 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 13 states. [2018-11-23 12:02:58,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:58,006 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2018-11-23 12:02:58,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:02:58,007 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2018-11-23 12:02:58,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:58,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:02:58,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 109 transitions. [2018-11-23 12:02:58,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:02:58,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 109 transitions. [2018-11-23 12:02:58,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 109 transitions. [2018-11-23 12:02:58,175 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:58,177 INFO L225 Difference]: With dead ends: 131 [2018-11-23 12:02:58,177 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 12:02:58,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:02:58,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 12:02:58,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-11-23 12:02:58,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:58,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 76 states. [2018-11-23 12:02:58,256 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2018-11-23 12:02:58,256 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2018-11-23 12:02:58,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:58,259 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2018-11-23 12:02:58,259 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-11-23 12:02:58,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:58,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:58,259 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2018-11-23 12:02:58,259 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2018-11-23 12:02:58,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:58,261 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2018-11-23 12:02:58,261 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-11-23 12:02:58,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:58,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:58,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:58,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:58,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 12:02:58,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2018-11-23 12:02:58,264 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 66 [2018-11-23 12:02:58,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:58,264 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2018-11-23 12:02:58,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:02:58,264 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-11-23 12:02:58,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 12:02:58,265 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:58,265 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 12:02:58,265 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:58,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:58,266 INFO L82 PathProgramCache]: Analyzing trace with hash 591181954, now seen corresponding path program 10 times [2018-11-23 12:02:58,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:58,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:58,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:58,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:58,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:58,996 INFO L256 TraceCheckUtils]: 0: Hoare triple {5071#true} call ULTIMATE.init(); {5071#true} is VALID [2018-11-23 12:02:58,997 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 12:02:58,997 INFO L273 TraceCheckUtils]: 2: Hoare triple {5071#true} assume true; {5071#true} is VALID [2018-11-23 12:02:58,997 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5071#true} {5071#true} #100#return; {5071#true} is VALID [2018-11-23 12:02:58,997 INFO L256 TraceCheckUtils]: 4: Hoare triple {5071#true} call #t~ret2 := main(); {5071#true} is VALID [2018-11-23 12:02:58,998 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 12:02:58,999 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 12:02:58,999 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 12:02:59,000 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 12:02:59,000 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 12:02:59,001 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 12:02:59,001 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 12:02:59,002 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 12:02:59,003 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 12:02:59,004 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 12:02:59,005 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 12:02:59,006 INFO L273 TraceCheckUtils]: 16: Hoare triple {5083#(<= main_~i~0 10)} assume !(~i~0 < 100000); {5072#false} is VALID [2018-11-23 12:02:59,006 INFO L273 TraceCheckUtils]: 17: Hoare triple {5072#false} ~i~0 := 0; {5072#false} is VALID [2018-11-23 12:02:59,006 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 12:02:59,006 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 12:02:59,006 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 12:02:59,007 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 12:02:59,007 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 12:02:59,007 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 12:02:59,007 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 12:02:59,007 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 12:02:59,008 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 12:02:59,008 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 12:02:59,008 INFO L273 TraceCheckUtils]: 28: Hoare triple {5072#false} assume !(~i~0 < 100000); {5072#false} is VALID [2018-11-23 12:02:59,008 INFO L273 TraceCheckUtils]: 29: Hoare triple {5072#false} ~i~0 := 0; {5072#false} is VALID [2018-11-23 12:02:59,008 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 12:02:59,009 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 12:02:59,009 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 12:02:59,009 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 12:02:59,009 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 12:02:59,009 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 12:02:59,009 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 12:02:59,010 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 12:02:59,010 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 12:02:59,010 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 12:02:59,010 INFO L273 TraceCheckUtils]: 40: Hoare triple {5072#false} assume !(~i~0 < 100000); {5072#false} is VALID [2018-11-23 12:02:59,010 INFO L273 TraceCheckUtils]: 41: Hoare triple {5072#false} ~i~0 := 0; {5072#false} is VALID [2018-11-23 12:02:59,010 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 12:02:59,011 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 12:02:59,011 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 12:02:59,011 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 12:02:59,011 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 12:02:59,011 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 12:02:59,011 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 12:02:59,012 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 12:02:59,012 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 12:02:59,012 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 12:02:59,012 INFO L273 TraceCheckUtils]: 52: Hoare triple {5072#false} assume !(~i~0 < 100000); {5072#false} is VALID [2018-11-23 12:02:59,012 INFO L273 TraceCheckUtils]: 53: Hoare triple {5072#false} ~i~0 := 0; {5072#false} is VALID [2018-11-23 12:02:59,012 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 12:02:59,013 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 12:02:59,013 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 12:02:59,013 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 12:02:59,013 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 12:02:59,013 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 12:02:59,013 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 12:02:59,014 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 12:02:59,014 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 12:02:59,014 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 12:02:59,014 INFO L273 TraceCheckUtils]: 64: Hoare triple {5072#false} assume !(~i~0 < 100000); {5072#false} is VALID [2018-11-23 12:02:59,014 INFO L273 TraceCheckUtils]: 65: Hoare triple {5072#false} havoc ~x~0;~x~0 := 0; {5072#false} is VALID [2018-11-23 12:02:59,014 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 12:02:59,015 INFO L256 TraceCheckUtils]: 67: Hoare triple {5072#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {5072#false} is VALID [2018-11-23 12:02:59,015 INFO L273 TraceCheckUtils]: 68: Hoare triple {5072#false} ~cond := #in~cond; {5072#false} is VALID [2018-11-23 12:02:59,015 INFO L273 TraceCheckUtils]: 69: Hoare triple {5072#false} assume 0 == ~cond; {5072#false} is VALID [2018-11-23 12:02:59,015 INFO L273 TraceCheckUtils]: 70: Hoare triple {5072#false} assume !false; {5072#false} is VALID [2018-11-23 12:02:59,018 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 12:02:59,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:59,018 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:59,030 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:02:59,072 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:02:59,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:59,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:59,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:59,217 INFO L256 TraceCheckUtils]: 0: Hoare triple {5071#true} call ULTIMATE.init(); {5071#true} is VALID [2018-11-23 12:02:59,217 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 12:02:59,218 INFO L273 TraceCheckUtils]: 2: Hoare triple {5071#true} assume true; {5071#true} is VALID [2018-11-23 12:02:59,218 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5071#true} {5071#true} #100#return; {5071#true} is VALID [2018-11-23 12:02:59,218 INFO L256 TraceCheckUtils]: 4: Hoare triple {5071#true} call #t~ret2 := main(); {5071#true} is VALID [2018-11-23 12:02:59,219 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 12:02:59,219 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 12:02:59,220 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 12:02:59,220 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 12:02:59,221 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 12:02:59,222 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 12:02:59,223 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 12:02:59,224 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 12:02:59,225 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 12:02:59,226 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 12:02:59,227 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 12:02:59,227 INFO L273 TraceCheckUtils]: 16: Hoare triple {5083#(<= main_~i~0 10)} assume !(~i~0 < 100000); {5072#false} is VALID [2018-11-23 12:02:59,227 INFO L273 TraceCheckUtils]: 17: Hoare triple {5072#false} ~i~0 := 0; {5072#false} is VALID [2018-11-23 12:02:59,228 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 12:02:59,228 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 12:02:59,228 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 12:02:59,228 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 12:02:59,228 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 12:02:59,229 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 12:02:59,229 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 12:02:59,229 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 12:02:59,229 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 12:02:59,229 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 12:02:59,230 INFO L273 TraceCheckUtils]: 28: Hoare triple {5072#false} assume !(~i~0 < 100000); {5072#false} is VALID [2018-11-23 12:02:59,230 INFO L273 TraceCheckUtils]: 29: Hoare triple {5072#false} ~i~0 := 0; {5072#false} is VALID [2018-11-23 12:02:59,230 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 12:02:59,230 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 12:02:59,230 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 12:02:59,230 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 12:02:59,231 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 12:02:59,231 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 12:02:59,231 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 12:02:59,231 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 12:02:59,231 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 12:02:59,232 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 12:02:59,232 INFO L273 TraceCheckUtils]: 40: Hoare triple {5072#false} assume !(~i~0 < 100000); {5072#false} is VALID [2018-11-23 12:02:59,232 INFO L273 TraceCheckUtils]: 41: Hoare triple {5072#false} ~i~0 := 0; {5072#false} is VALID [2018-11-23 12:02:59,232 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 12:02:59,232 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 12:02:59,232 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 12:02:59,232 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 12:02:59,232 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 12:02:59,233 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 12:02:59,233 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 12:02:59,233 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 12:02:59,233 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 12:02:59,233 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 12:02:59,233 INFO L273 TraceCheckUtils]: 52: Hoare triple {5072#false} assume !(~i~0 < 100000); {5072#false} is VALID [2018-11-23 12:02:59,233 INFO L273 TraceCheckUtils]: 53: Hoare triple {5072#false} ~i~0 := 0; {5072#false} is VALID [2018-11-23 12:02:59,233 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 12:02:59,234 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 12:02:59,234 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 12:02:59,234 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 12:02:59,234 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 12:02:59,234 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 12:02:59,234 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 12:02:59,234 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 12:02:59,234 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 12:02:59,234 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 12:02:59,235 INFO L273 TraceCheckUtils]: 64: Hoare triple {5072#false} assume !(~i~0 < 100000); {5072#false} is VALID [2018-11-23 12:02:59,235 INFO L273 TraceCheckUtils]: 65: Hoare triple {5072#false} havoc ~x~0;~x~0 := 0; {5072#false} is VALID [2018-11-23 12:02:59,235 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 12:02:59,235 INFO L256 TraceCheckUtils]: 67: Hoare triple {5072#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {5072#false} is VALID [2018-11-23 12:02:59,235 INFO L273 TraceCheckUtils]: 68: Hoare triple {5072#false} ~cond := #in~cond; {5072#false} is VALID [2018-11-23 12:02:59,235 INFO L273 TraceCheckUtils]: 69: Hoare triple {5072#false} assume 0 == ~cond; {5072#false} is VALID [2018-11-23 12:02:59,235 INFO L273 TraceCheckUtils]: 70: Hoare triple {5072#false} assume !false; {5072#false} is VALID [2018-11-23 12:02:59,238 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 12:02:59,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:59,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 12:02:59,258 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-11-23 12:02:59,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:59,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:02:59,288 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:59,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:02:59,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:02:59,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:02:59,289 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 14 states. [2018-11-23 12:02:59,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:59,943 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2018-11-23 12:02:59,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:02:59,943 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-11-23 12:02:59,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:59,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:02:59,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 114 transitions. [2018-11-23 12:02:59,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:02:59,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 114 transitions. [2018-11-23 12:02:59,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 114 transitions. [2018-11-23 12:03:00,817 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 12:03:00,820 INFO L225 Difference]: With dead ends: 140 [2018-11-23 12:03:00,820 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 12:03:00,821 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 12:03:00,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 12:03:00,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-11-23 12:03:00,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:00,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 81 states. [2018-11-23 12:03:00,874 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2018-11-23 12:03:00,874 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2018-11-23 12:03:00,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:00,876 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-11-23 12:03:00,876 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2018-11-23 12:03:00,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:00,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:00,877 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2018-11-23 12:03:00,877 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2018-11-23 12:03:00,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:00,878 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-11-23 12:03:00,878 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2018-11-23 12:03:00,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:00,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:00,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:00,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:00,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 12:03:00,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2018-11-23 12:03:00,881 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 71 [2018-11-23 12:03:00,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:00,881 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2018-11-23 12:03:00,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:03:00,881 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2018-11-23 12:03:00,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 12:03:00,882 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:00,882 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 12:03:00,882 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:00,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:00,883 INFO L82 PathProgramCache]: Analyzing trace with hash 665957076, now seen corresponding path program 11 times [2018-11-23 12:03:00,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:00,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:00,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:00,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:00,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:01,479 INFO L256 TraceCheckUtils]: 0: Hoare triple {5861#true} call ULTIMATE.init(); {5861#true} is VALID [2018-11-23 12:03:01,480 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 12:03:01,480 INFO L273 TraceCheckUtils]: 2: Hoare triple {5861#true} assume true; {5861#true} is VALID [2018-11-23 12:03:01,480 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5861#true} {5861#true} #100#return; {5861#true} is VALID [2018-11-23 12:03:01,481 INFO L256 TraceCheckUtils]: 4: Hoare triple {5861#true} call #t~ret2 := main(); {5861#true} is VALID [2018-11-23 12:03:01,481 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 12:03:01,482 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 12:03:01,483 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 12:03:01,484 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 12:03:01,484 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 12:03:01,485 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 12:03:01,486 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 12:03:01,487 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 12:03:01,488 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 12:03:01,489 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 12:03:01,490 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 12:03:01,491 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 12:03:01,492 INFO L273 TraceCheckUtils]: 17: Hoare triple {5874#(<= main_~i~0 11)} assume !(~i~0 < 100000); {5862#false} is VALID [2018-11-23 12:03:01,492 INFO L273 TraceCheckUtils]: 18: Hoare triple {5862#false} ~i~0 := 0; {5862#false} is VALID [2018-11-23 12:03:01,492 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 12:03:01,492 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 12:03:01,493 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 12:03:01,493 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 12:03:01,493 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 12:03:01,493 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 12:03:01,493 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 12:03:01,494 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 12:03:01,494 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 12:03:01,494 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 12:03:01,494 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 12:03:01,494 INFO L273 TraceCheckUtils]: 30: Hoare triple {5862#false} assume !(~i~0 < 100000); {5862#false} is VALID [2018-11-23 12:03:01,495 INFO L273 TraceCheckUtils]: 31: Hoare triple {5862#false} ~i~0 := 0; {5862#false} is VALID [2018-11-23 12:03:01,495 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 12:03:01,495 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 12:03:01,495 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 12:03:01,495 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 12:03:01,496 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 12:03:01,496 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 12:03:01,496 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 12:03:01,496 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 12:03:01,496 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 12:03:01,497 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 12:03:01,497 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 12:03:01,497 INFO L273 TraceCheckUtils]: 43: Hoare triple {5862#false} assume !(~i~0 < 100000); {5862#false} is VALID [2018-11-23 12:03:01,497 INFO L273 TraceCheckUtils]: 44: Hoare triple {5862#false} ~i~0 := 0; {5862#false} is VALID [2018-11-23 12:03:01,497 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 12:03:01,497 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 12:03:01,497 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 12:03:01,498 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 12:03:01,498 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 12:03:01,498 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 12:03:01,498 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 12:03:01,498 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 12:03:01,498 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 12:03:01,498 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 12:03:01,498 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 12:03:01,499 INFO L273 TraceCheckUtils]: 56: Hoare triple {5862#false} assume !(~i~0 < 100000); {5862#false} is VALID [2018-11-23 12:03:01,499 INFO L273 TraceCheckUtils]: 57: Hoare triple {5862#false} ~i~0 := 0; {5862#false} is VALID [2018-11-23 12:03:01,499 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 12:03:01,499 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 12:03:01,499 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 12:03:01,499 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 12:03:01,499 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 12:03:01,499 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 12:03:01,499 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 12:03:01,500 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 12:03:01,500 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 12:03:01,500 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 12:03:01,500 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 12:03:01,500 INFO L273 TraceCheckUtils]: 69: Hoare triple {5862#false} assume !(~i~0 < 100000); {5862#false} is VALID [2018-11-23 12:03:01,500 INFO L273 TraceCheckUtils]: 70: Hoare triple {5862#false} havoc ~x~0;~x~0 := 0; {5862#false} is VALID [2018-11-23 12:03:01,500 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 12:03:01,500 INFO L256 TraceCheckUtils]: 72: Hoare triple {5862#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {5862#false} is VALID [2018-11-23 12:03:01,501 INFO L273 TraceCheckUtils]: 73: Hoare triple {5862#false} ~cond := #in~cond; {5862#false} is VALID [2018-11-23 12:03:01,501 INFO L273 TraceCheckUtils]: 74: Hoare triple {5862#false} assume 0 == ~cond; {5862#false} is VALID [2018-11-23 12:03:01,501 INFO L273 TraceCheckUtils]: 75: Hoare triple {5862#false} assume !false; {5862#false} is VALID [2018-11-23 12:03:01,504 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 12:03:01,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:01,504 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:01,519 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:03:40,539 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 12:03:40,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:40,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:40,724 INFO L256 TraceCheckUtils]: 0: Hoare triple {5861#true} call ULTIMATE.init(); {5861#true} is VALID [2018-11-23 12:03:40,724 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 12:03:40,724 INFO L273 TraceCheckUtils]: 2: Hoare triple {5861#true} assume true; {5861#true} is VALID [2018-11-23 12:03:40,724 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5861#true} {5861#true} #100#return; {5861#true} is VALID [2018-11-23 12:03:40,725 INFO L256 TraceCheckUtils]: 4: Hoare triple {5861#true} call #t~ret2 := main(); {5861#true} is VALID [2018-11-23 12:03:40,725 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 12:03:40,726 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 12:03:40,727 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 12:03:40,727 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 12:03:40,728 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 12:03:40,728 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 12:03:40,729 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 12:03:40,730 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 12:03:40,731 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 12:03:40,732 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 12:03:40,733 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 12:03:40,734 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 12:03:40,735 INFO L273 TraceCheckUtils]: 17: Hoare triple {5874#(<= main_~i~0 11)} assume !(~i~0 < 100000); {5862#false} is VALID [2018-11-23 12:03:40,735 INFO L273 TraceCheckUtils]: 18: Hoare triple {5862#false} ~i~0 := 0; {5862#false} is VALID [2018-11-23 12:03:40,735 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 12:03:40,735 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 12:03:40,735 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 12:03:40,736 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 12:03:40,736 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 12:03:40,736 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 12:03:40,736 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 12:03:40,737 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 12:03:40,737 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 12:03:40,737 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 12:03:40,737 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 12:03:40,737 INFO L273 TraceCheckUtils]: 30: Hoare triple {5862#false} assume !(~i~0 < 100000); {5862#false} is VALID [2018-11-23 12:03:40,738 INFO L273 TraceCheckUtils]: 31: Hoare triple {5862#false} ~i~0 := 0; {5862#false} is VALID [2018-11-23 12:03:40,738 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 12:03:40,738 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 12:03:40,738 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 12:03:40,738 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 12:03:40,739 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 12:03:40,739 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 12:03:40,739 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 12:03:40,739 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 12:03:40,739 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 12:03:40,739 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 12:03:40,740 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 12:03:40,740 INFO L273 TraceCheckUtils]: 43: Hoare triple {5862#false} assume !(~i~0 < 100000); {5862#false} is VALID [2018-11-23 12:03:40,740 INFO L273 TraceCheckUtils]: 44: Hoare triple {5862#false} ~i~0 := 0; {5862#false} is VALID [2018-11-23 12:03:40,740 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 12:03:40,740 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 12:03:40,740 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 12:03:40,740 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 12:03:40,740 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 12:03:40,740 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 12:03:40,741 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 12:03:40,741 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 12:03:40,741 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 12:03:40,741 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 12:03:40,741 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 12:03:40,741 INFO L273 TraceCheckUtils]: 56: Hoare triple {5862#false} assume !(~i~0 < 100000); {5862#false} is VALID [2018-11-23 12:03:40,741 INFO L273 TraceCheckUtils]: 57: Hoare triple {5862#false} ~i~0 := 0; {5862#false} is VALID [2018-11-23 12:03:40,741 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 12:03:40,742 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 12:03:40,742 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 12:03:40,742 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 12:03:40,742 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 12:03:40,742 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 12:03:40,742 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 12:03:40,742 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 12:03:40,742 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 12:03:40,742 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 12:03:40,743 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 12:03:40,743 INFO L273 TraceCheckUtils]: 69: Hoare triple {5862#false} assume !(~i~0 < 100000); {5862#false} is VALID [2018-11-23 12:03:40,743 INFO L273 TraceCheckUtils]: 70: Hoare triple {5862#false} havoc ~x~0;~x~0 := 0; {5862#false} is VALID [2018-11-23 12:03:40,743 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 12:03:40,743 INFO L256 TraceCheckUtils]: 72: Hoare triple {5862#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {5862#false} is VALID [2018-11-23 12:03:40,743 INFO L273 TraceCheckUtils]: 73: Hoare triple {5862#false} ~cond := #in~cond; {5862#false} is VALID [2018-11-23 12:03:40,743 INFO L273 TraceCheckUtils]: 74: Hoare triple {5862#false} assume 0 == ~cond; {5862#false} is VALID [2018-11-23 12:03:40,743 INFO L273 TraceCheckUtils]: 75: Hoare triple {5862#false} assume !false; {5862#false} is VALID [2018-11-23 12:03:40,746 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 12:03:40,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:40,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 12:03:40,775 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 76 [2018-11-23 12:03:40,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:40,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:03:40,804 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:40,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:03:40,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:03:40,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:03:40,805 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand 15 states. [2018-11-23 12:03:41,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:41,569 INFO L93 Difference]: Finished difference Result 149 states and 163 transitions. [2018-11-23 12:03:41,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:03:41,569 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 76 [2018-11-23 12:03:41,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:41,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:03:41,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 119 transitions. [2018-11-23 12:03:41,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:03:41,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 119 transitions. [2018-11-23 12:03:41,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 119 transitions. [2018-11-23 12:03:42,169 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 12:03:42,171 INFO L225 Difference]: With dead ends: 149 [2018-11-23 12:03:42,171 INFO L226 Difference]: Without dead ends: 86 [2018-11-23 12:03:42,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:03:42,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-23 12:03:42,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-23 12:03:42,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:42,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 86 states. [2018-11-23 12:03:42,280 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 86 states. [2018-11-23 12:03:42,280 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 86 states. [2018-11-23 12:03:42,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:42,283 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-11-23 12:03:42,283 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-11-23 12:03:42,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:42,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:42,284 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 86 states. [2018-11-23 12:03:42,284 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 86 states. [2018-11-23 12:03:42,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:42,286 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-11-23 12:03:42,286 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-11-23 12:03:42,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:42,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:42,287 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:42,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:42,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 12:03:42,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-11-23 12:03:42,288 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 76 [2018-11-23 12:03:42,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:42,289 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-11-23 12:03:42,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:03:42,289 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-11-23 12:03:42,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 12:03:42,290 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:42,290 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 12:03:42,290 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:42,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:42,291 INFO L82 PathProgramCache]: Analyzing trace with hash 725345218, now seen corresponding path program 12 times [2018-11-23 12:03:42,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:42,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:42,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:42,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:42,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:42,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:42,579 INFO L256 TraceCheckUtils]: 0: Hoare triple {6705#true} call ULTIMATE.init(); {6705#true} is VALID [2018-11-23 12:03:42,580 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 12:03:42,580 INFO L273 TraceCheckUtils]: 2: Hoare triple {6705#true} assume true; {6705#true} is VALID [2018-11-23 12:03:42,580 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6705#true} {6705#true} #100#return; {6705#true} is VALID [2018-11-23 12:03:42,580 INFO L256 TraceCheckUtils]: 4: Hoare triple {6705#true} call #t~ret2 := main(); {6705#true} is VALID [2018-11-23 12:03:42,581 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 12:03:42,582 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 12:03:42,582 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 12:03:42,583 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 12:03:42,583 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 12:03:42,584 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 12:03:42,584 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 12:03:42,585 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 12:03:42,586 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 12:03:42,587 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 12:03:42,588 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 12:03:42,589 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 12:03:42,590 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 12:03:42,591 INFO L273 TraceCheckUtils]: 18: Hoare triple {6719#(<= main_~i~0 12)} assume !(~i~0 < 100000); {6706#false} is VALID [2018-11-23 12:03:42,591 INFO L273 TraceCheckUtils]: 19: Hoare triple {6706#false} ~i~0 := 0; {6706#false} is VALID [2018-11-23 12:03:42,591 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 12:03:42,591 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 12:03:42,592 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 12:03:42,592 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 12:03:42,592 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 12:03:42,592 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 12:03:42,592 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 12:03:42,593 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 12:03:42,593 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 12:03:42,593 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 12:03:42,593 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 12:03:42,593 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 12:03:42,594 INFO L273 TraceCheckUtils]: 32: Hoare triple {6706#false} assume !(~i~0 < 100000); {6706#false} is VALID [2018-11-23 12:03:42,594 INFO L273 TraceCheckUtils]: 33: Hoare triple {6706#false} ~i~0 := 0; {6706#false} is VALID [2018-11-23 12:03:42,594 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 12:03:42,594 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 12:03:42,595 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 12:03:42,595 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 12:03:42,595 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 12:03:42,595 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 12:03:42,595 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 12:03:42,595 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 12:03:42,595 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 12:03:42,595 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 12:03:42,596 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 12:03:42,596 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 12:03:42,596 INFO L273 TraceCheckUtils]: 46: Hoare triple {6706#false} assume !(~i~0 < 100000); {6706#false} is VALID [2018-11-23 12:03:42,596 INFO L273 TraceCheckUtils]: 47: Hoare triple {6706#false} ~i~0 := 0; {6706#false} is VALID [2018-11-23 12:03:42,596 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 12:03:42,596 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 12:03:42,596 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 12:03:42,596 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 12:03:42,596 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 12:03:42,597 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 12:03:42,597 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 12:03:42,597 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 12:03:42,597 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 12:03:42,597 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 12:03:42,597 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 12:03:42,597 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 12:03:42,597 INFO L273 TraceCheckUtils]: 60: Hoare triple {6706#false} assume !(~i~0 < 100000); {6706#false} is VALID [2018-11-23 12:03:42,598 INFO L273 TraceCheckUtils]: 61: Hoare triple {6706#false} ~i~0 := 0; {6706#false} is VALID [2018-11-23 12:03:42,598 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 12:03:42,598 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 12:03:42,598 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 12:03:42,598 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 12:03:42,598 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 12:03:42,598 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 12:03:42,598 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 12:03:42,598 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 12:03:42,599 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 12:03:42,599 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 12:03:42,599 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 12:03:42,599 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 12:03:42,599 INFO L273 TraceCheckUtils]: 74: Hoare triple {6706#false} assume !(~i~0 < 100000); {6706#false} is VALID [2018-11-23 12:03:42,599 INFO L273 TraceCheckUtils]: 75: Hoare triple {6706#false} havoc ~x~0;~x~0 := 0; {6706#false} is VALID [2018-11-23 12:03:42,599 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 12:03:42,599 INFO L256 TraceCheckUtils]: 77: Hoare triple {6706#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {6706#false} is VALID [2018-11-23 12:03:42,600 INFO L273 TraceCheckUtils]: 78: Hoare triple {6706#false} ~cond := #in~cond; {6706#false} is VALID [2018-11-23 12:03:42,600 INFO L273 TraceCheckUtils]: 79: Hoare triple {6706#false} assume 0 == ~cond; {6706#false} is VALID [2018-11-23 12:03:42,600 INFO L273 TraceCheckUtils]: 80: Hoare triple {6706#false} assume !false; {6706#false} is VALID [2018-11-23 12:03:42,602 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 12:03:42,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:42,603 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:42,611 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:04:09,211 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 12:04:09,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:04:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:09,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:04:09,615 INFO L256 TraceCheckUtils]: 0: Hoare triple {6705#true} call ULTIMATE.init(); {6705#true} is VALID [2018-11-23 12:04:09,615 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 12:04:09,615 INFO L273 TraceCheckUtils]: 2: Hoare triple {6705#true} assume true; {6705#true} is VALID [2018-11-23 12:04:09,616 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6705#true} {6705#true} #100#return; {6705#true} is VALID [2018-11-23 12:04:09,616 INFO L256 TraceCheckUtils]: 4: Hoare triple {6705#true} call #t~ret2 := main(); {6705#true} is VALID [2018-11-23 12:04:09,616 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 12:04:09,616 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 12:04:09,616 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 12:04:09,617 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 12:04:09,617 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 12:04:09,617 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 12:04:09,617 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 12:04:09,617 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 12:04:09,618 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 12:04:09,618 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 12:04:09,618 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 12:04:09,618 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 12:04:09,619 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 12:04:09,619 INFO L273 TraceCheckUtils]: 18: Hoare triple {6774#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {6705#true} is VALID [2018-11-23 12:04:09,619 INFO L273 TraceCheckUtils]: 19: Hoare triple {6705#true} ~i~0 := 0; {6705#true} is VALID [2018-11-23 12:04:09,619 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 12:04:09,619 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 12:04:09,619 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 12:04:09,619 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 12:04:09,620 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 12:04:09,620 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 12:04:09,620 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 12:04:09,620 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 12:04:09,620 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 12:04:09,620 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 12:04:09,620 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 12:04:09,621 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 12:04:09,621 INFO L273 TraceCheckUtils]: 32: Hoare triple {6774#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {6705#true} is VALID [2018-11-23 12:04:09,621 INFO L273 TraceCheckUtils]: 33: Hoare triple {6705#true} ~i~0 := 0; {6705#true} is VALID [2018-11-23 12:04:09,621 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 12:04:09,621 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 12:04:09,622 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 12:04:09,622 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 12:04:09,622 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 12:04:09,622 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 12:04:09,622 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 12:04:09,622 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 12:04:09,623 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 12:04:09,623 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 12:04:09,623 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 12:04:09,623 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 12:04:09,623 INFO L273 TraceCheckUtils]: 46: Hoare triple {6705#true} assume !(~i~0 < 100000); {6705#true} is VALID [2018-11-23 12:04:09,624 INFO L273 TraceCheckUtils]: 47: Hoare triple {6705#true} ~i~0 := 0; {6705#true} is VALID [2018-11-23 12:04:09,624 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 12:04:09,624 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 12:04:09,624 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 12:04:09,625 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 12:04:09,625 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 12:04:09,625 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 12:04:09,625 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 12:04:09,625 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 12:04:09,625 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 12:04:09,625 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 12:04:09,625 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 12:04:09,626 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; {6774#(<= main_~i~0 100000)} is VALID [2018-11-23 12:04:09,626 INFO L273 TraceCheckUtils]: 60: Hoare triple {6774#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {6705#true} is VALID [2018-11-23 12:04:09,627 INFO L273 TraceCheckUtils]: 61: Hoare triple {6705#true} ~i~0 := 0; {6907#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:09,627 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 12:04:09,628 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 12:04:09,628 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 12:04:09,630 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 12:04:09,631 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 12:04:09,632 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 12:04:09,633 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 12:04:09,634 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 12:04:09,635 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 12:04:09,636 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 12:04:09,637 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 12:04:09,638 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 12:04:09,638 INFO L273 TraceCheckUtils]: 74: Hoare triple {6719#(<= main_~i~0 12)} assume !(~i~0 < 100000); {6706#false} is VALID [2018-11-23 12:04:09,639 INFO L273 TraceCheckUtils]: 75: Hoare triple {6706#false} havoc ~x~0;~x~0 := 0; {6706#false} is VALID [2018-11-23 12:04:09,639 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 12:04:09,639 INFO L256 TraceCheckUtils]: 77: Hoare triple {6706#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {6706#false} is VALID [2018-11-23 12:04:09,639 INFO L273 TraceCheckUtils]: 78: Hoare triple {6706#false} ~cond := #in~cond; {6706#false} is VALID [2018-11-23 12:04:09,640 INFO L273 TraceCheckUtils]: 79: Hoare triple {6706#false} assume 0 == ~cond; {6706#false} is VALID [2018-11-23 12:04:09,640 INFO L273 TraceCheckUtils]: 80: Hoare triple {6706#false} assume !false; {6706#false} is VALID [2018-11-23 12:04:09,644 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 36 proven. 78 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-23 12:04:09,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:04:09,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 17 [2018-11-23 12:04:09,672 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 81 [2018-11-23 12:04:09,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:09,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:04:09,736 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:09,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:04:09,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:04:09,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:04:09,738 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 17 states. [2018-11-23 12:04:10,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:10,416 INFO L93 Difference]: Finished difference Result 158 states and 172 transitions. [2018-11-23 12:04:10,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:04:10,417 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 81 [2018-11-23 12:04:10,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:10,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:04:10,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 124 transitions. [2018-11-23 12:04:10,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:04:10,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 124 transitions. [2018-11-23 12:04:10,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 124 transitions. [2018-11-23 12:04:11,147 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:11,149 INFO L225 Difference]: With dead ends: 158 [2018-11-23 12:04:11,149 INFO L226 Difference]: Without dead ends: 91 [2018-11-23 12:04:11,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:04:11,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-23 12:04:11,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-11-23 12:04:11,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:11,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 91 states. [2018-11-23 12:04:11,205 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 91 states. [2018-11-23 12:04:11,205 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 91 states. [2018-11-23 12:04:11,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:11,207 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-11-23 12:04:11,207 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2018-11-23 12:04:11,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:11,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:11,208 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 91 states. [2018-11-23 12:04:11,208 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 91 states. [2018-11-23 12:04:11,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:11,211 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-11-23 12:04:11,211 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2018-11-23 12:04:11,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:11,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:11,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:11,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:11,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-23 12:04:11,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2018-11-23 12:04:11,214 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 81 [2018-11-23 12:04:11,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:11,214 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2018-11-23 12:04:11,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:04:11,214 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2018-11-23 12:04:11,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 12:04:11,215 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:11,215 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 12:04:11,216 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:11,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:11,216 INFO L82 PathProgramCache]: Analyzing trace with hash 810745364, now seen corresponding path program 13 times [2018-11-23 12:04:11,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:11,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:11,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:11,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:04:11,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:12,662 INFO L256 TraceCheckUtils]: 0: Hoare triple {7604#true} call ULTIMATE.init(); {7604#true} is VALID [2018-11-23 12:04:12,662 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 12:04:12,662 INFO L273 TraceCheckUtils]: 2: Hoare triple {7604#true} assume true; {7604#true} is VALID [2018-11-23 12:04:12,662 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7604#true} {7604#true} #100#return; {7604#true} is VALID [2018-11-23 12:04:12,663 INFO L256 TraceCheckUtils]: 4: Hoare triple {7604#true} call #t~ret2 := main(); {7604#true} is VALID [2018-11-23 12:04:12,663 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 12:04:12,664 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 12:04:12,664 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 12:04:12,665 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 12:04:12,666 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 12:04:12,667 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 12:04:12,668 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 12:04:12,669 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 12:04:12,670 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 12:04:12,671 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 12:04:12,672 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 12:04:12,675 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 12:04:12,691 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 12:04:12,696 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 12:04:12,697 INFO L273 TraceCheckUtils]: 19: Hoare triple {7619#(<= main_~i~0 13)} assume !(~i~0 < 100000); {7605#false} is VALID [2018-11-23 12:04:12,697 INFO L273 TraceCheckUtils]: 20: Hoare triple {7605#false} ~i~0 := 0; {7605#false} is VALID [2018-11-23 12:04:12,697 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 12:04:12,698 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 12:04:12,698 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 12:04:12,698 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 12:04:12,698 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 12:04:12,698 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 12:04:12,698 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 12:04:12,698 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 12:04:12,699 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 12:04:12,699 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 12:04:12,699 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 12:04:12,699 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 12:04:12,699 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 12:04:12,699 INFO L273 TraceCheckUtils]: 34: Hoare triple {7605#false} assume !(~i~0 < 100000); {7605#false} is VALID [2018-11-23 12:04:12,700 INFO L273 TraceCheckUtils]: 35: Hoare triple {7605#false} ~i~0 := 0; {7605#false} is VALID [2018-11-23 12:04:12,700 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 12:04:12,700 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 12:04:12,700 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 12:04:12,700 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 12:04:12,700 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 12:04:12,700 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 12:04:12,701 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 12:04:12,701 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 12:04:12,701 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 12:04:12,701 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 12:04:12,701 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 12:04:12,701 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 12:04:12,701 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 12:04:12,702 INFO L273 TraceCheckUtils]: 49: Hoare triple {7605#false} assume !(~i~0 < 100000); {7605#false} is VALID [2018-11-23 12:04:12,702 INFO L273 TraceCheckUtils]: 50: Hoare triple {7605#false} ~i~0 := 0; {7605#false} is VALID [2018-11-23 12:04:12,702 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 12:04:12,702 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 12:04:12,702 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 12:04:12,702 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 12:04:12,703 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 12:04:12,703 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 12:04:12,703 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 12:04:12,703 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 12:04:12,703 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 12:04:12,703 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 12:04:12,703 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 12:04:12,704 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 12:04:12,704 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 12:04:12,704 INFO L273 TraceCheckUtils]: 64: Hoare triple {7605#false} assume !(~i~0 < 100000); {7605#false} is VALID [2018-11-23 12:04:12,704 INFO L273 TraceCheckUtils]: 65: Hoare triple {7605#false} ~i~0 := 0; {7605#false} is VALID [2018-11-23 12:04:12,704 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 12:04:12,704 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 12:04:12,705 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 12:04:12,705 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 12:04:12,705 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 12:04:12,705 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 12:04:12,705 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 12:04:12,705 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 12:04:12,705 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 12:04:12,706 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 12:04:12,706 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 12:04:12,706 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 12:04:12,706 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 12:04:12,706 INFO L273 TraceCheckUtils]: 79: Hoare triple {7605#false} assume !(~i~0 < 100000); {7605#false} is VALID [2018-11-23 12:04:12,706 INFO L273 TraceCheckUtils]: 80: Hoare triple {7605#false} havoc ~x~0;~x~0 := 0; {7605#false} is VALID [2018-11-23 12:04:12,707 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 12:04:12,707 INFO L256 TraceCheckUtils]: 82: Hoare triple {7605#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {7605#false} is VALID [2018-11-23 12:04:12,707 INFO L273 TraceCheckUtils]: 83: Hoare triple {7605#false} ~cond := #in~cond; {7605#false} is VALID [2018-11-23 12:04:12,707 INFO L273 TraceCheckUtils]: 84: Hoare triple {7605#false} assume 0 == ~cond; {7605#false} is VALID [2018-11-23 12:04:12,707 INFO L273 TraceCheckUtils]: 85: Hoare triple {7605#false} assume !false; {7605#false} is VALID [2018-11-23 12:04:12,714 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 12:04:12,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:12,714 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:04:12,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:04:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:12,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:04:12,977 INFO L256 TraceCheckUtils]: 0: Hoare triple {7604#true} call ULTIMATE.init(); {7604#true} is VALID [2018-11-23 12:04:12,978 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 12:04:12,978 INFO L273 TraceCheckUtils]: 2: Hoare triple {7604#true} assume true; {7604#true} is VALID [2018-11-23 12:04:12,978 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7604#true} {7604#true} #100#return; {7604#true} is VALID [2018-11-23 12:04:12,979 INFO L256 TraceCheckUtils]: 4: Hoare triple {7604#true} call #t~ret2 := main(); {7604#true} is VALID [2018-11-23 12:04:12,979 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 12:04:12,980 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 12:04:12,981 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 12:04:12,981 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 12:04:12,982 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 12:04:12,983 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 12:04:12,984 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 12:04:12,985 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 12:04:12,986 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 12:04:12,987 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 12:04:12,989 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 12:04:12,990 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 12:04:12,991 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 12:04:12,992 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 12:04:12,993 INFO L273 TraceCheckUtils]: 19: Hoare triple {7619#(<= main_~i~0 13)} assume !(~i~0 < 100000); {7605#false} is VALID [2018-11-23 12:04:12,993 INFO L273 TraceCheckUtils]: 20: Hoare triple {7605#false} ~i~0 := 0; {7605#false} is VALID [2018-11-23 12:04:12,993 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 12:04:12,993 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 12:04:12,994 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 12:04:12,994 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 12:04:12,994 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 12:04:12,994 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 12:04:12,995 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 12:04:12,995 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 12:04:12,995 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 12:04:12,995 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 12:04:12,995 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 12:04:12,996 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 12:04:12,996 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 12:04:12,996 INFO L273 TraceCheckUtils]: 34: Hoare triple {7605#false} assume !(~i~0 < 100000); {7605#false} is VALID [2018-11-23 12:04:12,996 INFO L273 TraceCheckUtils]: 35: Hoare triple {7605#false} ~i~0 := 0; {7605#false} is VALID [2018-11-23 12:04:12,996 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 12:04:12,996 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 12:04:12,997 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 12:04:12,997 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 12:04:12,997 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 12:04:12,997 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 12:04:12,997 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 12:04:12,997 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 12:04:12,997 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 12:04:12,998 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 12:04:12,998 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 12:04:12,998 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 12:04:12,998 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 12:04:12,998 INFO L273 TraceCheckUtils]: 49: Hoare triple {7605#false} assume !(~i~0 < 100000); {7605#false} is VALID [2018-11-23 12:04:12,998 INFO L273 TraceCheckUtils]: 50: Hoare triple {7605#false} ~i~0 := 0; {7605#false} is VALID [2018-11-23 12:04:12,999 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 12:04:12,999 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 12:04:12,999 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 12:04:12,999 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 12:04:12,999 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 12:04:12,999 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 12:04:12,999 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 12:04:13,000 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 12:04:13,000 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 12:04:13,000 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 12:04:13,000 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 12:04:13,000 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 12:04:13,000 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 12:04:13,001 INFO L273 TraceCheckUtils]: 64: Hoare triple {7605#false} assume !(~i~0 < 100000); {7605#false} is VALID [2018-11-23 12:04:13,001 INFO L273 TraceCheckUtils]: 65: Hoare triple {7605#false} ~i~0 := 0; {7605#false} is VALID [2018-11-23 12:04:13,001 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 12:04:13,001 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 12:04:13,001 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 12:04:13,001 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 12:04:13,001 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 12:04:13,002 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 12:04:13,002 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 12:04:13,002 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 12:04:13,002 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 12:04:13,002 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 12:04:13,002 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 12:04:13,020 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 12:04:13,020 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 12:04:13,021 INFO L273 TraceCheckUtils]: 79: Hoare triple {7605#false} assume !(~i~0 < 100000); {7605#false} is VALID [2018-11-23 12:04:13,021 INFO L273 TraceCheckUtils]: 80: Hoare triple {7605#false} havoc ~x~0;~x~0 := 0; {7605#false} is VALID [2018-11-23 12:04:13,021 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 12:04:13,021 INFO L256 TraceCheckUtils]: 82: Hoare triple {7605#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {7605#false} is VALID [2018-11-23 12:04:13,021 INFO L273 TraceCheckUtils]: 83: Hoare triple {7605#false} ~cond := #in~cond; {7605#false} is VALID [2018-11-23 12:04:13,021 INFO L273 TraceCheckUtils]: 84: Hoare triple {7605#false} assume 0 == ~cond; {7605#false} is VALID [2018-11-23 12:04:13,022 INFO L273 TraceCheckUtils]: 85: Hoare triple {7605#false} assume !false; {7605#false} is VALID [2018-11-23 12:04:13,025 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 12:04:13,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:04:13,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:04:13,045 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 86 [2018-11-23 12:04:13,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:13,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:04:13,088 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:13,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:04:13,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:04:13,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:04:13,090 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand 17 states. [2018-11-23 12:04:13,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:13,667 INFO L93 Difference]: Finished difference Result 167 states and 181 transitions. [2018-11-23 12:04:13,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:04:13,667 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 86 [2018-11-23 12:04:13,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:13,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:04:13,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 129 transitions. [2018-11-23 12:04:13,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:04:13,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 129 transitions. [2018-11-23 12:04:13,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 129 transitions. [2018-11-23 12:04:13,831 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:13,833 INFO L225 Difference]: With dead ends: 167 [2018-11-23 12:04:13,834 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 12:04:13,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:04:13,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 12:04:13,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-11-23 12:04:13,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:13,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 96 states. [2018-11-23 12:04:13,907 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 96 states. [2018-11-23 12:04:13,907 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 96 states. [2018-11-23 12:04:13,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:13,910 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2018-11-23 12:04:13,910 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-11-23 12:04:13,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:13,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:13,911 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 96 states. [2018-11-23 12:04:13,911 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 96 states. [2018-11-23 12:04:13,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:13,913 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2018-11-23 12:04:13,913 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-11-23 12:04:13,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:13,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:13,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:13,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:13,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 12:04:13,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2018-11-23 12:04:13,915 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 86 [2018-11-23 12:04:13,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:13,916 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2018-11-23 12:04:13,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:04:13,916 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-11-23 12:04:13,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 12:04:13,917 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:13,917 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 12:04:13,917 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:13,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:13,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1391763710, now seen corresponding path program 14 times [2018-11-23 12:04:13,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:13,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:13,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:13,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:04:13,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:14,854 INFO L256 TraceCheckUtils]: 0: Hoare triple {8556#true} call ULTIMATE.init(); {8556#true} is VALID [2018-11-23 12:04:14,855 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 12:04:14,855 INFO L273 TraceCheckUtils]: 2: Hoare triple {8556#true} assume true; {8556#true} is VALID [2018-11-23 12:04:14,855 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8556#true} {8556#true} #100#return; {8556#true} is VALID [2018-11-23 12:04:14,855 INFO L256 TraceCheckUtils]: 4: Hoare triple {8556#true} call #t~ret2 := main(); {8556#true} is VALID [2018-11-23 12:04:14,856 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 12:04:14,857 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 12:04:14,858 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 12:04:14,875 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 12:04:14,891 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 12:04:14,901 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 12:04:14,902 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 12:04:14,903 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 12:04:14,903 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 12:04:14,904 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 12:04:14,905 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 12:04:14,905 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 12:04:14,906 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 12:04:14,907 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 12:04:14,908 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 12:04:14,909 INFO L273 TraceCheckUtils]: 20: Hoare triple {8572#(<= main_~i~0 14)} assume !(~i~0 < 100000); {8557#false} is VALID [2018-11-23 12:04:14,909 INFO L273 TraceCheckUtils]: 21: Hoare triple {8557#false} ~i~0 := 0; {8557#false} is VALID [2018-11-23 12:04:14,909 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 12:04:14,910 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 12:04:14,910 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 12:04:14,910 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 12:04:14,910 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 12:04:14,910 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 12:04:14,911 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 12:04:14,911 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 12:04:14,911 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 12:04:14,911 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 12:04:14,911 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 12:04:14,912 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 12:04:14,912 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 12:04:14,912 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 12:04:14,912 INFO L273 TraceCheckUtils]: 36: Hoare triple {8557#false} assume !(~i~0 < 100000); {8557#false} is VALID [2018-11-23 12:04:14,912 INFO L273 TraceCheckUtils]: 37: Hoare triple {8557#false} ~i~0 := 0; {8557#false} is VALID [2018-11-23 12:04:14,912 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 12:04:14,912 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 12:04:14,913 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 12:04:14,913 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 12:04:14,913 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 12:04:14,913 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 12:04:14,913 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 12:04:14,913 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 12:04:14,914 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 12:04:14,914 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 12:04:14,914 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 12:04:14,914 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 12:04:14,914 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 12:04:14,914 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 12:04:14,914 INFO L273 TraceCheckUtils]: 52: Hoare triple {8557#false} assume !(~i~0 < 100000); {8557#false} is VALID [2018-11-23 12:04:14,914 INFO L273 TraceCheckUtils]: 53: Hoare triple {8557#false} ~i~0 := 0; {8557#false} is VALID [2018-11-23 12:04:14,915 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 12:04:14,915 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 12:04:14,915 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 12:04:14,915 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 12:04:14,915 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 12:04:14,915 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 12:04:14,915 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 12:04:14,915 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 12:04:14,915 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 12:04:14,916 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 12:04:14,916 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 12:04:14,916 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 12:04:14,916 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 12:04:14,916 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 12:04:14,916 INFO L273 TraceCheckUtils]: 68: Hoare triple {8557#false} assume !(~i~0 < 100000); {8557#false} is VALID [2018-11-23 12:04:14,916 INFO L273 TraceCheckUtils]: 69: Hoare triple {8557#false} ~i~0 := 0; {8557#false} is VALID [2018-11-23 12:04:14,916 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 12:04:14,916 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 12:04:14,917 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 12:04:14,917 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 12:04:14,917 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 12:04:14,917 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 12:04:14,917 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 12:04:14,917 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 12:04:14,917 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 12:04:14,917 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 12:04:14,918 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 12:04:14,918 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 12:04:14,918 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 12:04:14,918 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 12:04:14,918 INFO L273 TraceCheckUtils]: 84: Hoare triple {8557#false} assume !(~i~0 < 100000); {8557#false} is VALID [2018-11-23 12:04:14,918 INFO L273 TraceCheckUtils]: 85: Hoare triple {8557#false} havoc ~x~0;~x~0 := 0; {8557#false} is VALID [2018-11-23 12:04:14,918 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 12:04:14,918 INFO L256 TraceCheckUtils]: 87: Hoare triple {8557#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {8557#false} is VALID [2018-11-23 12:04:14,918 INFO L273 TraceCheckUtils]: 88: Hoare triple {8557#false} ~cond := #in~cond; {8557#false} is VALID [2018-11-23 12:04:14,919 INFO L273 TraceCheckUtils]: 89: Hoare triple {8557#false} assume 0 == ~cond; {8557#false} is VALID [2018-11-23 12:04:14,919 INFO L273 TraceCheckUtils]: 90: Hoare triple {8557#false} assume !false; {8557#false} is VALID [2018-11-23 12:04:14,922 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 12:04:14,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:14,922 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:04:14,932 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:04:14,999 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:04:14,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:04:15,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:15,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:04:15,404 INFO L256 TraceCheckUtils]: 0: Hoare triple {8556#true} call ULTIMATE.init(); {8556#true} is VALID [2018-11-23 12:04:15,404 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 12:04:15,404 INFO L273 TraceCheckUtils]: 2: Hoare triple {8556#true} assume true; {8556#true} is VALID [2018-11-23 12:04:15,404 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8556#true} {8556#true} #100#return; {8556#true} is VALID [2018-11-23 12:04:15,405 INFO L256 TraceCheckUtils]: 4: Hoare triple {8556#true} call #t~ret2 := main(); {8556#true} is VALID [2018-11-23 12:04:15,406 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 12:04:15,406 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 12:04:15,408 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 12:04:15,409 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 12:04:15,410 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 12:04:15,411 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 12:04:15,412 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 12:04:15,413 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 12:04:15,414 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 12:04:15,415 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 12:04:15,416 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 12:04:15,417 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 12:04:15,418 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 12:04:15,419 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 12:04:15,423 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 12:04:15,424 INFO L273 TraceCheckUtils]: 20: Hoare triple {8572#(<= main_~i~0 14)} assume !(~i~0 < 100000); {8557#false} is VALID [2018-11-23 12:04:15,424 INFO L273 TraceCheckUtils]: 21: Hoare triple {8557#false} ~i~0 := 0; {8557#false} is VALID [2018-11-23 12:04:15,424 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 12:04:15,424 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 12:04:15,424 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 12:04:15,424 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 12:04:15,424 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 12:04:15,424 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 12:04:15,425 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 12:04:15,425 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 12:04:15,425 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 12:04:15,425 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 12:04:15,425 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 12:04:15,425 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 12:04:15,425 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 12:04:15,425 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 12:04:15,426 INFO L273 TraceCheckUtils]: 36: Hoare triple {8557#false} assume !(~i~0 < 100000); {8557#false} is VALID [2018-11-23 12:04:15,426 INFO L273 TraceCheckUtils]: 37: Hoare triple {8557#false} ~i~0 := 0; {8557#false} is VALID [2018-11-23 12:04:15,426 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 12:04:15,426 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 12:04:15,426 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 12:04:15,426 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 12:04:15,426 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 12:04:15,426 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 12:04:15,426 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 12:04:15,427 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 12:04:15,427 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 12:04:15,427 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 12:04:15,427 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 12:04:15,427 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 12:04:15,427 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 12:04:15,427 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 12:04:15,427 INFO L273 TraceCheckUtils]: 52: Hoare triple {8557#false} assume !(~i~0 < 100000); {8557#false} is VALID [2018-11-23 12:04:15,427 INFO L273 TraceCheckUtils]: 53: Hoare triple {8557#false} ~i~0 := 0; {8557#false} is VALID [2018-11-23 12:04:15,428 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 12:04:15,428 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 12:04:15,428 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 12:04:15,428 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 12:04:15,428 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 12:04:15,428 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 12:04:15,428 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 12:04:15,428 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 12:04:15,429 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 12:04:15,429 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 12:04:15,429 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 12:04:15,429 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 12:04:15,429 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 12:04:15,429 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 12:04:15,429 INFO L273 TraceCheckUtils]: 68: Hoare triple {8557#false} assume !(~i~0 < 100000); {8557#false} is VALID [2018-11-23 12:04:15,429 INFO L273 TraceCheckUtils]: 69: Hoare triple {8557#false} ~i~0 := 0; {8557#false} is VALID [2018-11-23 12:04:15,429 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 12:04:15,430 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 12:04:15,430 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 12:04:15,430 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 12:04:15,430 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 12:04:15,430 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 12:04:15,430 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 12:04:15,430 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 12:04:15,430 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 12:04:15,430 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 12:04:15,431 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 12:04:15,431 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 12:04:15,431 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 12:04:15,431 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 12:04:15,431 INFO L273 TraceCheckUtils]: 84: Hoare triple {8557#false} assume !(~i~0 < 100000); {8557#false} is VALID [2018-11-23 12:04:15,431 INFO L273 TraceCheckUtils]: 85: Hoare triple {8557#false} havoc ~x~0;~x~0 := 0; {8557#false} is VALID [2018-11-23 12:04:15,431 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 12:04:15,431 INFO L256 TraceCheckUtils]: 87: Hoare triple {8557#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {8557#false} is VALID [2018-11-23 12:04:15,432 INFO L273 TraceCheckUtils]: 88: Hoare triple {8557#false} ~cond := #in~cond; {8557#false} is VALID [2018-11-23 12:04:15,432 INFO L273 TraceCheckUtils]: 89: Hoare triple {8557#false} assume 0 == ~cond; {8557#false} is VALID [2018-11-23 12:04:15,432 INFO L273 TraceCheckUtils]: 90: Hoare triple {8557#false} assume !false; {8557#false} is VALID [2018-11-23 12:04:15,436 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 12:04:15,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:04:15,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:04:15,456 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2018-11-23 12:04:15,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:15,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:04:15,514 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 12:04:15,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:04:15,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:04:15,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:04:15,515 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 18 states. [2018-11-23 12:04:16,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:16,663 INFO L93 Difference]: Finished difference Result 176 states and 190 transitions. [2018-11-23 12:04:16,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:04:16,663 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2018-11-23 12:04:16,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:16,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:04:16,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 134 transitions. [2018-11-23 12:04:16,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:04:16,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 134 transitions. [2018-11-23 12:04:16,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 134 transitions. [2018-11-23 12:04:16,806 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:16,808 INFO L225 Difference]: With dead ends: 176 [2018-11-23 12:04:16,808 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 12:04:16,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:04:16,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 12:04:16,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-11-23 12:04:16,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:16,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 101 states. [2018-11-23 12:04:16,910 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 101 states. [2018-11-23 12:04:16,910 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 101 states. [2018-11-23 12:04:16,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:16,911 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-11-23 12:04:16,911 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-11-23 12:04:16,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:16,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:16,912 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 101 states. [2018-11-23 12:04:16,912 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 101 states. [2018-11-23 12:04:16,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:16,914 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-11-23 12:04:16,914 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-11-23 12:04:16,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:16,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:16,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:16,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:16,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-23 12:04:16,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-11-23 12:04:16,916 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 91 [2018-11-23 12:04:16,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:16,917 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-11-23 12:04:16,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:04:16,917 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-11-23 12:04:16,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 12:04:16,918 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:16,918 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 12:04:16,918 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:16,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:16,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1103546028, now seen corresponding path program 15 times [2018-11-23 12:04:16,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:16,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:16,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:16,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:04:16,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:17,193 INFO L256 TraceCheckUtils]: 0: Hoare triple {9562#true} call ULTIMATE.init(); {9562#true} is VALID [2018-11-23 12:04:17,193 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 12:04:17,194 INFO L273 TraceCheckUtils]: 2: Hoare triple {9562#true} assume true; {9562#true} is VALID [2018-11-23 12:04:17,194 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9562#true} {9562#true} #100#return; {9562#true} is VALID [2018-11-23 12:04:17,194 INFO L256 TraceCheckUtils]: 4: Hoare triple {9562#true} call #t~ret2 := main(); {9562#true} is VALID [2018-11-23 12:04:17,194 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 12:04:17,195 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 12:04:17,196 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 12:04:17,197 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 12:04:17,198 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 12:04:17,199 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 12:04:17,210 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 12:04:17,211 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 12:04:17,211 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 12:04:17,212 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 12:04:17,212 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 12:04:17,213 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 12:04:17,214 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 12:04:17,215 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 12:04:17,216 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 12:04:17,217 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 12:04:17,217 INFO L273 TraceCheckUtils]: 21: Hoare triple {9579#(<= main_~i~0 15)} assume !(~i~0 < 100000); {9563#false} is VALID [2018-11-23 12:04:17,218 INFO L273 TraceCheckUtils]: 22: Hoare triple {9563#false} ~i~0 := 0; {9563#false} is VALID [2018-11-23 12:04:17,218 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 12:04:17,218 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 12:04:17,218 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 12:04:17,218 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 12:04:17,219 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 12:04:17,219 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 12:04:17,219 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 12:04:17,219 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 12:04:17,219 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 12:04:17,220 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 12:04:17,220 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 12:04:17,220 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 12:04:17,220 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 12:04:17,220 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 12:04:17,221 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 12:04:17,221 INFO L273 TraceCheckUtils]: 38: Hoare triple {9563#false} assume !(~i~0 < 100000); {9563#false} is VALID [2018-11-23 12:04:17,221 INFO L273 TraceCheckUtils]: 39: Hoare triple {9563#false} ~i~0 := 0; {9563#false} is VALID [2018-11-23 12:04:17,221 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 12:04:17,221 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 12:04:17,221 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 12:04:17,222 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 12:04:17,222 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 12:04:17,222 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 12:04:17,222 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 12:04:17,222 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 12:04:17,222 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 12:04:17,222 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 12:04:17,222 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 12:04:17,222 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 12:04:17,223 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 12:04:17,223 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 12:04:17,223 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 12:04:17,223 INFO L273 TraceCheckUtils]: 55: Hoare triple {9563#false} assume !(~i~0 < 100000); {9563#false} is VALID [2018-11-23 12:04:17,223 INFO L273 TraceCheckUtils]: 56: Hoare triple {9563#false} ~i~0 := 0; {9563#false} is VALID [2018-11-23 12:04:17,223 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 12:04:17,223 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 12:04:17,223 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 12:04:17,224 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 12:04:17,224 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 12:04:17,224 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 12:04:17,224 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 12:04:17,224 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 12:04:17,224 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 12:04:17,224 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 12:04:17,224 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 12:04:17,224 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 12:04:17,225 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 12:04:17,225 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 12:04:17,225 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 12:04:17,225 INFO L273 TraceCheckUtils]: 72: Hoare triple {9563#false} assume !(~i~0 < 100000); {9563#false} is VALID [2018-11-23 12:04:17,225 INFO L273 TraceCheckUtils]: 73: Hoare triple {9563#false} ~i~0 := 0; {9563#false} is VALID [2018-11-23 12:04:17,225 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 12:04:17,225 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 12:04:17,225 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 12:04:17,225 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 12:04:17,226 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 12:04:17,226 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 12:04:17,226 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 12:04:17,226 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 12:04:17,226 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 12:04:17,226 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 12:04:17,226 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 12:04:17,226 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 12:04:17,227 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 12:04:17,227 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 12:04:17,227 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 12:04:17,227 INFO L273 TraceCheckUtils]: 89: Hoare triple {9563#false} assume !(~i~0 < 100000); {9563#false} is VALID [2018-11-23 12:04:17,227 INFO L273 TraceCheckUtils]: 90: Hoare triple {9563#false} havoc ~x~0;~x~0 := 0; {9563#false} is VALID [2018-11-23 12:04:17,227 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 12:04:17,227 INFO L256 TraceCheckUtils]: 92: Hoare triple {9563#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {9563#false} is VALID [2018-11-23 12:04:17,227 INFO L273 TraceCheckUtils]: 93: Hoare triple {9563#false} ~cond := #in~cond; {9563#false} is VALID [2018-11-23 12:04:17,227 INFO L273 TraceCheckUtils]: 94: Hoare triple {9563#false} assume 0 == ~cond; {9563#false} is VALID [2018-11-23 12:04:17,228 INFO L273 TraceCheckUtils]: 95: Hoare triple {9563#false} assume !false; {9563#false} is VALID [2018-11-23 12:04:17,231 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 12:04:17,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:17,232 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:04:17,241 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:04:44,845 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 12:04:44,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:04:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:44,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:04:45,105 INFO L256 TraceCheckUtils]: 0: Hoare triple {9562#true} call ULTIMATE.init(); {9562#true} is VALID [2018-11-23 12:04:45,106 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 12:04:45,106 INFO L273 TraceCheckUtils]: 2: Hoare triple {9562#true} assume true; {9562#true} is VALID [2018-11-23 12:04:45,106 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9562#true} {9562#true} #100#return; {9562#true} is VALID [2018-11-23 12:04:45,106 INFO L256 TraceCheckUtils]: 4: Hoare triple {9562#true} call #t~ret2 := main(); {9562#true} is VALID [2018-11-23 12:04:45,106 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 12:04:45,107 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 12:04:45,107 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 12:04:45,107 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 12:04:45,107 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 12:04:45,107 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 12:04:45,108 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 12:04:45,108 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 12:04:45,108 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 12:04:45,108 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 12:04:45,108 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 12:04:45,108 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 12:04:45,108 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 12:04:45,109 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 12:04:45,109 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 12:04:45,109 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; {9562#true} is VALID [2018-11-23 12:04:45,109 INFO L273 TraceCheckUtils]: 21: Hoare triple {9562#true} assume !(~i~0 < 100000); {9562#true} is VALID [2018-11-23 12:04:45,109 INFO L273 TraceCheckUtils]: 22: Hoare triple {9562#true} ~i~0 := 0; {9562#true} is VALID [2018-11-23 12:04:45,109 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 12:04:45,109 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 12:04:45,109 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 12:04:45,109 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 12:04:45,110 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 12:04:45,110 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 12:04:45,110 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 12:04:45,110 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 12:04:45,110 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 12:04:45,110 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 12:04:45,110 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 12:04:45,110 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 12:04:45,111 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 12:04:45,111 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 12:04:45,111 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; {9562#true} is VALID [2018-11-23 12:04:45,111 INFO L273 TraceCheckUtils]: 38: Hoare triple {9562#true} assume !(~i~0 < 100000); {9562#true} is VALID [2018-11-23 12:04:45,111 INFO L273 TraceCheckUtils]: 39: Hoare triple {9562#true} ~i~0 := 0; {9562#true} is VALID [2018-11-23 12:04:45,111 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 12:04:45,111 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 12:04:45,111 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 12:04:45,111 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 12:04:45,112 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 12:04:45,112 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 12:04:45,112 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 12:04:45,112 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 12:04:45,112 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 12:04:45,112 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 12:04:45,112 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 12:04:45,112 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 12:04:45,113 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 12:04:45,113 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 12:04:45,113 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 12:04:45,113 INFO L273 TraceCheckUtils]: 55: Hoare triple {9562#true} assume !(~i~0 < 100000); {9562#true} is VALID [2018-11-23 12:04:45,113 INFO L273 TraceCheckUtils]: 56: Hoare triple {9562#true} ~i~0 := 0; {9751#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:45,114 INFO L273 TraceCheckUtils]: 57: Hoare triple {9751#(<= 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 12:04:45,115 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 12:04:45,115 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 12:04:45,116 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 12:04:45,116 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 12:04:45,117 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 12:04:45,118 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 12:04:45,119 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 12:04:45,119 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 12:04:45,120 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 12:04:45,121 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 12:04:45,122 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 12:04:45,123 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 12:04:45,124 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 12:04:45,125 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 12:04:45,126 INFO L273 TraceCheckUtils]: 72: Hoare triple {9579#(<= main_~i~0 15)} assume !(~i~0 < 100000); {9563#false} is VALID [2018-11-23 12:04:45,126 INFO L273 TraceCheckUtils]: 73: Hoare triple {9563#false} ~i~0 := 0; {9563#false} is VALID [2018-11-23 12:04:45,126 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 12:04:45,126 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 12:04:45,127 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 12:04:45,127 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 12:04:45,127 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 12:04:45,127 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 12:04:45,127 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 12:04:45,128 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 12:04:45,128 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 12:04:45,128 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 12:04:45,128 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 12:04:45,128 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 12:04:45,129 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 12:04:45,129 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 12:04:45,129 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 12:04:45,129 INFO L273 TraceCheckUtils]: 89: Hoare triple {9563#false} assume !(~i~0 < 100000); {9563#false} is VALID [2018-11-23 12:04:45,130 INFO L273 TraceCheckUtils]: 90: Hoare triple {9563#false} havoc ~x~0;~x~0 := 0; {9563#false} is VALID [2018-11-23 12:04:45,130 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 12:04:45,130 INFO L256 TraceCheckUtils]: 92: Hoare triple {9563#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {9563#false} is VALID [2018-11-23 12:04:45,130 INFO L273 TraceCheckUtils]: 93: Hoare triple {9563#false} ~cond := #in~cond; {9563#false} is VALID [2018-11-23 12:04:45,130 INFO L273 TraceCheckUtils]: 94: Hoare triple {9563#false} assume 0 == ~cond; {9563#false} is VALID [2018-11-23 12:04:45,130 INFO L273 TraceCheckUtils]: 95: Hoare triple {9563#false} assume !false; {9563#false} is VALID [2018-11-23 12:04:45,134 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 12:04:45,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:04:45,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 12:04:45,164 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 96 [2018-11-23 12:04:45,164 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:45,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:04:45,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:45,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:04:45,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:04:45,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:04:45,233 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 19 states. [2018-11-23 12:04:46,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:46,186 INFO L93 Difference]: Finished difference Result 185 states and 199 transitions. [2018-11-23 12:04:46,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 12:04:46,187 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 96 [2018-11-23 12:04:46,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:46,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:04:46,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 139 transitions. [2018-11-23 12:04:46,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:04:46,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 139 transitions. [2018-11-23 12:04:46,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 139 transitions. [2018-11-23 12:04:46,342 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:46,344 INFO L225 Difference]: With dead ends: 185 [2018-11-23 12:04:46,344 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 12:04:46,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:04:46,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 12:04:46,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-11-23 12:04:46,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:46,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 106 states. [2018-11-23 12:04:46,416 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 106 states. [2018-11-23 12:04:46,416 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 106 states. [2018-11-23 12:04:46,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:46,418 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2018-11-23 12:04:46,418 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-11-23 12:04:46,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:46,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:46,419 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 106 states. [2018-11-23 12:04:46,419 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 106 states. [2018-11-23 12:04:46,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:46,421 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2018-11-23 12:04:46,421 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-11-23 12:04:46,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:46,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:46,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:46,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:46,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-23 12:04:46,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-11-23 12:04:46,424 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 96 [2018-11-23 12:04:46,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:46,424 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-11-23 12:04:46,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:04:46,425 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-11-23 12:04:46,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-23 12:04:46,425 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:46,426 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 12:04:46,426 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:46,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:46,426 INFO L82 PathProgramCache]: Analyzing trace with hash -831837630, now seen corresponding path program 16 times [2018-11-23 12:04:46,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:46,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:46,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:46,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:04:46,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:46,906 INFO L256 TraceCheckUtils]: 0: Hoare triple {10622#true} call ULTIMATE.init(); {10622#true} is VALID [2018-11-23 12:04:46,906 INFO L273 TraceCheckUtils]: 1: Hoare triple {10622#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10622#true} is VALID [2018-11-23 12:04:46,906 INFO L273 TraceCheckUtils]: 2: Hoare triple {10622#true} assume true; {10622#true} is VALID [2018-11-23 12:04:46,906 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10622#true} {10622#true} #100#return; {10622#true} is VALID [2018-11-23 12:04:46,907 INFO L256 TraceCheckUtils]: 4: Hoare triple {10622#true} call #t~ret2 := main(); {10622#true} is VALID [2018-11-23 12:04:46,907 INFO L273 TraceCheckUtils]: 5: Hoare triple {10622#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10624#(= main_~i~0 0)} is VALID [2018-11-23 12:04:46,908 INFO L273 TraceCheckUtils]: 6: Hoare triple {10624#(= 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; {10625#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:46,909 INFO L273 TraceCheckUtils]: 7: Hoare triple {10625#(<= 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; {10626#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:46,910 INFO L273 TraceCheckUtils]: 8: Hoare triple {10626#(<= 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; {10627#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:46,910 INFO L273 TraceCheckUtils]: 9: Hoare triple {10627#(<= 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; {10628#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:46,911 INFO L273 TraceCheckUtils]: 10: Hoare triple {10628#(<= 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; {10629#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:46,911 INFO L273 TraceCheckUtils]: 11: Hoare triple {10629#(<= 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; {10630#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:46,912 INFO L273 TraceCheckUtils]: 12: Hoare triple {10630#(<= 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; {10631#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:46,913 INFO L273 TraceCheckUtils]: 13: Hoare triple {10631#(<= 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; {10632#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:46,914 INFO L273 TraceCheckUtils]: 14: Hoare triple {10632#(<= 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; {10633#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:46,915 INFO L273 TraceCheckUtils]: 15: Hoare triple {10633#(<= 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; {10634#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:46,915 INFO L273 TraceCheckUtils]: 16: Hoare triple {10634#(<= 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; {10635#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:46,916 INFO L273 TraceCheckUtils]: 17: Hoare triple {10635#(<= 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; {10636#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:46,917 INFO L273 TraceCheckUtils]: 18: Hoare triple {10636#(<= 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; {10637#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:46,918 INFO L273 TraceCheckUtils]: 19: Hoare triple {10637#(<= 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; {10638#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:46,919 INFO L273 TraceCheckUtils]: 20: Hoare triple {10638#(<= 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; {10639#(<= main_~i~0 15)} is VALID [2018-11-23 12:04:46,920 INFO L273 TraceCheckUtils]: 21: Hoare triple {10639#(<= 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; {10640#(<= main_~i~0 16)} is VALID [2018-11-23 12:04:46,921 INFO L273 TraceCheckUtils]: 22: Hoare triple {10640#(<= main_~i~0 16)} assume !(~i~0 < 100000); {10623#false} is VALID [2018-11-23 12:04:46,921 INFO L273 TraceCheckUtils]: 23: Hoare triple {10623#false} ~i~0 := 0; {10623#false} is VALID [2018-11-23 12:04:46,921 INFO L273 TraceCheckUtils]: 24: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,922 INFO L273 TraceCheckUtils]: 25: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,922 INFO L273 TraceCheckUtils]: 26: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,922 INFO L273 TraceCheckUtils]: 27: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,922 INFO L273 TraceCheckUtils]: 28: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,922 INFO L273 TraceCheckUtils]: 29: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,923 INFO L273 TraceCheckUtils]: 30: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,923 INFO L273 TraceCheckUtils]: 31: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,923 INFO L273 TraceCheckUtils]: 32: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,923 INFO L273 TraceCheckUtils]: 33: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,923 INFO L273 TraceCheckUtils]: 34: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,924 INFO L273 TraceCheckUtils]: 35: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,924 INFO L273 TraceCheckUtils]: 36: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,924 INFO L273 TraceCheckUtils]: 37: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,924 INFO L273 TraceCheckUtils]: 38: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,924 INFO L273 TraceCheckUtils]: 39: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,925 INFO L273 TraceCheckUtils]: 40: Hoare triple {10623#false} assume !(~i~0 < 100000); {10623#false} is VALID [2018-11-23 12:04:46,925 INFO L273 TraceCheckUtils]: 41: Hoare triple {10623#false} ~i~0 := 0; {10623#false} is VALID [2018-11-23 12:04:46,925 INFO L273 TraceCheckUtils]: 42: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,925 INFO L273 TraceCheckUtils]: 43: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,926 INFO L273 TraceCheckUtils]: 44: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,926 INFO L273 TraceCheckUtils]: 45: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,926 INFO L273 TraceCheckUtils]: 46: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,926 INFO L273 TraceCheckUtils]: 47: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,927 INFO L273 TraceCheckUtils]: 48: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,927 INFO L273 TraceCheckUtils]: 49: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,927 INFO L273 TraceCheckUtils]: 50: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,927 INFO L273 TraceCheckUtils]: 51: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,927 INFO L273 TraceCheckUtils]: 52: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,928 INFO L273 TraceCheckUtils]: 53: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,928 INFO L273 TraceCheckUtils]: 54: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,928 INFO L273 TraceCheckUtils]: 55: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,928 INFO L273 TraceCheckUtils]: 56: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,929 INFO L273 TraceCheckUtils]: 57: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,929 INFO L273 TraceCheckUtils]: 58: Hoare triple {10623#false} assume !(~i~0 < 100000); {10623#false} is VALID [2018-11-23 12:04:46,929 INFO L273 TraceCheckUtils]: 59: Hoare triple {10623#false} ~i~0 := 0; {10623#false} is VALID [2018-11-23 12:04:46,929 INFO L273 TraceCheckUtils]: 60: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,929 INFO L273 TraceCheckUtils]: 61: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,930 INFO L273 TraceCheckUtils]: 62: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,930 INFO L273 TraceCheckUtils]: 63: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,930 INFO L273 TraceCheckUtils]: 64: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,930 INFO L273 TraceCheckUtils]: 65: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,930 INFO L273 TraceCheckUtils]: 66: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,931 INFO L273 TraceCheckUtils]: 67: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,931 INFO L273 TraceCheckUtils]: 68: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,931 INFO L273 TraceCheckUtils]: 69: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,931 INFO L273 TraceCheckUtils]: 70: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,931 INFO L273 TraceCheckUtils]: 71: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,932 INFO L273 TraceCheckUtils]: 72: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,932 INFO L273 TraceCheckUtils]: 73: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,932 INFO L273 TraceCheckUtils]: 74: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,932 INFO L273 TraceCheckUtils]: 75: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,932 INFO L273 TraceCheckUtils]: 76: Hoare triple {10623#false} assume !(~i~0 < 100000); {10623#false} is VALID [2018-11-23 12:04:46,933 INFO L273 TraceCheckUtils]: 77: Hoare triple {10623#false} ~i~0 := 0; {10623#false} is VALID [2018-11-23 12:04:46,933 INFO L273 TraceCheckUtils]: 78: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,933 INFO L273 TraceCheckUtils]: 79: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,933 INFO L273 TraceCheckUtils]: 80: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,933 INFO L273 TraceCheckUtils]: 81: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,934 INFO L273 TraceCheckUtils]: 82: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,934 INFO L273 TraceCheckUtils]: 83: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,934 INFO L273 TraceCheckUtils]: 84: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,934 INFO L273 TraceCheckUtils]: 85: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,934 INFO L273 TraceCheckUtils]: 86: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,935 INFO L273 TraceCheckUtils]: 87: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,935 INFO L273 TraceCheckUtils]: 88: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,935 INFO L273 TraceCheckUtils]: 89: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,935 INFO L273 TraceCheckUtils]: 90: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,935 INFO L273 TraceCheckUtils]: 91: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,936 INFO L273 TraceCheckUtils]: 92: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,936 INFO L273 TraceCheckUtils]: 93: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:46,936 INFO L273 TraceCheckUtils]: 94: Hoare triple {10623#false} assume !(~i~0 < 100000); {10623#false} is VALID [2018-11-23 12:04:46,936 INFO L273 TraceCheckUtils]: 95: Hoare triple {10623#false} havoc ~x~0;~x~0 := 0; {10623#false} is VALID [2018-11-23 12:04:46,936 INFO L273 TraceCheckUtils]: 96: Hoare triple {10623#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10623#false} is VALID [2018-11-23 12:04:46,937 INFO L256 TraceCheckUtils]: 97: Hoare triple {10623#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {10623#false} is VALID [2018-11-23 12:04:46,937 INFO L273 TraceCheckUtils]: 98: Hoare triple {10623#false} ~cond := #in~cond; {10623#false} is VALID [2018-11-23 12:04:46,937 INFO L273 TraceCheckUtils]: 99: Hoare triple {10623#false} assume 0 == ~cond; {10623#false} is VALID [2018-11-23 12:04:46,937 INFO L273 TraceCheckUtils]: 100: Hoare triple {10623#false} assume !false; {10623#false} is VALID [2018-11-23 12:04:46,946 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 12:04:46,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:46,946 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:04:46,956 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:04:47,021 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:04:47,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:04:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:47,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:04:47,258 INFO L256 TraceCheckUtils]: 0: Hoare triple {10622#true} call ULTIMATE.init(); {10622#true} is VALID [2018-11-23 12:04:47,258 INFO L273 TraceCheckUtils]: 1: Hoare triple {10622#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10622#true} is VALID [2018-11-23 12:04:47,259 INFO L273 TraceCheckUtils]: 2: Hoare triple {10622#true} assume true; {10622#true} is VALID [2018-11-23 12:04:47,259 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10622#true} {10622#true} #100#return; {10622#true} is VALID [2018-11-23 12:04:47,259 INFO L256 TraceCheckUtils]: 4: Hoare triple {10622#true} call #t~ret2 := main(); {10622#true} is VALID [2018-11-23 12:04:47,260 INFO L273 TraceCheckUtils]: 5: Hoare triple {10622#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10659#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:47,260 INFO L273 TraceCheckUtils]: 6: Hoare triple {10659#(<= 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; {10625#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:47,261 INFO L273 TraceCheckUtils]: 7: Hoare triple {10625#(<= 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; {10626#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:47,261 INFO L273 TraceCheckUtils]: 8: Hoare triple {10626#(<= 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; {10627#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:47,262 INFO L273 TraceCheckUtils]: 9: Hoare triple {10627#(<= 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; {10628#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:47,263 INFO L273 TraceCheckUtils]: 10: Hoare triple {10628#(<= 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; {10629#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:47,264 INFO L273 TraceCheckUtils]: 11: Hoare triple {10629#(<= 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; {10630#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:47,264 INFO L273 TraceCheckUtils]: 12: Hoare triple {10630#(<= 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; {10631#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:47,265 INFO L273 TraceCheckUtils]: 13: Hoare triple {10631#(<= 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; {10632#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:47,266 INFO L273 TraceCheckUtils]: 14: Hoare triple {10632#(<= 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; {10633#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:47,267 INFO L273 TraceCheckUtils]: 15: Hoare triple {10633#(<= 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; {10634#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:47,268 INFO L273 TraceCheckUtils]: 16: Hoare triple {10634#(<= 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; {10635#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:47,269 INFO L273 TraceCheckUtils]: 17: Hoare triple {10635#(<= 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; {10636#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:47,270 INFO L273 TraceCheckUtils]: 18: Hoare triple {10636#(<= 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; {10637#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:47,271 INFO L273 TraceCheckUtils]: 19: Hoare triple {10637#(<= 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; {10638#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:47,272 INFO L273 TraceCheckUtils]: 20: Hoare triple {10638#(<= 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; {10639#(<= main_~i~0 15)} is VALID [2018-11-23 12:04:47,273 INFO L273 TraceCheckUtils]: 21: Hoare triple {10639#(<= 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; {10640#(<= main_~i~0 16)} is VALID [2018-11-23 12:04:47,273 INFO L273 TraceCheckUtils]: 22: Hoare triple {10640#(<= main_~i~0 16)} assume !(~i~0 < 100000); {10623#false} is VALID [2018-11-23 12:04:47,274 INFO L273 TraceCheckUtils]: 23: Hoare triple {10623#false} ~i~0 := 0; {10623#false} is VALID [2018-11-23 12:04:47,274 INFO L273 TraceCheckUtils]: 24: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,274 INFO L273 TraceCheckUtils]: 25: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,274 INFO L273 TraceCheckUtils]: 26: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,275 INFO L273 TraceCheckUtils]: 27: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,275 INFO L273 TraceCheckUtils]: 28: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,275 INFO L273 TraceCheckUtils]: 29: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,275 INFO L273 TraceCheckUtils]: 30: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,275 INFO L273 TraceCheckUtils]: 31: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,275 INFO L273 TraceCheckUtils]: 32: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,276 INFO L273 TraceCheckUtils]: 33: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,276 INFO L273 TraceCheckUtils]: 34: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,276 INFO L273 TraceCheckUtils]: 35: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,276 INFO L273 TraceCheckUtils]: 36: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,276 INFO L273 TraceCheckUtils]: 37: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,277 INFO L273 TraceCheckUtils]: 38: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,277 INFO L273 TraceCheckUtils]: 39: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,277 INFO L273 TraceCheckUtils]: 40: Hoare triple {10623#false} assume !(~i~0 < 100000); {10623#false} is VALID [2018-11-23 12:04:47,277 INFO L273 TraceCheckUtils]: 41: Hoare triple {10623#false} ~i~0 := 0; {10623#false} is VALID [2018-11-23 12:04:47,277 INFO L273 TraceCheckUtils]: 42: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,277 INFO L273 TraceCheckUtils]: 43: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,277 INFO L273 TraceCheckUtils]: 44: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,278 INFO L273 TraceCheckUtils]: 45: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,278 INFO L273 TraceCheckUtils]: 46: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,278 INFO L273 TraceCheckUtils]: 47: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,278 INFO L273 TraceCheckUtils]: 48: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,278 INFO L273 TraceCheckUtils]: 49: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,278 INFO L273 TraceCheckUtils]: 50: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,278 INFO L273 TraceCheckUtils]: 51: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,278 INFO L273 TraceCheckUtils]: 52: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,278 INFO L273 TraceCheckUtils]: 53: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,279 INFO L273 TraceCheckUtils]: 54: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,279 INFO L273 TraceCheckUtils]: 55: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,279 INFO L273 TraceCheckUtils]: 56: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,279 INFO L273 TraceCheckUtils]: 57: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,279 INFO L273 TraceCheckUtils]: 58: Hoare triple {10623#false} assume !(~i~0 < 100000); {10623#false} is VALID [2018-11-23 12:04:47,279 INFO L273 TraceCheckUtils]: 59: Hoare triple {10623#false} ~i~0 := 0; {10623#false} is VALID [2018-11-23 12:04:47,279 INFO L273 TraceCheckUtils]: 60: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,279 INFO L273 TraceCheckUtils]: 61: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,279 INFO L273 TraceCheckUtils]: 62: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,280 INFO L273 TraceCheckUtils]: 63: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,280 INFO L273 TraceCheckUtils]: 64: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,280 INFO L273 TraceCheckUtils]: 65: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,280 INFO L273 TraceCheckUtils]: 66: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,280 INFO L273 TraceCheckUtils]: 67: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,280 INFO L273 TraceCheckUtils]: 68: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,280 INFO L273 TraceCheckUtils]: 69: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,280 INFO L273 TraceCheckUtils]: 70: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,280 INFO L273 TraceCheckUtils]: 71: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,281 INFO L273 TraceCheckUtils]: 72: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,281 INFO L273 TraceCheckUtils]: 73: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,281 INFO L273 TraceCheckUtils]: 74: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,281 INFO L273 TraceCheckUtils]: 75: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,281 INFO L273 TraceCheckUtils]: 76: Hoare triple {10623#false} assume !(~i~0 < 100000); {10623#false} is VALID [2018-11-23 12:04:47,281 INFO L273 TraceCheckUtils]: 77: Hoare triple {10623#false} ~i~0 := 0; {10623#false} is VALID [2018-11-23 12:04:47,281 INFO L273 TraceCheckUtils]: 78: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,281 INFO L273 TraceCheckUtils]: 79: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,282 INFO L273 TraceCheckUtils]: 80: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,282 INFO L273 TraceCheckUtils]: 81: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,282 INFO L273 TraceCheckUtils]: 82: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,282 INFO L273 TraceCheckUtils]: 83: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,282 INFO L273 TraceCheckUtils]: 84: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,282 INFO L273 TraceCheckUtils]: 85: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,282 INFO L273 TraceCheckUtils]: 86: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,282 INFO L273 TraceCheckUtils]: 87: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,282 INFO L273 TraceCheckUtils]: 88: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,283 INFO L273 TraceCheckUtils]: 89: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,283 INFO L273 TraceCheckUtils]: 90: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,283 INFO L273 TraceCheckUtils]: 91: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,283 INFO L273 TraceCheckUtils]: 92: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,283 INFO L273 TraceCheckUtils]: 93: Hoare triple {10623#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10623#false} is VALID [2018-11-23 12:04:47,283 INFO L273 TraceCheckUtils]: 94: Hoare triple {10623#false} assume !(~i~0 < 100000); {10623#false} is VALID [2018-11-23 12:04:47,283 INFO L273 TraceCheckUtils]: 95: Hoare triple {10623#false} havoc ~x~0;~x~0 := 0; {10623#false} is VALID [2018-11-23 12:04:47,283 INFO L273 TraceCheckUtils]: 96: Hoare triple {10623#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10623#false} is VALID [2018-11-23 12:04:47,283 INFO L256 TraceCheckUtils]: 97: Hoare triple {10623#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {10623#false} is VALID [2018-11-23 12:04:47,284 INFO L273 TraceCheckUtils]: 98: Hoare triple {10623#false} ~cond := #in~cond; {10623#false} is VALID [2018-11-23 12:04:47,284 INFO L273 TraceCheckUtils]: 99: Hoare triple {10623#false} assume 0 == ~cond; {10623#false} is VALID [2018-11-23 12:04:47,284 INFO L273 TraceCheckUtils]: 100: Hoare triple {10623#false} assume !false; {10623#false} is VALID [2018-11-23 12:04:47,288 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 12:04:47,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:04:47,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 12:04:47,308 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 101 [2018-11-23 12:04:47,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:47,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:04:47,342 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:47,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:04:47,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:04:47,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:04:47,344 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 20 states. [2018-11-23 12:04:48,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:48,308 INFO L93 Difference]: Finished difference Result 194 states and 208 transitions. [2018-11-23 12:04:48,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:04:48,308 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 101 [2018-11-23 12:04:48,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:48,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:04:48,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 144 transitions. [2018-11-23 12:04:48,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:04:48,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 144 transitions. [2018-11-23 12:04:48,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 144 transitions. [2018-11-23 12:04:48,463 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:48,466 INFO L225 Difference]: With dead ends: 194 [2018-11-23 12:04:48,466 INFO L226 Difference]: Without dead ends: 111 [2018-11-23 12:04:48,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:04:48,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-23 12:04:48,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-11-23 12:04:48,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:48,566 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 111 states. [2018-11-23 12:04:48,566 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 111 states. [2018-11-23 12:04:48,566 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 111 states. [2018-11-23 12:04:48,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:48,568 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2018-11-23 12:04:48,568 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2018-11-23 12:04:48,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:48,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:48,569 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 111 states. [2018-11-23 12:04:48,569 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 111 states. [2018-11-23 12:04:48,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:48,571 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2018-11-23 12:04:48,571 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2018-11-23 12:04:48,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:48,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:48,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:48,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:48,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-23 12:04:48,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 116 transitions. [2018-11-23 12:04:48,573 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 116 transitions. Word has length 101 [2018-11-23 12:04:48,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:48,573 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 116 transitions. [2018-11-23 12:04:48,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:04:48,574 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2018-11-23 12:04:48,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-23 12:04:48,574 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:48,574 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 12:04:48,575 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:48,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:48,575 INFO L82 PathProgramCache]: Analyzing trace with hash 855925908, now seen corresponding path program 17 times [2018-11-23 12:04:48,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:48,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:48,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:48,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:04:48,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:49,189 INFO L256 TraceCheckUtils]: 0: Hoare triple {11736#true} call ULTIMATE.init(); {11736#true} is VALID [2018-11-23 12:04:49,189 INFO L273 TraceCheckUtils]: 1: Hoare triple {11736#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11736#true} is VALID [2018-11-23 12:04:49,189 INFO L273 TraceCheckUtils]: 2: Hoare triple {11736#true} assume true; {11736#true} is VALID [2018-11-23 12:04:49,190 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11736#true} {11736#true} #100#return; {11736#true} is VALID [2018-11-23 12:04:49,190 INFO L256 TraceCheckUtils]: 4: Hoare triple {11736#true} call #t~ret2 := main(); {11736#true} is VALID [2018-11-23 12:04:49,190 INFO L273 TraceCheckUtils]: 5: Hoare triple {11736#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11738#(= main_~i~0 0)} is VALID [2018-11-23 12:04:49,191 INFO L273 TraceCheckUtils]: 6: Hoare triple {11738#(= 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; {11739#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:49,192 INFO L273 TraceCheckUtils]: 7: Hoare triple {11739#(<= 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; {11740#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:49,192 INFO L273 TraceCheckUtils]: 8: Hoare triple {11740#(<= 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; {11741#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:49,193 INFO L273 TraceCheckUtils]: 9: Hoare triple {11741#(<= 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; {11742#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:49,194 INFO L273 TraceCheckUtils]: 10: Hoare triple {11742#(<= 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; {11743#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:49,195 INFO L273 TraceCheckUtils]: 11: Hoare triple {11743#(<= 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; {11744#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:49,196 INFO L273 TraceCheckUtils]: 12: Hoare triple {11744#(<= 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; {11745#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:49,196 INFO L273 TraceCheckUtils]: 13: Hoare triple {11745#(<= 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; {11746#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:49,197 INFO L273 TraceCheckUtils]: 14: Hoare triple {11746#(<= 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; {11747#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:49,198 INFO L273 TraceCheckUtils]: 15: Hoare triple {11747#(<= 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; {11748#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:49,199 INFO L273 TraceCheckUtils]: 16: Hoare triple {11748#(<= 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; {11749#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:49,200 INFO L273 TraceCheckUtils]: 17: Hoare triple {11749#(<= 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; {11750#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:49,201 INFO L273 TraceCheckUtils]: 18: Hoare triple {11750#(<= 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; {11751#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:49,202 INFO L273 TraceCheckUtils]: 19: Hoare triple {11751#(<= 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; {11752#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:49,203 INFO L273 TraceCheckUtils]: 20: Hoare triple {11752#(<= 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; {11753#(<= main_~i~0 15)} is VALID [2018-11-23 12:04:49,204 INFO L273 TraceCheckUtils]: 21: Hoare triple {11753#(<= 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; {11754#(<= main_~i~0 16)} is VALID [2018-11-23 12:04:49,205 INFO L273 TraceCheckUtils]: 22: Hoare triple {11754#(<= 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; {11755#(<= main_~i~0 17)} is VALID [2018-11-23 12:04:49,205 INFO L273 TraceCheckUtils]: 23: Hoare triple {11755#(<= main_~i~0 17)} assume !(~i~0 < 100000); {11737#false} is VALID [2018-11-23 12:04:49,206 INFO L273 TraceCheckUtils]: 24: Hoare triple {11737#false} ~i~0 := 0; {11737#false} is VALID [2018-11-23 12:04:49,206 INFO L273 TraceCheckUtils]: 25: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,206 INFO L273 TraceCheckUtils]: 26: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,206 INFO L273 TraceCheckUtils]: 27: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,206 INFO L273 TraceCheckUtils]: 28: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,207 INFO L273 TraceCheckUtils]: 29: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,207 INFO L273 TraceCheckUtils]: 30: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,207 INFO L273 TraceCheckUtils]: 31: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,207 INFO L273 TraceCheckUtils]: 32: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,207 INFO L273 TraceCheckUtils]: 33: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,208 INFO L273 TraceCheckUtils]: 34: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,208 INFO L273 TraceCheckUtils]: 35: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,208 INFO L273 TraceCheckUtils]: 36: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,208 INFO L273 TraceCheckUtils]: 37: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,208 INFO L273 TraceCheckUtils]: 38: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,209 INFO L273 TraceCheckUtils]: 39: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,209 INFO L273 TraceCheckUtils]: 40: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,209 INFO L273 TraceCheckUtils]: 41: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,209 INFO L273 TraceCheckUtils]: 42: Hoare triple {11737#false} assume !(~i~0 < 100000); {11737#false} is VALID [2018-11-23 12:04:49,209 INFO L273 TraceCheckUtils]: 43: Hoare triple {11737#false} ~i~0 := 0; {11737#false} is VALID [2018-11-23 12:04:49,210 INFO L273 TraceCheckUtils]: 44: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,210 INFO L273 TraceCheckUtils]: 45: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,210 INFO L273 TraceCheckUtils]: 46: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,210 INFO L273 TraceCheckUtils]: 47: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,210 INFO L273 TraceCheckUtils]: 48: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,210 INFO L273 TraceCheckUtils]: 49: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,210 INFO L273 TraceCheckUtils]: 50: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,210 INFO L273 TraceCheckUtils]: 51: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,210 INFO L273 TraceCheckUtils]: 52: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,211 INFO L273 TraceCheckUtils]: 53: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,211 INFO L273 TraceCheckUtils]: 54: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,211 INFO L273 TraceCheckUtils]: 55: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,211 INFO L273 TraceCheckUtils]: 56: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,211 INFO L273 TraceCheckUtils]: 57: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,211 INFO L273 TraceCheckUtils]: 58: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,211 INFO L273 TraceCheckUtils]: 59: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,211 INFO L273 TraceCheckUtils]: 60: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,212 INFO L273 TraceCheckUtils]: 61: Hoare triple {11737#false} assume !(~i~0 < 100000); {11737#false} is VALID [2018-11-23 12:04:49,212 INFO L273 TraceCheckUtils]: 62: Hoare triple {11737#false} ~i~0 := 0; {11737#false} is VALID [2018-11-23 12:04:49,212 INFO L273 TraceCheckUtils]: 63: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,212 INFO L273 TraceCheckUtils]: 64: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,212 INFO L273 TraceCheckUtils]: 65: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,212 INFO L273 TraceCheckUtils]: 66: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,212 INFO L273 TraceCheckUtils]: 67: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,212 INFO L273 TraceCheckUtils]: 68: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,212 INFO L273 TraceCheckUtils]: 69: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,213 INFO L273 TraceCheckUtils]: 70: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,213 INFO L273 TraceCheckUtils]: 71: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,213 INFO L273 TraceCheckUtils]: 72: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,213 INFO L273 TraceCheckUtils]: 73: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,213 INFO L273 TraceCheckUtils]: 74: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,213 INFO L273 TraceCheckUtils]: 75: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,213 INFO L273 TraceCheckUtils]: 76: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,213 INFO L273 TraceCheckUtils]: 77: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,213 INFO L273 TraceCheckUtils]: 78: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,214 INFO L273 TraceCheckUtils]: 79: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,214 INFO L273 TraceCheckUtils]: 80: Hoare triple {11737#false} assume !(~i~0 < 100000); {11737#false} is VALID [2018-11-23 12:04:49,214 INFO L273 TraceCheckUtils]: 81: Hoare triple {11737#false} ~i~0 := 0; {11737#false} is VALID [2018-11-23 12:04:49,214 INFO L273 TraceCheckUtils]: 82: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,214 INFO L273 TraceCheckUtils]: 83: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,214 INFO L273 TraceCheckUtils]: 84: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,214 INFO L273 TraceCheckUtils]: 85: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,214 INFO L273 TraceCheckUtils]: 86: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,214 INFO L273 TraceCheckUtils]: 87: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,215 INFO L273 TraceCheckUtils]: 88: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,215 INFO L273 TraceCheckUtils]: 89: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,215 INFO L273 TraceCheckUtils]: 90: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,215 INFO L273 TraceCheckUtils]: 91: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,215 INFO L273 TraceCheckUtils]: 92: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,215 INFO L273 TraceCheckUtils]: 93: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,215 INFO L273 TraceCheckUtils]: 94: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,215 INFO L273 TraceCheckUtils]: 95: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,215 INFO L273 TraceCheckUtils]: 96: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,216 INFO L273 TraceCheckUtils]: 97: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,216 INFO L273 TraceCheckUtils]: 98: Hoare triple {11737#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11737#false} is VALID [2018-11-23 12:04:49,216 INFO L273 TraceCheckUtils]: 99: Hoare triple {11737#false} assume !(~i~0 < 100000); {11737#false} is VALID [2018-11-23 12:04:49,216 INFO L273 TraceCheckUtils]: 100: Hoare triple {11737#false} havoc ~x~0;~x~0 := 0; {11737#false} is VALID [2018-11-23 12:04:49,216 INFO L273 TraceCheckUtils]: 101: Hoare triple {11737#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11737#false} is VALID [2018-11-23 12:04:49,216 INFO L256 TraceCheckUtils]: 102: Hoare triple {11737#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {11737#false} is VALID [2018-11-23 12:04:49,216 INFO L273 TraceCheckUtils]: 103: Hoare triple {11737#false} ~cond := #in~cond; {11737#false} is VALID [2018-11-23 12:04:49,216 INFO L273 TraceCheckUtils]: 104: Hoare triple {11737#false} assume 0 == ~cond; {11737#false} is VALID [2018-11-23 12:04:49,216 INFO L273 TraceCheckUtils]: 105: Hoare triple {11737#false} assume !false; {11737#false} is VALID [2018-11-23 12:04:49,221 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 12:04:49,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:49,221 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:04:49,232 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:06:04,561 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-23 12:06:04,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:04,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:04,786 INFO L256 TraceCheckUtils]: 0: Hoare triple {11736#true} call ULTIMATE.init(); {11736#true} is VALID [2018-11-23 12:06:04,786 INFO L273 TraceCheckUtils]: 1: Hoare triple {11736#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11736#true} is VALID [2018-11-23 12:06:04,787 INFO L273 TraceCheckUtils]: 2: Hoare triple {11736#true} assume true; {11736#true} is VALID [2018-11-23 12:06:04,787 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11736#true} {11736#true} #100#return; {11736#true} is VALID [2018-11-23 12:06:04,787 INFO L256 TraceCheckUtils]: 4: Hoare triple {11736#true} call #t~ret2 := main(); {11736#true} is VALID [2018-11-23 12:06:04,787 INFO L273 TraceCheckUtils]: 5: Hoare triple {11736#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11736#true} is VALID [2018-11-23 12:06:04,787 INFO L273 TraceCheckUtils]: 6: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,788 INFO L273 TraceCheckUtils]: 7: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,788 INFO L273 TraceCheckUtils]: 8: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,788 INFO L273 TraceCheckUtils]: 9: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,788 INFO L273 TraceCheckUtils]: 10: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,788 INFO L273 TraceCheckUtils]: 11: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,789 INFO L273 TraceCheckUtils]: 12: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,789 INFO L273 TraceCheckUtils]: 13: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,789 INFO L273 TraceCheckUtils]: 14: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,789 INFO L273 TraceCheckUtils]: 15: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,789 INFO L273 TraceCheckUtils]: 16: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,789 INFO L273 TraceCheckUtils]: 17: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,789 INFO L273 TraceCheckUtils]: 18: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,789 INFO L273 TraceCheckUtils]: 19: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,789 INFO L273 TraceCheckUtils]: 20: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,790 INFO L273 TraceCheckUtils]: 21: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,790 INFO L273 TraceCheckUtils]: 22: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,790 INFO L273 TraceCheckUtils]: 23: Hoare triple {11736#true} assume !(~i~0 < 100000); {11736#true} is VALID [2018-11-23 12:06:04,790 INFO L273 TraceCheckUtils]: 24: Hoare triple {11736#true} ~i~0 := 0; {11736#true} is VALID [2018-11-23 12:06:04,790 INFO L273 TraceCheckUtils]: 25: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,790 INFO L273 TraceCheckUtils]: 26: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,790 INFO L273 TraceCheckUtils]: 27: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,790 INFO L273 TraceCheckUtils]: 28: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,790 INFO L273 TraceCheckUtils]: 29: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,791 INFO L273 TraceCheckUtils]: 30: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,791 INFO L273 TraceCheckUtils]: 31: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,791 INFO L273 TraceCheckUtils]: 32: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,791 INFO L273 TraceCheckUtils]: 33: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,791 INFO L273 TraceCheckUtils]: 34: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,791 INFO L273 TraceCheckUtils]: 35: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,791 INFO L273 TraceCheckUtils]: 36: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,791 INFO L273 TraceCheckUtils]: 37: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,791 INFO L273 TraceCheckUtils]: 38: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,792 INFO L273 TraceCheckUtils]: 39: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,792 INFO L273 TraceCheckUtils]: 40: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,792 INFO L273 TraceCheckUtils]: 41: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,792 INFO L273 TraceCheckUtils]: 42: Hoare triple {11736#true} assume !(~i~0 < 100000); {11736#true} is VALID [2018-11-23 12:06:04,792 INFO L273 TraceCheckUtils]: 43: Hoare triple {11736#true} ~i~0 := 0; {11736#true} is VALID [2018-11-23 12:06:04,792 INFO L273 TraceCheckUtils]: 44: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,792 INFO L273 TraceCheckUtils]: 45: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,792 INFO L273 TraceCheckUtils]: 46: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,792 INFO L273 TraceCheckUtils]: 47: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,793 INFO L273 TraceCheckUtils]: 48: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,793 INFO L273 TraceCheckUtils]: 49: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,793 INFO L273 TraceCheckUtils]: 50: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,793 INFO L273 TraceCheckUtils]: 51: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,793 INFO L273 TraceCheckUtils]: 52: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,793 INFO L273 TraceCheckUtils]: 53: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,793 INFO L273 TraceCheckUtils]: 54: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,793 INFO L273 TraceCheckUtils]: 55: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,794 INFO L273 TraceCheckUtils]: 56: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,794 INFO L273 TraceCheckUtils]: 57: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,794 INFO L273 TraceCheckUtils]: 58: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,794 INFO L273 TraceCheckUtils]: 59: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,794 INFO L273 TraceCheckUtils]: 60: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,794 INFO L273 TraceCheckUtils]: 61: Hoare triple {11736#true} assume !(~i~0 < 100000); {11736#true} is VALID [2018-11-23 12:06:04,794 INFO L273 TraceCheckUtils]: 62: Hoare triple {11736#true} ~i~0 := 0; {11736#true} is VALID [2018-11-23 12:06:04,794 INFO L273 TraceCheckUtils]: 63: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,794 INFO L273 TraceCheckUtils]: 64: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,795 INFO L273 TraceCheckUtils]: 65: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,795 INFO L273 TraceCheckUtils]: 66: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,795 INFO L273 TraceCheckUtils]: 67: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,795 INFO L273 TraceCheckUtils]: 68: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,795 INFO L273 TraceCheckUtils]: 69: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,795 INFO L273 TraceCheckUtils]: 70: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,795 INFO L273 TraceCheckUtils]: 71: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,795 INFO L273 TraceCheckUtils]: 72: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,795 INFO L273 TraceCheckUtils]: 73: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,796 INFO L273 TraceCheckUtils]: 74: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,796 INFO L273 TraceCheckUtils]: 75: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,796 INFO L273 TraceCheckUtils]: 76: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,796 INFO L273 TraceCheckUtils]: 77: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,796 INFO L273 TraceCheckUtils]: 78: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,796 INFO L273 TraceCheckUtils]: 79: Hoare triple {11736#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11736#true} is VALID [2018-11-23 12:06:04,796 INFO L273 TraceCheckUtils]: 80: Hoare triple {11736#true} assume !(~i~0 < 100000); {11736#true} is VALID [2018-11-23 12:06:04,801 INFO L273 TraceCheckUtils]: 81: Hoare triple {11736#true} ~i~0 := 0; {12002#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:04,801 INFO L273 TraceCheckUtils]: 82: Hoare triple {12002#(<= 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; {11739#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:04,802 INFO L273 TraceCheckUtils]: 83: Hoare triple {11739#(<= 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; {11740#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:04,802 INFO L273 TraceCheckUtils]: 84: Hoare triple {11740#(<= 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; {11741#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:04,803 INFO L273 TraceCheckUtils]: 85: Hoare triple {11741#(<= 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; {11742#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:04,804 INFO L273 TraceCheckUtils]: 86: Hoare triple {11742#(<= 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; {11743#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:04,804 INFO L273 TraceCheckUtils]: 87: Hoare triple {11743#(<= 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; {11744#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:04,805 INFO L273 TraceCheckUtils]: 88: Hoare triple {11744#(<= 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; {11745#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:04,806 INFO L273 TraceCheckUtils]: 89: Hoare triple {11745#(<= 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; {11746#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:04,807 INFO L273 TraceCheckUtils]: 90: Hoare triple {11746#(<= 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; {11747#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:04,808 INFO L273 TraceCheckUtils]: 91: Hoare triple {11747#(<= 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; {11748#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:04,809 INFO L273 TraceCheckUtils]: 92: Hoare triple {11748#(<= 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; {11749#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:04,810 INFO L273 TraceCheckUtils]: 93: Hoare triple {11749#(<= 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; {11750#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:04,811 INFO L273 TraceCheckUtils]: 94: Hoare triple {11750#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11751#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:04,812 INFO L273 TraceCheckUtils]: 95: Hoare triple {11751#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11752#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:04,813 INFO L273 TraceCheckUtils]: 96: Hoare triple {11752#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11753#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:04,814 INFO L273 TraceCheckUtils]: 97: Hoare triple {11753#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11754#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:04,815 INFO L273 TraceCheckUtils]: 98: Hoare triple {11754#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11755#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:04,815 INFO L273 TraceCheckUtils]: 99: Hoare triple {11755#(<= main_~i~0 17)} assume !(~i~0 < 100000); {11737#false} is VALID [2018-11-23 12:06:04,815 INFO L273 TraceCheckUtils]: 100: Hoare triple {11737#false} havoc ~x~0;~x~0 := 0; {11737#false} is VALID [2018-11-23 12:06:04,816 INFO L273 TraceCheckUtils]: 101: Hoare triple {11737#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11737#false} is VALID [2018-11-23 12:06:04,816 INFO L256 TraceCheckUtils]: 102: Hoare triple {11737#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {11737#false} is VALID [2018-11-23 12:06:04,816 INFO L273 TraceCheckUtils]: 103: Hoare triple {11737#false} ~cond := #in~cond; {11737#false} is VALID [2018-11-23 12:06:04,816 INFO L273 TraceCheckUtils]: 104: Hoare triple {11737#false} assume 0 == ~cond; {11737#false} is VALID [2018-11-23 12:06:04,816 INFO L273 TraceCheckUtils]: 105: Hoare triple {11737#false} assume !false; {11737#false} is VALID [2018-11-23 12:06:04,822 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 12:06:04,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:04,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 12:06:04,857 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 106 [2018-11-23 12:06:04,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:04,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 12:06:04,929 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:04,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 12:06:04,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 12:06:04,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:06:04,931 INFO L87 Difference]: Start difference. First operand 111 states and 116 transitions. Second operand 21 states. [2018-11-23 12:06:05,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:05,653 INFO L93 Difference]: Finished difference Result 203 states and 217 transitions. [2018-11-23 12:06:05,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 12:06:05,653 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 106 [2018-11-23 12:06:05,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:05,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:06:05,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 149 transitions. [2018-11-23 12:06:05,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:06:05,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 149 transitions. [2018-11-23 12:06:05,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 149 transitions. [2018-11-23 12:06:05,813 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:05,815 INFO L225 Difference]: With dead ends: 203 [2018-11-23 12:06:05,816 INFO L226 Difference]: Without dead ends: 116 [2018-11-23 12:06:05,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:06:05,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-23 12:06:05,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-11-23 12:06:05,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:05,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand 116 states. [2018-11-23 12:06:05,897 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 116 states. [2018-11-23 12:06:05,897 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 116 states. [2018-11-23 12:06:05,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:05,899 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-11-23 12:06:05,899 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 121 transitions. [2018-11-23 12:06:05,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:05,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:05,900 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 116 states. [2018-11-23 12:06:05,900 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 116 states. [2018-11-23 12:06:05,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:05,902 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-11-23 12:06:05,902 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 121 transitions. [2018-11-23 12:06:05,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:05,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:05,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:05,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:05,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-23 12:06:05,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 121 transitions. [2018-11-23 12:06:05,905 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 121 transitions. Word has length 106 [2018-11-23 12:06:05,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:05,905 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 121 transitions. [2018-11-23 12:06:05,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 12:06:05,905 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 121 transitions. [2018-11-23 12:06:05,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-23 12:06:05,906 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:05,907 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:05,907 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:05,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:05,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1813726594, now seen corresponding path program 18 times [2018-11-23 12:06:05,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:05,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:05,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:05,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:05,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:06,321 INFO L256 TraceCheckUtils]: 0: Hoare triple {12904#true} call ULTIMATE.init(); {12904#true} is VALID [2018-11-23 12:06:06,321 INFO L273 TraceCheckUtils]: 1: Hoare triple {12904#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12904#true} is VALID [2018-11-23 12:06:06,321 INFO L273 TraceCheckUtils]: 2: Hoare triple {12904#true} assume true; {12904#true} is VALID [2018-11-23 12:06:06,322 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12904#true} {12904#true} #100#return; {12904#true} is VALID [2018-11-23 12:06:06,322 INFO L256 TraceCheckUtils]: 4: Hoare triple {12904#true} call #t~ret2 := main(); {12904#true} is VALID [2018-11-23 12:06:06,322 INFO L273 TraceCheckUtils]: 5: Hoare triple {12904#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12906#(= main_~i~0 0)} is VALID [2018-11-23 12:06:06,323 INFO L273 TraceCheckUtils]: 6: Hoare triple {12906#(= 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; {12907#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:06,324 INFO L273 TraceCheckUtils]: 7: Hoare triple {12907#(<= 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; {12908#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:06,325 INFO L273 TraceCheckUtils]: 8: Hoare triple {12908#(<= 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; {12909#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:06,325 INFO L273 TraceCheckUtils]: 9: Hoare triple {12909#(<= 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; {12910#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:06,326 INFO L273 TraceCheckUtils]: 10: Hoare triple {12910#(<= 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; {12911#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:06,327 INFO L273 TraceCheckUtils]: 11: Hoare triple {12911#(<= 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; {12912#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:06,328 INFO L273 TraceCheckUtils]: 12: Hoare triple {12912#(<= 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; {12913#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:06,328 INFO L273 TraceCheckUtils]: 13: Hoare triple {12913#(<= 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; {12914#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:06,329 INFO L273 TraceCheckUtils]: 14: Hoare triple {12914#(<= 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; {12915#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:06,330 INFO L273 TraceCheckUtils]: 15: Hoare triple {12915#(<= 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; {12916#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:06,331 INFO L273 TraceCheckUtils]: 16: Hoare triple {12916#(<= 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; {12917#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:06,332 INFO L273 TraceCheckUtils]: 17: Hoare triple {12917#(<= 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; {12918#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:06,333 INFO L273 TraceCheckUtils]: 18: Hoare triple {12918#(<= 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; {12919#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:06,334 INFO L273 TraceCheckUtils]: 19: Hoare triple {12919#(<= 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; {12920#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:06,335 INFO L273 TraceCheckUtils]: 20: Hoare triple {12920#(<= 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; {12921#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:06,336 INFO L273 TraceCheckUtils]: 21: Hoare triple {12921#(<= 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; {12922#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:06,337 INFO L273 TraceCheckUtils]: 22: Hoare triple {12922#(<= 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; {12923#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:06,338 INFO L273 TraceCheckUtils]: 23: Hoare triple {12923#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12924#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:06,338 INFO L273 TraceCheckUtils]: 24: Hoare triple {12924#(<= main_~i~0 18)} assume !(~i~0 < 100000); {12905#false} is VALID [2018-11-23 12:06:06,339 INFO L273 TraceCheckUtils]: 25: Hoare triple {12905#false} ~i~0 := 0; {12905#false} is VALID [2018-11-23 12:06:06,339 INFO L273 TraceCheckUtils]: 26: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,339 INFO L273 TraceCheckUtils]: 27: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,339 INFO L273 TraceCheckUtils]: 28: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,339 INFO L273 TraceCheckUtils]: 29: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,340 INFO L273 TraceCheckUtils]: 30: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,340 INFO L273 TraceCheckUtils]: 31: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,340 INFO L273 TraceCheckUtils]: 32: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,340 INFO L273 TraceCheckUtils]: 33: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,340 INFO L273 TraceCheckUtils]: 34: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,341 INFO L273 TraceCheckUtils]: 35: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,341 INFO L273 TraceCheckUtils]: 36: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,341 INFO L273 TraceCheckUtils]: 37: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,341 INFO L273 TraceCheckUtils]: 38: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,341 INFO L273 TraceCheckUtils]: 39: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,342 INFO L273 TraceCheckUtils]: 40: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,342 INFO L273 TraceCheckUtils]: 41: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,342 INFO L273 TraceCheckUtils]: 42: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,342 INFO L273 TraceCheckUtils]: 43: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,342 INFO L273 TraceCheckUtils]: 44: Hoare triple {12905#false} assume !(~i~0 < 100000); {12905#false} is VALID [2018-11-23 12:06:06,342 INFO L273 TraceCheckUtils]: 45: Hoare triple {12905#false} ~i~0 := 0; {12905#false} is VALID [2018-11-23 12:06:06,343 INFO L273 TraceCheckUtils]: 46: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,343 INFO L273 TraceCheckUtils]: 47: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,343 INFO L273 TraceCheckUtils]: 48: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,343 INFO L273 TraceCheckUtils]: 49: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,343 INFO L273 TraceCheckUtils]: 50: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,344 INFO L273 TraceCheckUtils]: 51: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,344 INFO L273 TraceCheckUtils]: 52: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,344 INFO L273 TraceCheckUtils]: 53: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,344 INFO L273 TraceCheckUtils]: 54: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,344 INFO L273 TraceCheckUtils]: 55: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,344 INFO L273 TraceCheckUtils]: 56: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,344 INFO L273 TraceCheckUtils]: 57: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,344 INFO L273 TraceCheckUtils]: 58: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,344 INFO L273 TraceCheckUtils]: 59: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,345 INFO L273 TraceCheckUtils]: 60: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,345 INFO L273 TraceCheckUtils]: 61: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,345 INFO L273 TraceCheckUtils]: 62: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,345 INFO L273 TraceCheckUtils]: 63: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,345 INFO L273 TraceCheckUtils]: 64: Hoare triple {12905#false} assume !(~i~0 < 100000); {12905#false} is VALID [2018-11-23 12:06:06,345 INFO L273 TraceCheckUtils]: 65: Hoare triple {12905#false} ~i~0 := 0; {12905#false} is VALID [2018-11-23 12:06:06,345 INFO L273 TraceCheckUtils]: 66: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,345 INFO L273 TraceCheckUtils]: 67: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,345 INFO L273 TraceCheckUtils]: 68: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,346 INFO L273 TraceCheckUtils]: 69: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,346 INFO L273 TraceCheckUtils]: 70: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,346 INFO L273 TraceCheckUtils]: 71: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,346 INFO L273 TraceCheckUtils]: 72: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,346 INFO L273 TraceCheckUtils]: 73: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,346 INFO L273 TraceCheckUtils]: 74: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,346 INFO L273 TraceCheckUtils]: 75: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,346 INFO L273 TraceCheckUtils]: 76: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,347 INFO L273 TraceCheckUtils]: 77: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,347 INFO L273 TraceCheckUtils]: 78: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,347 INFO L273 TraceCheckUtils]: 79: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,347 INFO L273 TraceCheckUtils]: 80: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,347 INFO L273 TraceCheckUtils]: 81: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,347 INFO L273 TraceCheckUtils]: 82: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,347 INFO L273 TraceCheckUtils]: 83: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,347 INFO L273 TraceCheckUtils]: 84: Hoare triple {12905#false} assume !(~i~0 < 100000); {12905#false} is VALID [2018-11-23 12:06:06,347 INFO L273 TraceCheckUtils]: 85: Hoare triple {12905#false} ~i~0 := 0; {12905#false} is VALID [2018-11-23 12:06:06,348 INFO L273 TraceCheckUtils]: 86: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,348 INFO L273 TraceCheckUtils]: 87: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,348 INFO L273 TraceCheckUtils]: 88: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,348 INFO L273 TraceCheckUtils]: 89: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,348 INFO L273 TraceCheckUtils]: 90: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,348 INFO L273 TraceCheckUtils]: 91: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,348 INFO L273 TraceCheckUtils]: 92: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,348 INFO L273 TraceCheckUtils]: 93: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,348 INFO L273 TraceCheckUtils]: 94: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,349 INFO L273 TraceCheckUtils]: 95: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,349 INFO L273 TraceCheckUtils]: 96: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,349 INFO L273 TraceCheckUtils]: 97: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,349 INFO L273 TraceCheckUtils]: 98: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,349 INFO L273 TraceCheckUtils]: 99: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,349 INFO L273 TraceCheckUtils]: 100: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,349 INFO L273 TraceCheckUtils]: 101: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,349 INFO L273 TraceCheckUtils]: 102: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,349 INFO L273 TraceCheckUtils]: 103: Hoare triple {12905#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12905#false} is VALID [2018-11-23 12:06:06,350 INFO L273 TraceCheckUtils]: 104: Hoare triple {12905#false} assume !(~i~0 < 100000); {12905#false} is VALID [2018-11-23 12:06:06,350 INFO L273 TraceCheckUtils]: 105: Hoare triple {12905#false} havoc ~x~0;~x~0 := 0; {12905#false} is VALID [2018-11-23 12:06:06,350 INFO L273 TraceCheckUtils]: 106: Hoare triple {12905#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12905#false} is VALID [2018-11-23 12:06:06,350 INFO L256 TraceCheckUtils]: 107: Hoare triple {12905#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {12905#false} is VALID [2018-11-23 12:06:06,350 INFO L273 TraceCheckUtils]: 108: Hoare triple {12905#false} ~cond := #in~cond; {12905#false} is VALID [2018-11-23 12:06:06,350 INFO L273 TraceCheckUtils]: 109: Hoare triple {12905#false} assume 0 == ~cond; {12905#false} is VALID [2018-11-23 12:06:06,350 INFO L273 TraceCheckUtils]: 110: Hoare triple {12905#false} assume !false; {12905#false} is VALID [2018-11-23 12:06:06,355 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-23 12:06:06,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:06,355 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:06,366 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE