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_copyInitSum2_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:54:46,500 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:54:46,506 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:54:46,526 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:54:46,527 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:54:46,528 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:54:46,529 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:54:46,531 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:54:46,533 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:54:46,533 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:54:46,534 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:54:46,535 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:54:46,537 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:54:46,538 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:54:46,540 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:54:46,540 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:54:46,541 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:54:46,543 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:54:46,546 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:54:46,547 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:54:46,548 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:54:46,553 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:54:46,556 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:54:46,556 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:54:46,556 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:54:46,557 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:54:46,558 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:54:46,559 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:54:46,560 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:54:46,561 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:54:46,561 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:54:46,562 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:54:46,562 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:54:46,562 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:54:46,563 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:54:46,564 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:54:46,564 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 11:54:46,590 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:54:46,591 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:54:46,592 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:54:46,592 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:54:46,592 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:54:46,593 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:54:46,593 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:54:46,593 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:54:46,593 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:54:46,593 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:54:46,597 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:54:46,597 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:54:46,597 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:54:46,597 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:54:46,597 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:54:46,598 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:54:46,598 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:54:46,598 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:54:46,598 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:54:46,598 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:54:46,599 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:54:46,599 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:54:46,599 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:54:46,599 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:54:46,599 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:54:46,600 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:54:46,601 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:54:46,601 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:54:46,601 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:54:46,601 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:54:46,601 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:54:46,655 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:54:46,675 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:54:46,680 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:54:46,682 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:54:46,683 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:54:46,684 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copyInitSum2_false-unreach-call_ground.i [2018-11-23 11:54:46,763 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ac4cd1fa/023c5cc961f947dbbd9adf01a4c12562/FLAG82add1982 [2018-11-23 11:54:47,267 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:54:47,268 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copyInitSum2_false-unreach-call_ground.i [2018-11-23 11:54:47,275 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ac4cd1fa/023c5cc961f947dbbd9adf01a4c12562/FLAG82add1982 [2018-11-23 11:54:47,595 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ac4cd1fa/023c5cc961f947dbbd9adf01a4c12562 [2018-11-23 11:54:47,606 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:54:47,607 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:54:47,609 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:54:47,609 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:54:47,613 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:54:47,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:54:47" (1/1) ... [2018-11-23 11:54:47,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70d2abb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:47, skipping insertion in model container [2018-11-23 11:54:47,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:54:47" (1/1) ... [2018-11-23 11:54:47,631 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:54:47,657 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:54:47,899 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:54:47,905 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:54:47,937 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:54:47,968 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:54:47,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:47 WrapperNode [2018-11-23 11:54:47,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:54:47,970 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:54:47,970 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:54:47,970 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:54:47,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:47" (1/1) ... [2018-11-23 11:54:47,990 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:47" (1/1) ... [2018-11-23 11:54:47,998 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:54:47,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:54:47,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:54:47,999 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:54:48,007 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:47" (1/1) ... [2018-11-23 11:54:48,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:47" (1/1) ... [2018-11-23 11:54:48,009 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:47" (1/1) ... [2018-11-23 11:54:48,010 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:47" (1/1) ... [2018-11-23 11:54:48,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:47" (1/1) ... [2018-11-23 11:54:48,030 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:47" (1/1) ... [2018-11-23 11:54:48,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:47" (1/1) ... [2018-11-23 11:54:48,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:54:48,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:54:48,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:54:48,035 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:54:48,036 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:54:48,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:54:48,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:54:48,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:54:48,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:54:48,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:54:48,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:54:48,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:54:48,176 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:54:48,176 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:54:48,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:54:48,176 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:54:48,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:54:48,788 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:54:48,788 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 11:54:48,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:54:48 BoogieIcfgContainer [2018-11-23 11:54:48,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:54:48,790 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:54:48,790 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:54:48,794 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:54:48,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:54:47" (1/3) ... [2018-11-23 11:54:48,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b721b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:54:48, skipping insertion in model container [2018-11-23 11:54:48,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:47" (2/3) ... [2018-11-23 11:54:48,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b721b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:54:48, skipping insertion in model container [2018-11-23 11:54:48,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:54:48" (3/3) ... [2018-11-23 11:54:48,798 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copyInitSum2_false-unreach-call_ground.i [2018-11-23 11:54:48,807 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:54:48,815 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:54:48,834 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:54:48,866 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:54:48,867 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:54:48,867 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:54:48,867 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:54:48,867 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:54:48,868 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:54:48,868 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:54:48,868 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:54:48,868 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:54:48,885 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-23 11:54:48,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:54:48,892 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:48,893 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:48,896 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:48,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:48,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1001985310, now seen corresponding path program 1 times [2018-11-23 11:54:48,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:48,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:48,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:48,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:48,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:49,054 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-23 11:54:49,057 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32#true} is VALID [2018-11-23 11:54:49,058 INFO L273 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-23 11:54:49,059 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #76#return; {32#true} is VALID [2018-11-23 11:54:49,059 INFO L256 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2018-11-23 11:54:49,059 INFO L273 TraceCheckUtils]: 5: Hoare triple {32#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {32#true} is VALID [2018-11-23 11:54:49,077 INFO L273 TraceCheckUtils]: 6: Hoare triple {32#true} assume !true; {33#false} is VALID [2018-11-23 11:54:49,078 INFO L273 TraceCheckUtils]: 7: Hoare triple {33#false} ~i~0 := 0; {33#false} is VALID [2018-11-23 11:54:49,078 INFO L273 TraceCheckUtils]: 8: Hoare triple {33#false} assume !(~i~0 < 100000); {33#false} is VALID [2018-11-23 11:54:49,078 INFO L273 TraceCheckUtils]: 9: Hoare triple {33#false} ~i~0 := 0; {33#false} is VALID [2018-11-23 11:54:49,079 INFO L273 TraceCheckUtils]: 10: Hoare triple {33#false} assume !(~i~0 < 100000); {33#false} is VALID [2018-11-23 11:54:49,079 INFO L273 TraceCheckUtils]: 11: Hoare triple {33#false} havoc ~x~0;~x~0 := 0; {33#false} is VALID [2018-11-23 11:54:49,080 INFO L273 TraceCheckUtils]: 12: Hoare triple {33#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {33#false} is VALID [2018-11-23 11:54:49,080 INFO L256 TraceCheckUtils]: 13: Hoare triple {33#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {33#false} is VALID [2018-11-23 11:54:49,080 INFO L273 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2018-11-23 11:54:49,082 INFO L273 TraceCheckUtils]: 15: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2018-11-23 11:54:49,083 INFO L273 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-23 11:54:49,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:49,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:54:49,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:54:49,096 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 11:54:49,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:49,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:54:49,233 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:49,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:54:49,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:54:49,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:54:49,246 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-23 11:54:49,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:49,558 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2018-11-23 11:54:49,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:54:49,558 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 11:54:49,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:49,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:54:49,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 66 transitions. [2018-11-23 11:54:49,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:54:49,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 66 transitions. [2018-11-23 11:54:49,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 66 transitions. [2018-11-23 11:54:49,762 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 11:54:49,775 INFO L225 Difference]: With dead ends: 51 [2018-11-23 11:54:49,775 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 11:54:49,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:54:49,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 11:54:49,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 11:54:49,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:49,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-23 11:54:49,866 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 11:54:49,867 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 11:54:49,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:49,872 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-23 11:54:49,872 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 11:54:49,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:49,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:49,873 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 11:54:49,873 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 11:54:49,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:49,877 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-23 11:54:49,878 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 11:54:49,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:49,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:49,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:49,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:49,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:54:49,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-23 11:54:49,883 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2018-11-23 11:54:49,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:49,884 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-23 11:54:49,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:54:49,884 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 11:54:49,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:54:49,885 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:49,885 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:49,886 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:49,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:49,886 INFO L82 PathProgramCache]: Analyzing trace with hash -400143846, now seen corresponding path program 1 times [2018-11-23 11:54:49,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:49,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:49,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:49,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:49,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:49,973 INFO L256 TraceCheckUtils]: 0: Hoare triple {184#true} call ULTIMATE.init(); {184#true} is VALID [2018-11-23 11:54:49,973 INFO L273 TraceCheckUtils]: 1: Hoare triple {184#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {184#true} is VALID [2018-11-23 11:54:49,974 INFO L273 TraceCheckUtils]: 2: Hoare triple {184#true} assume true; {184#true} is VALID [2018-11-23 11:54:49,974 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {184#true} {184#true} #76#return; {184#true} is VALID [2018-11-23 11:54:49,974 INFO L256 TraceCheckUtils]: 4: Hoare triple {184#true} call #t~ret6 := main(); {184#true} is VALID [2018-11-23 11:54:49,975 INFO L273 TraceCheckUtils]: 5: Hoare triple {184#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {186#(= main_~i~0 0)} is VALID [2018-11-23 11:54:49,979 INFO L273 TraceCheckUtils]: 6: Hoare triple {186#(= main_~i~0 0)} assume !(~i~0 < 100000); {185#false} is VALID [2018-11-23 11:54:49,979 INFO L273 TraceCheckUtils]: 7: Hoare triple {185#false} ~i~0 := 0; {185#false} is VALID [2018-11-23 11:54:49,979 INFO L273 TraceCheckUtils]: 8: Hoare triple {185#false} assume !(~i~0 < 100000); {185#false} is VALID [2018-11-23 11:54:49,980 INFO L273 TraceCheckUtils]: 9: Hoare triple {185#false} ~i~0 := 0; {185#false} is VALID [2018-11-23 11:54:49,980 INFO L273 TraceCheckUtils]: 10: Hoare triple {185#false} assume !(~i~0 < 100000); {185#false} is VALID [2018-11-23 11:54:49,980 INFO L273 TraceCheckUtils]: 11: Hoare triple {185#false} havoc ~x~0;~x~0 := 0; {185#false} is VALID [2018-11-23 11:54:49,981 INFO L273 TraceCheckUtils]: 12: Hoare triple {185#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {185#false} is VALID [2018-11-23 11:54:49,981 INFO L256 TraceCheckUtils]: 13: Hoare triple {185#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {185#false} is VALID [2018-11-23 11:54:49,981 INFO L273 TraceCheckUtils]: 14: Hoare triple {185#false} ~cond := #in~cond; {185#false} is VALID [2018-11-23 11:54:49,982 INFO L273 TraceCheckUtils]: 15: Hoare triple {185#false} assume 0 == ~cond; {185#false} is VALID [2018-11-23 11:54:49,982 INFO L273 TraceCheckUtils]: 16: Hoare triple {185#false} assume !false; {185#false} is VALID [2018-11-23 11:54:49,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:49,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:54:49,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:54:49,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 11:54:49,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:49,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:54:50,045 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:50,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:54:50,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:54:50,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:54:50,046 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 3 states. [2018-11-23 11:54:50,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:50,222 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 11:54:50,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:54:50,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 11:54:50,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:50,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:54:50,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 11:54:50,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:54:50,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 11:54:50,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2018-11-23 11:54:50,438 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:50,440 INFO L225 Difference]: With dead ends: 46 [2018-11-23 11:54:50,441 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 11:54:50,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:54:50,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 11:54:50,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-23 11:54:50,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:50,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 27 states. [2018-11-23 11:54:50,643 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 27 states. [2018-11-23 11:54:50,643 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 27 states. [2018-11-23 11:54:50,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:50,646 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-23 11:54:50,646 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 11:54:50,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:50,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:50,647 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 29 states. [2018-11-23 11:54:50,647 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 29 states. [2018-11-23 11:54:50,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:50,650 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-23 11:54:50,650 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 11:54:50,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:50,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:50,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:50,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:50,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:54:50,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-23 11:54:50,654 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 17 [2018-11-23 11:54:50,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:50,654 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-23 11:54:50,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:54:50,655 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 11:54:50,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:54:50,656 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:50,656 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:50,656 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:50,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:50,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1150570790, now seen corresponding path program 1 times [2018-11-23 11:54:50,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:50,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:50,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:50,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:50,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:50,783 INFO L256 TraceCheckUtils]: 0: Hoare triple {351#true} call ULTIMATE.init(); {351#true} is VALID [2018-11-23 11:54:50,784 INFO L273 TraceCheckUtils]: 1: Hoare triple {351#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {351#true} is VALID [2018-11-23 11:54:50,784 INFO L273 TraceCheckUtils]: 2: Hoare triple {351#true} assume true; {351#true} is VALID [2018-11-23 11:54:50,784 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {351#true} {351#true} #76#return; {351#true} is VALID [2018-11-23 11:54:50,784 INFO L256 TraceCheckUtils]: 4: Hoare triple {351#true} call #t~ret6 := main(); {351#true} is VALID [2018-11-23 11:54:50,785 INFO L273 TraceCheckUtils]: 5: Hoare triple {351#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {353#(= main_~i~0 0)} is VALID [2018-11-23 11:54:50,786 INFO L273 TraceCheckUtils]: 6: Hoare triple {353#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {354#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:50,786 INFO L273 TraceCheckUtils]: 7: Hoare triple {354#(<= main_~i~0 1)} assume !(~i~0 < 100000); {352#false} is VALID [2018-11-23 11:54:50,787 INFO L273 TraceCheckUtils]: 8: Hoare triple {352#false} ~i~0 := 0; {352#false} is VALID [2018-11-23 11:54:50,787 INFO L273 TraceCheckUtils]: 9: Hoare triple {352#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {352#false} is VALID [2018-11-23 11:54:50,787 INFO L273 TraceCheckUtils]: 10: Hoare triple {352#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {352#false} is VALID [2018-11-23 11:54:50,787 INFO L273 TraceCheckUtils]: 11: Hoare triple {352#false} assume !(~i~0 < 100000); {352#false} is VALID [2018-11-23 11:54:50,788 INFO L273 TraceCheckUtils]: 12: Hoare triple {352#false} ~i~0 := 0; {352#false} is VALID [2018-11-23 11:54:50,788 INFO L273 TraceCheckUtils]: 13: Hoare triple {352#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {352#false} is VALID [2018-11-23 11:54:50,788 INFO L273 TraceCheckUtils]: 14: Hoare triple {352#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {352#false} is VALID [2018-11-23 11:54:50,789 INFO L273 TraceCheckUtils]: 15: Hoare triple {352#false} assume !(~i~0 < 100000); {352#false} is VALID [2018-11-23 11:54:50,789 INFO L273 TraceCheckUtils]: 16: Hoare triple {352#false} havoc ~x~0;~x~0 := 0; {352#false} is VALID [2018-11-23 11:54:50,789 INFO L273 TraceCheckUtils]: 17: Hoare triple {352#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {352#false} is VALID [2018-11-23 11:54:50,789 INFO L256 TraceCheckUtils]: 18: Hoare triple {352#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {352#false} is VALID [2018-11-23 11:54:50,789 INFO L273 TraceCheckUtils]: 19: Hoare triple {352#false} ~cond := #in~cond; {352#false} is VALID [2018-11-23 11:54:50,790 INFO L273 TraceCheckUtils]: 20: Hoare triple {352#false} assume 0 == ~cond; {352#false} is VALID [2018-11-23 11:54:50,790 INFO L273 TraceCheckUtils]: 21: Hoare triple {352#false} assume !false; {352#false} is VALID [2018-11-23 11:54:50,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:54:50,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:50,792 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:50,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:50,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:51,158 INFO L256 TraceCheckUtils]: 0: Hoare triple {351#true} call ULTIMATE.init(); {351#true} is VALID [2018-11-23 11:54:51,158 INFO L273 TraceCheckUtils]: 1: Hoare triple {351#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {351#true} is VALID [2018-11-23 11:54:51,159 INFO L273 TraceCheckUtils]: 2: Hoare triple {351#true} assume true; {351#true} is VALID [2018-11-23 11:54:51,159 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {351#true} {351#true} #76#return; {351#true} is VALID [2018-11-23 11:54:51,159 INFO L256 TraceCheckUtils]: 4: Hoare triple {351#true} call #t~ret6 := main(); {351#true} is VALID [2018-11-23 11:54:51,179 INFO L273 TraceCheckUtils]: 5: Hoare triple {351#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {373#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:51,196 INFO L273 TraceCheckUtils]: 6: Hoare triple {373#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {354#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:51,211 INFO L273 TraceCheckUtils]: 7: Hoare triple {354#(<= main_~i~0 1)} assume !(~i~0 < 100000); {352#false} is VALID [2018-11-23 11:54:51,211 INFO L273 TraceCheckUtils]: 8: Hoare triple {352#false} ~i~0 := 0; {352#false} is VALID [2018-11-23 11:54:51,212 INFO L273 TraceCheckUtils]: 9: Hoare triple {352#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {352#false} is VALID [2018-11-23 11:54:51,212 INFO L273 TraceCheckUtils]: 10: Hoare triple {352#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {352#false} is VALID [2018-11-23 11:54:51,212 INFO L273 TraceCheckUtils]: 11: Hoare triple {352#false} assume !(~i~0 < 100000); {352#false} is VALID [2018-11-23 11:54:51,213 INFO L273 TraceCheckUtils]: 12: Hoare triple {352#false} ~i~0 := 0; {352#false} is VALID [2018-11-23 11:54:51,213 INFO L273 TraceCheckUtils]: 13: Hoare triple {352#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {352#false} is VALID [2018-11-23 11:54:51,213 INFO L273 TraceCheckUtils]: 14: Hoare triple {352#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {352#false} is VALID [2018-11-23 11:54:51,213 INFO L273 TraceCheckUtils]: 15: Hoare triple {352#false} assume !(~i~0 < 100000); {352#false} is VALID [2018-11-23 11:54:51,214 INFO L273 TraceCheckUtils]: 16: Hoare triple {352#false} havoc ~x~0;~x~0 := 0; {352#false} is VALID [2018-11-23 11:54:51,214 INFO L273 TraceCheckUtils]: 17: Hoare triple {352#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {352#false} is VALID [2018-11-23 11:54:51,214 INFO L256 TraceCheckUtils]: 18: Hoare triple {352#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {352#false} is VALID [2018-11-23 11:54:51,214 INFO L273 TraceCheckUtils]: 19: Hoare triple {352#false} ~cond := #in~cond; {352#false} is VALID [2018-11-23 11:54:51,215 INFO L273 TraceCheckUtils]: 20: Hoare triple {352#false} assume 0 == ~cond; {352#false} is VALID [2018-11-23 11:54:51,215 INFO L273 TraceCheckUtils]: 21: Hoare triple {352#false} assume !false; {352#false} is VALID [2018-11-23 11:54:51,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:54:51,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:51,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 11:54:51,239 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-23 11:54:51,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:51,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:54:51,278 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:51,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:54:51,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:54:51,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:54:51,280 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 5 states. [2018-11-23 11:54:51,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:51,647 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2018-11-23 11:54:51,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:54:51,648 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-23 11:54:51,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:51,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:54:51,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2018-11-23 11:54:51,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:54:51,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2018-11-23 11:54:51,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 59 transitions. [2018-11-23 11:54:51,908 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:51,910 INFO L225 Difference]: With dead ends: 53 [2018-11-23 11:54:51,910 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 11:54:51,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:54:51,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 11:54:51,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-23 11:54:51,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:51,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2018-11-23 11:54:51,962 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2018-11-23 11:54:51,963 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2018-11-23 11:54:51,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:51,966 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-23 11:54:51,966 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-23 11:54:51,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:51,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:51,967 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2018-11-23 11:54:51,967 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2018-11-23 11:54:51,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:51,970 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-23 11:54:51,970 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-23 11:54:51,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:51,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:51,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:51,971 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:51,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:54:51,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-11-23 11:54:51,973 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 22 [2018-11-23 11:54:51,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:51,974 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-11-23 11:54:51,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:54:51,974 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-23 11:54:51,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 11:54:51,975 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:51,975 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:51,975 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:51,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:51,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1868122094, now seen corresponding path program 2 times [2018-11-23 11:54:51,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:51,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:51,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:51,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:51,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:52,122 INFO L256 TraceCheckUtils]: 0: Hoare triple {613#true} call ULTIMATE.init(); {613#true} is VALID [2018-11-23 11:54:52,122 INFO L273 TraceCheckUtils]: 1: Hoare triple {613#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {613#true} is VALID [2018-11-23 11:54:52,123 INFO L273 TraceCheckUtils]: 2: Hoare triple {613#true} assume true; {613#true} is VALID [2018-11-23 11:54:52,123 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {613#true} {613#true} #76#return; {613#true} is VALID [2018-11-23 11:54:52,123 INFO L256 TraceCheckUtils]: 4: Hoare triple {613#true} call #t~ret6 := main(); {613#true} is VALID [2018-11-23 11:54:52,125 INFO L273 TraceCheckUtils]: 5: Hoare triple {613#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {615#(= main_~i~0 0)} is VALID [2018-11-23 11:54:52,126 INFO L273 TraceCheckUtils]: 6: Hoare triple {615#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {616#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:52,127 INFO L273 TraceCheckUtils]: 7: Hoare triple {616#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {617#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:52,128 INFO L273 TraceCheckUtils]: 8: Hoare triple {617#(<= main_~i~0 2)} assume !(~i~0 < 100000); {614#false} is VALID [2018-11-23 11:54:52,128 INFO L273 TraceCheckUtils]: 9: Hoare triple {614#false} ~i~0 := 0; {614#false} is VALID [2018-11-23 11:54:52,129 INFO L273 TraceCheckUtils]: 10: Hoare triple {614#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {614#false} is VALID [2018-11-23 11:54:52,129 INFO L273 TraceCheckUtils]: 11: Hoare triple {614#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {614#false} is VALID [2018-11-23 11:54:52,130 INFO L273 TraceCheckUtils]: 12: Hoare triple {614#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {614#false} is VALID [2018-11-23 11:54:52,130 INFO L273 TraceCheckUtils]: 13: Hoare triple {614#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {614#false} is VALID [2018-11-23 11:54:52,130 INFO L273 TraceCheckUtils]: 14: Hoare triple {614#false} assume !(~i~0 < 100000); {614#false} is VALID [2018-11-23 11:54:52,131 INFO L273 TraceCheckUtils]: 15: Hoare triple {614#false} ~i~0 := 0; {614#false} is VALID [2018-11-23 11:54:52,131 INFO L273 TraceCheckUtils]: 16: Hoare triple {614#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {614#false} is VALID [2018-11-23 11:54:52,131 INFO L273 TraceCheckUtils]: 17: Hoare triple {614#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {614#false} is VALID [2018-11-23 11:54:52,132 INFO L273 TraceCheckUtils]: 18: Hoare triple {614#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {614#false} is VALID [2018-11-23 11:54:52,132 INFO L273 TraceCheckUtils]: 19: Hoare triple {614#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {614#false} is VALID [2018-11-23 11:54:52,132 INFO L273 TraceCheckUtils]: 20: Hoare triple {614#false} assume !(~i~0 < 100000); {614#false} is VALID [2018-11-23 11:54:52,132 INFO L273 TraceCheckUtils]: 21: Hoare triple {614#false} havoc ~x~0;~x~0 := 0; {614#false} is VALID [2018-11-23 11:54:52,132 INFO L273 TraceCheckUtils]: 22: Hoare triple {614#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {614#false} is VALID [2018-11-23 11:54:52,133 INFO L256 TraceCheckUtils]: 23: Hoare triple {614#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {614#false} is VALID [2018-11-23 11:54:52,133 INFO L273 TraceCheckUtils]: 24: Hoare triple {614#false} ~cond := #in~cond; {614#false} is VALID [2018-11-23 11:54:52,133 INFO L273 TraceCheckUtils]: 25: Hoare triple {614#false} assume 0 == ~cond; {614#false} is VALID [2018-11-23 11:54:52,133 INFO L273 TraceCheckUtils]: 26: Hoare triple {614#false} assume !false; {614#false} is VALID [2018-11-23 11:54:52,135 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 11:54:52,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:52,135 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:52,151 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:54:52,185 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:54:52,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:52,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:52,434 INFO L256 TraceCheckUtils]: 0: Hoare triple {613#true} call ULTIMATE.init(); {613#true} is VALID [2018-11-23 11:54:52,434 INFO L273 TraceCheckUtils]: 1: Hoare triple {613#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {613#true} is VALID [2018-11-23 11:54:52,434 INFO L273 TraceCheckUtils]: 2: Hoare triple {613#true} assume true; {613#true} is VALID [2018-11-23 11:54:52,435 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {613#true} {613#true} #76#return; {613#true} is VALID [2018-11-23 11:54:52,435 INFO L256 TraceCheckUtils]: 4: Hoare triple {613#true} call #t~ret6 := main(); {613#true} is VALID [2018-11-23 11:54:52,436 INFO L273 TraceCheckUtils]: 5: Hoare triple {613#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {613#true} is VALID [2018-11-23 11:54:52,436 INFO L273 TraceCheckUtils]: 6: Hoare triple {613#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {613#true} is VALID [2018-11-23 11:54:52,437 INFO L273 TraceCheckUtils]: 7: Hoare triple {613#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {613#true} is VALID [2018-11-23 11:54:52,437 INFO L273 TraceCheckUtils]: 8: Hoare triple {613#true} assume !(~i~0 < 100000); {613#true} is VALID [2018-11-23 11:54:52,437 INFO L273 TraceCheckUtils]: 9: Hoare triple {613#true} ~i~0 := 0; {613#true} is VALID [2018-11-23 11:54:52,438 INFO L273 TraceCheckUtils]: 10: Hoare triple {613#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {613#true} is VALID [2018-11-23 11:54:52,438 INFO L273 TraceCheckUtils]: 11: Hoare triple {613#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {613#true} is VALID [2018-11-23 11:54:52,438 INFO L273 TraceCheckUtils]: 12: Hoare triple {613#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {613#true} is VALID [2018-11-23 11:54:52,438 INFO L273 TraceCheckUtils]: 13: Hoare triple {613#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {613#true} is VALID [2018-11-23 11:54:52,439 INFO L273 TraceCheckUtils]: 14: Hoare triple {613#true} assume !(~i~0 < 100000); {613#true} is VALID [2018-11-23 11:54:52,440 INFO L273 TraceCheckUtils]: 15: Hoare triple {613#true} ~i~0 := 0; {666#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:52,455 INFO L273 TraceCheckUtils]: 16: Hoare triple {666#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {666#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:52,456 INFO L273 TraceCheckUtils]: 17: Hoare triple {666#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {616#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:52,457 INFO L273 TraceCheckUtils]: 18: Hoare triple {616#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {616#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:52,460 INFO L273 TraceCheckUtils]: 19: Hoare triple {616#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {617#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:52,462 INFO L273 TraceCheckUtils]: 20: Hoare triple {617#(<= main_~i~0 2)} assume !(~i~0 < 100000); {614#false} is VALID [2018-11-23 11:54:52,462 INFO L273 TraceCheckUtils]: 21: Hoare triple {614#false} havoc ~x~0;~x~0 := 0; {614#false} is VALID [2018-11-23 11:54:52,462 INFO L273 TraceCheckUtils]: 22: Hoare triple {614#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {614#false} is VALID [2018-11-23 11:54:52,463 INFO L256 TraceCheckUtils]: 23: Hoare triple {614#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {614#false} is VALID [2018-11-23 11:54:52,463 INFO L273 TraceCheckUtils]: 24: Hoare triple {614#false} ~cond := #in~cond; {614#false} is VALID [2018-11-23 11:54:52,463 INFO L273 TraceCheckUtils]: 25: Hoare triple {614#false} assume 0 == ~cond; {614#false} is VALID [2018-11-23 11:54:52,464 INFO L273 TraceCheckUtils]: 26: Hoare triple {614#false} assume !false; {614#false} is VALID [2018-11-23 11:54:52,465 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 11:54:52,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:52,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 11:54:52,485 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-23 11:54:52,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:52,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:54:52,536 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:52,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:54:52,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:54:52,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:54:52,538 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 6 states. [2018-11-23 11:54:52,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:52,747 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-23 11:54:52,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:54:52,748 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-23 11:54:52,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:52,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:54:52,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2018-11-23 11:54:52,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:54:52,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2018-11-23 11:54:52,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2018-11-23 11:54:52,904 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:52,907 INFO L225 Difference]: With dead ends: 62 [2018-11-23 11:54:52,907 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 11:54:52,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:54:52,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 11:54:52,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-23 11:54:52,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:52,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2018-11-23 11:54:52,929 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2018-11-23 11:54:52,929 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2018-11-23 11:54:52,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:52,932 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-23 11:54:52,932 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-23 11:54:52,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:52,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:52,933 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2018-11-23 11:54:52,933 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2018-11-23 11:54:52,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:52,936 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-23 11:54:52,936 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-23 11:54:52,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:52,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:52,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:52,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:52,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 11:54:52,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-11-23 11:54:52,940 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 27 [2018-11-23 11:54:52,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:52,940 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-11-23 11:54:52,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:54:52,940 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-23 11:54:52,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 11:54:52,941 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:52,942 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:52,942 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:52,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:52,942 INFO L82 PathProgramCache]: Analyzing trace with hash 150752210, now seen corresponding path program 3 times [2018-11-23 11:54:52,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:52,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:52,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:52,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:52,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:52,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:53,091 INFO L256 TraceCheckUtils]: 0: Hoare triple {923#true} call ULTIMATE.init(); {923#true} is VALID [2018-11-23 11:54:53,091 INFO L273 TraceCheckUtils]: 1: Hoare triple {923#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {923#true} is VALID [2018-11-23 11:54:53,091 INFO L273 TraceCheckUtils]: 2: Hoare triple {923#true} assume true; {923#true} is VALID [2018-11-23 11:54:53,091 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {923#true} {923#true} #76#return; {923#true} is VALID [2018-11-23 11:54:53,092 INFO L256 TraceCheckUtils]: 4: Hoare triple {923#true} call #t~ret6 := main(); {923#true} is VALID [2018-11-23 11:54:53,092 INFO L273 TraceCheckUtils]: 5: Hoare triple {923#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {925#(= main_~i~0 0)} is VALID [2018-11-23 11:54:53,093 INFO L273 TraceCheckUtils]: 6: Hoare triple {925#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {926#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:53,094 INFO L273 TraceCheckUtils]: 7: Hoare triple {926#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {927#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:53,095 INFO L273 TraceCheckUtils]: 8: Hoare triple {927#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {928#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:53,096 INFO L273 TraceCheckUtils]: 9: Hoare triple {928#(<= main_~i~0 3)} assume !(~i~0 < 100000); {924#false} is VALID [2018-11-23 11:54:53,097 INFO L273 TraceCheckUtils]: 10: Hoare triple {924#false} ~i~0 := 0; {924#false} is VALID [2018-11-23 11:54:53,097 INFO L273 TraceCheckUtils]: 11: Hoare triple {924#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {924#false} is VALID [2018-11-23 11:54:53,098 INFO L273 TraceCheckUtils]: 12: Hoare triple {924#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {924#false} is VALID [2018-11-23 11:54:53,098 INFO L273 TraceCheckUtils]: 13: Hoare triple {924#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {924#false} is VALID [2018-11-23 11:54:53,098 INFO L273 TraceCheckUtils]: 14: Hoare triple {924#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {924#false} is VALID [2018-11-23 11:54:53,099 INFO L273 TraceCheckUtils]: 15: Hoare triple {924#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {924#false} is VALID [2018-11-23 11:54:53,099 INFO L273 TraceCheckUtils]: 16: Hoare triple {924#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {924#false} is VALID [2018-11-23 11:54:53,099 INFO L273 TraceCheckUtils]: 17: Hoare triple {924#false} assume !(~i~0 < 100000); {924#false} is VALID [2018-11-23 11:54:53,100 INFO L273 TraceCheckUtils]: 18: Hoare triple {924#false} ~i~0 := 0; {924#false} is VALID [2018-11-23 11:54:53,100 INFO L273 TraceCheckUtils]: 19: Hoare triple {924#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {924#false} is VALID [2018-11-23 11:54:53,100 INFO L273 TraceCheckUtils]: 20: Hoare triple {924#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {924#false} is VALID [2018-11-23 11:54:53,101 INFO L273 TraceCheckUtils]: 21: Hoare triple {924#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {924#false} is VALID [2018-11-23 11:54:53,101 INFO L273 TraceCheckUtils]: 22: Hoare triple {924#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {924#false} is VALID [2018-11-23 11:54:53,101 INFO L273 TraceCheckUtils]: 23: Hoare triple {924#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {924#false} is VALID [2018-11-23 11:54:53,101 INFO L273 TraceCheckUtils]: 24: Hoare triple {924#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {924#false} is VALID [2018-11-23 11:54:53,102 INFO L273 TraceCheckUtils]: 25: Hoare triple {924#false} assume !(~i~0 < 100000); {924#false} is VALID [2018-11-23 11:54:53,102 INFO L273 TraceCheckUtils]: 26: Hoare triple {924#false} havoc ~x~0;~x~0 := 0; {924#false} is VALID [2018-11-23 11:54:53,102 INFO L273 TraceCheckUtils]: 27: Hoare triple {924#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {924#false} is VALID [2018-11-23 11:54:53,102 INFO L256 TraceCheckUtils]: 28: Hoare triple {924#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {924#false} is VALID [2018-11-23 11:54:53,102 INFO L273 TraceCheckUtils]: 29: Hoare triple {924#false} ~cond := #in~cond; {924#false} is VALID [2018-11-23 11:54:53,103 INFO L273 TraceCheckUtils]: 30: Hoare triple {924#false} assume 0 == ~cond; {924#false} is VALID [2018-11-23 11:54:53,103 INFO L273 TraceCheckUtils]: 31: Hoare triple {924#false} assume !false; {924#false} is VALID [2018-11-23 11:54:53,104 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 11:54:53,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:53,105 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:53,115 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:54:53,138 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:54:53,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:53,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:53,261 INFO L256 TraceCheckUtils]: 0: Hoare triple {923#true} call ULTIMATE.init(); {923#true} is VALID [2018-11-23 11:54:53,262 INFO L273 TraceCheckUtils]: 1: Hoare triple {923#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {923#true} is VALID [2018-11-23 11:54:53,262 INFO L273 TraceCheckUtils]: 2: Hoare triple {923#true} assume true; {923#true} is VALID [2018-11-23 11:54:53,262 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {923#true} {923#true} #76#return; {923#true} is VALID [2018-11-23 11:54:53,263 INFO L256 TraceCheckUtils]: 4: Hoare triple {923#true} call #t~ret6 := main(); {923#true} is VALID [2018-11-23 11:54:53,266 INFO L273 TraceCheckUtils]: 5: Hoare triple {923#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {947#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:53,267 INFO L273 TraceCheckUtils]: 6: Hoare triple {947#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {926#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:53,268 INFO L273 TraceCheckUtils]: 7: Hoare triple {926#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {927#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:53,269 INFO L273 TraceCheckUtils]: 8: Hoare triple {927#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {928#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:53,270 INFO L273 TraceCheckUtils]: 9: Hoare triple {928#(<= main_~i~0 3)} assume !(~i~0 < 100000); {924#false} is VALID [2018-11-23 11:54:53,270 INFO L273 TraceCheckUtils]: 10: Hoare triple {924#false} ~i~0 := 0; {924#false} is VALID [2018-11-23 11:54:53,270 INFO L273 TraceCheckUtils]: 11: Hoare triple {924#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {924#false} is VALID [2018-11-23 11:54:53,270 INFO L273 TraceCheckUtils]: 12: Hoare triple {924#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {924#false} is VALID [2018-11-23 11:54:53,271 INFO L273 TraceCheckUtils]: 13: Hoare triple {924#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {924#false} is VALID [2018-11-23 11:54:53,271 INFO L273 TraceCheckUtils]: 14: Hoare triple {924#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {924#false} is VALID [2018-11-23 11:54:53,272 INFO L273 TraceCheckUtils]: 15: Hoare triple {924#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {924#false} is VALID [2018-11-23 11:54:53,272 INFO L273 TraceCheckUtils]: 16: Hoare triple {924#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {924#false} is VALID [2018-11-23 11:54:53,272 INFO L273 TraceCheckUtils]: 17: Hoare triple {924#false} assume !(~i~0 < 100000); {924#false} is VALID [2018-11-23 11:54:53,273 INFO L273 TraceCheckUtils]: 18: Hoare triple {924#false} ~i~0 := 0; {924#false} is VALID [2018-11-23 11:54:53,273 INFO L273 TraceCheckUtils]: 19: Hoare triple {924#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {924#false} is VALID [2018-11-23 11:54:53,273 INFO L273 TraceCheckUtils]: 20: Hoare triple {924#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {924#false} is VALID [2018-11-23 11:54:53,273 INFO L273 TraceCheckUtils]: 21: Hoare triple {924#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {924#false} is VALID [2018-11-23 11:54:53,274 INFO L273 TraceCheckUtils]: 22: Hoare triple {924#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {924#false} is VALID [2018-11-23 11:54:53,274 INFO L273 TraceCheckUtils]: 23: Hoare triple {924#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {924#false} is VALID [2018-11-23 11:54:53,274 INFO L273 TraceCheckUtils]: 24: Hoare triple {924#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {924#false} is VALID [2018-11-23 11:54:53,274 INFO L273 TraceCheckUtils]: 25: Hoare triple {924#false} assume !(~i~0 < 100000); {924#false} is VALID [2018-11-23 11:54:53,274 INFO L273 TraceCheckUtils]: 26: Hoare triple {924#false} havoc ~x~0;~x~0 := 0; {924#false} is VALID [2018-11-23 11:54:53,275 INFO L273 TraceCheckUtils]: 27: Hoare triple {924#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {924#false} is VALID [2018-11-23 11:54:53,275 INFO L256 TraceCheckUtils]: 28: Hoare triple {924#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {924#false} is VALID [2018-11-23 11:54:53,275 INFO L273 TraceCheckUtils]: 29: Hoare triple {924#false} ~cond := #in~cond; {924#false} is VALID [2018-11-23 11:54:53,275 INFO L273 TraceCheckUtils]: 30: Hoare triple {924#false} assume 0 == ~cond; {924#false} is VALID [2018-11-23 11:54:53,276 INFO L273 TraceCheckUtils]: 31: Hoare triple {924#false} assume !false; {924#false} is VALID [2018-11-23 11:54:53,277 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 11:54:53,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:53,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 11:54:53,302 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-11-23 11:54:53,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:53,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:54:53,332 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:53,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:54:53,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:54:53,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:54:53,333 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 7 states. [2018-11-23 11:54:53,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:53,593 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-11-23 11:54:53,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:54:53,593 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-11-23 11:54:53,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:53,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:54:53,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2018-11-23 11:54:53,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:54:53,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2018-11-23 11:54:53,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2018-11-23 11:54:53,758 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:53,760 INFO L225 Difference]: With dead ends: 71 [2018-11-23 11:54:53,761 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 11:54:53,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:54:53,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 11:54:53,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-11-23 11:54:53,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:53,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2018-11-23 11:54:53,789 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2018-11-23 11:54:53,789 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2018-11-23 11:54:53,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:53,791 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-11-23 11:54:53,792 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-11-23 11:54:53,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:53,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:53,793 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2018-11-23 11:54:53,793 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2018-11-23 11:54:53,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:53,796 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-11-23 11:54:53,796 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-11-23 11:54:53,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:53,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:53,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:53,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:53,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:54:53,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-11-23 11:54:53,799 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 32 [2018-11-23 11:54:53,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:53,800 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-11-23 11:54:53,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:54:53,800 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-11-23 11:54:53,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 11:54:53,801 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:53,801 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:53,802 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:53,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:53,802 INFO L82 PathProgramCache]: Analyzing trace with hash -125121014, now seen corresponding path program 4 times [2018-11-23 11:54:53,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:53,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:53,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:53,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:53,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:53,959 INFO L256 TraceCheckUtils]: 0: Hoare triple {1281#true} call ULTIMATE.init(); {1281#true} is VALID [2018-11-23 11:54:53,960 INFO L273 TraceCheckUtils]: 1: Hoare triple {1281#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1281#true} is VALID [2018-11-23 11:54:53,960 INFO L273 TraceCheckUtils]: 2: Hoare triple {1281#true} assume true; {1281#true} is VALID [2018-11-23 11:54:53,960 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1281#true} {1281#true} #76#return; {1281#true} is VALID [2018-11-23 11:54:53,961 INFO L256 TraceCheckUtils]: 4: Hoare triple {1281#true} call #t~ret6 := main(); {1281#true} is VALID [2018-11-23 11:54:53,981 INFO L273 TraceCheckUtils]: 5: Hoare triple {1281#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1283#(= main_~i~0 0)} is VALID [2018-11-23 11:54:53,995 INFO L273 TraceCheckUtils]: 6: Hoare triple {1283#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1284#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:54,004 INFO L273 TraceCheckUtils]: 7: Hoare triple {1284#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1285#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:54,009 INFO L273 TraceCheckUtils]: 8: Hoare triple {1285#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1286#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:54,011 INFO L273 TraceCheckUtils]: 9: Hoare triple {1286#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1287#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:54,012 INFO L273 TraceCheckUtils]: 10: Hoare triple {1287#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1282#false} is VALID [2018-11-23 11:54:54,012 INFO L273 TraceCheckUtils]: 11: Hoare triple {1282#false} ~i~0 := 0; {1282#false} is VALID [2018-11-23 11:54:54,013 INFO L273 TraceCheckUtils]: 12: Hoare triple {1282#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1282#false} is VALID [2018-11-23 11:54:54,013 INFO L273 TraceCheckUtils]: 13: Hoare triple {1282#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1282#false} is VALID [2018-11-23 11:54:54,013 INFO L273 TraceCheckUtils]: 14: Hoare triple {1282#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1282#false} is VALID [2018-11-23 11:54:54,013 INFO L273 TraceCheckUtils]: 15: Hoare triple {1282#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1282#false} is VALID [2018-11-23 11:54:54,013 INFO L273 TraceCheckUtils]: 16: Hoare triple {1282#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1282#false} is VALID [2018-11-23 11:54:54,014 INFO L273 TraceCheckUtils]: 17: Hoare triple {1282#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1282#false} is VALID [2018-11-23 11:54:54,014 INFO L273 TraceCheckUtils]: 18: Hoare triple {1282#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1282#false} is VALID [2018-11-23 11:54:54,014 INFO L273 TraceCheckUtils]: 19: Hoare triple {1282#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1282#false} is VALID [2018-11-23 11:54:54,014 INFO L273 TraceCheckUtils]: 20: Hoare triple {1282#false} assume !(~i~0 < 100000); {1282#false} is VALID [2018-11-23 11:54:54,014 INFO L273 TraceCheckUtils]: 21: Hoare triple {1282#false} ~i~0 := 0; {1282#false} is VALID [2018-11-23 11:54:54,014 INFO L273 TraceCheckUtils]: 22: Hoare triple {1282#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1282#false} is VALID [2018-11-23 11:54:54,015 INFO L273 TraceCheckUtils]: 23: Hoare triple {1282#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1282#false} is VALID [2018-11-23 11:54:54,015 INFO L273 TraceCheckUtils]: 24: Hoare triple {1282#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1282#false} is VALID [2018-11-23 11:54:54,015 INFO L273 TraceCheckUtils]: 25: Hoare triple {1282#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1282#false} is VALID [2018-11-23 11:54:54,015 INFO L273 TraceCheckUtils]: 26: Hoare triple {1282#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1282#false} is VALID [2018-11-23 11:54:54,016 INFO L273 TraceCheckUtils]: 27: Hoare triple {1282#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1282#false} is VALID [2018-11-23 11:54:54,016 INFO L273 TraceCheckUtils]: 28: Hoare triple {1282#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1282#false} is VALID [2018-11-23 11:54:54,016 INFO L273 TraceCheckUtils]: 29: Hoare triple {1282#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1282#false} is VALID [2018-11-23 11:54:54,017 INFO L273 TraceCheckUtils]: 30: Hoare triple {1282#false} assume !(~i~0 < 100000); {1282#false} is VALID [2018-11-23 11:54:54,017 INFO L273 TraceCheckUtils]: 31: Hoare triple {1282#false} havoc ~x~0;~x~0 := 0; {1282#false} is VALID [2018-11-23 11:54:54,017 INFO L273 TraceCheckUtils]: 32: Hoare triple {1282#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1282#false} is VALID [2018-11-23 11:54:54,017 INFO L256 TraceCheckUtils]: 33: Hoare triple {1282#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {1282#false} is VALID [2018-11-23 11:54:54,017 INFO L273 TraceCheckUtils]: 34: Hoare triple {1282#false} ~cond := #in~cond; {1282#false} is VALID [2018-11-23 11:54:54,018 INFO L273 TraceCheckUtils]: 35: Hoare triple {1282#false} assume 0 == ~cond; {1282#false} is VALID [2018-11-23 11:54:54,018 INFO L273 TraceCheckUtils]: 36: Hoare triple {1282#false} assume !false; {1282#false} is VALID [2018-11-23 11:54:54,020 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-23 11:54:54,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:54,021 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:54,031 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:54:54,078 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:54:54,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:54,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:54,261 INFO L256 TraceCheckUtils]: 0: Hoare triple {1281#true} call ULTIMATE.init(); {1281#true} is VALID [2018-11-23 11:54:54,261 INFO L273 TraceCheckUtils]: 1: Hoare triple {1281#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1281#true} is VALID [2018-11-23 11:54:54,261 INFO L273 TraceCheckUtils]: 2: Hoare triple {1281#true} assume true; {1281#true} is VALID [2018-11-23 11:54:54,262 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1281#true} {1281#true} #76#return; {1281#true} is VALID [2018-11-23 11:54:54,262 INFO L256 TraceCheckUtils]: 4: Hoare triple {1281#true} call #t~ret6 := main(); {1281#true} is VALID [2018-11-23 11:54:54,262 INFO L273 TraceCheckUtils]: 5: Hoare triple {1281#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1281#true} is VALID [2018-11-23 11:54:54,263 INFO L273 TraceCheckUtils]: 6: Hoare triple {1281#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1281#true} is VALID [2018-11-23 11:54:54,263 INFO L273 TraceCheckUtils]: 7: Hoare triple {1281#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1281#true} is VALID [2018-11-23 11:54:54,263 INFO L273 TraceCheckUtils]: 8: Hoare triple {1281#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1281#true} is VALID [2018-11-23 11:54:54,264 INFO L273 TraceCheckUtils]: 9: Hoare triple {1281#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1281#true} is VALID [2018-11-23 11:54:54,264 INFO L273 TraceCheckUtils]: 10: Hoare triple {1281#true} assume !(~i~0 < 100000); {1281#true} is VALID [2018-11-23 11:54:54,265 INFO L273 TraceCheckUtils]: 11: Hoare triple {1281#true} ~i~0 := 0; {1324#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:54,265 INFO L273 TraceCheckUtils]: 12: Hoare triple {1324#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1324#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:54,266 INFO L273 TraceCheckUtils]: 13: Hoare triple {1324#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1284#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:54,266 INFO L273 TraceCheckUtils]: 14: Hoare triple {1284#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1284#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:54,267 INFO L273 TraceCheckUtils]: 15: Hoare triple {1284#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1285#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:54,268 INFO L273 TraceCheckUtils]: 16: Hoare triple {1285#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1285#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:54,269 INFO L273 TraceCheckUtils]: 17: Hoare triple {1285#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1286#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:54,269 INFO L273 TraceCheckUtils]: 18: Hoare triple {1286#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1286#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:54,270 INFO L273 TraceCheckUtils]: 19: Hoare triple {1286#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1287#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:54,272 INFO L273 TraceCheckUtils]: 20: Hoare triple {1287#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1282#false} is VALID [2018-11-23 11:54:54,273 INFO L273 TraceCheckUtils]: 21: Hoare triple {1282#false} ~i~0 := 0; {1282#false} is VALID [2018-11-23 11:54:54,273 INFO L273 TraceCheckUtils]: 22: Hoare triple {1282#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1282#false} is VALID [2018-11-23 11:54:54,274 INFO L273 TraceCheckUtils]: 23: Hoare triple {1282#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1282#false} is VALID [2018-11-23 11:54:54,274 INFO L273 TraceCheckUtils]: 24: Hoare triple {1282#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1282#false} is VALID [2018-11-23 11:54:54,274 INFO L273 TraceCheckUtils]: 25: Hoare triple {1282#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1282#false} is VALID [2018-11-23 11:54:54,275 INFO L273 TraceCheckUtils]: 26: Hoare triple {1282#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1282#false} is VALID [2018-11-23 11:54:54,275 INFO L273 TraceCheckUtils]: 27: Hoare triple {1282#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1282#false} is VALID [2018-11-23 11:54:54,276 INFO L273 TraceCheckUtils]: 28: Hoare triple {1282#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1282#false} is VALID [2018-11-23 11:54:54,276 INFO L273 TraceCheckUtils]: 29: Hoare triple {1282#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1282#false} is VALID [2018-11-23 11:54:54,276 INFO L273 TraceCheckUtils]: 30: Hoare triple {1282#false} assume !(~i~0 < 100000); {1282#false} is VALID [2018-11-23 11:54:54,277 INFO L273 TraceCheckUtils]: 31: Hoare triple {1282#false} havoc ~x~0;~x~0 := 0; {1282#false} is VALID [2018-11-23 11:54:54,277 INFO L273 TraceCheckUtils]: 32: Hoare triple {1282#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1282#false} is VALID [2018-11-23 11:54:54,277 INFO L256 TraceCheckUtils]: 33: Hoare triple {1282#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {1282#false} is VALID [2018-11-23 11:54:54,277 INFO L273 TraceCheckUtils]: 34: Hoare triple {1282#false} ~cond := #in~cond; {1282#false} is VALID [2018-11-23 11:54:54,277 INFO L273 TraceCheckUtils]: 35: Hoare triple {1282#false} assume 0 == ~cond; {1282#false} is VALID [2018-11-23 11:54:54,278 INFO L273 TraceCheckUtils]: 36: Hoare triple {1282#false} assume !false; {1282#false} is VALID [2018-11-23 11:54:54,280 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 11:54:54,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:54,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 11:54:54,309 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-11-23 11:54:54,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:54,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:54:54,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:54,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:54:54,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:54:54,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:54:54,370 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 8 states. [2018-11-23 11:54:54,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:54,804 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-11-23 11:54:54,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:54:54,804 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-11-23 11:54:54,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:54,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:54:54,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2018-11-23 11:54:54,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:54:54,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2018-11-23 11:54:54,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 74 transitions. [2018-11-23 11:54:54,923 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:54,925 INFO L225 Difference]: With dead ends: 80 [2018-11-23 11:54:54,925 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 11:54:54,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:54:54,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 11:54:54,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-23 11:54:54,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:54,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 47 states. [2018-11-23 11:54:54,957 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 47 states. [2018-11-23 11:54:54,957 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 47 states. [2018-11-23 11:54:54,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:54,959 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-11-23 11:54:54,960 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-11-23 11:54:54,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:54,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:54,961 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 49 states. [2018-11-23 11:54:54,961 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 49 states. [2018-11-23 11:54:54,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:54,963 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-11-23 11:54:54,963 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-11-23 11:54:54,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:54,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:54,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:54,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:54,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 11:54:54,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-11-23 11:54:54,966 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 37 [2018-11-23 11:54:54,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:54,967 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-11-23 11:54:54,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:54:54,967 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-11-23 11:54:54,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 11:54:54,968 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:54,968 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:54,969 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:54,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:54,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1558523702, now seen corresponding path program 5 times [2018-11-23 11:54:54,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:54,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:54,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:54,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:54,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:55,145 INFO L256 TraceCheckUtils]: 0: Hoare triple {1687#true} call ULTIMATE.init(); {1687#true} is VALID [2018-11-23 11:54:55,145 INFO L273 TraceCheckUtils]: 1: Hoare triple {1687#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1687#true} is VALID [2018-11-23 11:54:55,145 INFO L273 TraceCheckUtils]: 2: Hoare triple {1687#true} assume true; {1687#true} is VALID [2018-11-23 11:54:55,145 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1687#true} {1687#true} #76#return; {1687#true} is VALID [2018-11-23 11:54:55,146 INFO L256 TraceCheckUtils]: 4: Hoare triple {1687#true} call #t~ret6 := main(); {1687#true} is VALID [2018-11-23 11:54:55,146 INFO L273 TraceCheckUtils]: 5: Hoare triple {1687#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1689#(= main_~i~0 0)} is VALID [2018-11-23 11:54:55,147 INFO L273 TraceCheckUtils]: 6: Hoare triple {1689#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1690#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:55,149 INFO L273 TraceCheckUtils]: 7: Hoare triple {1690#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1691#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:55,150 INFO L273 TraceCheckUtils]: 8: Hoare triple {1691#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1692#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:55,151 INFO L273 TraceCheckUtils]: 9: Hoare triple {1692#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1693#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:55,152 INFO L273 TraceCheckUtils]: 10: Hoare triple {1693#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1694#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:55,153 INFO L273 TraceCheckUtils]: 11: Hoare triple {1694#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1688#false} is VALID [2018-11-23 11:54:55,154 INFO L273 TraceCheckUtils]: 12: Hoare triple {1688#false} ~i~0 := 0; {1688#false} is VALID [2018-11-23 11:54:55,154 INFO L273 TraceCheckUtils]: 13: Hoare triple {1688#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1688#false} is VALID [2018-11-23 11:54:55,154 INFO L273 TraceCheckUtils]: 14: Hoare triple {1688#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1688#false} is VALID [2018-11-23 11:54:55,154 INFO L273 TraceCheckUtils]: 15: Hoare triple {1688#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1688#false} is VALID [2018-11-23 11:54:55,155 INFO L273 TraceCheckUtils]: 16: Hoare triple {1688#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1688#false} is VALID [2018-11-23 11:54:55,155 INFO L273 TraceCheckUtils]: 17: Hoare triple {1688#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1688#false} is VALID [2018-11-23 11:54:55,155 INFO L273 TraceCheckUtils]: 18: Hoare triple {1688#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1688#false} is VALID [2018-11-23 11:54:55,155 INFO L273 TraceCheckUtils]: 19: Hoare triple {1688#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1688#false} is VALID [2018-11-23 11:54:55,156 INFO L273 TraceCheckUtils]: 20: Hoare triple {1688#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1688#false} is VALID [2018-11-23 11:54:55,156 INFO L273 TraceCheckUtils]: 21: Hoare triple {1688#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1688#false} is VALID [2018-11-23 11:54:55,156 INFO L273 TraceCheckUtils]: 22: Hoare triple {1688#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1688#false} is VALID [2018-11-23 11:54:55,156 INFO L273 TraceCheckUtils]: 23: Hoare triple {1688#false} assume !(~i~0 < 100000); {1688#false} is VALID [2018-11-23 11:54:55,156 INFO L273 TraceCheckUtils]: 24: Hoare triple {1688#false} ~i~0 := 0; {1688#false} is VALID [2018-11-23 11:54:55,157 INFO L273 TraceCheckUtils]: 25: Hoare triple {1688#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1688#false} is VALID [2018-11-23 11:54:55,157 INFO L273 TraceCheckUtils]: 26: Hoare triple {1688#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1688#false} is VALID [2018-11-23 11:54:55,157 INFO L273 TraceCheckUtils]: 27: Hoare triple {1688#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1688#false} is VALID [2018-11-23 11:54:55,157 INFO L273 TraceCheckUtils]: 28: Hoare triple {1688#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1688#false} is VALID [2018-11-23 11:54:55,158 INFO L273 TraceCheckUtils]: 29: Hoare triple {1688#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1688#false} is VALID [2018-11-23 11:54:55,158 INFO L273 TraceCheckUtils]: 30: Hoare triple {1688#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1688#false} is VALID [2018-11-23 11:54:55,158 INFO L273 TraceCheckUtils]: 31: Hoare triple {1688#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1688#false} is VALID [2018-11-23 11:54:55,158 INFO L273 TraceCheckUtils]: 32: Hoare triple {1688#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1688#false} is VALID [2018-11-23 11:54:55,158 INFO L273 TraceCheckUtils]: 33: Hoare triple {1688#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1688#false} is VALID [2018-11-23 11:54:55,159 INFO L273 TraceCheckUtils]: 34: Hoare triple {1688#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1688#false} is VALID [2018-11-23 11:54:55,159 INFO L273 TraceCheckUtils]: 35: Hoare triple {1688#false} assume !(~i~0 < 100000); {1688#false} is VALID [2018-11-23 11:54:55,159 INFO L273 TraceCheckUtils]: 36: Hoare triple {1688#false} havoc ~x~0;~x~0 := 0; {1688#false} is VALID [2018-11-23 11:54:55,159 INFO L273 TraceCheckUtils]: 37: Hoare triple {1688#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1688#false} is VALID [2018-11-23 11:54:55,160 INFO L256 TraceCheckUtils]: 38: Hoare triple {1688#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {1688#false} is VALID [2018-11-23 11:54:55,160 INFO L273 TraceCheckUtils]: 39: Hoare triple {1688#false} ~cond := #in~cond; {1688#false} is VALID [2018-11-23 11:54:55,160 INFO L273 TraceCheckUtils]: 40: Hoare triple {1688#false} assume 0 == ~cond; {1688#false} is VALID [2018-11-23 11:54:55,160 INFO L273 TraceCheckUtils]: 41: Hoare triple {1688#false} assume !false; {1688#false} is VALID [2018-11-23 11:54:55,162 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-23 11:54:55,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:55,162 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:55,178 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:54:55,708 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 11:54:55,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:55,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:55,824 INFO L256 TraceCheckUtils]: 0: Hoare triple {1687#true} call ULTIMATE.init(); {1687#true} is VALID [2018-11-23 11:54:55,824 INFO L273 TraceCheckUtils]: 1: Hoare triple {1687#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1687#true} is VALID [2018-11-23 11:54:55,824 INFO L273 TraceCheckUtils]: 2: Hoare triple {1687#true} assume true; {1687#true} is VALID [2018-11-23 11:54:55,825 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1687#true} {1687#true} #76#return; {1687#true} is VALID [2018-11-23 11:54:55,825 INFO L256 TraceCheckUtils]: 4: Hoare triple {1687#true} call #t~ret6 := main(); {1687#true} is VALID [2018-11-23 11:54:55,825 INFO L273 TraceCheckUtils]: 5: Hoare triple {1687#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1687#true} is VALID [2018-11-23 11:54:55,825 INFO L273 TraceCheckUtils]: 6: Hoare triple {1687#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1687#true} is VALID [2018-11-23 11:54:55,825 INFO L273 TraceCheckUtils]: 7: Hoare triple {1687#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1687#true} is VALID [2018-11-23 11:54:55,826 INFO L273 TraceCheckUtils]: 8: Hoare triple {1687#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1687#true} is VALID [2018-11-23 11:54:55,826 INFO L273 TraceCheckUtils]: 9: Hoare triple {1687#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1687#true} is VALID [2018-11-23 11:54:55,826 INFO L273 TraceCheckUtils]: 10: Hoare triple {1687#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1687#true} is VALID [2018-11-23 11:54:55,826 INFO L273 TraceCheckUtils]: 11: Hoare triple {1687#true} assume !(~i~0 < 100000); {1687#true} is VALID [2018-11-23 11:54:55,826 INFO L273 TraceCheckUtils]: 12: Hoare triple {1687#true} ~i~0 := 0; {1687#true} is VALID [2018-11-23 11:54:55,827 INFO L273 TraceCheckUtils]: 13: Hoare triple {1687#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1687#true} is VALID [2018-11-23 11:54:55,827 INFO L273 TraceCheckUtils]: 14: Hoare triple {1687#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1687#true} is VALID [2018-11-23 11:54:55,827 INFO L273 TraceCheckUtils]: 15: Hoare triple {1687#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1687#true} is VALID [2018-11-23 11:54:55,827 INFO L273 TraceCheckUtils]: 16: Hoare triple {1687#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1687#true} is VALID [2018-11-23 11:54:55,828 INFO L273 TraceCheckUtils]: 17: Hoare triple {1687#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1687#true} is VALID [2018-11-23 11:54:55,828 INFO L273 TraceCheckUtils]: 18: Hoare triple {1687#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1687#true} is VALID [2018-11-23 11:54:55,828 INFO L273 TraceCheckUtils]: 19: Hoare triple {1687#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1687#true} is VALID [2018-11-23 11:54:55,828 INFO L273 TraceCheckUtils]: 20: Hoare triple {1687#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1687#true} is VALID [2018-11-23 11:54:55,829 INFO L273 TraceCheckUtils]: 21: Hoare triple {1687#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1687#true} is VALID [2018-11-23 11:54:55,829 INFO L273 TraceCheckUtils]: 22: Hoare triple {1687#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1687#true} is VALID [2018-11-23 11:54:55,829 INFO L273 TraceCheckUtils]: 23: Hoare triple {1687#true} assume !(~i~0 < 100000); {1687#true} is VALID [2018-11-23 11:54:55,835 INFO L273 TraceCheckUtils]: 24: Hoare triple {1687#true} ~i~0 := 0; {1770#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:55,835 INFO L273 TraceCheckUtils]: 25: Hoare triple {1770#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1770#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:55,836 INFO L273 TraceCheckUtils]: 26: Hoare triple {1770#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1690#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:55,836 INFO L273 TraceCheckUtils]: 27: Hoare triple {1690#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1690#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:55,837 INFO L273 TraceCheckUtils]: 28: Hoare triple {1690#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1691#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:55,837 INFO L273 TraceCheckUtils]: 29: Hoare triple {1691#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1691#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:55,838 INFO L273 TraceCheckUtils]: 30: Hoare triple {1691#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1692#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:55,838 INFO L273 TraceCheckUtils]: 31: Hoare triple {1692#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1692#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:55,839 INFO L273 TraceCheckUtils]: 32: Hoare triple {1692#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1693#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:55,839 INFO L273 TraceCheckUtils]: 33: Hoare triple {1693#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1693#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:55,840 INFO L273 TraceCheckUtils]: 34: Hoare triple {1693#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1694#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:55,841 INFO L273 TraceCheckUtils]: 35: Hoare triple {1694#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1688#false} is VALID [2018-11-23 11:54:55,841 INFO L273 TraceCheckUtils]: 36: Hoare triple {1688#false} havoc ~x~0;~x~0 := 0; {1688#false} is VALID [2018-11-23 11:54:55,841 INFO L273 TraceCheckUtils]: 37: Hoare triple {1688#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1688#false} is VALID [2018-11-23 11:54:55,842 INFO L256 TraceCheckUtils]: 38: Hoare triple {1688#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {1688#false} is VALID [2018-11-23 11:54:55,842 INFO L273 TraceCheckUtils]: 39: Hoare triple {1688#false} ~cond := #in~cond; {1688#false} is VALID [2018-11-23 11:54:55,842 INFO L273 TraceCheckUtils]: 40: Hoare triple {1688#false} assume 0 == ~cond; {1688#false} is VALID [2018-11-23 11:54:55,842 INFO L273 TraceCheckUtils]: 41: Hoare triple {1688#false} assume !false; {1688#false} is VALID [2018-11-23 11:54:55,846 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 11:54:55,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:55,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 11:54:55,867 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-11-23 11:54:55,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:55,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:54:56,012 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:56,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:54:56,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:54:56,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:54:56,014 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 9 states. [2018-11-23 11:54:56,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:56,607 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-11-23 11:54:56,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:54:56,607 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-11-23 11:54:56,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:56,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:54:56,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2018-11-23 11:54:56,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:54:56,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2018-11-23 11:54:56,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 79 transitions. [2018-11-23 11:54:56,734 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:56,735 INFO L225 Difference]: With dead ends: 89 [2018-11-23 11:54:56,736 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 11:54:56,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:54:56,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 11:54:56,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-11-23 11:54:56,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:56,774 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 52 states. [2018-11-23 11:54:56,774 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 52 states. [2018-11-23 11:54:56,774 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 52 states. [2018-11-23 11:54:56,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:56,777 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-11-23 11:54:56,777 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-11-23 11:54:56,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:56,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:56,778 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 54 states. [2018-11-23 11:54:56,778 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 54 states. [2018-11-23 11:54:56,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:56,780 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-11-23 11:54:56,780 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-11-23 11:54:56,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:56,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:56,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:56,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:56,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 11:54:56,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-11-23 11:54:56,783 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 42 [2018-11-23 11:54:56,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:56,784 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-11-23 11:54:56,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:54:56,784 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-23 11:54:56,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 11:54:56,785 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:56,785 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:56,785 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:56,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:56,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1349350398, now seen corresponding path program 6 times [2018-11-23 11:54:56,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:56,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:56,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:56,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:56,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:57,005 INFO L256 TraceCheckUtils]: 0: Hoare triple {2141#true} call ULTIMATE.init(); {2141#true} is VALID [2018-11-23 11:54:57,005 INFO L273 TraceCheckUtils]: 1: Hoare triple {2141#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2141#true} is VALID [2018-11-23 11:54:57,006 INFO L273 TraceCheckUtils]: 2: Hoare triple {2141#true} assume true; {2141#true} is VALID [2018-11-23 11:54:57,006 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2141#true} {2141#true} #76#return; {2141#true} is VALID [2018-11-23 11:54:57,006 INFO L256 TraceCheckUtils]: 4: Hoare triple {2141#true} call #t~ret6 := main(); {2141#true} is VALID [2018-11-23 11:54:57,007 INFO L273 TraceCheckUtils]: 5: Hoare triple {2141#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2143#(= main_~i~0 0)} is VALID [2018-11-23 11:54:57,007 INFO L273 TraceCheckUtils]: 6: Hoare triple {2143#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2144#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:57,009 INFO L273 TraceCheckUtils]: 7: Hoare triple {2144#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2145#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:57,010 INFO L273 TraceCheckUtils]: 8: Hoare triple {2145#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2146#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:57,011 INFO L273 TraceCheckUtils]: 9: Hoare triple {2146#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2147#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:57,012 INFO L273 TraceCheckUtils]: 10: Hoare triple {2147#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2148#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:57,013 INFO L273 TraceCheckUtils]: 11: Hoare triple {2148#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2149#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:57,013 INFO L273 TraceCheckUtils]: 12: Hoare triple {2149#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 11:54:57,014 INFO L273 TraceCheckUtils]: 13: Hoare triple {2142#false} ~i~0 := 0; {2142#false} is VALID [2018-11-23 11:54:57,014 INFO L273 TraceCheckUtils]: 14: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2142#false} is VALID [2018-11-23 11:54:57,014 INFO L273 TraceCheckUtils]: 15: Hoare triple {2142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2142#false} is VALID [2018-11-23 11:54:57,015 INFO L273 TraceCheckUtils]: 16: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2142#false} is VALID [2018-11-23 11:54:57,015 INFO L273 TraceCheckUtils]: 17: Hoare triple {2142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2142#false} is VALID [2018-11-23 11:54:57,015 INFO L273 TraceCheckUtils]: 18: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2142#false} is VALID [2018-11-23 11:54:57,015 INFO L273 TraceCheckUtils]: 19: Hoare triple {2142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2142#false} is VALID [2018-11-23 11:54:57,016 INFO L273 TraceCheckUtils]: 20: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2142#false} is VALID [2018-11-23 11:54:57,016 INFO L273 TraceCheckUtils]: 21: Hoare triple {2142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2142#false} is VALID [2018-11-23 11:54:57,016 INFO L273 TraceCheckUtils]: 22: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2142#false} is VALID [2018-11-23 11:54:57,016 INFO L273 TraceCheckUtils]: 23: Hoare triple {2142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2142#false} is VALID [2018-11-23 11:54:57,017 INFO L273 TraceCheckUtils]: 24: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2142#false} is VALID [2018-11-23 11:54:57,017 INFO L273 TraceCheckUtils]: 25: Hoare triple {2142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2142#false} is VALID [2018-11-23 11:54:57,017 INFO L273 TraceCheckUtils]: 26: Hoare triple {2142#false} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 11:54:57,017 INFO L273 TraceCheckUtils]: 27: Hoare triple {2142#false} ~i~0 := 0; {2142#false} is VALID [2018-11-23 11:54:57,018 INFO L273 TraceCheckUtils]: 28: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2142#false} is VALID [2018-11-23 11:54:57,018 INFO L273 TraceCheckUtils]: 29: Hoare triple {2142#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2142#false} is VALID [2018-11-23 11:54:57,018 INFO L273 TraceCheckUtils]: 30: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2142#false} is VALID [2018-11-23 11:54:57,018 INFO L273 TraceCheckUtils]: 31: Hoare triple {2142#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2142#false} is VALID [2018-11-23 11:54:57,019 INFO L273 TraceCheckUtils]: 32: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2142#false} is VALID [2018-11-23 11:54:57,019 INFO L273 TraceCheckUtils]: 33: Hoare triple {2142#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2142#false} is VALID [2018-11-23 11:54:57,019 INFO L273 TraceCheckUtils]: 34: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2142#false} is VALID [2018-11-23 11:54:57,019 INFO L273 TraceCheckUtils]: 35: Hoare triple {2142#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2142#false} is VALID [2018-11-23 11:54:57,019 INFO L273 TraceCheckUtils]: 36: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2142#false} is VALID [2018-11-23 11:54:57,020 INFO L273 TraceCheckUtils]: 37: Hoare triple {2142#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2142#false} is VALID [2018-11-23 11:54:57,020 INFO L273 TraceCheckUtils]: 38: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2142#false} is VALID [2018-11-23 11:54:57,020 INFO L273 TraceCheckUtils]: 39: Hoare triple {2142#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2142#false} is VALID [2018-11-23 11:54:57,020 INFO L273 TraceCheckUtils]: 40: Hoare triple {2142#false} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 11:54:57,020 INFO L273 TraceCheckUtils]: 41: Hoare triple {2142#false} havoc ~x~0;~x~0 := 0; {2142#false} is VALID [2018-11-23 11:54:57,021 INFO L273 TraceCheckUtils]: 42: Hoare triple {2142#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2142#false} is VALID [2018-11-23 11:54:57,021 INFO L256 TraceCheckUtils]: 43: Hoare triple {2142#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {2142#false} is VALID [2018-11-23 11:54:57,021 INFO L273 TraceCheckUtils]: 44: Hoare triple {2142#false} ~cond := #in~cond; {2142#false} is VALID [2018-11-23 11:54:57,021 INFO L273 TraceCheckUtils]: 45: Hoare triple {2142#false} assume 0 == ~cond; {2142#false} is VALID [2018-11-23 11:54:57,021 INFO L273 TraceCheckUtils]: 46: Hoare triple {2142#false} assume !false; {2142#false} is VALID [2018-11-23 11:54:57,023 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-23 11:54:57,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:57,023 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:57,032 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:54:57,387 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 11:54:57,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:57,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:57,568 INFO L256 TraceCheckUtils]: 0: Hoare triple {2141#true} call ULTIMATE.init(); {2141#true} is VALID [2018-11-23 11:54:57,569 INFO L273 TraceCheckUtils]: 1: Hoare triple {2141#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2141#true} is VALID [2018-11-23 11:54:57,569 INFO L273 TraceCheckUtils]: 2: Hoare triple {2141#true} assume true; {2141#true} is VALID [2018-11-23 11:54:57,569 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2141#true} {2141#true} #76#return; {2141#true} is VALID [2018-11-23 11:54:57,569 INFO L256 TraceCheckUtils]: 4: Hoare triple {2141#true} call #t~ret6 := main(); {2141#true} is VALID [2018-11-23 11:54:57,570 INFO L273 TraceCheckUtils]: 5: Hoare triple {2141#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2141#true} is VALID [2018-11-23 11:54:57,570 INFO L273 TraceCheckUtils]: 6: Hoare triple {2141#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2141#true} is VALID [2018-11-23 11:54:57,570 INFO L273 TraceCheckUtils]: 7: Hoare triple {2141#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2141#true} is VALID [2018-11-23 11:54:57,570 INFO L273 TraceCheckUtils]: 8: Hoare triple {2141#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2141#true} is VALID [2018-11-23 11:54:57,571 INFO L273 TraceCheckUtils]: 9: Hoare triple {2141#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2141#true} is VALID [2018-11-23 11:54:57,571 INFO L273 TraceCheckUtils]: 10: Hoare triple {2141#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2141#true} is VALID [2018-11-23 11:54:57,571 INFO L273 TraceCheckUtils]: 11: Hoare triple {2141#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2141#true} is VALID [2018-11-23 11:54:57,571 INFO L273 TraceCheckUtils]: 12: Hoare triple {2141#true} assume !(~i~0 < 100000); {2141#true} is VALID [2018-11-23 11:54:57,571 INFO L273 TraceCheckUtils]: 13: Hoare triple {2141#true} ~i~0 := 0; {2141#true} is VALID [2018-11-23 11:54:57,572 INFO L273 TraceCheckUtils]: 14: Hoare triple {2141#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2141#true} is VALID [2018-11-23 11:54:57,572 INFO L273 TraceCheckUtils]: 15: Hoare triple {2141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2141#true} is VALID [2018-11-23 11:54:57,572 INFO L273 TraceCheckUtils]: 16: Hoare triple {2141#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2141#true} is VALID [2018-11-23 11:54:57,572 INFO L273 TraceCheckUtils]: 17: Hoare triple {2141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2141#true} is VALID [2018-11-23 11:54:57,572 INFO L273 TraceCheckUtils]: 18: Hoare triple {2141#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2141#true} is VALID [2018-11-23 11:54:57,572 INFO L273 TraceCheckUtils]: 19: Hoare triple {2141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2141#true} is VALID [2018-11-23 11:54:57,572 INFO L273 TraceCheckUtils]: 20: Hoare triple {2141#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2141#true} is VALID [2018-11-23 11:54:57,573 INFO L273 TraceCheckUtils]: 21: Hoare triple {2141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2141#true} is VALID [2018-11-23 11:54:57,573 INFO L273 TraceCheckUtils]: 22: Hoare triple {2141#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2141#true} is VALID [2018-11-23 11:54:57,573 INFO L273 TraceCheckUtils]: 23: Hoare triple {2141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2141#true} is VALID [2018-11-23 11:54:57,573 INFO L273 TraceCheckUtils]: 24: Hoare triple {2141#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2141#true} is VALID [2018-11-23 11:54:57,573 INFO L273 TraceCheckUtils]: 25: Hoare triple {2141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2141#true} is VALID [2018-11-23 11:54:57,573 INFO L273 TraceCheckUtils]: 26: Hoare triple {2141#true} assume !(~i~0 < 100000); {2141#true} is VALID [2018-11-23 11:54:57,574 INFO L273 TraceCheckUtils]: 27: Hoare triple {2141#true} ~i~0 := 0; {2234#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:57,574 INFO L273 TraceCheckUtils]: 28: Hoare triple {2234#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2234#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:57,575 INFO L273 TraceCheckUtils]: 29: Hoare triple {2234#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2144#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:57,575 INFO L273 TraceCheckUtils]: 30: Hoare triple {2144#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2144#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:57,575 INFO L273 TraceCheckUtils]: 31: Hoare triple {2144#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2145#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:57,576 INFO L273 TraceCheckUtils]: 32: Hoare triple {2145#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2145#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:57,576 INFO L273 TraceCheckUtils]: 33: Hoare triple {2145#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2146#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:57,577 INFO L273 TraceCheckUtils]: 34: Hoare triple {2146#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2146#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:57,577 INFO L273 TraceCheckUtils]: 35: Hoare triple {2146#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2147#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:57,595 INFO L273 TraceCheckUtils]: 36: Hoare triple {2147#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2147#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:57,604 INFO L273 TraceCheckUtils]: 37: Hoare triple {2147#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2148#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:57,620 INFO L273 TraceCheckUtils]: 38: Hoare triple {2148#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2148#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:57,636 INFO L273 TraceCheckUtils]: 39: Hoare triple {2148#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2149#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:57,644 INFO L273 TraceCheckUtils]: 40: Hoare triple {2149#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 11:54:57,644 INFO L273 TraceCheckUtils]: 41: Hoare triple {2142#false} havoc ~x~0;~x~0 := 0; {2142#false} is VALID [2018-11-23 11:54:57,644 INFO L273 TraceCheckUtils]: 42: Hoare triple {2142#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2142#false} is VALID [2018-11-23 11:54:57,644 INFO L256 TraceCheckUtils]: 43: Hoare triple {2142#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {2142#false} is VALID [2018-11-23 11:54:57,645 INFO L273 TraceCheckUtils]: 44: Hoare triple {2142#false} ~cond := #in~cond; {2142#false} is VALID [2018-11-23 11:54:57,645 INFO L273 TraceCheckUtils]: 45: Hoare triple {2142#false} assume 0 == ~cond; {2142#false} is VALID [2018-11-23 11:54:57,645 INFO L273 TraceCheckUtils]: 46: Hoare triple {2142#false} assume !false; {2142#false} is VALID [2018-11-23 11:54:57,646 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-23 11:54:57,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:57,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 11:54:57,667 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-11-23 11:54:57,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:57,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:54:57,891 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:57,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:54:57,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:54:57,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:54:57,892 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 10 states. [2018-11-23 11:54:58,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:58,215 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-11-23 11:54:58,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:54:58,215 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-11-23 11:54:58,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:58,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:54:58,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 84 transitions. [2018-11-23 11:54:58,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:54:58,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 84 transitions. [2018-11-23 11:54:58,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 84 transitions. [2018-11-23 11:54:58,308 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:58,309 INFO L225 Difference]: With dead ends: 98 [2018-11-23 11:54:58,309 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 11:54:58,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 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 11:54:58,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 11:54:58,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-11-23 11:54:58,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:58,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 57 states. [2018-11-23 11:54:58,338 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 57 states. [2018-11-23 11:54:58,338 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 57 states. [2018-11-23 11:54:58,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:58,341 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2018-11-23 11:54:58,341 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-11-23 11:54:58,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:58,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:58,342 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 59 states. [2018-11-23 11:54:58,342 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 59 states. [2018-11-23 11:54:58,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:58,344 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2018-11-23 11:54:58,344 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-11-23 11:54:58,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:58,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:58,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:58,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:58,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 11:54:58,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-11-23 11:54:58,347 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 47 [2018-11-23 11:54:58,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:58,347 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-11-23 11:54:58,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:54:58,347 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-11-23 11:54:58,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 11:54:58,348 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:58,348 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:58,348 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:58,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:58,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1128841790, now seen corresponding path program 7 times [2018-11-23 11:54:58,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:58,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:58,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:58,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:58,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:58,552 INFO L256 TraceCheckUtils]: 0: Hoare triple {2643#true} call ULTIMATE.init(); {2643#true} is VALID [2018-11-23 11:54:58,553 INFO L273 TraceCheckUtils]: 1: Hoare triple {2643#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2643#true} is VALID [2018-11-23 11:54:58,553 INFO L273 TraceCheckUtils]: 2: Hoare triple {2643#true} assume true; {2643#true} is VALID [2018-11-23 11:54:58,553 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2643#true} {2643#true} #76#return; {2643#true} is VALID [2018-11-23 11:54:58,554 INFO L256 TraceCheckUtils]: 4: Hoare triple {2643#true} call #t~ret6 := main(); {2643#true} is VALID [2018-11-23 11:54:58,555 INFO L273 TraceCheckUtils]: 5: Hoare triple {2643#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2645#(= main_~i~0 0)} is VALID [2018-11-23 11:54:58,556 INFO L273 TraceCheckUtils]: 6: Hoare triple {2645#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2646#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:58,556 INFO L273 TraceCheckUtils]: 7: Hoare triple {2646#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2647#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:58,557 INFO L273 TraceCheckUtils]: 8: Hoare triple {2647#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2648#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:58,558 INFO L273 TraceCheckUtils]: 9: Hoare triple {2648#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2649#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:58,558 INFO L273 TraceCheckUtils]: 10: Hoare triple {2649#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2650#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:58,559 INFO L273 TraceCheckUtils]: 11: Hoare triple {2650#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2651#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:58,559 INFO L273 TraceCheckUtils]: 12: Hoare triple {2651#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2652#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:58,560 INFO L273 TraceCheckUtils]: 13: Hoare triple {2652#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2644#false} is VALID [2018-11-23 11:54:58,560 INFO L273 TraceCheckUtils]: 14: Hoare triple {2644#false} ~i~0 := 0; {2644#false} is VALID [2018-11-23 11:54:58,561 INFO L273 TraceCheckUtils]: 15: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2644#false} is VALID [2018-11-23 11:54:58,561 INFO L273 TraceCheckUtils]: 16: Hoare triple {2644#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2644#false} is VALID [2018-11-23 11:54:58,561 INFO L273 TraceCheckUtils]: 17: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2644#false} is VALID [2018-11-23 11:54:58,561 INFO L273 TraceCheckUtils]: 18: Hoare triple {2644#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2644#false} is VALID [2018-11-23 11:54:58,562 INFO L273 TraceCheckUtils]: 19: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2644#false} is VALID [2018-11-23 11:54:58,562 INFO L273 TraceCheckUtils]: 20: Hoare triple {2644#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2644#false} is VALID [2018-11-23 11:54:58,562 INFO L273 TraceCheckUtils]: 21: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2644#false} is VALID [2018-11-23 11:54:58,562 INFO L273 TraceCheckUtils]: 22: Hoare triple {2644#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2644#false} is VALID [2018-11-23 11:54:58,562 INFO L273 TraceCheckUtils]: 23: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2644#false} is VALID [2018-11-23 11:54:58,563 INFO L273 TraceCheckUtils]: 24: Hoare triple {2644#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2644#false} is VALID [2018-11-23 11:54:58,563 INFO L273 TraceCheckUtils]: 25: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2644#false} is VALID [2018-11-23 11:54:58,563 INFO L273 TraceCheckUtils]: 26: Hoare triple {2644#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2644#false} is VALID [2018-11-23 11:54:58,563 INFO L273 TraceCheckUtils]: 27: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2644#false} is VALID [2018-11-23 11:54:58,564 INFO L273 TraceCheckUtils]: 28: Hoare triple {2644#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2644#false} is VALID [2018-11-23 11:54:58,564 INFO L273 TraceCheckUtils]: 29: Hoare triple {2644#false} assume !(~i~0 < 100000); {2644#false} is VALID [2018-11-23 11:54:58,564 INFO L273 TraceCheckUtils]: 30: Hoare triple {2644#false} ~i~0 := 0; {2644#false} is VALID [2018-11-23 11:54:58,564 INFO L273 TraceCheckUtils]: 31: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2644#false} is VALID [2018-11-23 11:54:58,565 INFO L273 TraceCheckUtils]: 32: Hoare triple {2644#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2644#false} is VALID [2018-11-23 11:54:58,565 INFO L273 TraceCheckUtils]: 33: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2644#false} is VALID [2018-11-23 11:54:58,565 INFO L273 TraceCheckUtils]: 34: Hoare triple {2644#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2644#false} is VALID [2018-11-23 11:54:58,566 INFO L273 TraceCheckUtils]: 35: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2644#false} is VALID [2018-11-23 11:54:58,566 INFO L273 TraceCheckUtils]: 36: Hoare triple {2644#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2644#false} is VALID [2018-11-23 11:54:58,566 INFO L273 TraceCheckUtils]: 37: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2644#false} is VALID [2018-11-23 11:54:58,566 INFO L273 TraceCheckUtils]: 38: Hoare triple {2644#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2644#false} is VALID [2018-11-23 11:54:58,567 INFO L273 TraceCheckUtils]: 39: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2644#false} is VALID [2018-11-23 11:54:58,567 INFO L273 TraceCheckUtils]: 40: Hoare triple {2644#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2644#false} is VALID [2018-11-23 11:54:58,567 INFO L273 TraceCheckUtils]: 41: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2644#false} is VALID [2018-11-23 11:54:58,567 INFO L273 TraceCheckUtils]: 42: Hoare triple {2644#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2644#false} is VALID [2018-11-23 11:54:58,567 INFO L273 TraceCheckUtils]: 43: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2644#false} is VALID [2018-11-23 11:54:58,568 INFO L273 TraceCheckUtils]: 44: Hoare triple {2644#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2644#false} is VALID [2018-11-23 11:54:58,568 INFO L273 TraceCheckUtils]: 45: Hoare triple {2644#false} assume !(~i~0 < 100000); {2644#false} is VALID [2018-11-23 11:54:58,568 INFO L273 TraceCheckUtils]: 46: Hoare triple {2644#false} havoc ~x~0;~x~0 := 0; {2644#false} is VALID [2018-11-23 11:54:58,568 INFO L273 TraceCheckUtils]: 47: Hoare triple {2644#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2644#false} is VALID [2018-11-23 11:54:58,568 INFO L256 TraceCheckUtils]: 48: Hoare triple {2644#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {2644#false} is VALID [2018-11-23 11:54:58,568 INFO L273 TraceCheckUtils]: 49: Hoare triple {2644#false} ~cond := #in~cond; {2644#false} is VALID [2018-11-23 11:54:58,569 INFO L273 TraceCheckUtils]: 50: Hoare triple {2644#false} assume 0 == ~cond; {2644#false} is VALID [2018-11-23 11:54:58,569 INFO L273 TraceCheckUtils]: 51: Hoare triple {2644#false} assume !false; {2644#false} is VALID [2018-11-23 11:54:58,570 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-23 11:54:58,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:58,571 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:58,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:58,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:58,814 INFO L256 TraceCheckUtils]: 0: Hoare triple {2643#true} call ULTIMATE.init(); {2643#true} is VALID [2018-11-23 11:54:58,814 INFO L273 TraceCheckUtils]: 1: Hoare triple {2643#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2643#true} is VALID [2018-11-23 11:54:58,815 INFO L273 TraceCheckUtils]: 2: Hoare triple {2643#true} assume true; {2643#true} is VALID [2018-11-23 11:54:58,815 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2643#true} {2643#true} #76#return; {2643#true} is VALID [2018-11-23 11:54:58,815 INFO L256 TraceCheckUtils]: 4: Hoare triple {2643#true} call #t~ret6 := main(); {2643#true} is VALID [2018-11-23 11:54:58,816 INFO L273 TraceCheckUtils]: 5: Hoare triple {2643#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2671#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:58,817 INFO L273 TraceCheckUtils]: 6: Hoare triple {2671#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2646#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:58,817 INFO L273 TraceCheckUtils]: 7: Hoare triple {2646#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2647#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:58,818 INFO L273 TraceCheckUtils]: 8: Hoare triple {2647#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2648#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:58,818 INFO L273 TraceCheckUtils]: 9: Hoare triple {2648#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2649#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:58,819 INFO L273 TraceCheckUtils]: 10: Hoare triple {2649#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2650#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:58,820 INFO L273 TraceCheckUtils]: 11: Hoare triple {2650#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2651#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:58,835 INFO L273 TraceCheckUtils]: 12: Hoare triple {2651#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2652#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:58,836 INFO L273 TraceCheckUtils]: 13: Hoare triple {2652#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2644#false} is VALID [2018-11-23 11:54:58,836 INFO L273 TraceCheckUtils]: 14: Hoare triple {2644#false} ~i~0 := 0; {2644#false} is VALID [2018-11-23 11:54:58,836 INFO L273 TraceCheckUtils]: 15: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2644#false} is VALID [2018-11-23 11:54:58,837 INFO L273 TraceCheckUtils]: 16: Hoare triple {2644#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2644#false} is VALID [2018-11-23 11:54:58,837 INFO L273 TraceCheckUtils]: 17: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2644#false} is VALID [2018-11-23 11:54:58,837 INFO L273 TraceCheckUtils]: 18: Hoare triple {2644#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2644#false} is VALID [2018-11-23 11:54:58,837 INFO L273 TraceCheckUtils]: 19: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2644#false} is VALID [2018-11-23 11:54:58,837 INFO L273 TraceCheckUtils]: 20: Hoare triple {2644#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2644#false} is VALID [2018-11-23 11:54:58,837 INFO L273 TraceCheckUtils]: 21: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2644#false} is VALID [2018-11-23 11:54:58,837 INFO L273 TraceCheckUtils]: 22: Hoare triple {2644#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2644#false} is VALID [2018-11-23 11:54:58,837 INFO L273 TraceCheckUtils]: 23: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2644#false} is VALID [2018-11-23 11:54:58,838 INFO L273 TraceCheckUtils]: 24: Hoare triple {2644#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2644#false} is VALID [2018-11-23 11:54:58,838 INFO L273 TraceCheckUtils]: 25: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2644#false} is VALID [2018-11-23 11:54:58,838 INFO L273 TraceCheckUtils]: 26: Hoare triple {2644#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2644#false} is VALID [2018-11-23 11:54:58,838 INFO L273 TraceCheckUtils]: 27: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2644#false} is VALID [2018-11-23 11:54:58,838 INFO L273 TraceCheckUtils]: 28: Hoare triple {2644#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2644#false} is VALID [2018-11-23 11:54:58,838 INFO L273 TraceCheckUtils]: 29: Hoare triple {2644#false} assume !(~i~0 < 100000); {2644#false} is VALID [2018-11-23 11:54:58,838 INFO L273 TraceCheckUtils]: 30: Hoare triple {2644#false} ~i~0 := 0; {2644#false} is VALID [2018-11-23 11:54:58,839 INFO L273 TraceCheckUtils]: 31: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2644#false} is VALID [2018-11-23 11:54:58,839 INFO L273 TraceCheckUtils]: 32: Hoare triple {2644#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2644#false} is VALID [2018-11-23 11:54:58,839 INFO L273 TraceCheckUtils]: 33: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2644#false} is VALID [2018-11-23 11:54:58,839 INFO L273 TraceCheckUtils]: 34: Hoare triple {2644#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2644#false} is VALID [2018-11-23 11:54:58,839 INFO L273 TraceCheckUtils]: 35: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2644#false} is VALID [2018-11-23 11:54:58,839 INFO L273 TraceCheckUtils]: 36: Hoare triple {2644#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2644#false} is VALID [2018-11-23 11:54:58,840 INFO L273 TraceCheckUtils]: 37: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2644#false} is VALID [2018-11-23 11:54:58,840 INFO L273 TraceCheckUtils]: 38: Hoare triple {2644#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2644#false} is VALID [2018-11-23 11:54:58,840 INFO L273 TraceCheckUtils]: 39: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2644#false} is VALID [2018-11-23 11:54:58,840 INFO L273 TraceCheckUtils]: 40: Hoare triple {2644#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2644#false} is VALID [2018-11-23 11:54:58,840 INFO L273 TraceCheckUtils]: 41: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2644#false} is VALID [2018-11-23 11:54:58,840 INFO L273 TraceCheckUtils]: 42: Hoare triple {2644#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2644#false} is VALID [2018-11-23 11:54:58,840 INFO L273 TraceCheckUtils]: 43: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2644#false} is VALID [2018-11-23 11:54:58,840 INFO L273 TraceCheckUtils]: 44: Hoare triple {2644#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2644#false} is VALID [2018-11-23 11:54:58,841 INFO L273 TraceCheckUtils]: 45: Hoare triple {2644#false} assume !(~i~0 < 100000); {2644#false} is VALID [2018-11-23 11:54:58,841 INFO L273 TraceCheckUtils]: 46: Hoare triple {2644#false} havoc ~x~0;~x~0 := 0; {2644#false} is VALID [2018-11-23 11:54:58,841 INFO L273 TraceCheckUtils]: 47: Hoare triple {2644#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2644#false} is VALID [2018-11-23 11:54:58,841 INFO L256 TraceCheckUtils]: 48: Hoare triple {2644#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {2644#false} is VALID [2018-11-23 11:54:58,841 INFO L273 TraceCheckUtils]: 49: Hoare triple {2644#false} ~cond := #in~cond; {2644#false} is VALID [2018-11-23 11:54:58,841 INFO L273 TraceCheckUtils]: 50: Hoare triple {2644#false} assume 0 == ~cond; {2644#false} is VALID [2018-11-23 11:54:58,841 INFO L273 TraceCheckUtils]: 51: Hoare triple {2644#false} assume !false; {2644#false} is VALID [2018-11-23 11:54:58,843 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-23 11:54:58,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:58,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 11:54:58,864 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-11-23 11:54:58,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:58,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:54:58,887 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:58,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:54:58,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:54:58,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:54:58,888 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 11 states. [2018-11-23 11:54:59,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:59,388 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2018-11-23 11:54:59,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:54:59,389 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-11-23 11:54:59,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:59,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:54:59,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 89 transitions. [2018-11-23 11:54:59,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:54:59,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 89 transitions. [2018-11-23 11:54:59,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 89 transitions. [2018-11-23 11:54:59,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:59,529 INFO L225 Difference]: With dead ends: 107 [2018-11-23 11:54:59,530 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 11:54:59,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 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 11:54:59,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 11:54:59,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-11-23 11:54:59,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:59,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 62 states. [2018-11-23 11:54:59,560 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 62 states. [2018-11-23 11:54:59,560 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 62 states. [2018-11-23 11:54:59,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:59,562 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-11-23 11:54:59,563 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-11-23 11:54:59,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:59,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:59,563 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 64 states. [2018-11-23 11:54:59,563 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 64 states. [2018-11-23 11:54:59,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:59,566 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-11-23 11:54:59,566 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-11-23 11:54:59,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:59,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:59,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:59,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:59,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 11:54:59,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2018-11-23 11:54:59,569 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 52 [2018-11-23 11:54:59,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:59,569 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2018-11-23 11:54:59,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:54:59,569 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-11-23 11:54:59,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 11:54:59,570 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:59,570 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:59,570 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:59,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:59,571 INFO L82 PathProgramCache]: Analyzing trace with hash -612503046, now seen corresponding path program 8 times [2018-11-23 11:54:59,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:59,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:59,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:59,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:59,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:59,776 INFO L256 TraceCheckUtils]: 0: Hoare triple {3193#true} call ULTIMATE.init(); {3193#true} is VALID [2018-11-23 11:54:59,776 INFO L273 TraceCheckUtils]: 1: Hoare triple {3193#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3193#true} is VALID [2018-11-23 11:54:59,776 INFO L273 TraceCheckUtils]: 2: Hoare triple {3193#true} assume true; {3193#true} is VALID [2018-11-23 11:54:59,777 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3193#true} {3193#true} #76#return; {3193#true} is VALID [2018-11-23 11:54:59,777 INFO L256 TraceCheckUtils]: 4: Hoare triple {3193#true} call #t~ret6 := main(); {3193#true} is VALID [2018-11-23 11:54:59,778 INFO L273 TraceCheckUtils]: 5: Hoare triple {3193#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3195#(= main_~i~0 0)} is VALID [2018-11-23 11:54:59,779 INFO L273 TraceCheckUtils]: 6: Hoare triple {3195#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:59,779 INFO L273 TraceCheckUtils]: 7: Hoare triple {3196#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3197#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:59,780 INFO L273 TraceCheckUtils]: 8: Hoare triple {3197#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3198#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:59,780 INFO L273 TraceCheckUtils]: 9: Hoare triple {3198#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3199#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:59,781 INFO L273 TraceCheckUtils]: 10: Hoare triple {3199#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3200#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:59,782 INFO L273 TraceCheckUtils]: 11: Hoare triple {3200#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3201#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:59,783 INFO L273 TraceCheckUtils]: 12: Hoare triple {3201#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3202#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:59,783 INFO L273 TraceCheckUtils]: 13: Hoare triple {3202#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3203#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:59,784 INFO L273 TraceCheckUtils]: 14: Hoare triple {3203#(<= main_~i~0 8)} assume !(~i~0 < 100000); {3194#false} is VALID [2018-11-23 11:54:59,784 INFO L273 TraceCheckUtils]: 15: Hoare triple {3194#false} ~i~0 := 0; {3194#false} is VALID [2018-11-23 11:54:59,785 INFO L273 TraceCheckUtils]: 16: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3194#false} is VALID [2018-11-23 11:54:59,785 INFO L273 TraceCheckUtils]: 17: Hoare triple {3194#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3194#false} is VALID [2018-11-23 11:54:59,785 INFO L273 TraceCheckUtils]: 18: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3194#false} is VALID [2018-11-23 11:54:59,785 INFO L273 TraceCheckUtils]: 19: Hoare triple {3194#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3194#false} is VALID [2018-11-23 11:54:59,786 INFO L273 TraceCheckUtils]: 20: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3194#false} is VALID [2018-11-23 11:54:59,786 INFO L273 TraceCheckUtils]: 21: Hoare triple {3194#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3194#false} is VALID [2018-11-23 11:54:59,786 INFO L273 TraceCheckUtils]: 22: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3194#false} is VALID [2018-11-23 11:54:59,786 INFO L273 TraceCheckUtils]: 23: Hoare triple {3194#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3194#false} is VALID [2018-11-23 11:54:59,786 INFO L273 TraceCheckUtils]: 24: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3194#false} is VALID [2018-11-23 11:54:59,787 INFO L273 TraceCheckUtils]: 25: Hoare triple {3194#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3194#false} is VALID [2018-11-23 11:54:59,787 INFO L273 TraceCheckUtils]: 26: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3194#false} is VALID [2018-11-23 11:54:59,787 INFO L273 TraceCheckUtils]: 27: Hoare triple {3194#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3194#false} is VALID [2018-11-23 11:54:59,787 INFO L273 TraceCheckUtils]: 28: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3194#false} is VALID [2018-11-23 11:54:59,787 INFO L273 TraceCheckUtils]: 29: Hoare triple {3194#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3194#false} is VALID [2018-11-23 11:54:59,788 INFO L273 TraceCheckUtils]: 30: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3194#false} is VALID [2018-11-23 11:54:59,788 INFO L273 TraceCheckUtils]: 31: Hoare triple {3194#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3194#false} is VALID [2018-11-23 11:54:59,788 INFO L273 TraceCheckUtils]: 32: Hoare triple {3194#false} assume !(~i~0 < 100000); {3194#false} is VALID [2018-11-23 11:54:59,788 INFO L273 TraceCheckUtils]: 33: Hoare triple {3194#false} ~i~0 := 0; {3194#false} is VALID [2018-11-23 11:54:59,789 INFO L273 TraceCheckUtils]: 34: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3194#false} is VALID [2018-11-23 11:54:59,789 INFO L273 TraceCheckUtils]: 35: Hoare triple {3194#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3194#false} is VALID [2018-11-23 11:54:59,789 INFO L273 TraceCheckUtils]: 36: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3194#false} is VALID [2018-11-23 11:54:59,789 INFO L273 TraceCheckUtils]: 37: Hoare triple {3194#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3194#false} is VALID [2018-11-23 11:54:59,789 INFO L273 TraceCheckUtils]: 38: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3194#false} is VALID [2018-11-23 11:54:59,789 INFO L273 TraceCheckUtils]: 39: Hoare triple {3194#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3194#false} is VALID [2018-11-23 11:54:59,789 INFO L273 TraceCheckUtils]: 40: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3194#false} is VALID [2018-11-23 11:54:59,789 INFO L273 TraceCheckUtils]: 41: Hoare triple {3194#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3194#false} is VALID [2018-11-23 11:54:59,790 INFO L273 TraceCheckUtils]: 42: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3194#false} is VALID [2018-11-23 11:54:59,790 INFO L273 TraceCheckUtils]: 43: Hoare triple {3194#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3194#false} is VALID [2018-11-23 11:54:59,790 INFO L273 TraceCheckUtils]: 44: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3194#false} is VALID [2018-11-23 11:54:59,790 INFO L273 TraceCheckUtils]: 45: Hoare triple {3194#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3194#false} is VALID [2018-11-23 11:54:59,790 INFO L273 TraceCheckUtils]: 46: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3194#false} is VALID [2018-11-23 11:54:59,790 INFO L273 TraceCheckUtils]: 47: Hoare triple {3194#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3194#false} is VALID [2018-11-23 11:54:59,790 INFO L273 TraceCheckUtils]: 48: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3194#false} is VALID [2018-11-23 11:54:59,790 INFO L273 TraceCheckUtils]: 49: Hoare triple {3194#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3194#false} is VALID [2018-11-23 11:54:59,791 INFO L273 TraceCheckUtils]: 50: Hoare triple {3194#false} assume !(~i~0 < 100000); {3194#false} is VALID [2018-11-23 11:54:59,791 INFO L273 TraceCheckUtils]: 51: Hoare triple {3194#false} havoc ~x~0;~x~0 := 0; {3194#false} is VALID [2018-11-23 11:54:59,791 INFO L273 TraceCheckUtils]: 52: Hoare triple {3194#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3194#false} is VALID [2018-11-23 11:54:59,791 INFO L256 TraceCheckUtils]: 53: Hoare triple {3194#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {3194#false} is VALID [2018-11-23 11:54:59,791 INFO L273 TraceCheckUtils]: 54: Hoare triple {3194#false} ~cond := #in~cond; {3194#false} is VALID [2018-11-23 11:54:59,791 INFO L273 TraceCheckUtils]: 55: Hoare triple {3194#false} assume 0 == ~cond; {3194#false} is VALID [2018-11-23 11:54:59,791 INFO L273 TraceCheckUtils]: 56: Hoare triple {3194#false} assume !false; {3194#false} is VALID [2018-11-23 11:54:59,794 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-11-23 11:54:59,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:59,795 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:59,806 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:54:59,836 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:54:59,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:59,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:59,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:59,970 INFO L256 TraceCheckUtils]: 0: Hoare triple {3193#true} call ULTIMATE.init(); {3193#true} is VALID [2018-11-23 11:54:59,970 INFO L273 TraceCheckUtils]: 1: Hoare triple {3193#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3193#true} is VALID [2018-11-23 11:54:59,970 INFO L273 TraceCheckUtils]: 2: Hoare triple {3193#true} assume true; {3193#true} is VALID [2018-11-23 11:54:59,970 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3193#true} {3193#true} #76#return; {3193#true} is VALID [2018-11-23 11:54:59,971 INFO L256 TraceCheckUtils]: 4: Hoare triple {3193#true} call #t~ret6 := main(); {3193#true} is VALID [2018-11-23 11:54:59,972 INFO L273 TraceCheckUtils]: 5: Hoare triple {3193#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3222#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:59,973 INFO L273 TraceCheckUtils]: 6: Hoare triple {3222#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:59,973 INFO L273 TraceCheckUtils]: 7: Hoare triple {3196#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3197#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:59,974 INFO L273 TraceCheckUtils]: 8: Hoare triple {3197#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3198#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:59,974 INFO L273 TraceCheckUtils]: 9: Hoare triple {3198#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3199#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:59,975 INFO L273 TraceCheckUtils]: 10: Hoare triple {3199#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3200#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:59,976 INFO L273 TraceCheckUtils]: 11: Hoare triple {3200#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3201#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:59,976 INFO L273 TraceCheckUtils]: 12: Hoare triple {3201#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3202#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:59,977 INFO L273 TraceCheckUtils]: 13: Hoare triple {3202#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3203#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:59,978 INFO L273 TraceCheckUtils]: 14: Hoare triple {3203#(<= main_~i~0 8)} assume !(~i~0 < 100000); {3194#false} is VALID [2018-11-23 11:54:59,978 INFO L273 TraceCheckUtils]: 15: Hoare triple {3194#false} ~i~0 := 0; {3194#false} is VALID [2018-11-23 11:54:59,978 INFO L273 TraceCheckUtils]: 16: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3194#false} is VALID [2018-11-23 11:54:59,979 INFO L273 TraceCheckUtils]: 17: Hoare triple {3194#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3194#false} is VALID [2018-11-23 11:54:59,979 INFO L273 TraceCheckUtils]: 18: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3194#false} is VALID [2018-11-23 11:54:59,979 INFO L273 TraceCheckUtils]: 19: Hoare triple {3194#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3194#false} is VALID [2018-11-23 11:54:59,979 INFO L273 TraceCheckUtils]: 20: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3194#false} is VALID [2018-11-23 11:54:59,979 INFO L273 TraceCheckUtils]: 21: Hoare triple {3194#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3194#false} is VALID [2018-11-23 11:54:59,980 INFO L273 TraceCheckUtils]: 22: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3194#false} is VALID [2018-11-23 11:54:59,980 INFO L273 TraceCheckUtils]: 23: Hoare triple {3194#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3194#false} is VALID [2018-11-23 11:54:59,980 INFO L273 TraceCheckUtils]: 24: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3194#false} is VALID [2018-11-23 11:54:59,980 INFO L273 TraceCheckUtils]: 25: Hoare triple {3194#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3194#false} is VALID [2018-11-23 11:54:59,980 INFO L273 TraceCheckUtils]: 26: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3194#false} is VALID [2018-11-23 11:54:59,981 INFO L273 TraceCheckUtils]: 27: Hoare triple {3194#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3194#false} is VALID [2018-11-23 11:54:59,981 INFO L273 TraceCheckUtils]: 28: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3194#false} is VALID [2018-11-23 11:54:59,981 INFO L273 TraceCheckUtils]: 29: Hoare triple {3194#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3194#false} is VALID [2018-11-23 11:54:59,981 INFO L273 TraceCheckUtils]: 30: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3194#false} is VALID [2018-11-23 11:54:59,981 INFO L273 TraceCheckUtils]: 31: Hoare triple {3194#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3194#false} is VALID [2018-11-23 11:54:59,982 INFO L273 TraceCheckUtils]: 32: Hoare triple {3194#false} assume !(~i~0 < 100000); {3194#false} is VALID [2018-11-23 11:54:59,982 INFO L273 TraceCheckUtils]: 33: Hoare triple {3194#false} ~i~0 := 0; {3194#false} is VALID [2018-11-23 11:54:59,982 INFO L273 TraceCheckUtils]: 34: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3194#false} is VALID [2018-11-23 11:54:59,982 INFO L273 TraceCheckUtils]: 35: Hoare triple {3194#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3194#false} is VALID [2018-11-23 11:54:59,982 INFO L273 TraceCheckUtils]: 36: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3194#false} is VALID [2018-11-23 11:54:59,983 INFO L273 TraceCheckUtils]: 37: Hoare triple {3194#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3194#false} is VALID [2018-11-23 11:54:59,983 INFO L273 TraceCheckUtils]: 38: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3194#false} is VALID [2018-11-23 11:54:59,983 INFO L273 TraceCheckUtils]: 39: Hoare triple {3194#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3194#false} is VALID [2018-11-23 11:54:59,983 INFO L273 TraceCheckUtils]: 40: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3194#false} is VALID [2018-11-23 11:54:59,983 INFO L273 TraceCheckUtils]: 41: Hoare triple {3194#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3194#false} is VALID [2018-11-23 11:54:59,983 INFO L273 TraceCheckUtils]: 42: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3194#false} is VALID [2018-11-23 11:54:59,983 INFO L273 TraceCheckUtils]: 43: Hoare triple {3194#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3194#false} is VALID [2018-11-23 11:54:59,984 INFO L273 TraceCheckUtils]: 44: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3194#false} is VALID [2018-11-23 11:54:59,984 INFO L273 TraceCheckUtils]: 45: Hoare triple {3194#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3194#false} is VALID [2018-11-23 11:54:59,984 INFO L273 TraceCheckUtils]: 46: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3194#false} is VALID [2018-11-23 11:54:59,984 INFO L273 TraceCheckUtils]: 47: Hoare triple {3194#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3194#false} is VALID [2018-11-23 11:54:59,984 INFO L273 TraceCheckUtils]: 48: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3194#false} is VALID [2018-11-23 11:54:59,984 INFO L273 TraceCheckUtils]: 49: Hoare triple {3194#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3194#false} is VALID [2018-11-23 11:54:59,984 INFO L273 TraceCheckUtils]: 50: Hoare triple {3194#false} assume !(~i~0 < 100000); {3194#false} is VALID [2018-11-23 11:54:59,984 INFO L273 TraceCheckUtils]: 51: Hoare triple {3194#false} havoc ~x~0;~x~0 := 0; {3194#false} is VALID [2018-11-23 11:54:59,985 INFO L273 TraceCheckUtils]: 52: Hoare triple {3194#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3194#false} is VALID [2018-11-23 11:54:59,985 INFO L256 TraceCheckUtils]: 53: Hoare triple {3194#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {3194#false} is VALID [2018-11-23 11:54:59,985 INFO L273 TraceCheckUtils]: 54: Hoare triple {3194#false} ~cond := #in~cond; {3194#false} is VALID [2018-11-23 11:54:59,985 INFO L273 TraceCheckUtils]: 55: Hoare triple {3194#false} assume 0 == ~cond; {3194#false} is VALID [2018-11-23 11:54:59,985 INFO L273 TraceCheckUtils]: 56: Hoare triple {3194#false} assume !false; {3194#false} is VALID [2018-11-23 11:54:59,987 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-11-23 11:55:00,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:00,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 11:55:00,008 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-11-23 11:55:00,008 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:00,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:55:00,058 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:00,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:55:00,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:55:00,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:55:00,059 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 12 states. [2018-11-23 11:55:00,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:00,345 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2018-11-23 11:55:00,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:55:00,346 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-11-23 11:55:00,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:00,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:55:00,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 94 transitions. [2018-11-23 11:55:00,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:55:00,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 94 transitions. [2018-11-23 11:55:00,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 94 transitions. [2018-11-23 11:55:00,478 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:00,480 INFO L225 Difference]: With dead ends: 116 [2018-11-23 11:55:00,480 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 11:55:00,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:55:00,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 11:55:00,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-23 11:55:00,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:00,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 67 states. [2018-11-23 11:55:00,524 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 67 states. [2018-11-23 11:55:00,524 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 67 states. [2018-11-23 11:55:00,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:00,526 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-11-23 11:55:00,526 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2018-11-23 11:55:00,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:00,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:00,527 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 69 states. [2018-11-23 11:55:00,527 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 69 states. [2018-11-23 11:55:00,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:00,529 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-11-23 11:55:00,529 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2018-11-23 11:55:00,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:00,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:00,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:00,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:00,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 11:55:00,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2018-11-23 11:55:00,531 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 57 [2018-11-23 11:55:00,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:00,532 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2018-11-23 11:55:00,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:55:00,532 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2018-11-23 11:55:00,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 11:55:00,533 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:00,533 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:00,533 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:00,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:00,533 INFO L82 PathProgramCache]: Analyzing trace with hash -490630470, now seen corresponding path program 9 times [2018-11-23 11:55:00,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:00,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:00,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:00,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:00,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:00,837 INFO L256 TraceCheckUtils]: 0: Hoare triple {3791#true} call ULTIMATE.init(); {3791#true} is VALID [2018-11-23 11:55:00,838 INFO L273 TraceCheckUtils]: 1: Hoare triple {3791#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3791#true} is VALID [2018-11-23 11:55:00,838 INFO L273 TraceCheckUtils]: 2: Hoare triple {3791#true} assume true; {3791#true} is VALID [2018-11-23 11:55:00,838 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3791#true} {3791#true} #76#return; {3791#true} is VALID [2018-11-23 11:55:00,838 INFO L256 TraceCheckUtils]: 4: Hoare triple {3791#true} call #t~ret6 := main(); {3791#true} is VALID [2018-11-23 11:55:00,839 INFO L273 TraceCheckUtils]: 5: Hoare triple {3791#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3793#(= main_~i~0 0)} is VALID [2018-11-23 11:55:00,840 INFO L273 TraceCheckUtils]: 6: Hoare triple {3793#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3794#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:00,841 INFO L273 TraceCheckUtils]: 7: Hoare triple {3794#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3795#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:00,842 INFO L273 TraceCheckUtils]: 8: Hoare triple {3795#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3796#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:00,861 INFO L273 TraceCheckUtils]: 9: Hoare triple {3796#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3797#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:00,862 INFO L273 TraceCheckUtils]: 10: Hoare triple {3797#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3798#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:00,863 INFO L273 TraceCheckUtils]: 11: Hoare triple {3798#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3799#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:00,863 INFO L273 TraceCheckUtils]: 12: Hoare triple {3799#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3800#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:00,864 INFO L273 TraceCheckUtils]: 13: Hoare triple {3800#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3801#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:00,882 INFO L273 TraceCheckUtils]: 14: Hoare triple {3801#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3802#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:00,883 INFO L273 TraceCheckUtils]: 15: Hoare triple {3802#(<= main_~i~0 9)} assume !(~i~0 < 100000); {3792#false} is VALID [2018-11-23 11:55:00,883 INFO L273 TraceCheckUtils]: 16: Hoare triple {3792#false} ~i~0 := 0; {3792#false} is VALID [2018-11-23 11:55:00,883 INFO L273 TraceCheckUtils]: 17: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3792#false} is VALID [2018-11-23 11:55:00,883 INFO L273 TraceCheckUtils]: 18: Hoare triple {3792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3792#false} is VALID [2018-11-23 11:55:00,883 INFO L273 TraceCheckUtils]: 19: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3792#false} is VALID [2018-11-23 11:55:00,883 INFO L273 TraceCheckUtils]: 20: Hoare triple {3792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3792#false} is VALID [2018-11-23 11:55:00,883 INFO L273 TraceCheckUtils]: 21: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3792#false} is VALID [2018-11-23 11:55:00,884 INFO L273 TraceCheckUtils]: 22: Hoare triple {3792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3792#false} is VALID [2018-11-23 11:55:00,884 INFO L273 TraceCheckUtils]: 23: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3792#false} is VALID [2018-11-23 11:55:00,884 INFO L273 TraceCheckUtils]: 24: Hoare triple {3792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3792#false} is VALID [2018-11-23 11:55:00,884 INFO L273 TraceCheckUtils]: 25: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3792#false} is VALID [2018-11-23 11:55:00,884 INFO L273 TraceCheckUtils]: 26: Hoare triple {3792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3792#false} is VALID [2018-11-23 11:55:00,884 INFO L273 TraceCheckUtils]: 27: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3792#false} is VALID [2018-11-23 11:55:00,884 INFO L273 TraceCheckUtils]: 28: Hoare triple {3792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3792#false} is VALID [2018-11-23 11:55:00,884 INFO L273 TraceCheckUtils]: 29: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3792#false} is VALID [2018-11-23 11:55:00,885 INFO L273 TraceCheckUtils]: 30: Hoare triple {3792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3792#false} is VALID [2018-11-23 11:55:00,885 INFO L273 TraceCheckUtils]: 31: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3792#false} is VALID [2018-11-23 11:55:00,885 INFO L273 TraceCheckUtils]: 32: Hoare triple {3792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3792#false} is VALID [2018-11-23 11:55:00,885 INFO L273 TraceCheckUtils]: 33: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3792#false} is VALID [2018-11-23 11:55:00,885 INFO L273 TraceCheckUtils]: 34: Hoare triple {3792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3792#false} is VALID [2018-11-23 11:55:00,885 INFO L273 TraceCheckUtils]: 35: Hoare triple {3792#false} assume !(~i~0 < 100000); {3792#false} is VALID [2018-11-23 11:55:00,885 INFO L273 TraceCheckUtils]: 36: Hoare triple {3792#false} ~i~0 := 0; {3792#false} is VALID [2018-11-23 11:55:00,885 INFO L273 TraceCheckUtils]: 37: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3792#false} is VALID [2018-11-23 11:55:00,886 INFO L273 TraceCheckUtils]: 38: Hoare triple {3792#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3792#false} is VALID [2018-11-23 11:55:00,886 INFO L273 TraceCheckUtils]: 39: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3792#false} is VALID [2018-11-23 11:55:00,886 INFO L273 TraceCheckUtils]: 40: Hoare triple {3792#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3792#false} is VALID [2018-11-23 11:55:00,886 INFO L273 TraceCheckUtils]: 41: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3792#false} is VALID [2018-11-23 11:55:00,886 INFO L273 TraceCheckUtils]: 42: Hoare triple {3792#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3792#false} is VALID [2018-11-23 11:55:00,886 INFO L273 TraceCheckUtils]: 43: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3792#false} is VALID [2018-11-23 11:55:00,886 INFO L273 TraceCheckUtils]: 44: Hoare triple {3792#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3792#false} is VALID [2018-11-23 11:55:00,886 INFO L273 TraceCheckUtils]: 45: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3792#false} is VALID [2018-11-23 11:55:00,887 INFO L273 TraceCheckUtils]: 46: Hoare triple {3792#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3792#false} is VALID [2018-11-23 11:55:00,887 INFO L273 TraceCheckUtils]: 47: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3792#false} is VALID [2018-11-23 11:55:00,887 INFO L273 TraceCheckUtils]: 48: Hoare triple {3792#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3792#false} is VALID [2018-11-23 11:55:00,887 INFO L273 TraceCheckUtils]: 49: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3792#false} is VALID [2018-11-23 11:55:00,887 INFO L273 TraceCheckUtils]: 50: Hoare triple {3792#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3792#false} is VALID [2018-11-23 11:55:00,887 INFO L273 TraceCheckUtils]: 51: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3792#false} is VALID [2018-11-23 11:55:00,888 INFO L273 TraceCheckUtils]: 52: Hoare triple {3792#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3792#false} is VALID [2018-11-23 11:55:00,888 INFO L273 TraceCheckUtils]: 53: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3792#false} is VALID [2018-11-23 11:55:00,888 INFO L273 TraceCheckUtils]: 54: Hoare triple {3792#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3792#false} is VALID [2018-11-23 11:55:00,888 INFO L273 TraceCheckUtils]: 55: Hoare triple {3792#false} assume !(~i~0 < 100000); {3792#false} is VALID [2018-11-23 11:55:00,888 INFO L273 TraceCheckUtils]: 56: Hoare triple {3792#false} havoc ~x~0;~x~0 := 0; {3792#false} is VALID [2018-11-23 11:55:00,889 INFO L273 TraceCheckUtils]: 57: Hoare triple {3792#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3792#false} is VALID [2018-11-23 11:55:00,889 INFO L256 TraceCheckUtils]: 58: Hoare triple {3792#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {3792#false} is VALID [2018-11-23 11:55:00,889 INFO L273 TraceCheckUtils]: 59: Hoare triple {3792#false} ~cond := #in~cond; {3792#false} is VALID [2018-11-23 11:55:00,889 INFO L273 TraceCheckUtils]: 60: Hoare triple {3792#false} assume 0 == ~cond; {3792#false} is VALID [2018-11-23 11:55:00,889 INFO L273 TraceCheckUtils]: 61: Hoare triple {3792#false} assume !false; {3792#false} is VALID [2018-11-23 11:55:00,892 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-11-23 11:55:00,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:00,892 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:00,908 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:55:00,993 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 11:55:00,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:01,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:01,131 INFO L256 TraceCheckUtils]: 0: Hoare triple {3791#true} call ULTIMATE.init(); {3791#true} is VALID [2018-11-23 11:55:01,132 INFO L273 TraceCheckUtils]: 1: Hoare triple {3791#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3791#true} is VALID [2018-11-23 11:55:01,132 INFO L273 TraceCheckUtils]: 2: Hoare triple {3791#true} assume true; {3791#true} is VALID [2018-11-23 11:55:01,132 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3791#true} {3791#true} #76#return; {3791#true} is VALID [2018-11-23 11:55:01,133 INFO L256 TraceCheckUtils]: 4: Hoare triple {3791#true} call #t~ret6 := main(); {3791#true} is VALID [2018-11-23 11:55:01,133 INFO L273 TraceCheckUtils]: 5: Hoare triple {3791#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3821#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:01,134 INFO L273 TraceCheckUtils]: 6: Hoare triple {3821#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3794#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:01,135 INFO L273 TraceCheckUtils]: 7: Hoare triple {3794#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3795#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:01,135 INFO L273 TraceCheckUtils]: 8: Hoare triple {3795#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3796#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:01,136 INFO L273 TraceCheckUtils]: 9: Hoare triple {3796#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3797#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:01,137 INFO L273 TraceCheckUtils]: 10: Hoare triple {3797#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3798#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:01,138 INFO L273 TraceCheckUtils]: 11: Hoare triple {3798#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3799#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:01,139 INFO L273 TraceCheckUtils]: 12: Hoare triple {3799#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3800#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:01,139 INFO L273 TraceCheckUtils]: 13: Hoare triple {3800#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3801#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:01,140 INFO L273 TraceCheckUtils]: 14: Hoare triple {3801#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3802#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:01,141 INFO L273 TraceCheckUtils]: 15: Hoare triple {3802#(<= main_~i~0 9)} assume !(~i~0 < 100000); {3792#false} is VALID [2018-11-23 11:55:01,141 INFO L273 TraceCheckUtils]: 16: Hoare triple {3792#false} ~i~0 := 0; {3792#false} is VALID [2018-11-23 11:55:01,141 INFO L273 TraceCheckUtils]: 17: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3792#false} is VALID [2018-11-23 11:55:01,142 INFO L273 TraceCheckUtils]: 18: Hoare triple {3792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3792#false} is VALID [2018-11-23 11:55:01,142 INFO L273 TraceCheckUtils]: 19: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3792#false} is VALID [2018-11-23 11:55:01,142 INFO L273 TraceCheckUtils]: 20: Hoare triple {3792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3792#false} is VALID [2018-11-23 11:55:01,142 INFO L273 TraceCheckUtils]: 21: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3792#false} is VALID [2018-11-23 11:55:01,142 INFO L273 TraceCheckUtils]: 22: Hoare triple {3792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3792#false} is VALID [2018-11-23 11:55:01,143 INFO L273 TraceCheckUtils]: 23: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3792#false} is VALID [2018-11-23 11:55:01,143 INFO L273 TraceCheckUtils]: 24: Hoare triple {3792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3792#false} is VALID [2018-11-23 11:55:01,143 INFO L273 TraceCheckUtils]: 25: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3792#false} is VALID [2018-11-23 11:55:01,143 INFO L273 TraceCheckUtils]: 26: Hoare triple {3792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3792#false} is VALID [2018-11-23 11:55:01,143 INFO L273 TraceCheckUtils]: 27: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3792#false} is VALID [2018-11-23 11:55:01,144 INFO L273 TraceCheckUtils]: 28: Hoare triple {3792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3792#false} is VALID [2018-11-23 11:55:01,144 INFO L273 TraceCheckUtils]: 29: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3792#false} is VALID [2018-11-23 11:55:01,144 INFO L273 TraceCheckUtils]: 30: Hoare triple {3792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3792#false} is VALID [2018-11-23 11:55:01,144 INFO L273 TraceCheckUtils]: 31: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3792#false} is VALID [2018-11-23 11:55:01,144 INFO L273 TraceCheckUtils]: 32: Hoare triple {3792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3792#false} is VALID [2018-11-23 11:55:01,145 INFO L273 TraceCheckUtils]: 33: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3792#false} is VALID [2018-11-23 11:55:01,145 INFO L273 TraceCheckUtils]: 34: Hoare triple {3792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3792#false} is VALID [2018-11-23 11:55:01,145 INFO L273 TraceCheckUtils]: 35: Hoare triple {3792#false} assume !(~i~0 < 100000); {3792#false} is VALID [2018-11-23 11:55:01,145 INFO L273 TraceCheckUtils]: 36: Hoare triple {3792#false} ~i~0 := 0; {3792#false} is VALID [2018-11-23 11:55:01,145 INFO L273 TraceCheckUtils]: 37: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3792#false} is VALID [2018-11-23 11:55:01,145 INFO L273 TraceCheckUtils]: 38: Hoare triple {3792#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3792#false} is VALID [2018-11-23 11:55:01,146 INFO L273 TraceCheckUtils]: 39: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3792#false} is VALID [2018-11-23 11:55:01,146 INFO L273 TraceCheckUtils]: 40: Hoare triple {3792#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3792#false} is VALID [2018-11-23 11:55:01,146 INFO L273 TraceCheckUtils]: 41: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3792#false} is VALID [2018-11-23 11:55:01,146 INFO L273 TraceCheckUtils]: 42: Hoare triple {3792#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3792#false} is VALID [2018-11-23 11:55:01,146 INFO L273 TraceCheckUtils]: 43: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3792#false} is VALID [2018-11-23 11:55:01,146 INFO L273 TraceCheckUtils]: 44: Hoare triple {3792#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3792#false} is VALID [2018-11-23 11:55:01,146 INFO L273 TraceCheckUtils]: 45: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3792#false} is VALID [2018-11-23 11:55:01,146 INFO L273 TraceCheckUtils]: 46: Hoare triple {3792#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3792#false} is VALID [2018-11-23 11:55:01,147 INFO L273 TraceCheckUtils]: 47: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3792#false} is VALID [2018-11-23 11:55:01,147 INFO L273 TraceCheckUtils]: 48: Hoare triple {3792#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3792#false} is VALID [2018-11-23 11:55:01,147 INFO L273 TraceCheckUtils]: 49: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3792#false} is VALID [2018-11-23 11:55:01,147 INFO L273 TraceCheckUtils]: 50: Hoare triple {3792#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3792#false} is VALID [2018-11-23 11:55:01,147 INFO L273 TraceCheckUtils]: 51: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3792#false} is VALID [2018-11-23 11:55:01,147 INFO L273 TraceCheckUtils]: 52: Hoare triple {3792#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3792#false} is VALID [2018-11-23 11:55:01,148 INFO L273 TraceCheckUtils]: 53: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3792#false} is VALID [2018-11-23 11:55:01,148 INFO L273 TraceCheckUtils]: 54: Hoare triple {3792#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3792#false} is VALID [2018-11-23 11:55:01,148 INFO L273 TraceCheckUtils]: 55: Hoare triple {3792#false} assume !(~i~0 < 100000); {3792#false} is VALID [2018-11-23 11:55:01,148 INFO L273 TraceCheckUtils]: 56: Hoare triple {3792#false} havoc ~x~0;~x~0 := 0; {3792#false} is VALID [2018-11-23 11:55:01,148 INFO L273 TraceCheckUtils]: 57: Hoare triple {3792#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3792#false} is VALID [2018-11-23 11:55:01,149 INFO L256 TraceCheckUtils]: 58: Hoare triple {3792#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {3792#false} is VALID [2018-11-23 11:55:01,149 INFO L273 TraceCheckUtils]: 59: Hoare triple {3792#false} ~cond := #in~cond; {3792#false} is VALID [2018-11-23 11:55:01,149 INFO L273 TraceCheckUtils]: 60: Hoare triple {3792#false} assume 0 == ~cond; {3792#false} is VALID [2018-11-23 11:55:01,149 INFO L273 TraceCheckUtils]: 61: Hoare triple {3792#false} assume !false; {3792#false} is VALID [2018-11-23 11:55:01,152 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-11-23 11:55:01,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:01,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 11:55:01,183 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-11-23 11:55:01,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:01,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:55:01,278 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:01,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:55:01,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:55:01,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:55:01,279 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 13 states. [2018-11-23 11:55:01,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:01,706 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-11-23 11:55:01,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:55:01,706 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-11-23 11:55:01,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:01,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:55:01,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 99 transitions. [2018-11-23 11:55:01,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:55:01,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 99 transitions. [2018-11-23 11:55:01,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 99 transitions. [2018-11-23 11:55:01,815 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:01,817 INFO L225 Difference]: With dead ends: 125 [2018-11-23 11:55:01,817 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 11:55:01,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:55:01,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 11:55:01,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-11-23 11:55:01,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:01,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 72 states. [2018-11-23 11:55:01,854 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 72 states. [2018-11-23 11:55:01,855 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 72 states. [2018-11-23 11:55:01,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:01,856 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-11-23 11:55:01,856 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-11-23 11:55:01,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:01,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:01,856 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 74 states. [2018-11-23 11:55:01,857 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 74 states. [2018-11-23 11:55:01,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:01,858 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-11-23 11:55:01,858 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-11-23 11:55:01,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:01,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:01,859 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:01,859 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:01,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 11:55:01,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2018-11-23 11:55:01,861 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 62 [2018-11-23 11:55:01,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:01,861 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2018-11-23 11:55:01,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:55:01,861 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2018-11-23 11:55:01,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 11:55:01,862 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:01,862 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:01,862 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:01,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:01,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1207107598, now seen corresponding path program 10 times [2018-11-23 11:55:01,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:01,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:01,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:01,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:01,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:02,225 INFO L256 TraceCheckUtils]: 0: Hoare triple {4437#true} call ULTIMATE.init(); {4437#true} is VALID [2018-11-23 11:55:02,225 INFO L273 TraceCheckUtils]: 1: Hoare triple {4437#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4437#true} is VALID [2018-11-23 11:55:02,225 INFO L273 TraceCheckUtils]: 2: Hoare triple {4437#true} assume true; {4437#true} is VALID [2018-11-23 11:55:02,226 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4437#true} {4437#true} #76#return; {4437#true} is VALID [2018-11-23 11:55:02,226 INFO L256 TraceCheckUtils]: 4: Hoare triple {4437#true} call #t~ret6 := main(); {4437#true} is VALID [2018-11-23 11:55:02,227 INFO L273 TraceCheckUtils]: 5: Hoare triple {4437#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4439#(= main_~i~0 0)} is VALID [2018-11-23 11:55:02,227 INFO L273 TraceCheckUtils]: 6: Hoare triple {4439#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4440#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:02,229 INFO L273 TraceCheckUtils]: 7: Hoare triple {4440#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4441#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:02,230 INFO L273 TraceCheckUtils]: 8: Hoare triple {4441#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4442#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:02,231 INFO L273 TraceCheckUtils]: 9: Hoare triple {4442#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4443#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:02,233 INFO L273 TraceCheckUtils]: 10: Hoare triple {4443#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4444#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:02,234 INFO L273 TraceCheckUtils]: 11: Hoare triple {4444#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4445#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:02,235 INFO L273 TraceCheckUtils]: 12: Hoare triple {4445#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4446#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:02,235 INFO L273 TraceCheckUtils]: 13: Hoare triple {4446#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4447#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:02,237 INFO L273 TraceCheckUtils]: 14: Hoare triple {4447#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4448#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:02,238 INFO L273 TraceCheckUtils]: 15: Hoare triple {4448#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4449#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:02,239 INFO L273 TraceCheckUtils]: 16: Hoare triple {4449#(<= main_~i~0 10)} assume !(~i~0 < 100000); {4438#false} is VALID [2018-11-23 11:55:02,239 INFO L273 TraceCheckUtils]: 17: Hoare triple {4438#false} ~i~0 := 0; {4438#false} is VALID [2018-11-23 11:55:02,239 INFO L273 TraceCheckUtils]: 18: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4438#false} is VALID [2018-11-23 11:55:02,239 INFO L273 TraceCheckUtils]: 19: Hoare triple {4438#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4438#false} is VALID [2018-11-23 11:55:02,240 INFO L273 TraceCheckUtils]: 20: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4438#false} is VALID [2018-11-23 11:55:02,240 INFO L273 TraceCheckUtils]: 21: Hoare triple {4438#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4438#false} is VALID [2018-11-23 11:55:02,240 INFO L273 TraceCheckUtils]: 22: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4438#false} is VALID [2018-11-23 11:55:02,240 INFO L273 TraceCheckUtils]: 23: Hoare triple {4438#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4438#false} is VALID [2018-11-23 11:55:02,240 INFO L273 TraceCheckUtils]: 24: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4438#false} is VALID [2018-11-23 11:55:02,241 INFO L273 TraceCheckUtils]: 25: Hoare triple {4438#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4438#false} is VALID [2018-11-23 11:55:02,241 INFO L273 TraceCheckUtils]: 26: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4438#false} is VALID [2018-11-23 11:55:02,241 INFO L273 TraceCheckUtils]: 27: Hoare triple {4438#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4438#false} is VALID [2018-11-23 11:55:02,241 INFO L273 TraceCheckUtils]: 28: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4438#false} is VALID [2018-11-23 11:55:02,241 INFO L273 TraceCheckUtils]: 29: Hoare triple {4438#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4438#false} is VALID [2018-11-23 11:55:02,241 INFO L273 TraceCheckUtils]: 30: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4438#false} is VALID [2018-11-23 11:55:02,242 INFO L273 TraceCheckUtils]: 31: Hoare triple {4438#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4438#false} is VALID [2018-11-23 11:55:02,242 INFO L273 TraceCheckUtils]: 32: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4438#false} is VALID [2018-11-23 11:55:02,242 INFO L273 TraceCheckUtils]: 33: Hoare triple {4438#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4438#false} is VALID [2018-11-23 11:55:02,242 INFO L273 TraceCheckUtils]: 34: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4438#false} is VALID [2018-11-23 11:55:02,242 INFO L273 TraceCheckUtils]: 35: Hoare triple {4438#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4438#false} is VALID [2018-11-23 11:55:02,242 INFO L273 TraceCheckUtils]: 36: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4438#false} is VALID [2018-11-23 11:55:02,242 INFO L273 TraceCheckUtils]: 37: Hoare triple {4438#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4438#false} is VALID [2018-11-23 11:55:02,242 INFO L273 TraceCheckUtils]: 38: Hoare triple {4438#false} assume !(~i~0 < 100000); {4438#false} is VALID [2018-11-23 11:55:02,243 INFO L273 TraceCheckUtils]: 39: Hoare triple {4438#false} ~i~0 := 0; {4438#false} is VALID [2018-11-23 11:55:02,243 INFO L273 TraceCheckUtils]: 40: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 11:55:02,243 INFO L273 TraceCheckUtils]: 41: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 11:55:02,243 INFO L273 TraceCheckUtils]: 42: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 11:55:02,243 INFO L273 TraceCheckUtils]: 43: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 11:55:02,243 INFO L273 TraceCheckUtils]: 44: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 11:55:02,243 INFO L273 TraceCheckUtils]: 45: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 11:55:02,243 INFO L273 TraceCheckUtils]: 46: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 11:55:02,243 INFO L273 TraceCheckUtils]: 47: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 11:55:02,244 INFO L273 TraceCheckUtils]: 48: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 11:55:02,244 INFO L273 TraceCheckUtils]: 49: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 11:55:02,244 INFO L273 TraceCheckUtils]: 50: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 11:55:02,244 INFO L273 TraceCheckUtils]: 51: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 11:55:02,244 INFO L273 TraceCheckUtils]: 52: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 11:55:02,244 INFO L273 TraceCheckUtils]: 53: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 11:55:02,244 INFO L273 TraceCheckUtils]: 54: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 11:55:02,244 INFO L273 TraceCheckUtils]: 55: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 11:55:02,245 INFO L273 TraceCheckUtils]: 56: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 11:55:02,245 INFO L273 TraceCheckUtils]: 57: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 11:55:02,245 INFO L273 TraceCheckUtils]: 58: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 11:55:02,245 INFO L273 TraceCheckUtils]: 59: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 11:55:02,245 INFO L273 TraceCheckUtils]: 60: Hoare triple {4438#false} assume !(~i~0 < 100000); {4438#false} is VALID [2018-11-23 11:55:02,245 INFO L273 TraceCheckUtils]: 61: Hoare triple {4438#false} havoc ~x~0;~x~0 := 0; {4438#false} is VALID [2018-11-23 11:55:02,245 INFO L273 TraceCheckUtils]: 62: Hoare triple {4438#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4438#false} is VALID [2018-11-23 11:55:02,245 INFO L256 TraceCheckUtils]: 63: Hoare triple {4438#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {4438#false} is VALID [2018-11-23 11:55:02,246 INFO L273 TraceCheckUtils]: 64: Hoare triple {4438#false} ~cond := #in~cond; {4438#false} is VALID [2018-11-23 11:55:02,246 INFO L273 TraceCheckUtils]: 65: Hoare triple {4438#false} assume 0 == ~cond; {4438#false} is VALID [2018-11-23 11:55:02,246 INFO L273 TraceCheckUtils]: 66: Hoare triple {4438#false} assume !false; {4438#false} is VALID [2018-11-23 11:55:02,250 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-23 11:55:02,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:02,250 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:02,264 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:55:02,302 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:55:02,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:02,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:02,601 INFO L256 TraceCheckUtils]: 0: Hoare triple {4437#true} call ULTIMATE.init(); {4437#true} is VALID [2018-11-23 11:55:02,602 INFO L273 TraceCheckUtils]: 1: Hoare triple {4437#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4437#true} is VALID [2018-11-23 11:55:02,602 INFO L273 TraceCheckUtils]: 2: Hoare triple {4437#true} assume true; {4437#true} is VALID [2018-11-23 11:55:02,602 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4437#true} {4437#true} #76#return; {4437#true} is VALID [2018-11-23 11:55:02,602 INFO L256 TraceCheckUtils]: 4: Hoare triple {4437#true} call #t~ret6 := main(); {4437#true} is VALID [2018-11-23 11:55:02,603 INFO L273 TraceCheckUtils]: 5: Hoare triple {4437#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4437#true} is VALID [2018-11-23 11:55:02,603 INFO L273 TraceCheckUtils]: 6: Hoare triple {4437#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4437#true} is VALID [2018-11-23 11:55:02,603 INFO L273 TraceCheckUtils]: 7: Hoare triple {4437#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4437#true} is VALID [2018-11-23 11:55:02,603 INFO L273 TraceCheckUtils]: 8: Hoare triple {4437#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4437#true} is VALID [2018-11-23 11:55:02,604 INFO L273 TraceCheckUtils]: 9: Hoare triple {4437#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4437#true} is VALID [2018-11-23 11:55:02,604 INFO L273 TraceCheckUtils]: 10: Hoare triple {4437#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4437#true} is VALID [2018-11-23 11:55:02,604 INFO L273 TraceCheckUtils]: 11: Hoare triple {4437#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4437#true} is VALID [2018-11-23 11:55:02,604 INFO L273 TraceCheckUtils]: 12: Hoare triple {4437#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4437#true} is VALID [2018-11-23 11:55:02,604 INFO L273 TraceCheckUtils]: 13: Hoare triple {4437#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4437#true} is VALID [2018-11-23 11:55:02,605 INFO L273 TraceCheckUtils]: 14: Hoare triple {4437#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4437#true} is VALID [2018-11-23 11:55:02,605 INFO L273 TraceCheckUtils]: 15: Hoare triple {4437#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4437#true} is VALID [2018-11-23 11:55:02,605 INFO L273 TraceCheckUtils]: 16: Hoare triple {4437#true} assume !(~i~0 < 100000); {4437#true} is VALID [2018-11-23 11:55:02,605 INFO L273 TraceCheckUtils]: 17: Hoare triple {4437#true} ~i~0 := 0; {4504#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:02,606 INFO L273 TraceCheckUtils]: 18: Hoare triple {4504#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4504#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:02,606 INFO L273 TraceCheckUtils]: 19: Hoare triple {4504#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4440#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:02,607 INFO L273 TraceCheckUtils]: 20: Hoare triple {4440#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4440#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:02,607 INFO L273 TraceCheckUtils]: 21: Hoare triple {4440#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4441#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:02,607 INFO L273 TraceCheckUtils]: 22: Hoare triple {4441#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4441#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:02,608 INFO L273 TraceCheckUtils]: 23: Hoare triple {4441#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4442#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:02,608 INFO L273 TraceCheckUtils]: 24: Hoare triple {4442#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4442#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:02,609 INFO L273 TraceCheckUtils]: 25: Hoare triple {4442#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4443#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:02,610 INFO L273 TraceCheckUtils]: 26: Hoare triple {4443#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4443#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:02,610 INFO L273 TraceCheckUtils]: 27: Hoare triple {4443#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4444#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:02,611 INFO L273 TraceCheckUtils]: 28: Hoare triple {4444#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4444#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:02,612 INFO L273 TraceCheckUtils]: 29: Hoare triple {4444#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4445#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:02,613 INFO L273 TraceCheckUtils]: 30: Hoare triple {4445#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4445#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:02,613 INFO L273 TraceCheckUtils]: 31: Hoare triple {4445#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4446#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:02,614 INFO L273 TraceCheckUtils]: 32: Hoare triple {4446#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4446#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:02,615 INFO L273 TraceCheckUtils]: 33: Hoare triple {4446#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4447#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:02,615 INFO L273 TraceCheckUtils]: 34: Hoare triple {4447#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4447#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:02,616 INFO L273 TraceCheckUtils]: 35: Hoare triple {4447#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4448#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:02,617 INFO L273 TraceCheckUtils]: 36: Hoare triple {4448#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4448#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:02,618 INFO L273 TraceCheckUtils]: 37: Hoare triple {4448#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4449#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:02,618 INFO L273 TraceCheckUtils]: 38: Hoare triple {4449#(<= main_~i~0 10)} assume !(~i~0 < 100000); {4438#false} is VALID [2018-11-23 11:55:02,619 INFO L273 TraceCheckUtils]: 39: Hoare triple {4438#false} ~i~0 := 0; {4438#false} is VALID [2018-11-23 11:55:02,619 INFO L273 TraceCheckUtils]: 40: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 11:55:02,619 INFO L273 TraceCheckUtils]: 41: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 11:55:02,619 INFO L273 TraceCheckUtils]: 42: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 11:55:02,620 INFO L273 TraceCheckUtils]: 43: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 11:55:02,620 INFO L273 TraceCheckUtils]: 44: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 11:55:02,620 INFO L273 TraceCheckUtils]: 45: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 11:55:02,620 INFO L273 TraceCheckUtils]: 46: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 11:55:02,621 INFO L273 TraceCheckUtils]: 47: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 11:55:02,621 INFO L273 TraceCheckUtils]: 48: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 11:55:02,621 INFO L273 TraceCheckUtils]: 49: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 11:55:02,621 INFO L273 TraceCheckUtils]: 50: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 11:55:02,621 INFO L273 TraceCheckUtils]: 51: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 11:55:02,621 INFO L273 TraceCheckUtils]: 52: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 11:55:02,622 INFO L273 TraceCheckUtils]: 53: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 11:55:02,622 INFO L273 TraceCheckUtils]: 54: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 11:55:02,622 INFO L273 TraceCheckUtils]: 55: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 11:55:02,622 INFO L273 TraceCheckUtils]: 56: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 11:55:02,622 INFO L273 TraceCheckUtils]: 57: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 11:55:02,622 INFO L273 TraceCheckUtils]: 58: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 11:55:02,622 INFO L273 TraceCheckUtils]: 59: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 11:55:02,623 INFO L273 TraceCheckUtils]: 60: Hoare triple {4438#false} assume !(~i~0 < 100000); {4438#false} is VALID [2018-11-23 11:55:02,623 INFO L273 TraceCheckUtils]: 61: Hoare triple {4438#false} havoc ~x~0;~x~0 := 0; {4438#false} is VALID [2018-11-23 11:55:02,623 INFO L273 TraceCheckUtils]: 62: Hoare triple {4438#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4438#false} is VALID [2018-11-23 11:55:02,623 INFO L256 TraceCheckUtils]: 63: Hoare triple {4438#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {4438#false} is VALID [2018-11-23 11:55:02,623 INFO L273 TraceCheckUtils]: 64: Hoare triple {4438#false} ~cond := #in~cond; {4438#false} is VALID [2018-11-23 11:55:02,623 INFO L273 TraceCheckUtils]: 65: Hoare triple {4438#false} assume 0 == ~cond; {4438#false} is VALID [2018-11-23 11:55:02,624 INFO L273 TraceCheckUtils]: 66: Hoare triple {4438#false} assume !false; {4438#false} is VALID [2018-11-23 11:55:02,628 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-23 11:55:02,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:02,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 11:55:02,648 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2018-11-23 11:55:02,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:02,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:55:02,708 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:02,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:55:02,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:55:02,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:55:02,709 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 14 states. [2018-11-23 11:55:03,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:03,035 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2018-11-23 11:55:03,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:55:03,035 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2018-11-23 11:55:03,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:03,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:55:03,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 104 transitions. [2018-11-23 11:55:03,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:55:03,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 104 transitions. [2018-11-23 11:55:03,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 104 transitions. [2018-11-23 11:55:03,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:03,160 INFO L225 Difference]: With dead ends: 134 [2018-11-23 11:55:03,160 INFO L226 Difference]: Without dead ends: 79 [2018-11-23 11:55:03,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:55:03,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-23 11:55:03,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-11-23 11:55:03,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:03,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 77 states. [2018-11-23 11:55:03,720 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 77 states. [2018-11-23 11:55:03,720 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 77 states. [2018-11-23 11:55:03,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:03,722 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-11-23 11:55:03,722 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2018-11-23 11:55:03,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:03,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:03,722 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 79 states. [2018-11-23 11:55:03,722 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 79 states. [2018-11-23 11:55:03,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:03,723 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-11-23 11:55:03,724 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2018-11-23 11:55:03,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:03,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:03,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:03,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:03,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 11:55:03,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2018-11-23 11:55:03,726 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 67 [2018-11-23 11:55:03,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:03,726 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2018-11-23 11:55:03,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:55:03,727 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2018-11-23 11:55:03,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 11:55:03,728 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:03,728 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:03,728 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:03,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:03,728 INFO L82 PathProgramCache]: Analyzing trace with hash 2083114930, now seen corresponding path program 11 times [2018-11-23 11:55:03,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:03,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:03,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:03,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:03,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:03,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:04,362 INFO L256 TraceCheckUtils]: 0: Hoare triple {5131#true} call ULTIMATE.init(); {5131#true} is VALID [2018-11-23 11:55:04,362 INFO L273 TraceCheckUtils]: 1: Hoare triple {5131#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5131#true} is VALID [2018-11-23 11:55:04,362 INFO L273 TraceCheckUtils]: 2: Hoare triple {5131#true} assume true; {5131#true} is VALID [2018-11-23 11:55:04,362 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5131#true} {5131#true} #76#return; {5131#true} is VALID [2018-11-23 11:55:04,363 INFO L256 TraceCheckUtils]: 4: Hoare triple {5131#true} call #t~ret6 := main(); {5131#true} is VALID [2018-11-23 11:55:04,363 INFO L273 TraceCheckUtils]: 5: Hoare triple {5131#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5133#(= main_~i~0 0)} is VALID [2018-11-23 11:55:04,364 INFO L273 TraceCheckUtils]: 6: Hoare triple {5133#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5134#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:04,365 INFO L273 TraceCheckUtils]: 7: Hoare triple {5134#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5135#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:04,365 INFO L273 TraceCheckUtils]: 8: Hoare triple {5135#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5136#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:04,366 INFO L273 TraceCheckUtils]: 9: Hoare triple {5136#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5137#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:04,366 INFO L273 TraceCheckUtils]: 10: Hoare triple {5137#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5138#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:04,367 INFO L273 TraceCheckUtils]: 11: Hoare triple {5138#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5139#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:04,368 INFO L273 TraceCheckUtils]: 12: Hoare triple {5139#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5140#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:04,368 INFO L273 TraceCheckUtils]: 13: Hoare triple {5140#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5141#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:04,369 INFO L273 TraceCheckUtils]: 14: Hoare triple {5141#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5142#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:04,370 INFO L273 TraceCheckUtils]: 15: Hoare triple {5142#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5143#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:04,371 INFO L273 TraceCheckUtils]: 16: Hoare triple {5143#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5144#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:04,372 INFO L273 TraceCheckUtils]: 17: Hoare triple {5144#(<= main_~i~0 11)} assume !(~i~0 < 100000); {5132#false} is VALID [2018-11-23 11:55:04,372 INFO L273 TraceCheckUtils]: 18: Hoare triple {5132#false} ~i~0 := 0; {5132#false} is VALID [2018-11-23 11:55:04,372 INFO L273 TraceCheckUtils]: 19: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5132#false} is VALID [2018-11-23 11:55:04,372 INFO L273 TraceCheckUtils]: 20: Hoare triple {5132#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5132#false} is VALID [2018-11-23 11:55:04,373 INFO L273 TraceCheckUtils]: 21: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5132#false} is VALID [2018-11-23 11:55:04,373 INFO L273 TraceCheckUtils]: 22: Hoare triple {5132#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5132#false} is VALID [2018-11-23 11:55:04,373 INFO L273 TraceCheckUtils]: 23: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5132#false} is VALID [2018-11-23 11:55:04,373 INFO L273 TraceCheckUtils]: 24: Hoare triple {5132#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5132#false} is VALID [2018-11-23 11:55:04,373 INFO L273 TraceCheckUtils]: 25: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5132#false} is VALID [2018-11-23 11:55:04,374 INFO L273 TraceCheckUtils]: 26: Hoare triple {5132#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5132#false} is VALID [2018-11-23 11:55:04,374 INFO L273 TraceCheckUtils]: 27: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5132#false} is VALID [2018-11-23 11:55:04,374 INFO L273 TraceCheckUtils]: 28: Hoare triple {5132#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5132#false} is VALID [2018-11-23 11:55:04,374 INFO L273 TraceCheckUtils]: 29: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5132#false} is VALID [2018-11-23 11:55:04,374 INFO L273 TraceCheckUtils]: 30: Hoare triple {5132#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5132#false} is VALID [2018-11-23 11:55:04,375 INFO L273 TraceCheckUtils]: 31: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5132#false} is VALID [2018-11-23 11:55:04,375 INFO L273 TraceCheckUtils]: 32: Hoare triple {5132#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5132#false} is VALID [2018-11-23 11:55:04,375 INFO L273 TraceCheckUtils]: 33: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5132#false} is VALID [2018-11-23 11:55:04,375 INFO L273 TraceCheckUtils]: 34: Hoare triple {5132#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5132#false} is VALID [2018-11-23 11:55:04,376 INFO L273 TraceCheckUtils]: 35: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5132#false} is VALID [2018-11-23 11:55:04,376 INFO L273 TraceCheckUtils]: 36: Hoare triple {5132#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5132#false} is VALID [2018-11-23 11:55:04,376 INFO L273 TraceCheckUtils]: 37: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5132#false} is VALID [2018-11-23 11:55:04,376 INFO L273 TraceCheckUtils]: 38: Hoare triple {5132#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5132#false} is VALID [2018-11-23 11:55:04,377 INFO L273 TraceCheckUtils]: 39: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5132#false} is VALID [2018-11-23 11:55:04,377 INFO L273 TraceCheckUtils]: 40: Hoare triple {5132#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5132#false} is VALID [2018-11-23 11:55:04,377 INFO L273 TraceCheckUtils]: 41: Hoare triple {5132#false} assume !(~i~0 < 100000); {5132#false} is VALID [2018-11-23 11:55:04,377 INFO L273 TraceCheckUtils]: 42: Hoare triple {5132#false} ~i~0 := 0; {5132#false} is VALID [2018-11-23 11:55:04,377 INFO L273 TraceCheckUtils]: 43: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5132#false} is VALID [2018-11-23 11:55:04,377 INFO L273 TraceCheckUtils]: 44: Hoare triple {5132#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5132#false} is VALID [2018-11-23 11:55:04,378 INFO L273 TraceCheckUtils]: 45: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5132#false} is VALID [2018-11-23 11:55:04,378 INFO L273 TraceCheckUtils]: 46: Hoare triple {5132#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5132#false} is VALID [2018-11-23 11:55:04,378 INFO L273 TraceCheckUtils]: 47: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5132#false} is VALID [2018-11-23 11:55:04,378 INFO L273 TraceCheckUtils]: 48: Hoare triple {5132#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5132#false} is VALID [2018-11-23 11:55:04,378 INFO L273 TraceCheckUtils]: 49: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5132#false} is VALID [2018-11-23 11:55:04,378 INFO L273 TraceCheckUtils]: 50: Hoare triple {5132#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5132#false} is VALID [2018-11-23 11:55:04,378 INFO L273 TraceCheckUtils]: 51: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5132#false} is VALID [2018-11-23 11:55:04,378 INFO L273 TraceCheckUtils]: 52: Hoare triple {5132#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5132#false} is VALID [2018-11-23 11:55:04,379 INFO L273 TraceCheckUtils]: 53: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5132#false} is VALID [2018-11-23 11:55:04,379 INFO L273 TraceCheckUtils]: 54: Hoare triple {5132#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5132#false} is VALID [2018-11-23 11:55:04,379 INFO L273 TraceCheckUtils]: 55: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5132#false} is VALID [2018-11-23 11:55:04,379 INFO L273 TraceCheckUtils]: 56: Hoare triple {5132#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5132#false} is VALID [2018-11-23 11:55:04,379 INFO L273 TraceCheckUtils]: 57: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5132#false} is VALID [2018-11-23 11:55:04,379 INFO L273 TraceCheckUtils]: 58: Hoare triple {5132#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5132#false} is VALID [2018-11-23 11:55:04,379 INFO L273 TraceCheckUtils]: 59: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5132#false} is VALID [2018-11-23 11:55:04,379 INFO L273 TraceCheckUtils]: 60: Hoare triple {5132#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5132#false} is VALID [2018-11-23 11:55:04,379 INFO L273 TraceCheckUtils]: 61: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5132#false} is VALID [2018-11-23 11:55:04,380 INFO L273 TraceCheckUtils]: 62: Hoare triple {5132#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5132#false} is VALID [2018-11-23 11:55:04,380 INFO L273 TraceCheckUtils]: 63: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5132#false} is VALID [2018-11-23 11:55:04,380 INFO L273 TraceCheckUtils]: 64: Hoare triple {5132#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5132#false} is VALID [2018-11-23 11:55:04,380 INFO L273 TraceCheckUtils]: 65: Hoare triple {5132#false} assume !(~i~0 < 100000); {5132#false} is VALID [2018-11-23 11:55:04,380 INFO L273 TraceCheckUtils]: 66: Hoare triple {5132#false} havoc ~x~0;~x~0 := 0; {5132#false} is VALID [2018-11-23 11:55:04,380 INFO L273 TraceCheckUtils]: 67: Hoare triple {5132#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5132#false} is VALID [2018-11-23 11:55:04,380 INFO L256 TraceCheckUtils]: 68: Hoare triple {5132#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {5132#false} is VALID [2018-11-23 11:55:04,380 INFO L273 TraceCheckUtils]: 69: Hoare triple {5132#false} ~cond := #in~cond; {5132#false} is VALID [2018-11-23 11:55:04,381 INFO L273 TraceCheckUtils]: 70: Hoare triple {5132#false} assume 0 == ~cond; {5132#false} is VALID [2018-11-23 11:55:04,381 INFO L273 TraceCheckUtils]: 71: Hoare triple {5132#false} assume !false; {5132#false} is VALID [2018-11-23 11:55:04,383 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-11-23 11:55:04,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:04,383 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:04,391 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:55:27,982 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 11:55:27,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:28,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:28,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:28,209 INFO L256 TraceCheckUtils]: 0: Hoare triple {5131#true} call ULTIMATE.init(); {5131#true} is VALID [2018-11-23 11:55:28,209 INFO L273 TraceCheckUtils]: 1: Hoare triple {5131#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5131#true} is VALID [2018-11-23 11:55:28,210 INFO L273 TraceCheckUtils]: 2: Hoare triple {5131#true} assume true; {5131#true} is VALID [2018-11-23 11:55:28,210 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5131#true} {5131#true} #76#return; {5131#true} is VALID [2018-11-23 11:55:28,210 INFO L256 TraceCheckUtils]: 4: Hoare triple {5131#true} call #t~ret6 := main(); {5131#true} is VALID [2018-11-23 11:55:28,210 INFO L273 TraceCheckUtils]: 5: Hoare triple {5131#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5131#true} is VALID [2018-11-23 11:55:28,211 INFO L273 TraceCheckUtils]: 6: Hoare triple {5131#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5131#true} is VALID [2018-11-23 11:55:28,211 INFO L273 TraceCheckUtils]: 7: Hoare triple {5131#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5131#true} is VALID [2018-11-23 11:55:28,211 INFO L273 TraceCheckUtils]: 8: Hoare triple {5131#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5131#true} is VALID [2018-11-23 11:55:28,211 INFO L273 TraceCheckUtils]: 9: Hoare triple {5131#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5131#true} is VALID [2018-11-23 11:55:28,211 INFO L273 TraceCheckUtils]: 10: Hoare triple {5131#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5131#true} is VALID [2018-11-23 11:55:28,212 INFO L273 TraceCheckUtils]: 11: Hoare triple {5131#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5131#true} is VALID [2018-11-23 11:55:28,212 INFO L273 TraceCheckUtils]: 12: Hoare triple {5131#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5131#true} is VALID [2018-11-23 11:55:28,212 INFO L273 TraceCheckUtils]: 13: Hoare triple {5131#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5131#true} is VALID [2018-11-23 11:55:28,212 INFO L273 TraceCheckUtils]: 14: Hoare triple {5131#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5131#true} is VALID [2018-11-23 11:55:28,212 INFO L273 TraceCheckUtils]: 15: Hoare triple {5131#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5131#true} is VALID [2018-11-23 11:55:28,212 INFO L273 TraceCheckUtils]: 16: Hoare triple {5131#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5131#true} is VALID [2018-11-23 11:55:28,213 INFO L273 TraceCheckUtils]: 17: Hoare triple {5131#true} assume !(~i~0 < 100000); {5131#true} is VALID [2018-11-23 11:55:28,213 INFO L273 TraceCheckUtils]: 18: Hoare triple {5131#true} ~i~0 := 0; {5131#true} is VALID [2018-11-23 11:55:28,213 INFO L273 TraceCheckUtils]: 19: Hoare triple {5131#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5131#true} is VALID [2018-11-23 11:55:28,213 INFO L273 TraceCheckUtils]: 20: Hoare triple {5131#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5131#true} is VALID [2018-11-23 11:55:28,213 INFO L273 TraceCheckUtils]: 21: Hoare triple {5131#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5131#true} is VALID [2018-11-23 11:55:28,213 INFO L273 TraceCheckUtils]: 22: Hoare triple {5131#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5131#true} is VALID [2018-11-23 11:55:28,213 INFO L273 TraceCheckUtils]: 23: Hoare triple {5131#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5131#true} is VALID [2018-11-23 11:55:28,213 INFO L273 TraceCheckUtils]: 24: Hoare triple {5131#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5131#true} is VALID [2018-11-23 11:55:28,213 INFO L273 TraceCheckUtils]: 25: Hoare triple {5131#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5131#true} is VALID [2018-11-23 11:55:28,214 INFO L273 TraceCheckUtils]: 26: Hoare triple {5131#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5131#true} is VALID [2018-11-23 11:55:28,214 INFO L273 TraceCheckUtils]: 27: Hoare triple {5131#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5131#true} is VALID [2018-11-23 11:55:28,214 INFO L273 TraceCheckUtils]: 28: Hoare triple {5131#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5131#true} is VALID [2018-11-23 11:55:28,214 INFO L273 TraceCheckUtils]: 29: Hoare triple {5131#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5131#true} is VALID [2018-11-23 11:55:28,214 INFO L273 TraceCheckUtils]: 30: Hoare triple {5131#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5131#true} is VALID [2018-11-23 11:55:28,214 INFO L273 TraceCheckUtils]: 31: Hoare triple {5131#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5131#true} is VALID [2018-11-23 11:55:28,214 INFO L273 TraceCheckUtils]: 32: Hoare triple {5131#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5131#true} is VALID [2018-11-23 11:55:28,214 INFO L273 TraceCheckUtils]: 33: Hoare triple {5131#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5131#true} is VALID [2018-11-23 11:55:28,215 INFO L273 TraceCheckUtils]: 34: Hoare triple {5131#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5131#true} is VALID [2018-11-23 11:55:28,215 INFO L273 TraceCheckUtils]: 35: Hoare triple {5131#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5131#true} is VALID [2018-11-23 11:55:28,215 INFO L273 TraceCheckUtils]: 36: Hoare triple {5131#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5131#true} is VALID [2018-11-23 11:55:28,215 INFO L273 TraceCheckUtils]: 37: Hoare triple {5131#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5131#true} is VALID [2018-11-23 11:55:28,215 INFO L273 TraceCheckUtils]: 38: Hoare triple {5131#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5131#true} is VALID [2018-11-23 11:55:28,215 INFO L273 TraceCheckUtils]: 39: Hoare triple {5131#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5131#true} is VALID [2018-11-23 11:55:28,215 INFO L273 TraceCheckUtils]: 40: Hoare triple {5131#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5131#true} is VALID [2018-11-23 11:55:28,215 INFO L273 TraceCheckUtils]: 41: Hoare triple {5131#true} assume !(~i~0 < 100000); {5131#true} is VALID [2018-11-23 11:55:28,217 INFO L273 TraceCheckUtils]: 42: Hoare triple {5131#true} ~i~0 := 0; {5274#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:28,217 INFO L273 TraceCheckUtils]: 43: Hoare triple {5274#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5274#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:28,217 INFO L273 TraceCheckUtils]: 44: Hoare triple {5274#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5134#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:28,218 INFO L273 TraceCheckUtils]: 45: Hoare triple {5134#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5134#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:28,218 INFO L273 TraceCheckUtils]: 46: Hoare triple {5134#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5135#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:28,219 INFO L273 TraceCheckUtils]: 47: Hoare triple {5135#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5135#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:28,219 INFO L273 TraceCheckUtils]: 48: Hoare triple {5135#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5136#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:28,219 INFO L273 TraceCheckUtils]: 49: Hoare triple {5136#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5136#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:28,220 INFO L273 TraceCheckUtils]: 50: Hoare triple {5136#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5137#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:28,221 INFO L273 TraceCheckUtils]: 51: Hoare triple {5137#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5137#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:28,221 INFO L273 TraceCheckUtils]: 52: Hoare triple {5137#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5138#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:28,222 INFO L273 TraceCheckUtils]: 53: Hoare triple {5138#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5138#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:28,223 INFO L273 TraceCheckUtils]: 54: Hoare triple {5138#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5139#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:28,223 INFO L273 TraceCheckUtils]: 55: Hoare triple {5139#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5139#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:28,224 INFO L273 TraceCheckUtils]: 56: Hoare triple {5139#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5140#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:28,224 INFO L273 TraceCheckUtils]: 57: Hoare triple {5140#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5140#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:28,225 INFO L273 TraceCheckUtils]: 58: Hoare triple {5140#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5141#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:28,226 INFO L273 TraceCheckUtils]: 59: Hoare triple {5141#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5141#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:28,226 INFO L273 TraceCheckUtils]: 60: Hoare triple {5141#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5142#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:28,227 INFO L273 TraceCheckUtils]: 61: Hoare triple {5142#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5142#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:28,227 INFO L273 TraceCheckUtils]: 62: Hoare triple {5142#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5143#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:28,228 INFO L273 TraceCheckUtils]: 63: Hoare triple {5143#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5143#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:28,229 INFO L273 TraceCheckUtils]: 64: Hoare triple {5143#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5144#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:28,229 INFO L273 TraceCheckUtils]: 65: Hoare triple {5144#(<= main_~i~0 11)} assume !(~i~0 < 100000); {5132#false} is VALID [2018-11-23 11:55:28,230 INFO L273 TraceCheckUtils]: 66: Hoare triple {5132#false} havoc ~x~0;~x~0 := 0; {5132#false} is VALID [2018-11-23 11:55:28,230 INFO L273 TraceCheckUtils]: 67: Hoare triple {5132#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5132#false} is VALID [2018-11-23 11:55:28,230 INFO L256 TraceCheckUtils]: 68: Hoare triple {5132#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {5132#false} is VALID [2018-11-23 11:55:28,230 INFO L273 TraceCheckUtils]: 69: Hoare triple {5132#false} ~cond := #in~cond; {5132#false} is VALID [2018-11-23 11:55:28,230 INFO L273 TraceCheckUtils]: 70: Hoare triple {5132#false} assume 0 == ~cond; {5132#false} is VALID [2018-11-23 11:55:28,231 INFO L273 TraceCheckUtils]: 71: Hoare triple {5132#false} assume !false; {5132#false} is VALID [2018-11-23 11:55:28,234 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-23 11:55:28,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:28,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 11:55:28,261 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-11-23 11:55:28,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:28,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:55:28,325 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:28,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:55:28,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:55:28,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:55:28,327 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 15 states. [2018-11-23 11:55:29,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:29,018 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2018-11-23 11:55:29,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:55:29,018 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-11-23 11:55:29,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:29,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:55:29,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 109 transitions. [2018-11-23 11:55:29,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:55:29,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 109 transitions. [2018-11-23 11:55:29,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 109 transitions. [2018-11-23 11:55:29,523 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:29,526 INFO L225 Difference]: With dead ends: 143 [2018-11-23 11:55:29,526 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 11:55:29,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:55:29,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 11:55:29,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-11-23 11:55:29,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:29,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 82 states. [2018-11-23 11:55:29,570 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 82 states. [2018-11-23 11:55:29,570 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 82 states. [2018-11-23 11:55:29,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:29,573 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2018-11-23 11:55:29,573 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2018-11-23 11:55:29,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:29,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:29,573 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 84 states. [2018-11-23 11:55:29,574 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 84 states. [2018-11-23 11:55:29,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:29,575 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2018-11-23 11:55:29,576 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2018-11-23 11:55:29,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:29,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:29,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:29,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:29,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 11:55:29,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2018-11-23 11:55:29,578 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 72 [2018-11-23 11:55:29,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:29,579 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2018-11-23 11:55:29,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:55:29,579 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-11-23 11:55:29,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 11:55:29,580 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:29,580 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:29,580 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:29,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:29,581 INFO L82 PathProgramCache]: Analyzing trace with hash 385857002, now seen corresponding path program 12 times [2018-11-23 11:55:29,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:29,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:29,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:29,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:29,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:29,940 INFO L256 TraceCheckUtils]: 0: Hoare triple {5873#true} call ULTIMATE.init(); {5873#true} is VALID [2018-11-23 11:55:29,941 INFO L273 TraceCheckUtils]: 1: Hoare triple {5873#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5873#true} is VALID [2018-11-23 11:55:29,941 INFO L273 TraceCheckUtils]: 2: Hoare triple {5873#true} assume true; {5873#true} is VALID [2018-11-23 11:55:29,941 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5873#true} {5873#true} #76#return; {5873#true} is VALID [2018-11-23 11:55:29,941 INFO L256 TraceCheckUtils]: 4: Hoare triple {5873#true} call #t~ret6 := main(); {5873#true} is VALID [2018-11-23 11:55:29,942 INFO L273 TraceCheckUtils]: 5: Hoare triple {5873#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5875#(= main_~i~0 0)} is VALID [2018-11-23 11:55:29,943 INFO L273 TraceCheckUtils]: 6: Hoare triple {5875#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5876#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:29,943 INFO L273 TraceCheckUtils]: 7: Hoare triple {5876#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5877#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:29,944 INFO L273 TraceCheckUtils]: 8: Hoare triple {5877#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5878#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:29,944 INFO L273 TraceCheckUtils]: 9: Hoare triple {5878#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5879#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:29,945 INFO L273 TraceCheckUtils]: 10: Hoare triple {5879#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5880#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:29,945 INFO L273 TraceCheckUtils]: 11: Hoare triple {5880#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5881#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:29,946 INFO L273 TraceCheckUtils]: 12: Hoare triple {5881#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5882#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:29,947 INFO L273 TraceCheckUtils]: 13: Hoare triple {5882#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5883#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:29,948 INFO L273 TraceCheckUtils]: 14: Hoare triple {5883#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5884#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:29,949 INFO L273 TraceCheckUtils]: 15: Hoare triple {5884#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5885#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:29,950 INFO L273 TraceCheckUtils]: 16: Hoare triple {5885#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5886#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:29,951 INFO L273 TraceCheckUtils]: 17: Hoare triple {5886#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5887#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:29,952 INFO L273 TraceCheckUtils]: 18: Hoare triple {5887#(<= main_~i~0 12)} assume !(~i~0 < 100000); {5874#false} is VALID [2018-11-23 11:55:29,952 INFO L273 TraceCheckUtils]: 19: Hoare triple {5874#false} ~i~0 := 0; {5874#false} is VALID [2018-11-23 11:55:29,952 INFO L273 TraceCheckUtils]: 20: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5874#false} is VALID [2018-11-23 11:55:29,953 INFO L273 TraceCheckUtils]: 21: Hoare triple {5874#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5874#false} is VALID [2018-11-23 11:55:29,953 INFO L273 TraceCheckUtils]: 22: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5874#false} is VALID [2018-11-23 11:55:29,953 INFO L273 TraceCheckUtils]: 23: Hoare triple {5874#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5874#false} is VALID [2018-11-23 11:55:29,953 INFO L273 TraceCheckUtils]: 24: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5874#false} is VALID [2018-11-23 11:55:29,953 INFO L273 TraceCheckUtils]: 25: Hoare triple {5874#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5874#false} is VALID [2018-11-23 11:55:29,954 INFO L273 TraceCheckUtils]: 26: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5874#false} is VALID [2018-11-23 11:55:29,954 INFO L273 TraceCheckUtils]: 27: Hoare triple {5874#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5874#false} is VALID [2018-11-23 11:55:29,954 INFO L273 TraceCheckUtils]: 28: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5874#false} is VALID [2018-11-23 11:55:29,954 INFO L273 TraceCheckUtils]: 29: Hoare triple {5874#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5874#false} is VALID [2018-11-23 11:55:29,954 INFO L273 TraceCheckUtils]: 30: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5874#false} is VALID [2018-11-23 11:55:29,955 INFO L273 TraceCheckUtils]: 31: Hoare triple {5874#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5874#false} is VALID [2018-11-23 11:55:29,955 INFO L273 TraceCheckUtils]: 32: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5874#false} is VALID [2018-11-23 11:55:29,955 INFO L273 TraceCheckUtils]: 33: Hoare triple {5874#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5874#false} is VALID [2018-11-23 11:55:29,955 INFO L273 TraceCheckUtils]: 34: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5874#false} is VALID [2018-11-23 11:55:29,955 INFO L273 TraceCheckUtils]: 35: Hoare triple {5874#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5874#false} is VALID [2018-11-23 11:55:29,955 INFO L273 TraceCheckUtils]: 36: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5874#false} is VALID [2018-11-23 11:55:29,955 INFO L273 TraceCheckUtils]: 37: Hoare triple {5874#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5874#false} is VALID [2018-11-23 11:55:29,955 INFO L273 TraceCheckUtils]: 38: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5874#false} is VALID [2018-11-23 11:55:29,956 INFO L273 TraceCheckUtils]: 39: Hoare triple {5874#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5874#false} is VALID [2018-11-23 11:55:29,956 INFO L273 TraceCheckUtils]: 40: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5874#false} is VALID [2018-11-23 11:55:29,956 INFO L273 TraceCheckUtils]: 41: Hoare triple {5874#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5874#false} is VALID [2018-11-23 11:55:29,956 INFO L273 TraceCheckUtils]: 42: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5874#false} is VALID [2018-11-23 11:55:29,956 INFO L273 TraceCheckUtils]: 43: Hoare triple {5874#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5874#false} is VALID [2018-11-23 11:55:29,956 INFO L273 TraceCheckUtils]: 44: Hoare triple {5874#false} assume !(~i~0 < 100000); {5874#false} is VALID [2018-11-23 11:55:29,956 INFO L273 TraceCheckUtils]: 45: Hoare triple {5874#false} ~i~0 := 0; {5874#false} is VALID [2018-11-23 11:55:29,956 INFO L273 TraceCheckUtils]: 46: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5874#false} is VALID [2018-11-23 11:55:29,956 INFO L273 TraceCheckUtils]: 47: Hoare triple {5874#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5874#false} is VALID [2018-11-23 11:55:29,957 INFO L273 TraceCheckUtils]: 48: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5874#false} is VALID [2018-11-23 11:55:29,957 INFO L273 TraceCheckUtils]: 49: Hoare triple {5874#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5874#false} is VALID [2018-11-23 11:55:29,957 INFO L273 TraceCheckUtils]: 50: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5874#false} is VALID [2018-11-23 11:55:29,957 INFO L273 TraceCheckUtils]: 51: Hoare triple {5874#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5874#false} is VALID [2018-11-23 11:55:29,957 INFO L273 TraceCheckUtils]: 52: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5874#false} is VALID [2018-11-23 11:55:29,957 INFO L273 TraceCheckUtils]: 53: Hoare triple {5874#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5874#false} is VALID [2018-11-23 11:55:29,958 INFO L273 TraceCheckUtils]: 54: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5874#false} is VALID [2018-11-23 11:55:29,958 INFO L273 TraceCheckUtils]: 55: Hoare triple {5874#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5874#false} is VALID [2018-11-23 11:55:29,958 INFO L273 TraceCheckUtils]: 56: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5874#false} is VALID [2018-11-23 11:55:29,958 INFO L273 TraceCheckUtils]: 57: Hoare triple {5874#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5874#false} is VALID [2018-11-23 11:55:29,958 INFO L273 TraceCheckUtils]: 58: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5874#false} is VALID [2018-11-23 11:55:29,958 INFO L273 TraceCheckUtils]: 59: Hoare triple {5874#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5874#false} is VALID [2018-11-23 11:55:29,959 INFO L273 TraceCheckUtils]: 60: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5874#false} is VALID [2018-11-23 11:55:29,959 INFO L273 TraceCheckUtils]: 61: Hoare triple {5874#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5874#false} is VALID [2018-11-23 11:55:29,959 INFO L273 TraceCheckUtils]: 62: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5874#false} is VALID [2018-11-23 11:55:29,959 INFO L273 TraceCheckUtils]: 63: Hoare triple {5874#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5874#false} is VALID [2018-11-23 11:55:29,959 INFO L273 TraceCheckUtils]: 64: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5874#false} is VALID [2018-11-23 11:55:29,960 INFO L273 TraceCheckUtils]: 65: Hoare triple {5874#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5874#false} is VALID [2018-11-23 11:55:29,960 INFO L273 TraceCheckUtils]: 66: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5874#false} is VALID [2018-11-23 11:55:29,960 INFO L273 TraceCheckUtils]: 67: Hoare triple {5874#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5874#false} is VALID [2018-11-23 11:55:29,960 INFO L273 TraceCheckUtils]: 68: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5874#false} is VALID [2018-11-23 11:55:29,960 INFO L273 TraceCheckUtils]: 69: Hoare triple {5874#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5874#false} is VALID [2018-11-23 11:55:29,960 INFO L273 TraceCheckUtils]: 70: Hoare triple {5874#false} assume !(~i~0 < 100000); {5874#false} is VALID [2018-11-23 11:55:29,961 INFO L273 TraceCheckUtils]: 71: Hoare triple {5874#false} havoc ~x~0;~x~0 := 0; {5874#false} is VALID [2018-11-23 11:55:29,961 INFO L273 TraceCheckUtils]: 72: Hoare triple {5874#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5874#false} is VALID [2018-11-23 11:55:29,961 INFO L256 TraceCheckUtils]: 73: Hoare triple {5874#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {5874#false} is VALID [2018-11-23 11:55:29,961 INFO L273 TraceCheckUtils]: 74: Hoare triple {5874#false} ~cond := #in~cond; {5874#false} is VALID [2018-11-23 11:55:29,961 INFO L273 TraceCheckUtils]: 75: Hoare triple {5874#false} assume 0 == ~cond; {5874#false} is VALID [2018-11-23 11:55:29,961 INFO L273 TraceCheckUtils]: 76: Hoare triple {5874#false} assume !false; {5874#false} is VALID [2018-11-23 11:55:29,965 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-11-23 11:55:29,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:29,965 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:29,976 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:55:42,954 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 11:55:42,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:42,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:43,373 INFO L256 TraceCheckUtils]: 0: Hoare triple {5873#true} call ULTIMATE.init(); {5873#true} is VALID [2018-11-23 11:55:43,373 INFO L273 TraceCheckUtils]: 1: Hoare triple {5873#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5873#true} is VALID [2018-11-23 11:55:43,373 INFO L273 TraceCheckUtils]: 2: Hoare triple {5873#true} assume true; {5873#true} is VALID [2018-11-23 11:55:43,373 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5873#true} {5873#true} #76#return; {5873#true} is VALID [2018-11-23 11:55:43,373 INFO L256 TraceCheckUtils]: 4: Hoare triple {5873#true} call #t~ret6 := main(); {5873#true} is VALID [2018-11-23 11:55:43,374 INFO L273 TraceCheckUtils]: 5: Hoare triple {5873#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5873#true} is VALID [2018-11-23 11:55:43,374 INFO L273 TraceCheckUtils]: 6: Hoare triple {5873#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5873#true} is VALID [2018-11-23 11:55:43,374 INFO L273 TraceCheckUtils]: 7: Hoare triple {5873#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5873#true} is VALID [2018-11-23 11:55:43,374 INFO L273 TraceCheckUtils]: 8: Hoare triple {5873#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5873#true} is VALID [2018-11-23 11:55:43,374 INFO L273 TraceCheckUtils]: 9: Hoare triple {5873#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5873#true} is VALID [2018-11-23 11:55:43,374 INFO L273 TraceCheckUtils]: 10: Hoare triple {5873#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5873#true} is VALID [2018-11-23 11:55:43,374 INFO L273 TraceCheckUtils]: 11: Hoare triple {5873#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5873#true} is VALID [2018-11-23 11:55:43,374 INFO L273 TraceCheckUtils]: 12: Hoare triple {5873#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5873#true} is VALID [2018-11-23 11:55:43,375 INFO L273 TraceCheckUtils]: 13: Hoare triple {5873#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5873#true} is VALID [2018-11-23 11:55:43,375 INFO L273 TraceCheckUtils]: 14: Hoare triple {5873#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5873#true} is VALID [2018-11-23 11:55:43,375 INFO L273 TraceCheckUtils]: 15: Hoare triple {5873#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5873#true} is VALID [2018-11-23 11:55:43,375 INFO L273 TraceCheckUtils]: 16: Hoare triple {5873#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5873#true} is VALID [2018-11-23 11:55:43,378 INFO L273 TraceCheckUtils]: 17: Hoare triple {5873#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5942#(<= main_~i~0 100000)} is VALID [2018-11-23 11:55:43,378 INFO L273 TraceCheckUtils]: 18: Hoare triple {5942#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {5873#true} is VALID [2018-11-23 11:55:43,378 INFO L273 TraceCheckUtils]: 19: Hoare triple {5873#true} ~i~0 := 0; {5873#true} is VALID [2018-11-23 11:55:43,378 INFO L273 TraceCheckUtils]: 20: Hoare triple {5873#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5873#true} is VALID [2018-11-23 11:55:43,378 INFO L273 TraceCheckUtils]: 21: Hoare triple {5873#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5873#true} is VALID [2018-11-23 11:55:43,378 INFO L273 TraceCheckUtils]: 22: Hoare triple {5873#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5873#true} is VALID [2018-11-23 11:55:43,378 INFO L273 TraceCheckUtils]: 23: Hoare triple {5873#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5873#true} is VALID [2018-11-23 11:55:43,379 INFO L273 TraceCheckUtils]: 24: Hoare triple {5873#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5873#true} is VALID [2018-11-23 11:55:43,379 INFO L273 TraceCheckUtils]: 25: Hoare triple {5873#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5873#true} is VALID [2018-11-23 11:55:43,379 INFO L273 TraceCheckUtils]: 26: Hoare triple {5873#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5873#true} is VALID [2018-11-23 11:55:43,379 INFO L273 TraceCheckUtils]: 27: Hoare triple {5873#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5873#true} is VALID [2018-11-23 11:55:43,379 INFO L273 TraceCheckUtils]: 28: Hoare triple {5873#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5873#true} is VALID [2018-11-23 11:55:43,379 INFO L273 TraceCheckUtils]: 29: Hoare triple {5873#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5873#true} is VALID [2018-11-23 11:55:43,379 INFO L273 TraceCheckUtils]: 30: Hoare triple {5873#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5873#true} is VALID [2018-11-23 11:55:43,379 INFO L273 TraceCheckUtils]: 31: Hoare triple {5873#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5873#true} is VALID [2018-11-23 11:55:43,380 INFO L273 TraceCheckUtils]: 32: Hoare triple {5873#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5873#true} is VALID [2018-11-23 11:55:43,380 INFO L273 TraceCheckUtils]: 33: Hoare triple {5873#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5873#true} is VALID [2018-11-23 11:55:43,380 INFO L273 TraceCheckUtils]: 34: Hoare triple {5873#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5873#true} is VALID [2018-11-23 11:55:43,380 INFO L273 TraceCheckUtils]: 35: Hoare triple {5873#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5873#true} is VALID [2018-11-23 11:55:43,380 INFO L273 TraceCheckUtils]: 36: Hoare triple {5873#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5873#true} is VALID [2018-11-23 11:55:43,380 INFO L273 TraceCheckUtils]: 37: Hoare triple {5873#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5873#true} is VALID [2018-11-23 11:55:43,380 INFO L273 TraceCheckUtils]: 38: Hoare triple {5873#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5873#true} is VALID [2018-11-23 11:55:43,380 INFO L273 TraceCheckUtils]: 39: Hoare triple {5873#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5873#true} is VALID [2018-11-23 11:55:43,381 INFO L273 TraceCheckUtils]: 40: Hoare triple {5873#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5873#true} is VALID [2018-11-23 11:55:43,381 INFO L273 TraceCheckUtils]: 41: Hoare triple {5873#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5873#true} is VALID [2018-11-23 11:55:43,382 INFO L273 TraceCheckUtils]: 42: Hoare triple {5873#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6018#(< main_~i~0 100000)} is VALID [2018-11-23 11:55:43,384 INFO L273 TraceCheckUtils]: 43: Hoare triple {6018#(< main_~i~0 100000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5942#(<= main_~i~0 100000)} is VALID [2018-11-23 11:55:43,384 INFO L273 TraceCheckUtils]: 44: Hoare triple {5942#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {5873#true} is VALID [2018-11-23 11:55:43,384 INFO L273 TraceCheckUtils]: 45: Hoare triple {5873#true} ~i~0 := 0; {6028#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:43,387 INFO L273 TraceCheckUtils]: 46: Hoare triple {6028#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6028#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:43,387 INFO L273 TraceCheckUtils]: 47: Hoare triple {6028#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5876#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:43,390 INFO L273 TraceCheckUtils]: 48: Hoare triple {5876#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5876#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:43,390 INFO L273 TraceCheckUtils]: 49: Hoare triple {5876#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5877#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:43,393 INFO L273 TraceCheckUtils]: 50: Hoare triple {5877#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5877#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:43,393 INFO L273 TraceCheckUtils]: 51: Hoare triple {5877#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5878#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:43,395 INFO L273 TraceCheckUtils]: 52: Hoare triple {5878#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5878#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:43,395 INFO L273 TraceCheckUtils]: 53: Hoare triple {5878#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5879#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:43,398 INFO L273 TraceCheckUtils]: 54: Hoare triple {5879#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5879#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:43,398 INFO L273 TraceCheckUtils]: 55: Hoare triple {5879#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5880#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:43,400 INFO L273 TraceCheckUtils]: 56: Hoare triple {5880#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5880#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:43,400 INFO L273 TraceCheckUtils]: 57: Hoare triple {5880#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5881#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:43,402 INFO L273 TraceCheckUtils]: 58: Hoare triple {5881#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5881#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:43,402 INFO L273 TraceCheckUtils]: 59: Hoare triple {5881#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5882#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:43,404 INFO L273 TraceCheckUtils]: 60: Hoare triple {5882#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5882#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:43,404 INFO L273 TraceCheckUtils]: 61: Hoare triple {5882#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5883#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:43,406 INFO L273 TraceCheckUtils]: 62: Hoare triple {5883#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5883#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:43,406 INFO L273 TraceCheckUtils]: 63: Hoare triple {5883#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5884#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:43,408 INFO L273 TraceCheckUtils]: 64: Hoare triple {5884#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5884#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:43,408 INFO L273 TraceCheckUtils]: 65: Hoare triple {5884#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5885#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:43,410 INFO L273 TraceCheckUtils]: 66: Hoare triple {5885#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5885#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:43,410 INFO L273 TraceCheckUtils]: 67: Hoare triple {5885#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5886#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:43,413 INFO L273 TraceCheckUtils]: 68: Hoare triple {5886#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5886#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:43,413 INFO L273 TraceCheckUtils]: 69: Hoare triple {5886#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5887#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:43,415 INFO L273 TraceCheckUtils]: 70: Hoare triple {5887#(<= main_~i~0 12)} assume !(~i~0 < 100000); {5874#false} is VALID [2018-11-23 11:55:43,415 INFO L273 TraceCheckUtils]: 71: Hoare triple {5874#false} havoc ~x~0;~x~0 := 0; {5874#false} is VALID [2018-11-23 11:55:43,415 INFO L273 TraceCheckUtils]: 72: Hoare triple {5874#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5874#false} is VALID [2018-11-23 11:55:43,415 INFO L256 TraceCheckUtils]: 73: Hoare triple {5874#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {5874#false} is VALID [2018-11-23 11:55:43,415 INFO L273 TraceCheckUtils]: 74: Hoare triple {5874#false} ~cond := #in~cond; {5874#false} is VALID [2018-11-23 11:55:43,415 INFO L273 TraceCheckUtils]: 75: Hoare triple {5874#false} assume 0 == ~cond; {5874#false} is VALID [2018-11-23 11:55:43,415 INFO L273 TraceCheckUtils]: 76: Hoare triple {5874#false} assume !false; {5874#false} is VALID [2018-11-23 11:55:43,418 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 35 proven. 144 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-23 11:55:43,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:43,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 18 [2018-11-23 11:55:43,443 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-11-23 11:55:43,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:43,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:55:43,513 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:43,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:55:43,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:55:43,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:55:43,514 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 18 states. [2018-11-23 11:55:43,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:43,920 INFO L93 Difference]: Finished difference Result 155 states and 166 transitions. [2018-11-23 11:55:43,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:55:43,920 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-11-23 11:55:43,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:43,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:55:43,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 120 transitions. [2018-11-23 11:55:43,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:55:43,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 120 transitions. [2018-11-23 11:55:43,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 120 transitions. [2018-11-23 11:55:44,057 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:44,059 INFO L225 Difference]: With dead ends: 155 [2018-11-23 11:55:44,059 INFO L226 Difference]: Without dead ends: 92 [2018-11-23 11:55:44,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:55:44,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-23 11:55:44,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-11-23 11:55:44,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:44,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 92 states. [2018-11-23 11:55:44,119 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2018-11-23 11:55:44,120 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2018-11-23 11:55:44,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:44,122 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2018-11-23 11:55:44,122 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-11-23 11:55:44,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:44,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:44,122 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2018-11-23 11:55:44,123 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2018-11-23 11:55:44,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:44,125 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2018-11-23 11:55:44,125 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-11-23 11:55:44,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:44,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:44,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:44,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:44,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-23 11:55:44,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2018-11-23 11:55:44,128 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 77 [2018-11-23 11:55:44,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:44,128 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2018-11-23 11:55:44,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:55:44,128 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-11-23 11:55:44,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-23 11:55:44,129 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:44,129 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:44,130 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:44,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:44,130 INFO L82 PathProgramCache]: Analyzing trace with hash -535424030, now seen corresponding path program 13 times [2018-11-23 11:55:44,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:44,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:44,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:44,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:44,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:45,288 INFO L256 TraceCheckUtils]: 0: Hoare triple {6685#true} call ULTIMATE.init(); {6685#true} is VALID [2018-11-23 11:55:45,288 INFO L273 TraceCheckUtils]: 1: Hoare triple {6685#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6685#true} is VALID [2018-11-23 11:55:45,289 INFO L273 TraceCheckUtils]: 2: Hoare triple {6685#true} assume true; {6685#true} is VALID [2018-11-23 11:55:45,289 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6685#true} {6685#true} #76#return; {6685#true} is VALID [2018-11-23 11:55:45,289 INFO L256 TraceCheckUtils]: 4: Hoare triple {6685#true} call #t~ret6 := main(); {6685#true} is VALID [2018-11-23 11:55:45,290 INFO L273 TraceCheckUtils]: 5: Hoare triple {6685#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6687#(= main_~i~0 0)} is VALID [2018-11-23 11:55:45,291 INFO L273 TraceCheckUtils]: 6: Hoare triple {6687#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6688#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:45,292 INFO L273 TraceCheckUtils]: 7: Hoare triple {6688#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6689#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:45,293 INFO L273 TraceCheckUtils]: 8: Hoare triple {6689#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6690#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:45,294 INFO L273 TraceCheckUtils]: 9: Hoare triple {6690#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6691#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:45,295 INFO L273 TraceCheckUtils]: 10: Hoare triple {6691#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6692#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:45,296 INFO L273 TraceCheckUtils]: 11: Hoare triple {6692#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6693#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:45,297 INFO L273 TraceCheckUtils]: 12: Hoare triple {6693#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6694#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:45,298 INFO L273 TraceCheckUtils]: 13: Hoare triple {6694#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6695#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:45,299 INFO L273 TraceCheckUtils]: 14: Hoare triple {6695#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6696#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:45,300 INFO L273 TraceCheckUtils]: 15: Hoare triple {6696#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6697#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:45,300 INFO L273 TraceCheckUtils]: 16: Hoare triple {6697#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6698#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:45,301 INFO L273 TraceCheckUtils]: 17: Hoare triple {6698#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6699#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:45,302 INFO L273 TraceCheckUtils]: 18: Hoare triple {6699#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6700#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:45,303 INFO L273 TraceCheckUtils]: 19: Hoare triple {6700#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6701#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:45,304 INFO L273 TraceCheckUtils]: 20: Hoare triple {6701#(<= main_~i~0 14)} assume !(~i~0 < 100000); {6686#false} is VALID [2018-11-23 11:55:45,304 INFO L273 TraceCheckUtils]: 21: Hoare triple {6686#false} ~i~0 := 0; {6686#false} is VALID [2018-11-23 11:55:45,305 INFO L273 TraceCheckUtils]: 22: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6686#false} is VALID [2018-11-23 11:55:45,305 INFO L273 TraceCheckUtils]: 23: Hoare triple {6686#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6686#false} is VALID [2018-11-23 11:55:45,305 INFO L273 TraceCheckUtils]: 24: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6686#false} is VALID [2018-11-23 11:55:45,305 INFO L273 TraceCheckUtils]: 25: Hoare triple {6686#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6686#false} is VALID [2018-11-23 11:55:45,305 INFO L273 TraceCheckUtils]: 26: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6686#false} is VALID [2018-11-23 11:55:45,306 INFO L273 TraceCheckUtils]: 27: Hoare triple {6686#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6686#false} is VALID [2018-11-23 11:55:45,306 INFO L273 TraceCheckUtils]: 28: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6686#false} is VALID [2018-11-23 11:55:45,306 INFO L273 TraceCheckUtils]: 29: Hoare triple {6686#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6686#false} is VALID [2018-11-23 11:55:45,306 INFO L273 TraceCheckUtils]: 30: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6686#false} is VALID [2018-11-23 11:55:45,306 INFO L273 TraceCheckUtils]: 31: Hoare triple {6686#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6686#false} is VALID [2018-11-23 11:55:45,307 INFO L273 TraceCheckUtils]: 32: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6686#false} is VALID [2018-11-23 11:55:45,307 INFO L273 TraceCheckUtils]: 33: Hoare triple {6686#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6686#false} is VALID [2018-11-23 11:55:45,307 INFO L273 TraceCheckUtils]: 34: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6686#false} is VALID [2018-11-23 11:55:45,307 INFO L273 TraceCheckUtils]: 35: Hoare triple {6686#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6686#false} is VALID [2018-11-23 11:55:45,307 INFO L273 TraceCheckUtils]: 36: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6686#false} is VALID [2018-11-23 11:55:45,308 INFO L273 TraceCheckUtils]: 37: Hoare triple {6686#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6686#false} is VALID [2018-11-23 11:55:45,308 INFO L273 TraceCheckUtils]: 38: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6686#false} is VALID [2018-11-23 11:55:45,308 INFO L273 TraceCheckUtils]: 39: Hoare triple {6686#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6686#false} is VALID [2018-11-23 11:55:45,308 INFO L273 TraceCheckUtils]: 40: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6686#false} is VALID [2018-11-23 11:55:45,308 INFO L273 TraceCheckUtils]: 41: Hoare triple {6686#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6686#false} is VALID [2018-11-23 11:55:45,309 INFO L273 TraceCheckUtils]: 42: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6686#false} is VALID [2018-11-23 11:55:45,309 INFO L273 TraceCheckUtils]: 43: Hoare triple {6686#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6686#false} is VALID [2018-11-23 11:55:45,309 INFO L273 TraceCheckUtils]: 44: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6686#false} is VALID [2018-11-23 11:55:45,309 INFO L273 TraceCheckUtils]: 45: Hoare triple {6686#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6686#false} is VALID [2018-11-23 11:55:45,309 INFO L273 TraceCheckUtils]: 46: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6686#false} is VALID [2018-11-23 11:55:45,309 INFO L273 TraceCheckUtils]: 47: Hoare triple {6686#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6686#false} is VALID [2018-11-23 11:55:45,309 INFO L273 TraceCheckUtils]: 48: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6686#false} is VALID [2018-11-23 11:55:45,309 INFO L273 TraceCheckUtils]: 49: Hoare triple {6686#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6686#false} is VALID [2018-11-23 11:55:45,310 INFO L273 TraceCheckUtils]: 50: Hoare triple {6686#false} assume !(~i~0 < 100000); {6686#false} is VALID [2018-11-23 11:55:45,310 INFO L273 TraceCheckUtils]: 51: Hoare triple {6686#false} ~i~0 := 0; {6686#false} is VALID [2018-11-23 11:55:45,310 INFO L273 TraceCheckUtils]: 52: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6686#false} is VALID [2018-11-23 11:55:45,310 INFO L273 TraceCheckUtils]: 53: Hoare triple {6686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6686#false} is VALID [2018-11-23 11:55:45,310 INFO L273 TraceCheckUtils]: 54: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6686#false} is VALID [2018-11-23 11:55:45,310 INFO L273 TraceCheckUtils]: 55: Hoare triple {6686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6686#false} is VALID [2018-11-23 11:55:45,310 INFO L273 TraceCheckUtils]: 56: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6686#false} is VALID [2018-11-23 11:55:45,310 INFO L273 TraceCheckUtils]: 57: Hoare triple {6686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6686#false} is VALID [2018-11-23 11:55:45,311 INFO L273 TraceCheckUtils]: 58: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6686#false} is VALID [2018-11-23 11:55:45,311 INFO L273 TraceCheckUtils]: 59: Hoare triple {6686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6686#false} is VALID [2018-11-23 11:55:45,311 INFO L273 TraceCheckUtils]: 60: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6686#false} is VALID [2018-11-23 11:55:45,311 INFO L273 TraceCheckUtils]: 61: Hoare triple {6686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6686#false} is VALID [2018-11-23 11:55:45,311 INFO L273 TraceCheckUtils]: 62: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6686#false} is VALID [2018-11-23 11:55:45,311 INFO L273 TraceCheckUtils]: 63: Hoare triple {6686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6686#false} is VALID [2018-11-23 11:55:45,311 INFO L273 TraceCheckUtils]: 64: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6686#false} is VALID [2018-11-23 11:55:45,311 INFO L273 TraceCheckUtils]: 65: Hoare triple {6686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6686#false} is VALID [2018-11-23 11:55:45,311 INFO L273 TraceCheckUtils]: 66: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6686#false} is VALID [2018-11-23 11:55:45,312 INFO L273 TraceCheckUtils]: 67: Hoare triple {6686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6686#false} is VALID [2018-11-23 11:55:45,312 INFO L273 TraceCheckUtils]: 68: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6686#false} is VALID [2018-11-23 11:55:45,312 INFO L273 TraceCheckUtils]: 69: Hoare triple {6686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6686#false} is VALID [2018-11-23 11:55:45,312 INFO L273 TraceCheckUtils]: 70: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6686#false} is VALID [2018-11-23 11:55:45,312 INFO L273 TraceCheckUtils]: 71: Hoare triple {6686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6686#false} is VALID [2018-11-23 11:55:45,312 INFO L273 TraceCheckUtils]: 72: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6686#false} is VALID [2018-11-23 11:55:45,312 INFO L273 TraceCheckUtils]: 73: Hoare triple {6686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6686#false} is VALID [2018-11-23 11:55:45,312 INFO L273 TraceCheckUtils]: 74: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6686#false} is VALID [2018-11-23 11:55:45,313 INFO L273 TraceCheckUtils]: 75: Hoare triple {6686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6686#false} is VALID [2018-11-23 11:55:45,313 INFO L273 TraceCheckUtils]: 76: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6686#false} is VALID [2018-11-23 11:55:45,313 INFO L273 TraceCheckUtils]: 77: Hoare triple {6686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6686#false} is VALID [2018-11-23 11:55:45,313 INFO L273 TraceCheckUtils]: 78: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6686#false} is VALID [2018-11-23 11:55:45,313 INFO L273 TraceCheckUtils]: 79: Hoare triple {6686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6686#false} is VALID [2018-11-23 11:55:45,313 INFO L273 TraceCheckUtils]: 80: Hoare triple {6686#false} assume !(~i~0 < 100000); {6686#false} is VALID [2018-11-23 11:55:45,313 INFO L273 TraceCheckUtils]: 81: Hoare triple {6686#false} havoc ~x~0;~x~0 := 0; {6686#false} is VALID [2018-11-23 11:55:45,313 INFO L273 TraceCheckUtils]: 82: Hoare triple {6686#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {6686#false} is VALID [2018-11-23 11:55:45,314 INFO L256 TraceCheckUtils]: 83: Hoare triple {6686#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {6686#false} is VALID [2018-11-23 11:55:45,314 INFO L273 TraceCheckUtils]: 84: Hoare triple {6686#false} ~cond := #in~cond; {6686#false} is VALID [2018-11-23 11:55:45,314 INFO L273 TraceCheckUtils]: 85: Hoare triple {6686#false} assume 0 == ~cond; {6686#false} is VALID [2018-11-23 11:55:45,314 INFO L273 TraceCheckUtils]: 86: Hoare triple {6686#false} assume !false; {6686#false} is VALID [2018-11-23 11:55:45,317 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-23 11:55:45,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:45,318 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:45,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:45,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:45,540 INFO L256 TraceCheckUtils]: 0: Hoare triple {6685#true} call ULTIMATE.init(); {6685#true} is VALID [2018-11-23 11:55:45,540 INFO L273 TraceCheckUtils]: 1: Hoare triple {6685#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6685#true} is VALID [2018-11-23 11:55:45,540 INFO L273 TraceCheckUtils]: 2: Hoare triple {6685#true} assume true; {6685#true} is VALID [2018-11-23 11:55:45,540 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6685#true} {6685#true} #76#return; {6685#true} is VALID [2018-11-23 11:55:45,541 INFO L256 TraceCheckUtils]: 4: Hoare triple {6685#true} call #t~ret6 := main(); {6685#true} is VALID [2018-11-23 11:55:45,542 INFO L273 TraceCheckUtils]: 5: Hoare triple {6685#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6720#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:45,542 INFO L273 TraceCheckUtils]: 6: Hoare triple {6720#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6688#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:45,543 INFO L273 TraceCheckUtils]: 7: Hoare triple {6688#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6689#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:45,544 INFO L273 TraceCheckUtils]: 8: Hoare triple {6689#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6690#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:45,544 INFO L273 TraceCheckUtils]: 9: Hoare triple {6690#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6691#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:45,545 INFO L273 TraceCheckUtils]: 10: Hoare triple {6691#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6692#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:45,546 INFO L273 TraceCheckUtils]: 11: Hoare triple {6692#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6693#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:45,547 INFO L273 TraceCheckUtils]: 12: Hoare triple {6693#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6694#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:45,548 INFO L273 TraceCheckUtils]: 13: Hoare triple {6694#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6695#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:45,549 INFO L273 TraceCheckUtils]: 14: Hoare triple {6695#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6696#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:45,550 INFO L273 TraceCheckUtils]: 15: Hoare triple {6696#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6697#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:45,551 INFO L273 TraceCheckUtils]: 16: Hoare triple {6697#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6698#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:45,552 INFO L273 TraceCheckUtils]: 17: Hoare triple {6698#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6699#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:45,553 INFO L273 TraceCheckUtils]: 18: Hoare triple {6699#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6700#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:45,554 INFO L273 TraceCheckUtils]: 19: Hoare triple {6700#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6701#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:45,554 INFO L273 TraceCheckUtils]: 20: Hoare triple {6701#(<= main_~i~0 14)} assume !(~i~0 < 100000); {6686#false} is VALID [2018-11-23 11:55:45,555 INFO L273 TraceCheckUtils]: 21: Hoare triple {6686#false} ~i~0 := 0; {6686#false} is VALID [2018-11-23 11:55:45,555 INFO L273 TraceCheckUtils]: 22: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6686#false} is VALID [2018-11-23 11:55:45,555 INFO L273 TraceCheckUtils]: 23: Hoare triple {6686#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6686#false} is VALID [2018-11-23 11:55:45,555 INFO L273 TraceCheckUtils]: 24: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6686#false} is VALID [2018-11-23 11:55:45,556 INFO L273 TraceCheckUtils]: 25: Hoare triple {6686#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6686#false} is VALID [2018-11-23 11:55:45,556 INFO L273 TraceCheckUtils]: 26: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6686#false} is VALID [2018-11-23 11:55:45,556 INFO L273 TraceCheckUtils]: 27: Hoare triple {6686#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6686#false} is VALID [2018-11-23 11:55:45,556 INFO L273 TraceCheckUtils]: 28: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6686#false} is VALID [2018-11-23 11:55:45,556 INFO L273 TraceCheckUtils]: 29: Hoare triple {6686#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6686#false} is VALID [2018-11-23 11:55:45,557 INFO L273 TraceCheckUtils]: 30: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6686#false} is VALID [2018-11-23 11:55:45,557 INFO L273 TraceCheckUtils]: 31: Hoare triple {6686#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6686#false} is VALID [2018-11-23 11:55:45,557 INFO L273 TraceCheckUtils]: 32: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6686#false} is VALID [2018-11-23 11:55:45,557 INFO L273 TraceCheckUtils]: 33: Hoare triple {6686#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6686#false} is VALID [2018-11-23 11:55:45,558 INFO L273 TraceCheckUtils]: 34: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6686#false} is VALID [2018-11-23 11:55:45,558 INFO L273 TraceCheckUtils]: 35: Hoare triple {6686#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6686#false} is VALID [2018-11-23 11:55:45,558 INFO L273 TraceCheckUtils]: 36: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6686#false} is VALID [2018-11-23 11:55:45,558 INFO L273 TraceCheckUtils]: 37: Hoare triple {6686#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6686#false} is VALID [2018-11-23 11:55:45,559 INFO L273 TraceCheckUtils]: 38: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6686#false} is VALID [2018-11-23 11:55:45,559 INFO L273 TraceCheckUtils]: 39: Hoare triple {6686#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6686#false} is VALID [2018-11-23 11:55:45,559 INFO L273 TraceCheckUtils]: 40: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6686#false} is VALID [2018-11-23 11:55:45,560 INFO L273 TraceCheckUtils]: 41: Hoare triple {6686#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6686#false} is VALID [2018-11-23 11:55:45,560 INFO L273 TraceCheckUtils]: 42: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6686#false} is VALID [2018-11-23 11:55:45,560 INFO L273 TraceCheckUtils]: 43: Hoare triple {6686#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6686#false} is VALID [2018-11-23 11:55:45,560 INFO L273 TraceCheckUtils]: 44: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6686#false} is VALID [2018-11-23 11:55:45,561 INFO L273 TraceCheckUtils]: 45: Hoare triple {6686#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6686#false} is VALID [2018-11-23 11:55:45,561 INFO L273 TraceCheckUtils]: 46: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6686#false} is VALID [2018-11-23 11:55:45,561 INFO L273 TraceCheckUtils]: 47: Hoare triple {6686#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6686#false} is VALID [2018-11-23 11:55:45,561 INFO L273 TraceCheckUtils]: 48: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6686#false} is VALID [2018-11-23 11:55:45,561 INFO L273 TraceCheckUtils]: 49: Hoare triple {6686#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6686#false} is VALID [2018-11-23 11:55:45,561 INFO L273 TraceCheckUtils]: 50: Hoare triple {6686#false} assume !(~i~0 < 100000); {6686#false} is VALID [2018-11-23 11:55:45,562 INFO L273 TraceCheckUtils]: 51: Hoare triple {6686#false} ~i~0 := 0; {6686#false} is VALID [2018-11-23 11:55:45,562 INFO L273 TraceCheckUtils]: 52: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6686#false} is VALID [2018-11-23 11:55:45,562 INFO L273 TraceCheckUtils]: 53: Hoare triple {6686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6686#false} is VALID [2018-11-23 11:55:45,562 INFO L273 TraceCheckUtils]: 54: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6686#false} is VALID [2018-11-23 11:55:45,562 INFO L273 TraceCheckUtils]: 55: Hoare triple {6686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6686#false} is VALID [2018-11-23 11:55:45,562 INFO L273 TraceCheckUtils]: 56: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6686#false} is VALID [2018-11-23 11:55:45,563 INFO L273 TraceCheckUtils]: 57: Hoare triple {6686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6686#false} is VALID [2018-11-23 11:55:45,563 INFO L273 TraceCheckUtils]: 58: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6686#false} is VALID [2018-11-23 11:55:45,563 INFO L273 TraceCheckUtils]: 59: Hoare triple {6686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6686#false} is VALID [2018-11-23 11:55:45,563 INFO L273 TraceCheckUtils]: 60: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6686#false} is VALID [2018-11-23 11:55:45,563 INFO L273 TraceCheckUtils]: 61: Hoare triple {6686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6686#false} is VALID [2018-11-23 11:55:45,563 INFO L273 TraceCheckUtils]: 62: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6686#false} is VALID [2018-11-23 11:55:45,564 INFO L273 TraceCheckUtils]: 63: Hoare triple {6686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6686#false} is VALID [2018-11-23 11:55:45,564 INFO L273 TraceCheckUtils]: 64: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6686#false} is VALID [2018-11-23 11:55:45,564 INFO L273 TraceCheckUtils]: 65: Hoare triple {6686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6686#false} is VALID [2018-11-23 11:55:45,564 INFO L273 TraceCheckUtils]: 66: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6686#false} is VALID [2018-11-23 11:55:45,564 INFO L273 TraceCheckUtils]: 67: Hoare triple {6686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6686#false} is VALID [2018-11-23 11:55:45,564 INFO L273 TraceCheckUtils]: 68: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6686#false} is VALID [2018-11-23 11:55:45,565 INFO L273 TraceCheckUtils]: 69: Hoare triple {6686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6686#false} is VALID [2018-11-23 11:55:45,565 INFO L273 TraceCheckUtils]: 70: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6686#false} is VALID [2018-11-23 11:55:45,565 INFO L273 TraceCheckUtils]: 71: Hoare triple {6686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6686#false} is VALID [2018-11-23 11:55:45,565 INFO L273 TraceCheckUtils]: 72: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6686#false} is VALID [2018-11-23 11:55:45,565 INFO L273 TraceCheckUtils]: 73: Hoare triple {6686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6686#false} is VALID [2018-11-23 11:55:45,565 INFO L273 TraceCheckUtils]: 74: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6686#false} is VALID [2018-11-23 11:55:45,566 INFO L273 TraceCheckUtils]: 75: Hoare triple {6686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6686#false} is VALID [2018-11-23 11:55:45,566 INFO L273 TraceCheckUtils]: 76: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6686#false} is VALID [2018-11-23 11:55:45,566 INFO L273 TraceCheckUtils]: 77: Hoare triple {6686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6686#false} is VALID [2018-11-23 11:55:45,566 INFO L273 TraceCheckUtils]: 78: Hoare triple {6686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6686#false} is VALID [2018-11-23 11:55:45,566 INFO L273 TraceCheckUtils]: 79: Hoare triple {6686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6686#false} is VALID [2018-11-23 11:55:45,566 INFO L273 TraceCheckUtils]: 80: Hoare triple {6686#false} assume !(~i~0 < 100000); {6686#false} is VALID [2018-11-23 11:55:45,567 INFO L273 TraceCheckUtils]: 81: Hoare triple {6686#false} havoc ~x~0;~x~0 := 0; {6686#false} is VALID [2018-11-23 11:55:45,567 INFO L273 TraceCheckUtils]: 82: Hoare triple {6686#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {6686#false} is VALID [2018-11-23 11:55:45,567 INFO L256 TraceCheckUtils]: 83: Hoare triple {6686#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {6686#false} is VALID [2018-11-23 11:55:45,567 INFO L273 TraceCheckUtils]: 84: Hoare triple {6686#false} ~cond := #in~cond; {6686#false} is VALID [2018-11-23 11:55:45,567 INFO L273 TraceCheckUtils]: 85: Hoare triple {6686#false} assume 0 == ~cond; {6686#false} is VALID [2018-11-23 11:55:45,567 INFO L273 TraceCheckUtils]: 86: Hoare triple {6686#false} assume !false; {6686#false} is VALID [2018-11-23 11:55:45,572 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-23 11:55:45,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:45,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 11:55:45,596 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-11-23 11:55:45,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:45,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:55:45,632 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:45,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:55:45,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:55:45,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:55:45,634 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 18 states. [2018-11-23 11:55:46,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:46,226 INFO L93 Difference]: Finished difference Result 170 states and 178 transitions. [2018-11-23 11:55:46,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:55:46,227 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-11-23 11:55:46,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:46,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:55:46,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 124 transitions. [2018-11-23 11:55:46,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:55:46,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 124 transitions. [2018-11-23 11:55:46,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 124 transitions. [2018-11-23 11:55:46,858 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:46,860 INFO L225 Difference]: With dead ends: 170 [2018-11-23 11:55:46,860 INFO L226 Difference]: Without dead ends: 99 [2018-11-23 11:55:46,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:55:46,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-23 11:55:47,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2018-11-23 11:55:47,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:47,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 97 states. [2018-11-23 11:55:47,037 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 97 states. [2018-11-23 11:55:47,037 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 97 states. [2018-11-23 11:55:47,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:47,039 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2018-11-23 11:55:47,040 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2018-11-23 11:55:47,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:47,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:47,040 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 99 states. [2018-11-23 11:55:47,040 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 99 states. [2018-11-23 11:55:47,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:47,042 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2018-11-23 11:55:47,042 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2018-11-23 11:55:47,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:47,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:47,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:47,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:47,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-23 11:55:47,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2018-11-23 11:55:47,045 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 87 [2018-11-23 11:55:47,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:47,046 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2018-11-23 11:55:47,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:55:47,046 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2018-11-23 11:55:47,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-23 11:55:47,047 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:47,047 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:47,047 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:47,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:47,048 INFO L82 PathProgramCache]: Analyzing trace with hash -422313566, now seen corresponding path program 14 times [2018-11-23 11:55:47,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:47,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:47,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:47,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:47,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:47,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:48,166 INFO L256 TraceCheckUtils]: 0: Hoare triple {7571#true} call ULTIMATE.init(); {7571#true} is VALID [2018-11-23 11:55:48,166 INFO L273 TraceCheckUtils]: 1: Hoare triple {7571#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7571#true} is VALID [2018-11-23 11:55:48,167 INFO L273 TraceCheckUtils]: 2: Hoare triple {7571#true} assume true; {7571#true} is VALID [2018-11-23 11:55:48,167 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7571#true} {7571#true} #76#return; {7571#true} is VALID [2018-11-23 11:55:48,167 INFO L256 TraceCheckUtils]: 4: Hoare triple {7571#true} call #t~ret6 := main(); {7571#true} is VALID [2018-11-23 11:55:48,167 INFO L273 TraceCheckUtils]: 5: Hoare triple {7571#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7573#(= main_~i~0 0)} is VALID [2018-11-23 11:55:48,168 INFO L273 TraceCheckUtils]: 6: Hoare triple {7573#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7574#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:48,169 INFO L273 TraceCheckUtils]: 7: Hoare triple {7574#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7575#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:48,169 INFO L273 TraceCheckUtils]: 8: Hoare triple {7575#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7576#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:48,170 INFO L273 TraceCheckUtils]: 9: Hoare triple {7576#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7577#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:48,170 INFO L273 TraceCheckUtils]: 10: Hoare triple {7577#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7578#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:48,171 INFO L273 TraceCheckUtils]: 11: Hoare triple {7578#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7579#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:48,172 INFO L273 TraceCheckUtils]: 12: Hoare triple {7579#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7580#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:48,173 INFO L273 TraceCheckUtils]: 13: Hoare triple {7580#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7581#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:48,174 INFO L273 TraceCheckUtils]: 14: Hoare triple {7581#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7582#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:48,175 INFO L273 TraceCheckUtils]: 15: Hoare triple {7582#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7583#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:48,177 INFO L273 TraceCheckUtils]: 16: Hoare triple {7583#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7584#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:48,178 INFO L273 TraceCheckUtils]: 17: Hoare triple {7584#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7585#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:48,179 INFO L273 TraceCheckUtils]: 18: Hoare triple {7585#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7586#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:48,180 INFO L273 TraceCheckUtils]: 19: Hoare triple {7586#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7587#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:48,181 INFO L273 TraceCheckUtils]: 20: Hoare triple {7587#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7588#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:48,182 INFO L273 TraceCheckUtils]: 21: Hoare triple {7588#(<= main_~i~0 15)} assume !(~i~0 < 100000); {7572#false} is VALID [2018-11-23 11:55:48,182 INFO L273 TraceCheckUtils]: 22: Hoare triple {7572#false} ~i~0 := 0; {7572#false} is VALID [2018-11-23 11:55:48,182 INFO L273 TraceCheckUtils]: 23: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7572#false} is VALID [2018-11-23 11:55:48,183 INFO L273 TraceCheckUtils]: 24: Hoare triple {7572#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7572#false} is VALID [2018-11-23 11:55:48,183 INFO L273 TraceCheckUtils]: 25: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7572#false} is VALID [2018-11-23 11:55:48,183 INFO L273 TraceCheckUtils]: 26: Hoare triple {7572#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7572#false} is VALID [2018-11-23 11:55:48,183 INFO L273 TraceCheckUtils]: 27: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7572#false} is VALID [2018-11-23 11:55:48,184 INFO L273 TraceCheckUtils]: 28: Hoare triple {7572#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7572#false} is VALID [2018-11-23 11:55:48,184 INFO L273 TraceCheckUtils]: 29: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7572#false} is VALID [2018-11-23 11:55:48,184 INFO L273 TraceCheckUtils]: 30: Hoare triple {7572#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7572#false} is VALID [2018-11-23 11:55:48,185 INFO L273 TraceCheckUtils]: 31: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7572#false} is VALID [2018-11-23 11:55:48,185 INFO L273 TraceCheckUtils]: 32: Hoare triple {7572#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7572#false} is VALID [2018-11-23 11:55:48,185 INFO L273 TraceCheckUtils]: 33: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7572#false} is VALID [2018-11-23 11:55:48,186 INFO L273 TraceCheckUtils]: 34: Hoare triple {7572#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7572#false} is VALID [2018-11-23 11:55:48,186 INFO L273 TraceCheckUtils]: 35: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7572#false} is VALID [2018-11-23 11:55:48,186 INFO L273 TraceCheckUtils]: 36: Hoare triple {7572#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7572#false} is VALID [2018-11-23 11:55:48,186 INFO L273 TraceCheckUtils]: 37: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7572#false} is VALID [2018-11-23 11:55:48,187 INFO L273 TraceCheckUtils]: 38: Hoare triple {7572#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7572#false} is VALID [2018-11-23 11:55:48,187 INFO L273 TraceCheckUtils]: 39: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7572#false} is VALID [2018-11-23 11:55:48,187 INFO L273 TraceCheckUtils]: 40: Hoare triple {7572#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7572#false} is VALID [2018-11-23 11:55:48,187 INFO L273 TraceCheckUtils]: 41: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7572#false} is VALID [2018-11-23 11:55:48,187 INFO L273 TraceCheckUtils]: 42: Hoare triple {7572#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7572#false} is VALID [2018-11-23 11:55:48,188 INFO L273 TraceCheckUtils]: 43: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7572#false} is VALID [2018-11-23 11:55:48,188 INFO L273 TraceCheckUtils]: 44: Hoare triple {7572#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7572#false} is VALID [2018-11-23 11:55:48,188 INFO L273 TraceCheckUtils]: 45: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7572#false} is VALID [2018-11-23 11:55:48,188 INFO L273 TraceCheckUtils]: 46: Hoare triple {7572#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7572#false} is VALID [2018-11-23 11:55:48,188 INFO L273 TraceCheckUtils]: 47: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7572#false} is VALID [2018-11-23 11:55:48,189 INFO L273 TraceCheckUtils]: 48: Hoare triple {7572#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7572#false} is VALID [2018-11-23 11:55:48,189 INFO L273 TraceCheckUtils]: 49: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7572#false} is VALID [2018-11-23 11:55:48,189 INFO L273 TraceCheckUtils]: 50: Hoare triple {7572#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7572#false} is VALID [2018-11-23 11:55:48,189 INFO L273 TraceCheckUtils]: 51: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7572#false} is VALID [2018-11-23 11:55:48,189 INFO L273 TraceCheckUtils]: 52: Hoare triple {7572#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7572#false} is VALID [2018-11-23 11:55:48,190 INFO L273 TraceCheckUtils]: 53: Hoare triple {7572#false} assume !(~i~0 < 100000); {7572#false} is VALID [2018-11-23 11:55:48,190 INFO L273 TraceCheckUtils]: 54: Hoare triple {7572#false} ~i~0 := 0; {7572#false} is VALID [2018-11-23 11:55:48,190 INFO L273 TraceCheckUtils]: 55: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7572#false} is VALID [2018-11-23 11:55:48,190 INFO L273 TraceCheckUtils]: 56: Hoare triple {7572#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7572#false} is VALID [2018-11-23 11:55:48,191 INFO L273 TraceCheckUtils]: 57: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7572#false} is VALID [2018-11-23 11:55:48,191 INFO L273 TraceCheckUtils]: 58: Hoare triple {7572#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7572#false} is VALID [2018-11-23 11:55:48,191 INFO L273 TraceCheckUtils]: 59: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7572#false} is VALID [2018-11-23 11:55:48,191 INFO L273 TraceCheckUtils]: 60: Hoare triple {7572#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7572#false} is VALID [2018-11-23 11:55:48,191 INFO L273 TraceCheckUtils]: 61: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7572#false} is VALID [2018-11-23 11:55:48,192 INFO L273 TraceCheckUtils]: 62: Hoare triple {7572#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7572#false} is VALID [2018-11-23 11:55:48,192 INFO L273 TraceCheckUtils]: 63: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7572#false} is VALID [2018-11-23 11:55:48,192 INFO L273 TraceCheckUtils]: 64: Hoare triple {7572#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7572#false} is VALID [2018-11-23 11:55:48,192 INFO L273 TraceCheckUtils]: 65: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7572#false} is VALID [2018-11-23 11:55:48,193 INFO L273 TraceCheckUtils]: 66: Hoare triple {7572#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7572#false} is VALID [2018-11-23 11:55:48,193 INFO L273 TraceCheckUtils]: 67: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7572#false} is VALID [2018-11-23 11:55:48,194 INFO L273 TraceCheckUtils]: 68: Hoare triple {7572#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7572#false} is VALID [2018-11-23 11:55:48,195 INFO L273 TraceCheckUtils]: 69: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7572#false} is VALID [2018-11-23 11:55:48,195 INFO L273 TraceCheckUtils]: 70: Hoare triple {7572#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7572#false} is VALID [2018-11-23 11:55:48,196 INFO L273 TraceCheckUtils]: 71: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7572#false} is VALID [2018-11-23 11:55:48,196 INFO L273 TraceCheckUtils]: 72: Hoare triple {7572#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7572#false} is VALID [2018-11-23 11:55:48,196 INFO L273 TraceCheckUtils]: 73: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7572#false} is VALID [2018-11-23 11:55:48,196 INFO L273 TraceCheckUtils]: 74: Hoare triple {7572#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7572#false} is VALID [2018-11-23 11:55:48,196 INFO L273 TraceCheckUtils]: 75: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7572#false} is VALID [2018-11-23 11:55:48,197 INFO L273 TraceCheckUtils]: 76: Hoare triple {7572#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7572#false} is VALID [2018-11-23 11:55:48,197 INFO L273 TraceCheckUtils]: 77: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7572#false} is VALID [2018-11-23 11:55:48,197 INFO L273 TraceCheckUtils]: 78: Hoare triple {7572#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7572#false} is VALID [2018-11-23 11:55:48,197 INFO L273 TraceCheckUtils]: 79: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7572#false} is VALID [2018-11-23 11:55:48,198 INFO L273 TraceCheckUtils]: 80: Hoare triple {7572#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7572#false} is VALID [2018-11-23 11:55:48,198 INFO L273 TraceCheckUtils]: 81: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7572#false} is VALID [2018-11-23 11:55:48,198 INFO L273 TraceCheckUtils]: 82: Hoare triple {7572#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7572#false} is VALID [2018-11-23 11:55:48,198 INFO L273 TraceCheckUtils]: 83: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7572#false} is VALID [2018-11-23 11:55:48,198 INFO L273 TraceCheckUtils]: 84: Hoare triple {7572#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7572#false} is VALID [2018-11-23 11:55:48,199 INFO L273 TraceCheckUtils]: 85: Hoare triple {7572#false} assume !(~i~0 < 100000); {7572#false} is VALID [2018-11-23 11:55:48,199 INFO L273 TraceCheckUtils]: 86: Hoare triple {7572#false} havoc ~x~0;~x~0 := 0; {7572#false} is VALID [2018-11-23 11:55:48,199 INFO L273 TraceCheckUtils]: 87: Hoare triple {7572#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {7572#false} is VALID [2018-11-23 11:55:48,199 INFO L256 TraceCheckUtils]: 88: Hoare triple {7572#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {7572#false} is VALID [2018-11-23 11:55:48,199 INFO L273 TraceCheckUtils]: 89: Hoare triple {7572#false} ~cond := #in~cond; {7572#false} is VALID [2018-11-23 11:55:48,200 INFO L273 TraceCheckUtils]: 90: Hoare triple {7572#false} assume 0 == ~cond; {7572#false} is VALID [2018-11-23 11:55:48,200 INFO L273 TraceCheckUtils]: 91: Hoare triple {7572#false} assume !false; {7572#false} is VALID [2018-11-23 11:55:48,209 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-11-23 11:55:48,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:48,210 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:48,231 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:55:48,285 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:55:48,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:48,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:48,657 INFO L256 TraceCheckUtils]: 0: Hoare triple {7571#true} call ULTIMATE.init(); {7571#true} is VALID [2018-11-23 11:55:48,658 INFO L273 TraceCheckUtils]: 1: Hoare triple {7571#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7571#true} is VALID [2018-11-23 11:55:48,658 INFO L273 TraceCheckUtils]: 2: Hoare triple {7571#true} assume true; {7571#true} is VALID [2018-11-23 11:55:48,658 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7571#true} {7571#true} #76#return; {7571#true} is VALID [2018-11-23 11:55:48,658 INFO L256 TraceCheckUtils]: 4: Hoare triple {7571#true} call #t~ret6 := main(); {7571#true} is VALID [2018-11-23 11:55:48,659 INFO L273 TraceCheckUtils]: 5: Hoare triple {7571#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7607#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:48,661 INFO L273 TraceCheckUtils]: 6: Hoare triple {7607#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7574#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:48,662 INFO L273 TraceCheckUtils]: 7: Hoare triple {7574#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7575#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:48,663 INFO L273 TraceCheckUtils]: 8: Hoare triple {7575#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7576#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:48,664 INFO L273 TraceCheckUtils]: 9: Hoare triple {7576#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7577#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:48,665 INFO L273 TraceCheckUtils]: 10: Hoare triple {7577#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7578#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:48,666 INFO L273 TraceCheckUtils]: 11: Hoare triple {7578#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7579#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:48,667 INFO L273 TraceCheckUtils]: 12: Hoare triple {7579#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7580#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:48,668 INFO L273 TraceCheckUtils]: 13: Hoare triple {7580#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7581#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:48,669 INFO L273 TraceCheckUtils]: 14: Hoare triple {7581#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7582#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:48,670 INFO L273 TraceCheckUtils]: 15: Hoare triple {7582#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7583#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:48,671 INFO L273 TraceCheckUtils]: 16: Hoare triple {7583#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7584#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:48,672 INFO L273 TraceCheckUtils]: 17: Hoare triple {7584#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7585#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:48,674 INFO L273 TraceCheckUtils]: 18: Hoare triple {7585#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7586#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:48,675 INFO L273 TraceCheckUtils]: 19: Hoare triple {7586#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7587#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:48,676 INFO L273 TraceCheckUtils]: 20: Hoare triple {7587#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7588#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:48,676 INFO L273 TraceCheckUtils]: 21: Hoare triple {7588#(<= main_~i~0 15)} assume !(~i~0 < 100000); {7572#false} is VALID [2018-11-23 11:55:48,677 INFO L273 TraceCheckUtils]: 22: Hoare triple {7572#false} ~i~0 := 0; {7572#false} is VALID [2018-11-23 11:55:48,677 INFO L273 TraceCheckUtils]: 23: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7572#false} is VALID [2018-11-23 11:55:48,677 INFO L273 TraceCheckUtils]: 24: Hoare triple {7572#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7572#false} is VALID [2018-11-23 11:55:48,678 INFO L273 TraceCheckUtils]: 25: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7572#false} is VALID [2018-11-23 11:55:48,678 INFO L273 TraceCheckUtils]: 26: Hoare triple {7572#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7572#false} is VALID [2018-11-23 11:55:48,678 INFO L273 TraceCheckUtils]: 27: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7572#false} is VALID [2018-11-23 11:55:48,678 INFO L273 TraceCheckUtils]: 28: Hoare triple {7572#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7572#false} is VALID [2018-11-23 11:55:48,679 INFO L273 TraceCheckUtils]: 29: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7572#false} is VALID [2018-11-23 11:55:48,679 INFO L273 TraceCheckUtils]: 30: Hoare triple {7572#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7572#false} is VALID [2018-11-23 11:55:48,679 INFO L273 TraceCheckUtils]: 31: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7572#false} is VALID [2018-11-23 11:55:48,679 INFO L273 TraceCheckUtils]: 32: Hoare triple {7572#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7572#false} is VALID [2018-11-23 11:55:48,680 INFO L273 TraceCheckUtils]: 33: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7572#false} is VALID [2018-11-23 11:55:48,680 INFO L273 TraceCheckUtils]: 34: Hoare triple {7572#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7572#false} is VALID [2018-11-23 11:55:48,680 INFO L273 TraceCheckUtils]: 35: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7572#false} is VALID [2018-11-23 11:55:48,680 INFO L273 TraceCheckUtils]: 36: Hoare triple {7572#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7572#false} is VALID [2018-11-23 11:55:48,681 INFO L273 TraceCheckUtils]: 37: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7572#false} is VALID [2018-11-23 11:55:48,681 INFO L273 TraceCheckUtils]: 38: Hoare triple {7572#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7572#false} is VALID [2018-11-23 11:55:48,681 INFO L273 TraceCheckUtils]: 39: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7572#false} is VALID [2018-11-23 11:55:48,681 INFO L273 TraceCheckUtils]: 40: Hoare triple {7572#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7572#false} is VALID [2018-11-23 11:55:48,682 INFO L273 TraceCheckUtils]: 41: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7572#false} is VALID [2018-11-23 11:55:48,682 INFO L273 TraceCheckUtils]: 42: Hoare triple {7572#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7572#false} is VALID [2018-11-23 11:55:48,682 INFO L273 TraceCheckUtils]: 43: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7572#false} is VALID [2018-11-23 11:55:48,682 INFO L273 TraceCheckUtils]: 44: Hoare triple {7572#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7572#false} is VALID [2018-11-23 11:55:48,682 INFO L273 TraceCheckUtils]: 45: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7572#false} is VALID [2018-11-23 11:55:48,682 INFO L273 TraceCheckUtils]: 46: Hoare triple {7572#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7572#false} is VALID [2018-11-23 11:55:48,683 INFO L273 TraceCheckUtils]: 47: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7572#false} is VALID [2018-11-23 11:55:48,683 INFO L273 TraceCheckUtils]: 48: Hoare triple {7572#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7572#false} is VALID [2018-11-23 11:55:48,683 INFO L273 TraceCheckUtils]: 49: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7572#false} is VALID [2018-11-23 11:55:48,683 INFO L273 TraceCheckUtils]: 50: Hoare triple {7572#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7572#false} is VALID [2018-11-23 11:55:48,683 INFO L273 TraceCheckUtils]: 51: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7572#false} is VALID [2018-11-23 11:55:48,683 INFO L273 TraceCheckUtils]: 52: Hoare triple {7572#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7572#false} is VALID [2018-11-23 11:55:48,684 INFO L273 TraceCheckUtils]: 53: Hoare triple {7572#false} assume !(~i~0 < 100000); {7572#false} is VALID [2018-11-23 11:55:48,684 INFO L273 TraceCheckUtils]: 54: Hoare triple {7572#false} ~i~0 := 0; {7572#false} is VALID [2018-11-23 11:55:48,684 INFO L273 TraceCheckUtils]: 55: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7572#false} is VALID [2018-11-23 11:55:48,684 INFO L273 TraceCheckUtils]: 56: Hoare triple {7572#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7572#false} is VALID [2018-11-23 11:55:48,684 INFO L273 TraceCheckUtils]: 57: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7572#false} is VALID [2018-11-23 11:55:48,684 INFO L273 TraceCheckUtils]: 58: Hoare triple {7572#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7572#false} is VALID [2018-11-23 11:55:48,684 INFO L273 TraceCheckUtils]: 59: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7572#false} is VALID [2018-11-23 11:55:48,685 INFO L273 TraceCheckUtils]: 60: Hoare triple {7572#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7572#false} is VALID [2018-11-23 11:55:48,685 INFO L273 TraceCheckUtils]: 61: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7572#false} is VALID [2018-11-23 11:55:48,685 INFO L273 TraceCheckUtils]: 62: Hoare triple {7572#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7572#false} is VALID [2018-11-23 11:55:48,685 INFO L273 TraceCheckUtils]: 63: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7572#false} is VALID [2018-11-23 11:55:48,685 INFO L273 TraceCheckUtils]: 64: Hoare triple {7572#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7572#false} is VALID [2018-11-23 11:55:48,685 INFO L273 TraceCheckUtils]: 65: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7572#false} is VALID [2018-11-23 11:55:48,685 INFO L273 TraceCheckUtils]: 66: Hoare triple {7572#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7572#false} is VALID [2018-11-23 11:55:48,686 INFO L273 TraceCheckUtils]: 67: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7572#false} is VALID [2018-11-23 11:55:48,686 INFO L273 TraceCheckUtils]: 68: Hoare triple {7572#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7572#false} is VALID [2018-11-23 11:55:48,686 INFO L273 TraceCheckUtils]: 69: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7572#false} is VALID [2018-11-23 11:55:48,686 INFO L273 TraceCheckUtils]: 70: Hoare triple {7572#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7572#false} is VALID [2018-11-23 11:55:48,686 INFO L273 TraceCheckUtils]: 71: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7572#false} is VALID [2018-11-23 11:55:48,686 INFO L273 TraceCheckUtils]: 72: Hoare triple {7572#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7572#false} is VALID [2018-11-23 11:55:48,687 INFO L273 TraceCheckUtils]: 73: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7572#false} is VALID [2018-11-23 11:55:48,687 INFO L273 TraceCheckUtils]: 74: Hoare triple {7572#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7572#false} is VALID [2018-11-23 11:55:48,687 INFO L273 TraceCheckUtils]: 75: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7572#false} is VALID [2018-11-23 11:55:48,687 INFO L273 TraceCheckUtils]: 76: Hoare triple {7572#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7572#false} is VALID [2018-11-23 11:55:48,687 INFO L273 TraceCheckUtils]: 77: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7572#false} is VALID [2018-11-23 11:55:48,687 INFO L273 TraceCheckUtils]: 78: Hoare triple {7572#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7572#false} is VALID [2018-11-23 11:55:48,688 INFO L273 TraceCheckUtils]: 79: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7572#false} is VALID [2018-11-23 11:55:48,688 INFO L273 TraceCheckUtils]: 80: Hoare triple {7572#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7572#false} is VALID [2018-11-23 11:55:48,688 INFO L273 TraceCheckUtils]: 81: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7572#false} is VALID [2018-11-23 11:55:48,688 INFO L273 TraceCheckUtils]: 82: Hoare triple {7572#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7572#false} is VALID [2018-11-23 11:55:48,688 INFO L273 TraceCheckUtils]: 83: Hoare triple {7572#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7572#false} is VALID [2018-11-23 11:55:48,688 INFO L273 TraceCheckUtils]: 84: Hoare triple {7572#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7572#false} is VALID [2018-11-23 11:55:48,688 INFO L273 TraceCheckUtils]: 85: Hoare triple {7572#false} assume !(~i~0 < 100000); {7572#false} is VALID [2018-11-23 11:55:48,689 INFO L273 TraceCheckUtils]: 86: Hoare triple {7572#false} havoc ~x~0;~x~0 := 0; {7572#false} is VALID [2018-11-23 11:55:48,689 INFO L273 TraceCheckUtils]: 87: Hoare triple {7572#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {7572#false} is VALID [2018-11-23 11:55:48,689 INFO L256 TraceCheckUtils]: 88: Hoare triple {7572#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {7572#false} is VALID [2018-11-23 11:55:48,689 INFO L273 TraceCheckUtils]: 89: Hoare triple {7572#false} ~cond := #in~cond; {7572#false} is VALID [2018-11-23 11:55:48,689 INFO L273 TraceCheckUtils]: 90: Hoare triple {7572#false} assume 0 == ~cond; {7572#false} is VALID [2018-11-23 11:55:48,689 INFO L273 TraceCheckUtils]: 91: Hoare triple {7572#false} assume !false; {7572#false} is VALID [2018-11-23 11:55:48,697 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-11-23 11:55:48,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:48,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 11:55:48,718 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-11-23 11:55:48,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:48,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 11:55:48,751 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:48,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 11:55:48,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 11:55:48,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:55:48,753 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand 19 states. [2018-11-23 11:55:49,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:49,317 INFO L93 Difference]: Finished difference Result 179 states and 187 transitions. [2018-11-23 11:55:49,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:55:49,317 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-11-23 11:55:49,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:49,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:55:49,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 129 transitions. [2018-11-23 11:55:49,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:55:49,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 129 transitions. [2018-11-23 11:55:49,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 129 transitions. [2018-11-23 11:55:49,491 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:49,493 INFO L225 Difference]: With dead ends: 179 [2018-11-23 11:55:49,493 INFO L226 Difference]: Without dead ends: 104 [2018-11-23 11:55:49,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:55:49,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-23 11:55:49,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2018-11-23 11:55:49,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:49,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 102 states. [2018-11-23 11:55:49,543 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 102 states. [2018-11-23 11:55:49,544 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 102 states. [2018-11-23 11:55:49,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:49,546 INFO L93 Difference]: Finished difference Result 104 states and 107 transitions. [2018-11-23 11:55:49,547 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 107 transitions. [2018-11-23 11:55:49,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:49,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:49,547 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 104 states. [2018-11-23 11:55:49,547 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 104 states. [2018-11-23 11:55:49,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:49,549 INFO L93 Difference]: Finished difference Result 104 states and 107 transitions. [2018-11-23 11:55:49,549 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 107 transitions. [2018-11-23 11:55:49,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:49,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:49,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:49,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:49,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-23 11:55:49,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2018-11-23 11:55:49,552 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 92 [2018-11-23 11:55:49,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:49,552 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2018-11-23 11:55:49,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 11:55:49,553 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2018-11-23 11:55:49,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-23 11:55:49,553 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:49,554 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:49,554 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:49,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:49,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1861215782, now seen corresponding path program 15 times [2018-11-23 11:55:49,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:49,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:49,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:49,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:49,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:49,871 INFO L256 TraceCheckUtils]: 0: Hoare triple {8505#true} call ULTIMATE.init(); {8505#true} is VALID [2018-11-23 11:55:49,871 INFO L273 TraceCheckUtils]: 1: Hoare triple {8505#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8505#true} is VALID [2018-11-23 11:55:49,871 INFO L273 TraceCheckUtils]: 2: Hoare triple {8505#true} assume true; {8505#true} is VALID [2018-11-23 11:55:49,872 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8505#true} {8505#true} #76#return; {8505#true} is VALID [2018-11-23 11:55:49,872 INFO L256 TraceCheckUtils]: 4: Hoare triple {8505#true} call #t~ret6 := main(); {8505#true} is VALID [2018-11-23 11:55:49,872 INFO L273 TraceCheckUtils]: 5: Hoare triple {8505#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8507#(= main_~i~0 0)} is VALID [2018-11-23 11:55:49,873 INFO L273 TraceCheckUtils]: 6: Hoare triple {8507#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8508#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:49,874 INFO L273 TraceCheckUtils]: 7: Hoare triple {8508#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8509#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:49,875 INFO L273 TraceCheckUtils]: 8: Hoare triple {8509#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8510#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:49,875 INFO L273 TraceCheckUtils]: 9: Hoare triple {8510#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8511#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:49,876 INFO L273 TraceCheckUtils]: 10: Hoare triple {8511#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8512#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:49,876 INFO L273 TraceCheckUtils]: 11: Hoare triple {8512#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8513#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:49,877 INFO L273 TraceCheckUtils]: 12: Hoare triple {8513#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8514#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:49,878 INFO L273 TraceCheckUtils]: 13: Hoare triple {8514#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8515#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:49,879 INFO L273 TraceCheckUtils]: 14: Hoare triple {8515#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8516#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:49,880 INFO L273 TraceCheckUtils]: 15: Hoare triple {8516#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8517#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:49,881 INFO L273 TraceCheckUtils]: 16: Hoare triple {8517#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8518#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:49,882 INFO L273 TraceCheckUtils]: 17: Hoare triple {8518#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8519#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:49,883 INFO L273 TraceCheckUtils]: 18: Hoare triple {8519#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8520#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:49,884 INFO L273 TraceCheckUtils]: 19: Hoare triple {8520#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8521#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:49,885 INFO L273 TraceCheckUtils]: 20: Hoare triple {8521#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8522#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:49,886 INFO L273 TraceCheckUtils]: 21: Hoare triple {8522#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:49,887 INFO L273 TraceCheckUtils]: 22: Hoare triple {8523#(<= main_~i~0 16)} assume !(~i~0 < 100000); {8506#false} is VALID [2018-11-23 11:55:49,887 INFO L273 TraceCheckUtils]: 23: Hoare triple {8506#false} ~i~0 := 0; {8506#false} is VALID [2018-11-23 11:55:49,887 INFO L273 TraceCheckUtils]: 24: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8506#false} is VALID [2018-11-23 11:55:49,887 INFO L273 TraceCheckUtils]: 25: Hoare triple {8506#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#false} is VALID [2018-11-23 11:55:49,887 INFO L273 TraceCheckUtils]: 26: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8506#false} is VALID [2018-11-23 11:55:49,888 INFO L273 TraceCheckUtils]: 27: Hoare triple {8506#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#false} is VALID [2018-11-23 11:55:49,888 INFO L273 TraceCheckUtils]: 28: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8506#false} is VALID [2018-11-23 11:55:49,888 INFO L273 TraceCheckUtils]: 29: Hoare triple {8506#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#false} is VALID [2018-11-23 11:55:49,888 INFO L273 TraceCheckUtils]: 30: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8506#false} is VALID [2018-11-23 11:55:49,888 INFO L273 TraceCheckUtils]: 31: Hoare triple {8506#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#false} is VALID [2018-11-23 11:55:49,889 INFO L273 TraceCheckUtils]: 32: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8506#false} is VALID [2018-11-23 11:55:49,889 INFO L273 TraceCheckUtils]: 33: Hoare triple {8506#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#false} is VALID [2018-11-23 11:55:49,889 INFO L273 TraceCheckUtils]: 34: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8506#false} is VALID [2018-11-23 11:55:49,889 INFO L273 TraceCheckUtils]: 35: Hoare triple {8506#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#false} is VALID [2018-11-23 11:55:49,889 INFO L273 TraceCheckUtils]: 36: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8506#false} is VALID [2018-11-23 11:55:49,890 INFO L273 TraceCheckUtils]: 37: Hoare triple {8506#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#false} is VALID [2018-11-23 11:55:49,890 INFO L273 TraceCheckUtils]: 38: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8506#false} is VALID [2018-11-23 11:55:49,890 INFO L273 TraceCheckUtils]: 39: Hoare triple {8506#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#false} is VALID [2018-11-23 11:55:49,890 INFO L273 TraceCheckUtils]: 40: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8506#false} is VALID [2018-11-23 11:55:49,890 INFO L273 TraceCheckUtils]: 41: Hoare triple {8506#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#false} is VALID [2018-11-23 11:55:49,890 INFO L273 TraceCheckUtils]: 42: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8506#false} is VALID [2018-11-23 11:55:49,891 INFO L273 TraceCheckUtils]: 43: Hoare triple {8506#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#false} is VALID [2018-11-23 11:55:49,891 INFO L273 TraceCheckUtils]: 44: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8506#false} is VALID [2018-11-23 11:55:49,891 INFO L273 TraceCheckUtils]: 45: Hoare triple {8506#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#false} is VALID [2018-11-23 11:55:49,891 INFO L273 TraceCheckUtils]: 46: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8506#false} is VALID [2018-11-23 11:55:49,891 INFO L273 TraceCheckUtils]: 47: Hoare triple {8506#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#false} is VALID [2018-11-23 11:55:49,891 INFO L273 TraceCheckUtils]: 48: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8506#false} is VALID [2018-11-23 11:55:49,891 INFO L273 TraceCheckUtils]: 49: Hoare triple {8506#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#false} is VALID [2018-11-23 11:55:49,891 INFO L273 TraceCheckUtils]: 50: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8506#false} is VALID [2018-11-23 11:55:49,892 INFO L273 TraceCheckUtils]: 51: Hoare triple {8506#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#false} is VALID [2018-11-23 11:55:49,892 INFO L273 TraceCheckUtils]: 52: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8506#false} is VALID [2018-11-23 11:55:49,892 INFO L273 TraceCheckUtils]: 53: Hoare triple {8506#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#false} is VALID [2018-11-23 11:55:49,892 INFO L273 TraceCheckUtils]: 54: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8506#false} is VALID [2018-11-23 11:55:49,892 INFO L273 TraceCheckUtils]: 55: Hoare triple {8506#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#false} is VALID [2018-11-23 11:55:49,892 INFO L273 TraceCheckUtils]: 56: Hoare triple {8506#false} assume !(~i~0 < 100000); {8506#false} is VALID [2018-11-23 11:55:49,892 INFO L273 TraceCheckUtils]: 57: Hoare triple {8506#false} ~i~0 := 0; {8506#false} is VALID [2018-11-23 11:55:49,892 INFO L273 TraceCheckUtils]: 58: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8506#false} is VALID [2018-11-23 11:55:49,892 INFO L273 TraceCheckUtils]: 59: Hoare triple {8506#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8506#false} is VALID [2018-11-23 11:55:49,893 INFO L273 TraceCheckUtils]: 60: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8506#false} is VALID [2018-11-23 11:55:49,893 INFO L273 TraceCheckUtils]: 61: Hoare triple {8506#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8506#false} is VALID [2018-11-23 11:55:49,893 INFO L273 TraceCheckUtils]: 62: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8506#false} is VALID [2018-11-23 11:55:49,893 INFO L273 TraceCheckUtils]: 63: Hoare triple {8506#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8506#false} is VALID [2018-11-23 11:55:49,893 INFO L273 TraceCheckUtils]: 64: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8506#false} is VALID [2018-11-23 11:55:49,893 INFO L273 TraceCheckUtils]: 65: Hoare triple {8506#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8506#false} is VALID [2018-11-23 11:55:49,893 INFO L273 TraceCheckUtils]: 66: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8506#false} is VALID [2018-11-23 11:55:49,893 INFO L273 TraceCheckUtils]: 67: Hoare triple {8506#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8506#false} is VALID [2018-11-23 11:55:49,893 INFO L273 TraceCheckUtils]: 68: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8506#false} is VALID [2018-11-23 11:55:49,894 INFO L273 TraceCheckUtils]: 69: Hoare triple {8506#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8506#false} is VALID [2018-11-23 11:55:49,894 INFO L273 TraceCheckUtils]: 70: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8506#false} is VALID [2018-11-23 11:55:49,894 INFO L273 TraceCheckUtils]: 71: Hoare triple {8506#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8506#false} is VALID [2018-11-23 11:55:49,894 INFO L273 TraceCheckUtils]: 72: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8506#false} is VALID [2018-11-23 11:55:49,894 INFO L273 TraceCheckUtils]: 73: Hoare triple {8506#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8506#false} is VALID [2018-11-23 11:55:49,894 INFO L273 TraceCheckUtils]: 74: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8506#false} is VALID [2018-11-23 11:55:49,894 INFO L273 TraceCheckUtils]: 75: Hoare triple {8506#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8506#false} is VALID [2018-11-23 11:55:49,894 INFO L273 TraceCheckUtils]: 76: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8506#false} is VALID [2018-11-23 11:55:49,895 INFO L273 TraceCheckUtils]: 77: Hoare triple {8506#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8506#false} is VALID [2018-11-23 11:55:49,895 INFO L273 TraceCheckUtils]: 78: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8506#false} is VALID [2018-11-23 11:55:49,895 INFO L273 TraceCheckUtils]: 79: Hoare triple {8506#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8506#false} is VALID [2018-11-23 11:55:49,895 INFO L273 TraceCheckUtils]: 80: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8506#false} is VALID [2018-11-23 11:55:49,895 INFO L273 TraceCheckUtils]: 81: Hoare triple {8506#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8506#false} is VALID [2018-11-23 11:55:49,895 INFO L273 TraceCheckUtils]: 82: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8506#false} is VALID [2018-11-23 11:55:49,895 INFO L273 TraceCheckUtils]: 83: Hoare triple {8506#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8506#false} is VALID [2018-11-23 11:55:49,895 INFO L273 TraceCheckUtils]: 84: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8506#false} is VALID [2018-11-23 11:55:49,895 INFO L273 TraceCheckUtils]: 85: Hoare triple {8506#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8506#false} is VALID [2018-11-23 11:55:49,896 INFO L273 TraceCheckUtils]: 86: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8506#false} is VALID [2018-11-23 11:55:49,896 INFO L273 TraceCheckUtils]: 87: Hoare triple {8506#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8506#false} is VALID [2018-11-23 11:55:49,896 INFO L273 TraceCheckUtils]: 88: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8506#false} is VALID [2018-11-23 11:55:49,896 INFO L273 TraceCheckUtils]: 89: Hoare triple {8506#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8506#false} is VALID [2018-11-23 11:55:49,896 INFO L273 TraceCheckUtils]: 90: Hoare triple {8506#false} assume !(~i~0 < 100000); {8506#false} is VALID [2018-11-23 11:55:49,896 INFO L273 TraceCheckUtils]: 91: Hoare triple {8506#false} havoc ~x~0;~x~0 := 0; {8506#false} is VALID [2018-11-23 11:55:49,896 INFO L273 TraceCheckUtils]: 92: Hoare triple {8506#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {8506#false} is VALID [2018-11-23 11:55:49,896 INFO L256 TraceCheckUtils]: 93: Hoare triple {8506#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {8506#false} is VALID [2018-11-23 11:55:49,897 INFO L273 TraceCheckUtils]: 94: Hoare triple {8506#false} ~cond := #in~cond; {8506#false} is VALID [2018-11-23 11:55:49,897 INFO L273 TraceCheckUtils]: 95: Hoare triple {8506#false} assume 0 == ~cond; {8506#false} is VALID [2018-11-23 11:55:49,897 INFO L273 TraceCheckUtils]: 96: Hoare triple {8506#false} assume !false; {8506#false} is VALID [2018-11-23 11:55:49,902 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-11-23 11:55:49,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:49,902 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:49,911 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:55:53,724 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 11:55:53,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:53,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:54,038 INFO L256 TraceCheckUtils]: 0: Hoare triple {8505#true} call ULTIMATE.init(); {8505#true} is VALID [2018-11-23 11:55:54,038 INFO L273 TraceCheckUtils]: 1: Hoare triple {8505#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8505#true} is VALID [2018-11-23 11:55:54,039 INFO L273 TraceCheckUtils]: 2: Hoare triple {8505#true} assume true; {8505#true} is VALID [2018-11-23 11:55:54,039 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8505#true} {8505#true} #76#return; {8505#true} is VALID [2018-11-23 11:55:54,039 INFO L256 TraceCheckUtils]: 4: Hoare triple {8505#true} call #t~ret6 := main(); {8505#true} is VALID [2018-11-23 11:55:54,040 INFO L273 TraceCheckUtils]: 5: Hoare triple {8505#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8542#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:54,041 INFO L273 TraceCheckUtils]: 6: Hoare triple {8542#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8508#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:54,042 INFO L273 TraceCheckUtils]: 7: Hoare triple {8508#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8509#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:54,042 INFO L273 TraceCheckUtils]: 8: Hoare triple {8509#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8510#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:54,043 INFO L273 TraceCheckUtils]: 9: Hoare triple {8510#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8511#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:54,044 INFO L273 TraceCheckUtils]: 10: Hoare triple {8511#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8512#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:54,044 INFO L273 TraceCheckUtils]: 11: Hoare triple {8512#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8513#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:54,045 INFO L273 TraceCheckUtils]: 12: Hoare triple {8513#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8514#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:54,046 INFO L273 TraceCheckUtils]: 13: Hoare triple {8514#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8515#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:54,047 INFO L273 TraceCheckUtils]: 14: Hoare triple {8515#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8516#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:54,048 INFO L273 TraceCheckUtils]: 15: Hoare triple {8516#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8517#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:54,061 INFO L273 TraceCheckUtils]: 16: Hoare triple {8517#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8518#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:54,062 INFO L273 TraceCheckUtils]: 17: Hoare triple {8518#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8519#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:54,063 INFO L273 TraceCheckUtils]: 18: Hoare triple {8519#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8520#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:54,063 INFO L273 TraceCheckUtils]: 19: Hoare triple {8520#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8521#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:54,064 INFO L273 TraceCheckUtils]: 20: Hoare triple {8521#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8522#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:54,064 INFO L273 TraceCheckUtils]: 21: Hoare triple {8522#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:54,065 INFO L273 TraceCheckUtils]: 22: Hoare triple {8523#(<= main_~i~0 16)} assume !(~i~0 < 100000); {8506#false} is VALID [2018-11-23 11:55:54,065 INFO L273 TraceCheckUtils]: 23: Hoare triple {8506#false} ~i~0 := 0; {8506#false} is VALID [2018-11-23 11:55:54,066 INFO L273 TraceCheckUtils]: 24: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8506#false} is VALID [2018-11-23 11:55:54,066 INFO L273 TraceCheckUtils]: 25: Hoare triple {8506#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#false} is VALID [2018-11-23 11:55:54,066 INFO L273 TraceCheckUtils]: 26: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8506#false} is VALID [2018-11-23 11:55:54,066 INFO L273 TraceCheckUtils]: 27: Hoare triple {8506#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#false} is VALID [2018-11-23 11:55:54,066 INFO L273 TraceCheckUtils]: 28: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8506#false} is VALID [2018-11-23 11:55:54,067 INFO L273 TraceCheckUtils]: 29: Hoare triple {8506#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#false} is VALID [2018-11-23 11:55:54,067 INFO L273 TraceCheckUtils]: 30: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8506#false} is VALID [2018-11-23 11:55:54,067 INFO L273 TraceCheckUtils]: 31: Hoare triple {8506#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#false} is VALID [2018-11-23 11:55:54,067 INFO L273 TraceCheckUtils]: 32: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8506#false} is VALID [2018-11-23 11:55:54,067 INFO L273 TraceCheckUtils]: 33: Hoare triple {8506#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#false} is VALID [2018-11-23 11:55:54,068 INFO L273 TraceCheckUtils]: 34: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8506#false} is VALID [2018-11-23 11:55:54,068 INFO L273 TraceCheckUtils]: 35: Hoare triple {8506#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#false} is VALID [2018-11-23 11:55:54,068 INFO L273 TraceCheckUtils]: 36: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8506#false} is VALID [2018-11-23 11:55:54,068 INFO L273 TraceCheckUtils]: 37: Hoare triple {8506#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#false} is VALID [2018-11-23 11:55:54,068 INFO L273 TraceCheckUtils]: 38: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8506#false} is VALID [2018-11-23 11:55:54,069 INFO L273 TraceCheckUtils]: 39: Hoare triple {8506#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#false} is VALID [2018-11-23 11:55:54,069 INFO L273 TraceCheckUtils]: 40: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8506#false} is VALID [2018-11-23 11:55:54,069 INFO L273 TraceCheckUtils]: 41: Hoare triple {8506#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#false} is VALID [2018-11-23 11:55:54,069 INFO L273 TraceCheckUtils]: 42: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8506#false} is VALID [2018-11-23 11:55:54,069 INFO L273 TraceCheckUtils]: 43: Hoare triple {8506#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#false} is VALID [2018-11-23 11:55:54,070 INFO L273 TraceCheckUtils]: 44: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8506#false} is VALID [2018-11-23 11:55:54,070 INFO L273 TraceCheckUtils]: 45: Hoare triple {8506#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#false} is VALID [2018-11-23 11:55:54,070 INFO L273 TraceCheckUtils]: 46: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8506#false} is VALID [2018-11-23 11:55:54,070 INFO L273 TraceCheckUtils]: 47: Hoare triple {8506#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#false} is VALID [2018-11-23 11:55:54,070 INFO L273 TraceCheckUtils]: 48: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8506#false} is VALID [2018-11-23 11:55:54,070 INFO L273 TraceCheckUtils]: 49: Hoare triple {8506#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#false} is VALID [2018-11-23 11:55:54,071 INFO L273 TraceCheckUtils]: 50: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8506#false} is VALID [2018-11-23 11:55:54,071 INFO L273 TraceCheckUtils]: 51: Hoare triple {8506#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#false} is VALID [2018-11-23 11:55:54,071 INFO L273 TraceCheckUtils]: 52: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8506#false} is VALID [2018-11-23 11:55:54,071 INFO L273 TraceCheckUtils]: 53: Hoare triple {8506#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#false} is VALID [2018-11-23 11:55:54,071 INFO L273 TraceCheckUtils]: 54: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8506#false} is VALID [2018-11-23 11:55:54,071 INFO L273 TraceCheckUtils]: 55: Hoare triple {8506#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#false} is VALID [2018-11-23 11:55:54,071 INFO L273 TraceCheckUtils]: 56: Hoare triple {8506#false} assume !(~i~0 < 100000); {8506#false} is VALID [2018-11-23 11:55:54,071 INFO L273 TraceCheckUtils]: 57: Hoare triple {8506#false} ~i~0 := 0; {8506#false} is VALID [2018-11-23 11:55:54,071 INFO L273 TraceCheckUtils]: 58: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8506#false} is VALID [2018-11-23 11:55:54,072 INFO L273 TraceCheckUtils]: 59: Hoare triple {8506#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8506#false} is VALID [2018-11-23 11:55:54,072 INFO L273 TraceCheckUtils]: 60: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8506#false} is VALID [2018-11-23 11:55:54,072 INFO L273 TraceCheckUtils]: 61: Hoare triple {8506#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8506#false} is VALID [2018-11-23 11:55:54,072 INFO L273 TraceCheckUtils]: 62: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8506#false} is VALID [2018-11-23 11:55:54,072 INFO L273 TraceCheckUtils]: 63: Hoare triple {8506#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8506#false} is VALID [2018-11-23 11:55:54,072 INFO L273 TraceCheckUtils]: 64: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8506#false} is VALID [2018-11-23 11:55:54,072 INFO L273 TraceCheckUtils]: 65: Hoare triple {8506#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8506#false} is VALID [2018-11-23 11:55:54,072 INFO L273 TraceCheckUtils]: 66: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8506#false} is VALID [2018-11-23 11:55:54,072 INFO L273 TraceCheckUtils]: 67: Hoare triple {8506#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8506#false} is VALID [2018-11-23 11:55:54,073 INFO L273 TraceCheckUtils]: 68: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8506#false} is VALID [2018-11-23 11:55:54,073 INFO L273 TraceCheckUtils]: 69: Hoare triple {8506#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8506#false} is VALID [2018-11-23 11:55:54,073 INFO L273 TraceCheckUtils]: 70: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8506#false} is VALID [2018-11-23 11:55:54,073 INFO L273 TraceCheckUtils]: 71: Hoare triple {8506#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8506#false} is VALID [2018-11-23 11:55:54,073 INFO L273 TraceCheckUtils]: 72: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8506#false} is VALID [2018-11-23 11:55:54,073 INFO L273 TraceCheckUtils]: 73: Hoare triple {8506#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8506#false} is VALID [2018-11-23 11:55:54,073 INFO L273 TraceCheckUtils]: 74: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8506#false} is VALID [2018-11-23 11:55:54,073 INFO L273 TraceCheckUtils]: 75: Hoare triple {8506#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8506#false} is VALID [2018-11-23 11:55:54,074 INFO L273 TraceCheckUtils]: 76: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8506#false} is VALID [2018-11-23 11:55:54,074 INFO L273 TraceCheckUtils]: 77: Hoare triple {8506#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8506#false} is VALID [2018-11-23 11:55:54,074 INFO L273 TraceCheckUtils]: 78: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8506#false} is VALID [2018-11-23 11:55:54,074 INFO L273 TraceCheckUtils]: 79: Hoare triple {8506#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8506#false} is VALID [2018-11-23 11:55:54,074 INFO L273 TraceCheckUtils]: 80: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8506#false} is VALID [2018-11-23 11:55:54,074 INFO L273 TraceCheckUtils]: 81: Hoare triple {8506#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8506#false} is VALID [2018-11-23 11:55:54,074 INFO L273 TraceCheckUtils]: 82: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8506#false} is VALID [2018-11-23 11:55:54,074 INFO L273 TraceCheckUtils]: 83: Hoare triple {8506#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8506#false} is VALID [2018-11-23 11:55:54,075 INFO L273 TraceCheckUtils]: 84: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8506#false} is VALID [2018-11-23 11:55:54,075 INFO L273 TraceCheckUtils]: 85: Hoare triple {8506#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8506#false} is VALID [2018-11-23 11:55:54,075 INFO L273 TraceCheckUtils]: 86: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8506#false} is VALID [2018-11-23 11:55:54,075 INFO L273 TraceCheckUtils]: 87: Hoare triple {8506#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8506#false} is VALID [2018-11-23 11:55:54,075 INFO L273 TraceCheckUtils]: 88: Hoare triple {8506#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8506#false} is VALID [2018-11-23 11:55:54,075 INFO L273 TraceCheckUtils]: 89: Hoare triple {8506#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8506#false} is VALID [2018-11-23 11:55:54,075 INFO L273 TraceCheckUtils]: 90: Hoare triple {8506#false} assume !(~i~0 < 100000); {8506#false} is VALID [2018-11-23 11:55:54,075 INFO L273 TraceCheckUtils]: 91: Hoare triple {8506#false} havoc ~x~0;~x~0 := 0; {8506#false} is VALID [2018-11-23 11:55:54,075 INFO L273 TraceCheckUtils]: 92: Hoare triple {8506#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {8506#false} is VALID [2018-11-23 11:55:54,076 INFO L256 TraceCheckUtils]: 93: Hoare triple {8506#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {8506#false} is VALID [2018-11-23 11:55:54,076 INFO L273 TraceCheckUtils]: 94: Hoare triple {8506#false} ~cond := #in~cond; {8506#false} is VALID [2018-11-23 11:55:54,076 INFO L273 TraceCheckUtils]: 95: Hoare triple {8506#false} assume 0 == ~cond; {8506#false} is VALID [2018-11-23 11:55:54,076 INFO L273 TraceCheckUtils]: 96: Hoare triple {8506#false} assume !false; {8506#false} is VALID [2018-11-23 11:55:54,080 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-11-23 11:55:54,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:54,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 11:55:54,102 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2018-11-23 11:55:54,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:54,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:55:54,138 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:54,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:55:54,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:55:54,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:55:54,139 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand 20 states. [2018-11-23 11:55:55,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:55,251 INFO L93 Difference]: Finished difference Result 188 states and 196 transitions. [2018-11-23 11:55:55,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:55:55,251 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2018-11-23 11:55:55,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:55,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:55:55,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 134 transitions. [2018-11-23 11:55:55,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:55:55,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 134 transitions. [2018-11-23 11:55:55,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 134 transitions. [2018-11-23 11:55:55,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:55,787 INFO L225 Difference]: With dead ends: 188 [2018-11-23 11:55:55,787 INFO L226 Difference]: Without dead ends: 109 [2018-11-23 11:55:55,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:55:55,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-23 11:55:55,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-11-23 11:55:55,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:55,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 107 states. [2018-11-23 11:55:55,853 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 107 states. [2018-11-23 11:55:55,853 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 107 states. [2018-11-23 11:55:55,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:55,856 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2018-11-23 11:55:55,856 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 112 transitions. [2018-11-23 11:55:55,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:55,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:55,857 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 109 states. [2018-11-23 11:55:55,857 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 109 states. [2018-11-23 11:55:55,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:55,859 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2018-11-23 11:55:55,859 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 112 transitions. [2018-11-23 11:55:55,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:55,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:55,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:55,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:55,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-23 11:55:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 110 transitions. [2018-11-23 11:55:55,862 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 110 transitions. Word has length 97 [2018-11-23 11:55:55,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:55,862 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 110 transitions. [2018-11-23 11:55:55,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:55:55,863 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2018-11-23 11:55:55,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-23 11:55:55,863 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:55,864 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:55,864 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:55,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:55,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1207301786, now seen corresponding path program 16 times [2018-11-23 11:55:55,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:55,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:55,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:55,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:55,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:56,390 INFO L256 TraceCheckUtils]: 0: Hoare triple {9487#true} call ULTIMATE.init(); {9487#true} is VALID [2018-11-23 11:55:56,390 INFO L273 TraceCheckUtils]: 1: Hoare triple {9487#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9487#true} is VALID [2018-11-23 11:55:56,391 INFO L273 TraceCheckUtils]: 2: Hoare triple {9487#true} assume true; {9487#true} is VALID [2018-11-23 11:55:56,391 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9487#true} {9487#true} #76#return; {9487#true} is VALID [2018-11-23 11:55:56,391 INFO L256 TraceCheckUtils]: 4: Hoare triple {9487#true} call #t~ret6 := main(); {9487#true} is VALID [2018-11-23 11:55:56,392 INFO L273 TraceCheckUtils]: 5: Hoare triple {9487#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9489#(= main_~i~0 0)} is VALID [2018-11-23 11:55:56,393 INFO L273 TraceCheckUtils]: 6: Hoare triple {9489#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9490#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:56,393 INFO L273 TraceCheckUtils]: 7: Hoare triple {9490#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9491#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:56,394 INFO L273 TraceCheckUtils]: 8: Hoare triple {9491#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9492#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:56,394 INFO L273 TraceCheckUtils]: 9: Hoare triple {9492#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9493#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:56,395 INFO L273 TraceCheckUtils]: 10: Hoare triple {9493#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9494#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:56,395 INFO L273 TraceCheckUtils]: 11: Hoare triple {9494#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9495#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:56,396 INFO L273 TraceCheckUtils]: 12: Hoare triple {9495#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9496#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:56,397 INFO L273 TraceCheckUtils]: 13: Hoare triple {9496#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9497#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:56,398 INFO L273 TraceCheckUtils]: 14: Hoare triple {9497#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9498#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:56,399 INFO L273 TraceCheckUtils]: 15: Hoare triple {9498#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9499#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:56,400 INFO L273 TraceCheckUtils]: 16: Hoare triple {9499#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9500#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:56,401 INFO L273 TraceCheckUtils]: 17: Hoare triple {9500#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9501#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:56,402 INFO L273 TraceCheckUtils]: 18: Hoare triple {9501#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9502#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:56,403 INFO L273 TraceCheckUtils]: 19: Hoare triple {9502#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9503#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:56,404 INFO L273 TraceCheckUtils]: 20: Hoare triple {9503#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9504#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:56,405 INFO L273 TraceCheckUtils]: 21: Hoare triple {9504#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9505#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:56,406 INFO L273 TraceCheckUtils]: 22: Hoare triple {9505#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9506#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:56,406 INFO L273 TraceCheckUtils]: 23: Hoare triple {9506#(<= main_~i~0 17)} assume !(~i~0 < 100000); {9488#false} is VALID [2018-11-23 11:55:56,407 INFO L273 TraceCheckUtils]: 24: Hoare triple {9488#false} ~i~0 := 0; {9488#false} is VALID [2018-11-23 11:55:56,407 INFO L273 TraceCheckUtils]: 25: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9488#false} is VALID [2018-11-23 11:55:56,407 INFO L273 TraceCheckUtils]: 26: Hoare triple {9488#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9488#false} is VALID [2018-11-23 11:55:56,407 INFO L273 TraceCheckUtils]: 27: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9488#false} is VALID [2018-11-23 11:55:56,407 INFO L273 TraceCheckUtils]: 28: Hoare triple {9488#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9488#false} is VALID [2018-11-23 11:55:56,408 INFO L273 TraceCheckUtils]: 29: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9488#false} is VALID [2018-11-23 11:55:56,408 INFO L273 TraceCheckUtils]: 30: Hoare triple {9488#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9488#false} is VALID [2018-11-23 11:55:56,408 INFO L273 TraceCheckUtils]: 31: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9488#false} is VALID [2018-11-23 11:55:56,408 INFO L273 TraceCheckUtils]: 32: Hoare triple {9488#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9488#false} is VALID [2018-11-23 11:55:56,408 INFO L273 TraceCheckUtils]: 33: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9488#false} is VALID [2018-11-23 11:55:56,409 INFO L273 TraceCheckUtils]: 34: Hoare triple {9488#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9488#false} is VALID [2018-11-23 11:55:56,409 INFO L273 TraceCheckUtils]: 35: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9488#false} is VALID [2018-11-23 11:55:56,409 INFO L273 TraceCheckUtils]: 36: Hoare triple {9488#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9488#false} is VALID [2018-11-23 11:55:56,409 INFO L273 TraceCheckUtils]: 37: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9488#false} is VALID [2018-11-23 11:55:56,409 INFO L273 TraceCheckUtils]: 38: Hoare triple {9488#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9488#false} is VALID [2018-11-23 11:55:56,410 INFO L273 TraceCheckUtils]: 39: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9488#false} is VALID [2018-11-23 11:55:56,410 INFO L273 TraceCheckUtils]: 40: Hoare triple {9488#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9488#false} is VALID [2018-11-23 11:55:56,410 INFO L273 TraceCheckUtils]: 41: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9488#false} is VALID [2018-11-23 11:55:56,410 INFO L273 TraceCheckUtils]: 42: Hoare triple {9488#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9488#false} is VALID [2018-11-23 11:55:56,410 INFO L273 TraceCheckUtils]: 43: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9488#false} is VALID [2018-11-23 11:55:56,411 INFO L273 TraceCheckUtils]: 44: Hoare triple {9488#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9488#false} is VALID [2018-11-23 11:55:56,411 INFO L273 TraceCheckUtils]: 45: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9488#false} is VALID [2018-11-23 11:55:56,411 INFO L273 TraceCheckUtils]: 46: Hoare triple {9488#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9488#false} is VALID [2018-11-23 11:55:56,411 INFO L273 TraceCheckUtils]: 47: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9488#false} is VALID [2018-11-23 11:55:56,411 INFO L273 TraceCheckUtils]: 48: Hoare triple {9488#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9488#false} is VALID [2018-11-23 11:55:56,411 INFO L273 TraceCheckUtils]: 49: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9488#false} is VALID [2018-11-23 11:55:56,411 INFO L273 TraceCheckUtils]: 50: Hoare triple {9488#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9488#false} is VALID [2018-11-23 11:55:56,411 INFO L273 TraceCheckUtils]: 51: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9488#false} is VALID [2018-11-23 11:55:56,411 INFO L273 TraceCheckUtils]: 52: Hoare triple {9488#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9488#false} is VALID [2018-11-23 11:55:56,412 INFO L273 TraceCheckUtils]: 53: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9488#false} is VALID [2018-11-23 11:55:56,412 INFO L273 TraceCheckUtils]: 54: Hoare triple {9488#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9488#false} is VALID [2018-11-23 11:55:56,412 INFO L273 TraceCheckUtils]: 55: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9488#false} is VALID [2018-11-23 11:55:56,412 INFO L273 TraceCheckUtils]: 56: Hoare triple {9488#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9488#false} is VALID [2018-11-23 11:55:56,412 INFO L273 TraceCheckUtils]: 57: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9488#false} is VALID [2018-11-23 11:55:56,412 INFO L273 TraceCheckUtils]: 58: Hoare triple {9488#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9488#false} is VALID [2018-11-23 11:55:56,412 INFO L273 TraceCheckUtils]: 59: Hoare triple {9488#false} assume !(~i~0 < 100000); {9488#false} is VALID [2018-11-23 11:55:56,412 INFO L273 TraceCheckUtils]: 60: Hoare triple {9488#false} ~i~0 := 0; {9488#false} is VALID [2018-11-23 11:55:56,412 INFO L273 TraceCheckUtils]: 61: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9488#false} is VALID [2018-11-23 11:55:56,413 INFO L273 TraceCheckUtils]: 62: Hoare triple {9488#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9488#false} is VALID [2018-11-23 11:55:56,413 INFO L273 TraceCheckUtils]: 63: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9488#false} is VALID [2018-11-23 11:55:56,413 INFO L273 TraceCheckUtils]: 64: Hoare triple {9488#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9488#false} is VALID [2018-11-23 11:55:56,413 INFO L273 TraceCheckUtils]: 65: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9488#false} is VALID [2018-11-23 11:55:56,413 INFO L273 TraceCheckUtils]: 66: Hoare triple {9488#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9488#false} is VALID [2018-11-23 11:55:56,413 INFO L273 TraceCheckUtils]: 67: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9488#false} is VALID [2018-11-23 11:55:56,413 INFO L273 TraceCheckUtils]: 68: Hoare triple {9488#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9488#false} is VALID [2018-11-23 11:55:56,413 INFO L273 TraceCheckUtils]: 69: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9488#false} is VALID [2018-11-23 11:55:56,414 INFO L273 TraceCheckUtils]: 70: Hoare triple {9488#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9488#false} is VALID [2018-11-23 11:55:56,414 INFO L273 TraceCheckUtils]: 71: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9488#false} is VALID [2018-11-23 11:55:56,414 INFO L273 TraceCheckUtils]: 72: Hoare triple {9488#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9488#false} is VALID [2018-11-23 11:55:56,414 INFO L273 TraceCheckUtils]: 73: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9488#false} is VALID [2018-11-23 11:55:56,414 INFO L273 TraceCheckUtils]: 74: Hoare triple {9488#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9488#false} is VALID [2018-11-23 11:55:56,414 INFO L273 TraceCheckUtils]: 75: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9488#false} is VALID [2018-11-23 11:55:56,414 INFO L273 TraceCheckUtils]: 76: Hoare triple {9488#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9488#false} is VALID [2018-11-23 11:55:56,414 INFO L273 TraceCheckUtils]: 77: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9488#false} is VALID [2018-11-23 11:55:56,414 INFO L273 TraceCheckUtils]: 78: Hoare triple {9488#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9488#false} is VALID [2018-11-23 11:55:56,415 INFO L273 TraceCheckUtils]: 79: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9488#false} is VALID [2018-11-23 11:55:56,415 INFO L273 TraceCheckUtils]: 80: Hoare triple {9488#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9488#false} is VALID [2018-11-23 11:55:56,415 INFO L273 TraceCheckUtils]: 81: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9488#false} is VALID [2018-11-23 11:55:56,415 INFO L273 TraceCheckUtils]: 82: Hoare triple {9488#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9488#false} is VALID [2018-11-23 11:55:56,415 INFO L273 TraceCheckUtils]: 83: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9488#false} is VALID [2018-11-23 11:55:56,415 INFO L273 TraceCheckUtils]: 84: Hoare triple {9488#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9488#false} is VALID [2018-11-23 11:55:56,415 INFO L273 TraceCheckUtils]: 85: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9488#false} is VALID [2018-11-23 11:55:56,415 INFO L273 TraceCheckUtils]: 86: Hoare triple {9488#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9488#false} is VALID [2018-11-23 11:55:56,415 INFO L273 TraceCheckUtils]: 87: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9488#false} is VALID [2018-11-23 11:55:56,416 INFO L273 TraceCheckUtils]: 88: Hoare triple {9488#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9488#false} is VALID [2018-11-23 11:55:56,416 INFO L273 TraceCheckUtils]: 89: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9488#false} is VALID [2018-11-23 11:55:56,416 INFO L273 TraceCheckUtils]: 90: Hoare triple {9488#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9488#false} is VALID [2018-11-23 11:55:56,416 INFO L273 TraceCheckUtils]: 91: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9488#false} is VALID [2018-11-23 11:55:56,416 INFO L273 TraceCheckUtils]: 92: Hoare triple {9488#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9488#false} is VALID [2018-11-23 11:55:56,416 INFO L273 TraceCheckUtils]: 93: Hoare triple {9488#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9488#false} is VALID [2018-11-23 11:55:56,416 INFO L273 TraceCheckUtils]: 94: Hoare triple {9488#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9488#false} is VALID [2018-11-23 11:55:56,416 INFO L273 TraceCheckUtils]: 95: Hoare triple {9488#false} assume !(~i~0 < 100000); {9488#false} is VALID [2018-11-23 11:55:56,417 INFO L273 TraceCheckUtils]: 96: Hoare triple {9488#false} havoc ~x~0;~x~0 := 0; {9488#false} is VALID [2018-11-23 11:55:56,417 INFO L273 TraceCheckUtils]: 97: Hoare triple {9488#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {9488#false} is VALID [2018-11-23 11:55:56,417 INFO L256 TraceCheckUtils]: 98: Hoare triple {9488#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {9488#false} is VALID [2018-11-23 11:55:56,417 INFO L273 TraceCheckUtils]: 99: Hoare triple {9488#false} ~cond := #in~cond; {9488#false} is VALID [2018-11-23 11:55:56,417 INFO L273 TraceCheckUtils]: 100: Hoare triple {9488#false} assume 0 == ~cond; {9488#false} is VALID [2018-11-23 11:55:56,417 INFO L273 TraceCheckUtils]: 101: Hoare triple {9488#false} assume !false; {9488#false} is VALID [2018-11-23 11:55:56,421 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-11-23 11:55:56,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:56,422 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:56,431 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:55:56,484 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:55:56,484 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:56,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:56,672 INFO L256 TraceCheckUtils]: 0: Hoare triple {9487#true} call ULTIMATE.init(); {9487#true} is VALID [2018-11-23 11:55:56,672 INFO L273 TraceCheckUtils]: 1: Hoare triple {9487#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9487#true} is VALID [2018-11-23 11:55:56,672 INFO L273 TraceCheckUtils]: 2: Hoare triple {9487#true} assume true; {9487#true} is VALID [2018-11-23 11:55:56,672 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9487#true} {9487#true} #76#return; {9487#true} is VALID [2018-11-23 11:55:56,672 INFO L256 TraceCheckUtils]: 4: Hoare triple {9487#true} call #t~ret6 := main(); {9487#true} is VALID [2018-11-23 11:55:56,672 INFO L273 TraceCheckUtils]: 5: Hoare triple {9487#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9487#true} is VALID [2018-11-23 11:55:56,673 INFO L273 TraceCheckUtils]: 6: Hoare triple {9487#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9487#true} is VALID [2018-11-23 11:55:56,673 INFO L273 TraceCheckUtils]: 7: Hoare triple {9487#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9487#true} is VALID [2018-11-23 11:55:56,673 INFO L273 TraceCheckUtils]: 8: Hoare triple {9487#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9487#true} is VALID [2018-11-23 11:55:56,673 INFO L273 TraceCheckUtils]: 9: Hoare triple {9487#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9487#true} is VALID [2018-11-23 11:55:56,673 INFO L273 TraceCheckUtils]: 10: Hoare triple {9487#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9487#true} is VALID [2018-11-23 11:55:56,673 INFO L273 TraceCheckUtils]: 11: Hoare triple {9487#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9487#true} is VALID [2018-11-23 11:55:56,673 INFO L273 TraceCheckUtils]: 12: Hoare triple {9487#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9487#true} is VALID [2018-11-23 11:55:56,673 INFO L273 TraceCheckUtils]: 13: Hoare triple {9487#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9487#true} is VALID [2018-11-23 11:55:56,674 INFO L273 TraceCheckUtils]: 14: Hoare triple {9487#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9487#true} is VALID [2018-11-23 11:55:56,674 INFO L273 TraceCheckUtils]: 15: Hoare triple {9487#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9487#true} is VALID [2018-11-23 11:55:56,674 INFO L273 TraceCheckUtils]: 16: Hoare triple {9487#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9487#true} is VALID [2018-11-23 11:55:56,674 INFO L273 TraceCheckUtils]: 17: Hoare triple {9487#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9487#true} is VALID [2018-11-23 11:55:56,674 INFO L273 TraceCheckUtils]: 18: Hoare triple {9487#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9487#true} is VALID [2018-11-23 11:55:56,674 INFO L273 TraceCheckUtils]: 19: Hoare triple {9487#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9487#true} is VALID [2018-11-23 11:55:56,674 INFO L273 TraceCheckUtils]: 20: Hoare triple {9487#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9487#true} is VALID [2018-11-23 11:55:56,674 INFO L273 TraceCheckUtils]: 21: Hoare triple {9487#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9487#true} is VALID [2018-11-23 11:55:56,674 INFO L273 TraceCheckUtils]: 22: Hoare triple {9487#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9487#true} is VALID [2018-11-23 11:55:56,675 INFO L273 TraceCheckUtils]: 23: Hoare triple {9487#true} assume !(~i~0 < 100000); {9487#true} is VALID [2018-11-23 11:55:56,675 INFO L273 TraceCheckUtils]: 24: Hoare triple {9487#true} ~i~0 := 0; {9487#true} is VALID [2018-11-23 11:55:56,675 INFO L273 TraceCheckUtils]: 25: Hoare triple {9487#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9487#true} is VALID [2018-11-23 11:55:56,675 INFO L273 TraceCheckUtils]: 26: Hoare triple {9487#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9487#true} is VALID [2018-11-23 11:55:56,675 INFO L273 TraceCheckUtils]: 27: Hoare triple {9487#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9487#true} is VALID [2018-11-23 11:55:56,675 INFO L273 TraceCheckUtils]: 28: Hoare triple {9487#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9487#true} is VALID [2018-11-23 11:55:56,675 INFO L273 TraceCheckUtils]: 29: Hoare triple {9487#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9487#true} is VALID [2018-11-23 11:55:56,675 INFO L273 TraceCheckUtils]: 30: Hoare triple {9487#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9487#true} is VALID [2018-11-23 11:55:56,676 INFO L273 TraceCheckUtils]: 31: Hoare triple {9487#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9487#true} is VALID [2018-11-23 11:55:56,676 INFO L273 TraceCheckUtils]: 32: Hoare triple {9487#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9487#true} is VALID [2018-11-23 11:55:56,676 INFO L273 TraceCheckUtils]: 33: Hoare triple {9487#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9487#true} is VALID [2018-11-23 11:55:56,676 INFO L273 TraceCheckUtils]: 34: Hoare triple {9487#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9487#true} is VALID [2018-11-23 11:55:56,676 INFO L273 TraceCheckUtils]: 35: Hoare triple {9487#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9487#true} is VALID [2018-11-23 11:55:56,676 INFO L273 TraceCheckUtils]: 36: Hoare triple {9487#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9487#true} is VALID [2018-11-23 11:55:56,676 INFO L273 TraceCheckUtils]: 37: Hoare triple {9487#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9487#true} is VALID [2018-11-23 11:55:56,676 INFO L273 TraceCheckUtils]: 38: Hoare triple {9487#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9487#true} is VALID [2018-11-23 11:55:56,676 INFO L273 TraceCheckUtils]: 39: Hoare triple {9487#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9487#true} is VALID [2018-11-23 11:55:56,677 INFO L273 TraceCheckUtils]: 40: Hoare triple {9487#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9487#true} is VALID [2018-11-23 11:55:56,677 INFO L273 TraceCheckUtils]: 41: Hoare triple {9487#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9487#true} is VALID [2018-11-23 11:55:56,677 INFO L273 TraceCheckUtils]: 42: Hoare triple {9487#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9487#true} is VALID [2018-11-23 11:55:56,677 INFO L273 TraceCheckUtils]: 43: Hoare triple {9487#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9487#true} is VALID [2018-11-23 11:55:56,677 INFO L273 TraceCheckUtils]: 44: Hoare triple {9487#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9487#true} is VALID [2018-11-23 11:55:56,677 INFO L273 TraceCheckUtils]: 45: Hoare triple {9487#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9487#true} is VALID [2018-11-23 11:55:56,677 INFO L273 TraceCheckUtils]: 46: Hoare triple {9487#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9487#true} is VALID [2018-11-23 11:55:56,677 INFO L273 TraceCheckUtils]: 47: Hoare triple {9487#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9487#true} is VALID [2018-11-23 11:55:56,677 INFO L273 TraceCheckUtils]: 48: Hoare triple {9487#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9487#true} is VALID [2018-11-23 11:55:56,678 INFO L273 TraceCheckUtils]: 49: Hoare triple {9487#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9487#true} is VALID [2018-11-23 11:55:56,678 INFO L273 TraceCheckUtils]: 50: Hoare triple {9487#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9487#true} is VALID [2018-11-23 11:55:56,678 INFO L273 TraceCheckUtils]: 51: Hoare triple {9487#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9487#true} is VALID [2018-11-23 11:55:56,678 INFO L273 TraceCheckUtils]: 52: Hoare triple {9487#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9487#true} is VALID [2018-11-23 11:55:56,678 INFO L273 TraceCheckUtils]: 53: Hoare triple {9487#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9487#true} is VALID [2018-11-23 11:55:56,678 INFO L273 TraceCheckUtils]: 54: Hoare triple {9487#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9487#true} is VALID [2018-11-23 11:55:56,678 INFO L273 TraceCheckUtils]: 55: Hoare triple {9487#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9487#true} is VALID [2018-11-23 11:55:56,678 INFO L273 TraceCheckUtils]: 56: Hoare triple {9487#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9487#true} is VALID [2018-11-23 11:55:56,679 INFO L273 TraceCheckUtils]: 57: Hoare triple {9487#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9487#true} is VALID [2018-11-23 11:55:56,679 INFO L273 TraceCheckUtils]: 58: Hoare triple {9487#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9487#true} is VALID [2018-11-23 11:55:56,679 INFO L273 TraceCheckUtils]: 59: Hoare triple {9487#true} assume !(~i~0 < 100000); {9487#true} is VALID [2018-11-23 11:55:56,680 INFO L273 TraceCheckUtils]: 60: Hoare triple {9487#true} ~i~0 := 0; {9690#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:56,680 INFO L273 TraceCheckUtils]: 61: Hoare triple {9690#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9690#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:56,681 INFO L273 TraceCheckUtils]: 62: Hoare triple {9690#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9490#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:56,681 INFO L273 TraceCheckUtils]: 63: Hoare triple {9490#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9490#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:56,681 INFO L273 TraceCheckUtils]: 64: Hoare triple {9490#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9491#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:56,682 INFO L273 TraceCheckUtils]: 65: Hoare triple {9491#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9491#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:56,683 INFO L273 TraceCheckUtils]: 66: Hoare triple {9491#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9492#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:56,683 INFO L273 TraceCheckUtils]: 67: Hoare triple {9492#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9492#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:56,683 INFO L273 TraceCheckUtils]: 68: Hoare triple {9492#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9493#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:56,684 INFO L273 TraceCheckUtils]: 69: Hoare triple {9493#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9493#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:56,684 INFO L273 TraceCheckUtils]: 70: Hoare triple {9493#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9494#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:56,685 INFO L273 TraceCheckUtils]: 71: Hoare triple {9494#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9494#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:56,686 INFO L273 TraceCheckUtils]: 72: Hoare triple {9494#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9495#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:56,686 INFO L273 TraceCheckUtils]: 73: Hoare triple {9495#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9495#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:56,687 INFO L273 TraceCheckUtils]: 74: Hoare triple {9495#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9496#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:56,687 INFO L273 TraceCheckUtils]: 75: Hoare triple {9496#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9496#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:56,688 INFO L273 TraceCheckUtils]: 76: Hoare triple {9496#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9497#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:56,689 INFO L273 TraceCheckUtils]: 77: Hoare triple {9497#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9497#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:56,689 INFO L273 TraceCheckUtils]: 78: Hoare triple {9497#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9498#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:56,690 INFO L273 TraceCheckUtils]: 79: Hoare triple {9498#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9498#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:56,691 INFO L273 TraceCheckUtils]: 80: Hoare triple {9498#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9499#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:56,691 INFO L273 TraceCheckUtils]: 81: Hoare triple {9499#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9499#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:56,692 INFO L273 TraceCheckUtils]: 82: Hoare triple {9499#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9500#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:56,693 INFO L273 TraceCheckUtils]: 83: Hoare triple {9500#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9500#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:56,693 INFO L273 TraceCheckUtils]: 84: Hoare triple {9500#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9501#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:56,694 INFO L273 TraceCheckUtils]: 85: Hoare triple {9501#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9501#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:56,695 INFO L273 TraceCheckUtils]: 86: Hoare triple {9501#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9502#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:56,695 INFO L273 TraceCheckUtils]: 87: Hoare triple {9502#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9502#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:56,696 INFO L273 TraceCheckUtils]: 88: Hoare triple {9502#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9503#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:56,696 INFO L273 TraceCheckUtils]: 89: Hoare triple {9503#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9503#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:56,697 INFO L273 TraceCheckUtils]: 90: Hoare triple {9503#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9504#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:56,698 INFO L273 TraceCheckUtils]: 91: Hoare triple {9504#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9504#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:56,698 INFO L273 TraceCheckUtils]: 92: Hoare triple {9504#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9505#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:56,699 INFO L273 TraceCheckUtils]: 93: Hoare triple {9505#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9505#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:56,700 INFO L273 TraceCheckUtils]: 94: Hoare triple {9505#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9506#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:56,700 INFO L273 TraceCheckUtils]: 95: Hoare triple {9506#(<= main_~i~0 17)} assume !(~i~0 < 100000); {9488#false} is VALID [2018-11-23 11:55:56,701 INFO L273 TraceCheckUtils]: 96: Hoare triple {9488#false} havoc ~x~0;~x~0 := 0; {9488#false} is VALID [2018-11-23 11:55:56,701 INFO L273 TraceCheckUtils]: 97: Hoare triple {9488#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {9488#false} is VALID [2018-11-23 11:55:56,701 INFO L256 TraceCheckUtils]: 98: Hoare triple {9488#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {9488#false} is VALID [2018-11-23 11:55:56,701 INFO L273 TraceCheckUtils]: 99: Hoare triple {9488#false} ~cond := #in~cond; {9488#false} is VALID [2018-11-23 11:55:56,701 INFO L273 TraceCheckUtils]: 100: Hoare triple {9488#false} assume 0 == ~cond; {9488#false} is VALID [2018-11-23 11:55:56,702 INFO L273 TraceCheckUtils]: 101: Hoare triple {9488#false} assume !false; {9488#false} is VALID [2018-11-23 11:55:56,708 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-11-23 11:55:56,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:56,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 11:55:56,728 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 102 [2018-11-23 11:55:56,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:56,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 11:55:56,813 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:56,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 11:55:56,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 11:55:56,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:55:56,814 INFO L87 Difference]: Start difference. First operand 107 states and 110 transitions. Second operand 21 states. [2018-11-23 11:55:57,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:57,447 INFO L93 Difference]: Finished difference Result 197 states and 205 transitions. [2018-11-23 11:55:57,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:55:57,447 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 102 [2018-11-23 11:55:57,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:57,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:55:57,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 139 transitions. [2018-11-23 11:55:57,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:55:57,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 139 transitions. [2018-11-23 11:55:57,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 139 transitions. [2018-11-23 11:55:57,601 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:57,604 INFO L225 Difference]: With dead ends: 197 [2018-11-23 11:55:57,604 INFO L226 Difference]: Without dead ends: 114 [2018-11-23 11:55:57,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:55:57,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-23 11:55:57,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2018-11-23 11:55:57,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:57,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 112 states. [2018-11-23 11:55:57,658 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 112 states. [2018-11-23 11:55:57,658 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 112 states. [2018-11-23 11:55:57,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:57,660 INFO L93 Difference]: Finished difference Result 114 states and 117 transitions. [2018-11-23 11:55:57,660 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 117 transitions. [2018-11-23 11:55:57,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:57,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:57,661 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 114 states. [2018-11-23 11:55:57,661 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 114 states. [2018-11-23 11:55:57,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:57,663 INFO L93 Difference]: Finished difference Result 114 states and 117 transitions. [2018-11-23 11:55:57,663 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 117 transitions. [2018-11-23 11:55:57,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:57,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:57,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:57,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:57,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-23 11:55:57,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 115 transitions. [2018-11-23 11:55:57,666 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 115 transitions. Word has length 102 [2018-11-23 11:55:57,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:57,667 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 115 transitions. [2018-11-23 11:55:57,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 11:55:57,667 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 115 transitions. [2018-11-23 11:55:57,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-23 11:55:57,668 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:57,668 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:57,668 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:57,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:57,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1112684590, now seen corresponding path program 17 times [2018-11-23 11:55:57,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:57,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:57,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:57,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:57,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:58,503 INFO L256 TraceCheckUtils]: 0: Hoare triple {10517#true} call ULTIMATE.init(); {10517#true} is VALID [2018-11-23 11:55:58,503 INFO L273 TraceCheckUtils]: 1: Hoare triple {10517#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10517#true} is VALID [2018-11-23 11:55:58,504 INFO L273 TraceCheckUtils]: 2: Hoare triple {10517#true} assume true; {10517#true} is VALID [2018-11-23 11:55:58,504 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10517#true} {10517#true} #76#return; {10517#true} is VALID [2018-11-23 11:55:58,504 INFO L256 TraceCheckUtils]: 4: Hoare triple {10517#true} call #t~ret6 := main(); {10517#true} is VALID [2018-11-23 11:55:58,505 INFO L273 TraceCheckUtils]: 5: Hoare triple {10517#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10519#(= main_~i~0 0)} is VALID [2018-11-23 11:55:58,505 INFO L273 TraceCheckUtils]: 6: Hoare triple {10519#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10520#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:58,509 INFO L273 TraceCheckUtils]: 7: Hoare triple {10520#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10521#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:58,509 INFO L273 TraceCheckUtils]: 8: Hoare triple {10521#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10522#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:58,511 INFO L273 TraceCheckUtils]: 9: Hoare triple {10522#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10523#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:58,511 INFO L273 TraceCheckUtils]: 10: Hoare triple {10523#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10524#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:58,513 INFO L273 TraceCheckUtils]: 11: Hoare triple {10524#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10525#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:58,514 INFO L273 TraceCheckUtils]: 12: Hoare triple {10525#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10526#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:58,515 INFO L273 TraceCheckUtils]: 13: Hoare triple {10526#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10527#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:58,516 INFO L273 TraceCheckUtils]: 14: Hoare triple {10527#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10528#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:58,517 INFO L273 TraceCheckUtils]: 15: Hoare triple {10528#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10529#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:58,519 INFO L273 TraceCheckUtils]: 16: Hoare triple {10529#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10530#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:58,521 INFO L273 TraceCheckUtils]: 17: Hoare triple {10530#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10531#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:58,522 INFO L273 TraceCheckUtils]: 18: Hoare triple {10531#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10532#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:58,523 INFO L273 TraceCheckUtils]: 19: Hoare triple {10532#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10533#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:58,523 INFO L273 TraceCheckUtils]: 20: Hoare triple {10533#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10534#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:58,525 INFO L273 TraceCheckUtils]: 21: Hoare triple {10534#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10535#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:58,526 INFO L273 TraceCheckUtils]: 22: Hoare triple {10535#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10536#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:58,527 INFO L273 TraceCheckUtils]: 23: Hoare triple {10536#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10537#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:58,527 INFO L273 TraceCheckUtils]: 24: Hoare triple {10537#(<= main_~i~0 18)} assume !(~i~0 < 100000); {10518#false} is VALID [2018-11-23 11:55:58,528 INFO L273 TraceCheckUtils]: 25: Hoare triple {10518#false} ~i~0 := 0; {10518#false} is VALID [2018-11-23 11:55:58,528 INFO L273 TraceCheckUtils]: 26: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10518#false} is VALID [2018-11-23 11:55:58,528 INFO L273 TraceCheckUtils]: 27: Hoare triple {10518#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10518#false} is VALID [2018-11-23 11:55:58,528 INFO L273 TraceCheckUtils]: 28: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10518#false} is VALID [2018-11-23 11:55:58,528 INFO L273 TraceCheckUtils]: 29: Hoare triple {10518#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10518#false} is VALID [2018-11-23 11:55:58,529 INFO L273 TraceCheckUtils]: 30: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10518#false} is VALID [2018-11-23 11:55:58,529 INFO L273 TraceCheckUtils]: 31: Hoare triple {10518#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10518#false} is VALID [2018-11-23 11:55:58,529 INFO L273 TraceCheckUtils]: 32: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10518#false} is VALID [2018-11-23 11:55:58,529 INFO L273 TraceCheckUtils]: 33: Hoare triple {10518#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10518#false} is VALID [2018-11-23 11:55:58,529 INFO L273 TraceCheckUtils]: 34: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10518#false} is VALID [2018-11-23 11:55:58,530 INFO L273 TraceCheckUtils]: 35: Hoare triple {10518#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10518#false} is VALID [2018-11-23 11:55:58,530 INFO L273 TraceCheckUtils]: 36: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10518#false} is VALID [2018-11-23 11:55:58,530 INFO L273 TraceCheckUtils]: 37: Hoare triple {10518#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10518#false} is VALID [2018-11-23 11:55:58,530 INFO L273 TraceCheckUtils]: 38: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10518#false} is VALID [2018-11-23 11:55:58,530 INFO L273 TraceCheckUtils]: 39: Hoare triple {10518#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10518#false} is VALID [2018-11-23 11:55:58,531 INFO L273 TraceCheckUtils]: 40: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10518#false} is VALID [2018-11-23 11:55:58,531 INFO L273 TraceCheckUtils]: 41: Hoare triple {10518#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10518#false} is VALID [2018-11-23 11:55:58,531 INFO L273 TraceCheckUtils]: 42: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10518#false} is VALID [2018-11-23 11:55:58,531 INFO L273 TraceCheckUtils]: 43: Hoare triple {10518#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10518#false} is VALID [2018-11-23 11:55:58,531 INFO L273 TraceCheckUtils]: 44: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10518#false} is VALID [2018-11-23 11:55:58,531 INFO L273 TraceCheckUtils]: 45: Hoare triple {10518#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10518#false} is VALID [2018-11-23 11:55:58,531 INFO L273 TraceCheckUtils]: 46: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10518#false} is VALID [2018-11-23 11:55:58,531 INFO L273 TraceCheckUtils]: 47: Hoare triple {10518#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10518#false} is VALID [2018-11-23 11:55:58,532 INFO L273 TraceCheckUtils]: 48: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10518#false} is VALID [2018-11-23 11:55:58,532 INFO L273 TraceCheckUtils]: 49: Hoare triple {10518#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10518#false} is VALID [2018-11-23 11:55:58,532 INFO L273 TraceCheckUtils]: 50: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10518#false} is VALID [2018-11-23 11:55:58,532 INFO L273 TraceCheckUtils]: 51: Hoare triple {10518#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10518#false} is VALID [2018-11-23 11:55:58,532 INFO L273 TraceCheckUtils]: 52: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10518#false} is VALID [2018-11-23 11:55:58,532 INFO L273 TraceCheckUtils]: 53: Hoare triple {10518#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10518#false} is VALID [2018-11-23 11:55:58,532 INFO L273 TraceCheckUtils]: 54: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10518#false} is VALID [2018-11-23 11:55:58,532 INFO L273 TraceCheckUtils]: 55: Hoare triple {10518#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10518#false} is VALID [2018-11-23 11:55:58,532 INFO L273 TraceCheckUtils]: 56: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10518#false} is VALID [2018-11-23 11:55:58,533 INFO L273 TraceCheckUtils]: 57: Hoare triple {10518#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10518#false} is VALID [2018-11-23 11:55:58,533 INFO L273 TraceCheckUtils]: 58: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10518#false} is VALID [2018-11-23 11:55:58,533 INFO L273 TraceCheckUtils]: 59: Hoare triple {10518#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10518#false} is VALID [2018-11-23 11:55:58,533 INFO L273 TraceCheckUtils]: 60: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10518#false} is VALID [2018-11-23 11:55:58,533 INFO L273 TraceCheckUtils]: 61: Hoare triple {10518#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10518#false} is VALID [2018-11-23 11:55:58,533 INFO L273 TraceCheckUtils]: 62: Hoare triple {10518#false} assume !(~i~0 < 100000); {10518#false} is VALID [2018-11-23 11:55:58,533 INFO L273 TraceCheckUtils]: 63: Hoare triple {10518#false} ~i~0 := 0; {10518#false} is VALID [2018-11-23 11:55:58,533 INFO L273 TraceCheckUtils]: 64: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10518#false} is VALID [2018-11-23 11:55:58,533 INFO L273 TraceCheckUtils]: 65: Hoare triple {10518#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10518#false} is VALID [2018-11-23 11:55:58,534 INFO L273 TraceCheckUtils]: 66: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10518#false} is VALID [2018-11-23 11:55:58,534 INFO L273 TraceCheckUtils]: 67: Hoare triple {10518#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10518#false} is VALID [2018-11-23 11:55:58,534 INFO L273 TraceCheckUtils]: 68: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10518#false} is VALID [2018-11-23 11:55:58,534 INFO L273 TraceCheckUtils]: 69: Hoare triple {10518#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10518#false} is VALID [2018-11-23 11:55:58,534 INFO L273 TraceCheckUtils]: 70: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10518#false} is VALID [2018-11-23 11:55:58,534 INFO L273 TraceCheckUtils]: 71: Hoare triple {10518#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10518#false} is VALID [2018-11-23 11:55:58,534 INFO L273 TraceCheckUtils]: 72: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10518#false} is VALID [2018-11-23 11:55:58,534 INFO L273 TraceCheckUtils]: 73: Hoare triple {10518#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10518#false} is VALID [2018-11-23 11:55:58,534 INFO L273 TraceCheckUtils]: 74: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10518#false} is VALID [2018-11-23 11:55:58,535 INFO L273 TraceCheckUtils]: 75: Hoare triple {10518#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10518#false} is VALID [2018-11-23 11:55:58,535 INFO L273 TraceCheckUtils]: 76: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10518#false} is VALID [2018-11-23 11:55:58,535 INFO L273 TraceCheckUtils]: 77: Hoare triple {10518#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10518#false} is VALID [2018-11-23 11:55:58,535 INFO L273 TraceCheckUtils]: 78: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10518#false} is VALID [2018-11-23 11:55:58,535 INFO L273 TraceCheckUtils]: 79: Hoare triple {10518#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10518#false} is VALID [2018-11-23 11:55:58,535 INFO L273 TraceCheckUtils]: 80: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10518#false} is VALID [2018-11-23 11:55:58,535 INFO L273 TraceCheckUtils]: 81: Hoare triple {10518#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10518#false} is VALID [2018-11-23 11:55:58,535 INFO L273 TraceCheckUtils]: 82: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10518#false} is VALID [2018-11-23 11:55:58,536 INFO L273 TraceCheckUtils]: 83: Hoare triple {10518#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10518#false} is VALID [2018-11-23 11:55:58,536 INFO L273 TraceCheckUtils]: 84: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10518#false} is VALID [2018-11-23 11:55:58,536 INFO L273 TraceCheckUtils]: 85: Hoare triple {10518#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10518#false} is VALID [2018-11-23 11:55:58,536 INFO L273 TraceCheckUtils]: 86: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10518#false} is VALID [2018-11-23 11:55:58,536 INFO L273 TraceCheckUtils]: 87: Hoare triple {10518#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10518#false} is VALID [2018-11-23 11:55:58,536 INFO L273 TraceCheckUtils]: 88: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10518#false} is VALID [2018-11-23 11:55:58,536 INFO L273 TraceCheckUtils]: 89: Hoare triple {10518#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10518#false} is VALID [2018-11-23 11:55:58,536 INFO L273 TraceCheckUtils]: 90: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10518#false} is VALID [2018-11-23 11:55:58,536 INFO L273 TraceCheckUtils]: 91: Hoare triple {10518#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10518#false} is VALID [2018-11-23 11:55:58,537 INFO L273 TraceCheckUtils]: 92: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10518#false} is VALID [2018-11-23 11:55:58,537 INFO L273 TraceCheckUtils]: 93: Hoare triple {10518#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10518#false} is VALID [2018-11-23 11:55:58,537 INFO L273 TraceCheckUtils]: 94: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10518#false} is VALID [2018-11-23 11:55:58,537 INFO L273 TraceCheckUtils]: 95: Hoare triple {10518#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10518#false} is VALID [2018-11-23 11:55:58,537 INFO L273 TraceCheckUtils]: 96: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10518#false} is VALID [2018-11-23 11:55:58,537 INFO L273 TraceCheckUtils]: 97: Hoare triple {10518#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10518#false} is VALID [2018-11-23 11:55:58,537 INFO L273 TraceCheckUtils]: 98: Hoare triple {10518#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10518#false} is VALID [2018-11-23 11:55:58,537 INFO L273 TraceCheckUtils]: 99: Hoare triple {10518#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10518#false} is VALID [2018-11-23 11:55:58,537 INFO L273 TraceCheckUtils]: 100: Hoare triple {10518#false} assume !(~i~0 < 100000); {10518#false} is VALID [2018-11-23 11:55:58,538 INFO L273 TraceCheckUtils]: 101: Hoare triple {10518#false} havoc ~x~0;~x~0 := 0; {10518#false} is VALID [2018-11-23 11:55:58,538 INFO L273 TraceCheckUtils]: 102: Hoare triple {10518#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {10518#false} is VALID [2018-11-23 11:55:58,538 INFO L256 TraceCheckUtils]: 103: Hoare triple {10518#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {10518#false} is VALID [2018-11-23 11:55:58,538 INFO L273 TraceCheckUtils]: 104: Hoare triple {10518#false} ~cond := #in~cond; {10518#false} is VALID [2018-11-23 11:55:58,538 INFO L273 TraceCheckUtils]: 105: Hoare triple {10518#false} assume 0 == ~cond; {10518#false} is VALID [2018-11-23 11:55:58,538 INFO L273 TraceCheckUtils]: 106: Hoare triple {10518#false} assume !false; {10518#false} is VALID [2018-11-23 11:55:58,543 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2018-11-23 11:55:58,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:58,544 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:58,553 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:57:22,753 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-11-23 11:57:22,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:57:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:22,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:23,037 INFO L256 TraceCheckUtils]: 0: Hoare triple {10517#true} call ULTIMATE.init(); {10517#true} is VALID [2018-11-23 11:57:23,037 INFO L273 TraceCheckUtils]: 1: Hoare triple {10517#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10517#true} is VALID [2018-11-23 11:57:23,037 INFO L273 TraceCheckUtils]: 2: Hoare triple {10517#true} assume true; {10517#true} is VALID [2018-11-23 11:57:23,038 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10517#true} {10517#true} #76#return; {10517#true} is VALID [2018-11-23 11:57:23,038 INFO L256 TraceCheckUtils]: 4: Hoare triple {10517#true} call #t~ret6 := main(); {10517#true} is VALID [2018-11-23 11:57:23,038 INFO L273 TraceCheckUtils]: 5: Hoare triple {10517#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10517#true} is VALID [2018-11-23 11:57:23,039 INFO L273 TraceCheckUtils]: 6: Hoare triple {10517#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10517#true} is VALID [2018-11-23 11:57:23,039 INFO L273 TraceCheckUtils]: 7: Hoare triple {10517#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10517#true} is VALID [2018-11-23 11:57:23,039 INFO L273 TraceCheckUtils]: 8: Hoare triple {10517#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10517#true} is VALID [2018-11-23 11:57:23,039 INFO L273 TraceCheckUtils]: 9: Hoare triple {10517#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10517#true} is VALID [2018-11-23 11:57:23,039 INFO L273 TraceCheckUtils]: 10: Hoare triple {10517#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10517#true} is VALID [2018-11-23 11:57:23,040 INFO L273 TraceCheckUtils]: 11: Hoare triple {10517#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10517#true} is VALID [2018-11-23 11:57:23,040 INFO L273 TraceCheckUtils]: 12: Hoare triple {10517#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10517#true} is VALID [2018-11-23 11:57:23,040 INFO L273 TraceCheckUtils]: 13: Hoare triple {10517#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10517#true} is VALID [2018-11-23 11:57:23,040 INFO L273 TraceCheckUtils]: 14: Hoare triple {10517#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10517#true} is VALID [2018-11-23 11:57:23,040 INFO L273 TraceCheckUtils]: 15: Hoare triple {10517#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10517#true} is VALID [2018-11-23 11:57:23,040 INFO L273 TraceCheckUtils]: 16: Hoare triple {10517#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10517#true} is VALID [2018-11-23 11:57:23,040 INFO L273 TraceCheckUtils]: 17: Hoare triple {10517#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10517#true} is VALID [2018-11-23 11:57:23,041 INFO L273 TraceCheckUtils]: 18: Hoare triple {10517#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10517#true} is VALID [2018-11-23 11:57:23,041 INFO L273 TraceCheckUtils]: 19: Hoare triple {10517#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10517#true} is VALID [2018-11-23 11:57:23,041 INFO L273 TraceCheckUtils]: 20: Hoare triple {10517#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10517#true} is VALID [2018-11-23 11:57:23,041 INFO L273 TraceCheckUtils]: 21: Hoare triple {10517#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10517#true} is VALID [2018-11-23 11:57:23,041 INFO L273 TraceCheckUtils]: 22: Hoare triple {10517#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10517#true} is VALID [2018-11-23 11:57:23,041 INFO L273 TraceCheckUtils]: 23: Hoare triple {10517#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10517#true} is VALID [2018-11-23 11:57:23,041 INFO L273 TraceCheckUtils]: 24: Hoare triple {10517#true} assume !(~i~0 < 100000); {10517#true} is VALID [2018-11-23 11:57:23,041 INFO L273 TraceCheckUtils]: 25: Hoare triple {10517#true} ~i~0 := 0; {10517#true} is VALID [2018-11-23 11:57:23,042 INFO L273 TraceCheckUtils]: 26: Hoare triple {10517#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10517#true} is VALID [2018-11-23 11:57:23,042 INFO L273 TraceCheckUtils]: 27: Hoare triple {10517#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10517#true} is VALID [2018-11-23 11:57:23,042 INFO L273 TraceCheckUtils]: 28: Hoare triple {10517#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10517#true} is VALID [2018-11-23 11:57:23,042 INFO L273 TraceCheckUtils]: 29: Hoare triple {10517#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10517#true} is VALID [2018-11-23 11:57:23,042 INFO L273 TraceCheckUtils]: 30: Hoare triple {10517#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10517#true} is VALID [2018-11-23 11:57:23,042 INFO L273 TraceCheckUtils]: 31: Hoare triple {10517#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10517#true} is VALID [2018-11-23 11:57:23,042 INFO L273 TraceCheckUtils]: 32: Hoare triple {10517#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10517#true} is VALID [2018-11-23 11:57:23,042 INFO L273 TraceCheckUtils]: 33: Hoare triple {10517#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10517#true} is VALID [2018-11-23 11:57:23,042 INFO L273 TraceCheckUtils]: 34: Hoare triple {10517#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10517#true} is VALID [2018-11-23 11:57:23,043 INFO L273 TraceCheckUtils]: 35: Hoare triple {10517#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10517#true} is VALID [2018-11-23 11:57:23,043 INFO L273 TraceCheckUtils]: 36: Hoare triple {10517#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10517#true} is VALID [2018-11-23 11:57:23,043 INFO L273 TraceCheckUtils]: 37: Hoare triple {10517#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10517#true} is VALID [2018-11-23 11:57:23,043 INFO L273 TraceCheckUtils]: 38: Hoare triple {10517#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10517#true} is VALID [2018-11-23 11:57:23,043 INFO L273 TraceCheckUtils]: 39: Hoare triple {10517#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10517#true} is VALID [2018-11-23 11:57:23,043 INFO L273 TraceCheckUtils]: 40: Hoare triple {10517#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10517#true} is VALID [2018-11-23 11:57:23,043 INFO L273 TraceCheckUtils]: 41: Hoare triple {10517#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10517#true} is VALID [2018-11-23 11:57:23,043 INFO L273 TraceCheckUtils]: 42: Hoare triple {10517#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10517#true} is VALID [2018-11-23 11:57:23,043 INFO L273 TraceCheckUtils]: 43: Hoare triple {10517#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10517#true} is VALID [2018-11-23 11:57:23,044 INFO L273 TraceCheckUtils]: 44: Hoare triple {10517#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10517#true} is VALID [2018-11-23 11:57:23,044 INFO L273 TraceCheckUtils]: 45: Hoare triple {10517#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10517#true} is VALID [2018-11-23 11:57:23,044 INFO L273 TraceCheckUtils]: 46: Hoare triple {10517#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10517#true} is VALID [2018-11-23 11:57:23,044 INFO L273 TraceCheckUtils]: 47: Hoare triple {10517#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10517#true} is VALID [2018-11-23 11:57:23,044 INFO L273 TraceCheckUtils]: 48: Hoare triple {10517#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10517#true} is VALID [2018-11-23 11:57:23,044 INFO L273 TraceCheckUtils]: 49: Hoare triple {10517#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10517#true} is VALID [2018-11-23 11:57:23,044 INFO L273 TraceCheckUtils]: 50: Hoare triple {10517#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10517#true} is VALID [2018-11-23 11:57:23,044 INFO L273 TraceCheckUtils]: 51: Hoare triple {10517#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10517#true} is VALID [2018-11-23 11:57:23,044 INFO L273 TraceCheckUtils]: 52: Hoare triple {10517#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10517#true} is VALID [2018-11-23 11:57:23,045 INFO L273 TraceCheckUtils]: 53: Hoare triple {10517#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10517#true} is VALID [2018-11-23 11:57:23,045 INFO L273 TraceCheckUtils]: 54: Hoare triple {10517#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10517#true} is VALID [2018-11-23 11:57:23,045 INFO L273 TraceCheckUtils]: 55: Hoare triple {10517#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10517#true} is VALID [2018-11-23 11:57:23,045 INFO L273 TraceCheckUtils]: 56: Hoare triple {10517#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10517#true} is VALID [2018-11-23 11:57:23,045 INFO L273 TraceCheckUtils]: 57: Hoare triple {10517#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10517#true} is VALID [2018-11-23 11:57:23,045 INFO L273 TraceCheckUtils]: 58: Hoare triple {10517#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10517#true} is VALID [2018-11-23 11:57:23,045 INFO L273 TraceCheckUtils]: 59: Hoare triple {10517#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10517#true} is VALID [2018-11-23 11:57:23,045 INFO L273 TraceCheckUtils]: 60: Hoare triple {10517#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10517#true} is VALID [2018-11-23 11:57:23,046 INFO L273 TraceCheckUtils]: 61: Hoare triple {10517#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10517#true} is VALID [2018-11-23 11:57:23,046 INFO L273 TraceCheckUtils]: 62: Hoare triple {10517#true} assume !(~i~0 < 100000); {10517#true} is VALID [2018-11-23 11:57:23,046 INFO L273 TraceCheckUtils]: 63: Hoare triple {10517#true} ~i~0 := 0; {10730#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:23,046 INFO L273 TraceCheckUtils]: 64: Hoare triple {10730#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10730#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:23,047 INFO L273 TraceCheckUtils]: 65: Hoare triple {10730#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10520#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:23,047 INFO L273 TraceCheckUtils]: 66: Hoare triple {10520#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10520#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:23,048 INFO L273 TraceCheckUtils]: 67: Hoare triple {10520#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10521#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:23,048 INFO L273 TraceCheckUtils]: 68: Hoare triple {10521#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10521#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:23,048 INFO L273 TraceCheckUtils]: 69: Hoare triple {10521#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10522#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:23,049 INFO L273 TraceCheckUtils]: 70: Hoare triple {10522#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10522#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:23,049 INFO L273 TraceCheckUtils]: 71: Hoare triple {10522#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10523#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:23,049 INFO L273 TraceCheckUtils]: 72: Hoare triple {10523#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10523#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:23,050 INFO L273 TraceCheckUtils]: 73: Hoare triple {10523#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10524#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:23,050 INFO L273 TraceCheckUtils]: 74: Hoare triple {10524#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10524#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:23,051 INFO L273 TraceCheckUtils]: 75: Hoare triple {10524#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10525#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:23,051 INFO L273 TraceCheckUtils]: 76: Hoare triple {10525#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10525#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:23,052 INFO L273 TraceCheckUtils]: 77: Hoare triple {10525#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10526#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:23,053 INFO L273 TraceCheckUtils]: 78: Hoare triple {10526#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10526#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:23,053 INFO L273 TraceCheckUtils]: 79: Hoare triple {10526#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10527#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:23,054 INFO L273 TraceCheckUtils]: 80: Hoare triple {10527#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10527#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:23,055 INFO L273 TraceCheckUtils]: 81: Hoare triple {10527#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10528#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:23,055 INFO L273 TraceCheckUtils]: 82: Hoare triple {10528#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10528#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:23,056 INFO L273 TraceCheckUtils]: 83: Hoare triple {10528#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10529#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:23,057 INFO L273 TraceCheckUtils]: 84: Hoare triple {10529#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10529#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:23,057 INFO L273 TraceCheckUtils]: 85: Hoare triple {10529#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10530#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:23,058 INFO L273 TraceCheckUtils]: 86: Hoare triple {10530#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10530#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:23,059 INFO L273 TraceCheckUtils]: 87: Hoare triple {10530#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10531#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:23,059 INFO L273 TraceCheckUtils]: 88: Hoare triple {10531#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10531#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:23,060 INFO L273 TraceCheckUtils]: 89: Hoare triple {10531#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10532#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:23,060 INFO L273 TraceCheckUtils]: 90: Hoare triple {10532#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10532#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:23,061 INFO L273 TraceCheckUtils]: 91: Hoare triple {10532#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10533#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:23,062 INFO L273 TraceCheckUtils]: 92: Hoare triple {10533#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10533#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:23,062 INFO L273 TraceCheckUtils]: 93: Hoare triple {10533#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10534#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:23,063 INFO L273 TraceCheckUtils]: 94: Hoare triple {10534#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10534#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:23,064 INFO L273 TraceCheckUtils]: 95: Hoare triple {10534#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10535#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:23,064 INFO L273 TraceCheckUtils]: 96: Hoare triple {10535#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10535#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:23,065 INFO L273 TraceCheckUtils]: 97: Hoare triple {10535#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10536#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:23,065 INFO L273 TraceCheckUtils]: 98: Hoare triple {10536#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10536#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:23,066 INFO L273 TraceCheckUtils]: 99: Hoare triple {10536#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10537#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:23,067 INFO L273 TraceCheckUtils]: 100: Hoare triple {10537#(<= main_~i~0 18)} assume !(~i~0 < 100000); {10518#false} is VALID [2018-11-23 11:57:23,067 INFO L273 TraceCheckUtils]: 101: Hoare triple {10518#false} havoc ~x~0;~x~0 := 0; {10518#false} is VALID [2018-11-23 11:57:23,067 INFO L273 TraceCheckUtils]: 102: Hoare triple {10518#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {10518#false} is VALID [2018-11-23 11:57:23,067 INFO L256 TraceCheckUtils]: 103: Hoare triple {10518#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {10518#false} is VALID [2018-11-23 11:57:23,068 INFO L273 TraceCheckUtils]: 104: Hoare triple {10518#false} ~cond := #in~cond; {10518#false} is VALID [2018-11-23 11:57:23,068 INFO L273 TraceCheckUtils]: 105: Hoare triple {10518#false} assume 0 == ~cond; {10518#false} is VALID [2018-11-23 11:57:23,068 INFO L273 TraceCheckUtils]: 106: Hoare triple {10518#false} assume !false; {10518#false} is VALID [2018-11-23 11:57:23,074 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-11-23 11:57:23,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:23,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 11:57:23,108 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 107 [2018-11-23 11:57:23,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:23,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 11:57:23,195 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:23,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:57:23,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:57:23,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:57:23,196 INFO L87 Difference]: Start difference. First operand 112 states and 115 transitions. Second operand 22 states. [2018-11-23 11:57:23,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:23,797 INFO L93 Difference]: Finished difference Result 206 states and 214 transitions. [2018-11-23 11:57:23,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 11:57:23,797 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 107 [2018-11-23 11:57:23,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:23,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:57:23,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 144 transitions. [2018-11-23 11:57:23,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:57:23,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 144 transitions. [2018-11-23 11:57:23,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 144 transitions. [2018-11-23 11:57:24,119 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:24,122 INFO L225 Difference]: With dead ends: 206 [2018-11-23 11:57:24,122 INFO L226 Difference]: Without dead ends: 119 [2018-11-23 11:57:24,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:57:24,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-23 11:57:24,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-11-23 11:57:24,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:24,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 117 states. [2018-11-23 11:57:24,297 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 117 states. [2018-11-23 11:57:24,297 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 117 states. [2018-11-23 11:57:24,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:24,300 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2018-11-23 11:57:24,300 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2018-11-23 11:57:24,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:24,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:24,301 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 119 states. [2018-11-23 11:57:24,301 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 119 states. [2018-11-23 11:57:24,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:24,303 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2018-11-23 11:57:24,304 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2018-11-23 11:57:24,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:24,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:24,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:24,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:24,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-23 11:57:24,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 120 transitions. [2018-11-23 11:57:24,307 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 120 transitions. Word has length 107 [2018-11-23 11:57:24,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:24,307 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 120 transitions. [2018-11-23 11:57:24,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:57:24,307 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2018-11-23 11:57:24,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-23 11:57:24,308 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:24,308 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:24,309 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:24,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:24,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1010160530, now seen corresponding path program 18 times [2018-11-23 11:57:24,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:24,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:24,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:24,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:57:24,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:24,871 INFO L256 TraceCheckUtils]: 0: Hoare triple {11595#true} call ULTIMATE.init(); {11595#true} is VALID [2018-11-23 11:57:24,871 INFO L273 TraceCheckUtils]: 1: Hoare triple {11595#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11595#true} is VALID [2018-11-23 11:57:24,871 INFO L273 TraceCheckUtils]: 2: Hoare triple {11595#true} assume true; {11595#true} is VALID [2018-11-23 11:57:24,871 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11595#true} {11595#true} #76#return; {11595#true} is VALID [2018-11-23 11:57:24,871 INFO L256 TraceCheckUtils]: 4: Hoare triple {11595#true} call #t~ret6 := main(); {11595#true} is VALID [2018-11-23 11:57:24,872 INFO L273 TraceCheckUtils]: 5: Hoare triple {11595#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11597#(= main_~i~0 0)} is VALID [2018-11-23 11:57:24,872 INFO L273 TraceCheckUtils]: 6: Hoare triple {11597#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11598#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:24,873 INFO L273 TraceCheckUtils]: 7: Hoare triple {11598#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11599#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:24,874 INFO L273 TraceCheckUtils]: 8: Hoare triple {11599#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11600#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:24,874 INFO L273 TraceCheckUtils]: 9: Hoare triple {11600#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11601#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:24,875 INFO L273 TraceCheckUtils]: 10: Hoare triple {11601#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11602#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:24,875 INFO L273 TraceCheckUtils]: 11: Hoare triple {11602#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11603#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:24,876 INFO L273 TraceCheckUtils]: 12: Hoare triple {11603#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11604#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:24,877 INFO L273 TraceCheckUtils]: 13: Hoare triple {11604#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11605#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:24,878 INFO L273 TraceCheckUtils]: 14: Hoare triple {11605#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11606#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:24,879 INFO L273 TraceCheckUtils]: 15: Hoare triple {11606#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11607#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:24,880 INFO L273 TraceCheckUtils]: 16: Hoare triple {11607#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11608#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:24,881 INFO L273 TraceCheckUtils]: 17: Hoare triple {11608#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11609#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:24,882 INFO L273 TraceCheckUtils]: 18: Hoare triple {11609#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11610#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:24,883 INFO L273 TraceCheckUtils]: 19: Hoare triple {11610#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11611#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:24,884 INFO L273 TraceCheckUtils]: 20: Hoare triple {11611#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11612#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:24,885 INFO L273 TraceCheckUtils]: 21: Hoare triple {11612#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11613#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:24,886 INFO L273 TraceCheckUtils]: 22: Hoare triple {11613#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11614#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:24,887 INFO L273 TraceCheckUtils]: 23: Hoare triple {11614#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11615#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:24,888 INFO L273 TraceCheckUtils]: 24: Hoare triple {11615#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11616#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:24,888 INFO L273 TraceCheckUtils]: 25: Hoare triple {11616#(<= main_~i~0 19)} assume !(~i~0 < 100000); {11596#false} is VALID [2018-11-23 11:57:24,888 INFO L273 TraceCheckUtils]: 26: Hoare triple {11596#false} ~i~0 := 0; {11596#false} is VALID [2018-11-23 11:57:24,889 INFO L273 TraceCheckUtils]: 27: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11596#false} is VALID [2018-11-23 11:57:24,889 INFO L273 TraceCheckUtils]: 28: Hoare triple {11596#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11596#false} is VALID [2018-11-23 11:57:24,889 INFO L273 TraceCheckUtils]: 29: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11596#false} is VALID [2018-11-23 11:57:24,889 INFO L273 TraceCheckUtils]: 30: Hoare triple {11596#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11596#false} is VALID [2018-11-23 11:57:24,889 INFO L273 TraceCheckUtils]: 31: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11596#false} is VALID [2018-11-23 11:57:24,890 INFO L273 TraceCheckUtils]: 32: Hoare triple {11596#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11596#false} is VALID [2018-11-23 11:57:24,890 INFO L273 TraceCheckUtils]: 33: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11596#false} is VALID [2018-11-23 11:57:24,890 INFO L273 TraceCheckUtils]: 34: Hoare triple {11596#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11596#false} is VALID [2018-11-23 11:57:24,890 INFO L273 TraceCheckUtils]: 35: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11596#false} is VALID [2018-11-23 11:57:24,890 INFO L273 TraceCheckUtils]: 36: Hoare triple {11596#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11596#false} is VALID [2018-11-23 11:57:24,891 INFO L273 TraceCheckUtils]: 37: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11596#false} is VALID [2018-11-23 11:57:24,891 INFO L273 TraceCheckUtils]: 38: Hoare triple {11596#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11596#false} is VALID [2018-11-23 11:57:24,891 INFO L273 TraceCheckUtils]: 39: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11596#false} is VALID [2018-11-23 11:57:24,891 INFO L273 TraceCheckUtils]: 40: Hoare triple {11596#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11596#false} is VALID [2018-11-23 11:57:24,891 INFO L273 TraceCheckUtils]: 41: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11596#false} is VALID [2018-11-23 11:57:24,891 INFO L273 TraceCheckUtils]: 42: Hoare triple {11596#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11596#false} is VALID [2018-11-23 11:57:24,891 INFO L273 TraceCheckUtils]: 43: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11596#false} is VALID [2018-11-23 11:57:24,892 INFO L273 TraceCheckUtils]: 44: Hoare triple {11596#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11596#false} is VALID [2018-11-23 11:57:24,892 INFO L273 TraceCheckUtils]: 45: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11596#false} is VALID [2018-11-23 11:57:24,892 INFO L273 TraceCheckUtils]: 46: Hoare triple {11596#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11596#false} is VALID [2018-11-23 11:57:24,892 INFO L273 TraceCheckUtils]: 47: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11596#false} is VALID [2018-11-23 11:57:24,892 INFO L273 TraceCheckUtils]: 48: Hoare triple {11596#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11596#false} is VALID [2018-11-23 11:57:24,892 INFO L273 TraceCheckUtils]: 49: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11596#false} is VALID [2018-11-23 11:57:24,892 INFO L273 TraceCheckUtils]: 50: Hoare triple {11596#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11596#false} is VALID [2018-11-23 11:57:24,892 INFO L273 TraceCheckUtils]: 51: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11596#false} is VALID [2018-11-23 11:57:24,892 INFO L273 TraceCheckUtils]: 52: Hoare triple {11596#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11596#false} is VALID [2018-11-23 11:57:24,893 INFO L273 TraceCheckUtils]: 53: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11596#false} is VALID [2018-11-23 11:57:24,893 INFO L273 TraceCheckUtils]: 54: Hoare triple {11596#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11596#false} is VALID [2018-11-23 11:57:24,893 INFO L273 TraceCheckUtils]: 55: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11596#false} is VALID [2018-11-23 11:57:24,893 INFO L273 TraceCheckUtils]: 56: Hoare triple {11596#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11596#false} is VALID [2018-11-23 11:57:24,893 INFO L273 TraceCheckUtils]: 57: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11596#false} is VALID [2018-11-23 11:57:24,893 INFO L273 TraceCheckUtils]: 58: Hoare triple {11596#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11596#false} is VALID [2018-11-23 11:57:24,893 INFO L273 TraceCheckUtils]: 59: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11596#false} is VALID [2018-11-23 11:57:24,893 INFO L273 TraceCheckUtils]: 60: Hoare triple {11596#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11596#false} is VALID [2018-11-23 11:57:24,893 INFO L273 TraceCheckUtils]: 61: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11596#false} is VALID [2018-11-23 11:57:24,894 INFO L273 TraceCheckUtils]: 62: Hoare triple {11596#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11596#false} is VALID [2018-11-23 11:57:24,894 INFO L273 TraceCheckUtils]: 63: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11596#false} is VALID [2018-11-23 11:57:24,894 INFO L273 TraceCheckUtils]: 64: Hoare triple {11596#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11596#false} is VALID [2018-11-23 11:57:24,894 INFO L273 TraceCheckUtils]: 65: Hoare triple {11596#false} assume !(~i~0 < 100000); {11596#false} is VALID [2018-11-23 11:57:24,894 INFO L273 TraceCheckUtils]: 66: Hoare triple {11596#false} ~i~0 := 0; {11596#false} is VALID [2018-11-23 11:57:24,894 INFO L273 TraceCheckUtils]: 67: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11596#false} is VALID [2018-11-23 11:57:24,894 INFO L273 TraceCheckUtils]: 68: Hoare triple {11596#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11596#false} is VALID [2018-11-23 11:57:24,894 INFO L273 TraceCheckUtils]: 69: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11596#false} is VALID [2018-11-23 11:57:24,894 INFO L273 TraceCheckUtils]: 70: Hoare triple {11596#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11596#false} is VALID [2018-11-23 11:57:24,895 INFO L273 TraceCheckUtils]: 71: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11596#false} is VALID [2018-11-23 11:57:24,895 INFO L273 TraceCheckUtils]: 72: Hoare triple {11596#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11596#false} is VALID [2018-11-23 11:57:24,895 INFO L273 TraceCheckUtils]: 73: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11596#false} is VALID [2018-11-23 11:57:24,895 INFO L273 TraceCheckUtils]: 74: Hoare triple {11596#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11596#false} is VALID [2018-11-23 11:57:24,895 INFO L273 TraceCheckUtils]: 75: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11596#false} is VALID [2018-11-23 11:57:24,895 INFO L273 TraceCheckUtils]: 76: Hoare triple {11596#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11596#false} is VALID [2018-11-23 11:57:24,895 INFO L273 TraceCheckUtils]: 77: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11596#false} is VALID [2018-11-23 11:57:24,895 INFO L273 TraceCheckUtils]: 78: Hoare triple {11596#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11596#false} is VALID [2018-11-23 11:57:24,895 INFO L273 TraceCheckUtils]: 79: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11596#false} is VALID [2018-11-23 11:57:24,896 INFO L273 TraceCheckUtils]: 80: Hoare triple {11596#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11596#false} is VALID [2018-11-23 11:57:24,896 INFO L273 TraceCheckUtils]: 81: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11596#false} is VALID [2018-11-23 11:57:24,896 INFO L273 TraceCheckUtils]: 82: Hoare triple {11596#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11596#false} is VALID [2018-11-23 11:57:24,896 INFO L273 TraceCheckUtils]: 83: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11596#false} is VALID [2018-11-23 11:57:24,896 INFO L273 TraceCheckUtils]: 84: Hoare triple {11596#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11596#false} is VALID [2018-11-23 11:57:24,896 INFO L273 TraceCheckUtils]: 85: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11596#false} is VALID [2018-11-23 11:57:24,896 INFO L273 TraceCheckUtils]: 86: Hoare triple {11596#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11596#false} is VALID [2018-11-23 11:57:24,896 INFO L273 TraceCheckUtils]: 87: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11596#false} is VALID [2018-11-23 11:57:24,896 INFO L273 TraceCheckUtils]: 88: Hoare triple {11596#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11596#false} is VALID [2018-11-23 11:57:24,896 INFO L273 TraceCheckUtils]: 89: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11596#false} is VALID [2018-11-23 11:57:24,897 INFO L273 TraceCheckUtils]: 90: Hoare triple {11596#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11596#false} is VALID [2018-11-23 11:57:24,897 INFO L273 TraceCheckUtils]: 91: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11596#false} is VALID [2018-11-23 11:57:24,897 INFO L273 TraceCheckUtils]: 92: Hoare triple {11596#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11596#false} is VALID [2018-11-23 11:57:24,897 INFO L273 TraceCheckUtils]: 93: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11596#false} is VALID [2018-11-23 11:57:24,897 INFO L273 TraceCheckUtils]: 94: Hoare triple {11596#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11596#false} is VALID [2018-11-23 11:57:24,897 INFO L273 TraceCheckUtils]: 95: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11596#false} is VALID [2018-11-23 11:57:24,897 INFO L273 TraceCheckUtils]: 96: Hoare triple {11596#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11596#false} is VALID [2018-11-23 11:57:24,897 INFO L273 TraceCheckUtils]: 97: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11596#false} is VALID [2018-11-23 11:57:24,897 INFO L273 TraceCheckUtils]: 98: Hoare triple {11596#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11596#false} is VALID [2018-11-23 11:57:24,898 INFO L273 TraceCheckUtils]: 99: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11596#false} is VALID [2018-11-23 11:57:24,898 INFO L273 TraceCheckUtils]: 100: Hoare triple {11596#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11596#false} is VALID [2018-11-23 11:57:24,898 INFO L273 TraceCheckUtils]: 101: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11596#false} is VALID [2018-11-23 11:57:24,898 INFO L273 TraceCheckUtils]: 102: Hoare triple {11596#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11596#false} is VALID [2018-11-23 11:57:24,898 INFO L273 TraceCheckUtils]: 103: Hoare triple {11596#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11596#false} is VALID [2018-11-23 11:57:24,898 INFO L273 TraceCheckUtils]: 104: Hoare triple {11596#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11596#false} is VALID [2018-11-23 11:57:24,898 INFO L273 TraceCheckUtils]: 105: Hoare triple {11596#false} assume !(~i~0 < 100000); {11596#false} is VALID [2018-11-23 11:57:24,898 INFO L273 TraceCheckUtils]: 106: Hoare triple {11596#false} havoc ~x~0;~x~0 := 0; {11596#false} is VALID [2018-11-23 11:57:24,898 INFO L273 TraceCheckUtils]: 107: Hoare triple {11596#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {11596#false} is VALID [2018-11-23 11:57:24,898 INFO L256 TraceCheckUtils]: 108: Hoare triple {11596#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {11596#false} is VALID [2018-11-23 11:57:24,899 INFO L273 TraceCheckUtils]: 109: Hoare triple {11596#false} ~cond := #in~cond; {11596#false} is VALID [2018-11-23 11:57:24,899 INFO L273 TraceCheckUtils]: 110: Hoare triple {11596#false} assume 0 == ~cond; {11596#false} is VALID [2018-11-23 11:57:24,899 INFO L273 TraceCheckUtils]: 111: Hoare triple {11596#false} assume !false; {11596#false} is VALID [2018-11-23 11:57:24,903 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2018-11-23 11:57:24,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:24,903 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 11:57:24,913 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE